arXiv AI
Program Learning with Verifiable Rewards: Symbolic Backpropagation for Post-Training LLMs
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
3d ago
ArgGYM: A Procedural, Engine-Verified Benchmark for Structured Defeasible Reasoning
arXiv:2609.38409v1 Announce Type: new Abstract: Recent progress in large language model reasoning has been driven by benchmarks and reinforcement learning environments with automatically verifiable r...
arXiv AI
Jun 9
Internalizing Geometric Law: Learning from Solver Residuals for Precision-Critical Generation
arXiv:2606. 09278v1 Announce Type: cross Abstract: Large Language Models frequently hallucinate in precision-critical domains such as technical diagramming and mechanical design, where outputs must satisfy strict geometric constraints.
arXiv AI
Jul 7
Forethought: Verifiable Reasoning from Neurosymbolic Primitive Programming
arXiv:2607. 04096v1 Announce Type: new Abstract: Current agentic workflows usually involve decomposing user requests into sequences of tool calls with correctly resolved parameters, the results of which are processed through reasoning traces in the language model's context window.
arXiv AI
2d ago
Dependency-Aware Reward Shaping for Agentic Reinforcement Learning
The paper introduces Dependency‑Aware Reward Shaping (DARS), a method that assigns step‑level credit in reinforcement learning by modeling task progress as a graph of predicates with prerequisite relations. Annotators mark each step’s effect on predicates, and DARS discounts verified predicates based on distance from broken prerequisites while preserving independent ones, converting these annotations into signed per‑step rewards. Experiments on five task families with models ranging from 1.5B to 8B show that DARS improves success rates by up to 10 points over GiGPO, boosts WebShop and Search‑R1 QA scores, complements AEPO on AIME24/25, and outperforms OmniOPD in tool‑free reasoning, with ablations confirming the contribution of step‑level credit, dependency attenuation, and graph topology.
arXiv AI
Jun 9
Correct Is Not Enough: Training Reasoning Planners with Executor-Grounded Rewards
arXiv:2605. 03862v4 Announce Type: replace Abstract: Reinforcement learning with verifiable rewards has become a common way to improve explicit reasoning in large language models, but final-answer correctness alone does not reveal whether the reasoning trace is faithful, reliable, or useful to the model that consumes it.
arXiv AI
Jul 20
Understanding Reasoning from Pretraining to Post-Training
arXiv:2607. 16097v1 Announce Type: cross Abstract: Reinforcement learning (RL) has become central to improving large language models (LLMs) on complex reasoning tasks, yet RL post-training is largely studied in isolation from the pretraining that precedes it.