mlsanityData to 7 Oct 2026

VAM: Verbalized Action Masking for Controllable Exploration in RL Post-Training -- A Chess Case Study

arXiv 2602.16833 ↗First posted 18 Feb 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Exploration remains a key bottleneck for reinforcement learning (RL) post-training of large language models (LLMs), where sparse feedback and large action spaces can lead to premature collapse into repetitive behaviors. We propose Verbalized Action Masking (VAM), which verbalizes an action mask in the prompt and enforces that the model outputs an action from the masked set. Building on this interface, we introduce iterative action-space pruning: if the target action is not sampled, we remove valid sampled actions from the mask and resample under the reduced candidate set, repeating until the target is sampled or a fixed budget is exhausted. We study VAM in chess and evaluate it under two training regimes: an engine-play regime that generates states via play against an engine opponent and a fixed-dataset regime that trains from a fixed dataset of positions with verifier scores. Across held-out chess puzzles and full-game play measured by average centipawn loss (ACPL), VAM improves learning efficiency and final performance over strong baselines, highlighting verbalized masking as a practical mechanism for controllable exploration in LLM RL post-training.

Key facts. Cited by 1 paper in the map (data through 7 Oct 2026). Builds on 18 of its 27 references that are in the map. First posted on arXiv 18 Feb 2026.

Builds on

18 of 27 references.

References · 18

  1. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  2. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 8,851
  3. 2023Let's Verify Step by Stepcited by 3,598
  4. 2023Self-Refine: Iterative Refinement with Self-Feedbackcited by 3,317
  5. 2022CodeRL: Mastering Code Generation through Pretrained Models and Deep Reinforcement Learningcited by 342
  6. 2025Reinforcement Learning with Verifiable Rewards Implicitly Incentivizes Correct Reasoning in Base LLMscited by 276
  7. 2025Learning to Reason under Off-Policy Guidancecited by 266
  8. 2023InterCode: Standardizing and Benchmarking Interactive Coding with Execution Feedbackcited by 229
  9. 2024Trial and Error: Exploration-Based Trajectory Optimization for LLM Agentscited by 194
  10. 2025Outcome-based Exploration for LLM Reasoningcited by 79
  11. 2025BREAD: Branched Rollouts from Expert Anchors Bridge SFT & RL for Reasoningcited by 57
  12. 2025Complete Chess Games Enable LLM Become A Chess Mastercited by 16
6 more
  1. 2025From Trial-and-Error to Improvement: A Systematic Analysis of LLM Exploration Mechanisms in RLVRcited by 16
  2. 2025RL for Reasoning by Adaptively Revealing Rationalescited by 15
  3. 2025Clip-Low Increases Entropy and Clip-High Decreases Entropy in Reinforcement Learning of Large Language Modelscited by 12
  4. 2025Can Large Language Models Develop Strategic Reasoning? Post-training Insights from Learning Chesscited by 8
  5. 2025Generating Creative Chess Puzzlescited by 7
  6. 2025Evaluating In Silico Creativity: An Expert Review of AI Chess Compositionscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 1.

1 paper.