arXiv (All)
open access
Function-Structured Reinforcement Learning with Executable Verifiers for Mathematical Reasoning
Algorithmic mathematical reasoning requires reliable decomposition, computation, and aggregation. Final-answer rewards provide limited guidance on intermediate errors, while successful execution does not guarantee mathematical correctness. This work proposes Function-Structured Graph Reinforcement L
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- From Outcomes to Strategies: Learning Strategy Utility for Mathematical Reasoning#1116813
- Danus: Orchestrating Mathematical Reasoning Agents with Fact-Graph Memory#346549
- Achieving Olympiad-Level Geometry Large Language Model Agent via Complexity Boosting Reinforcement Learning#927198
- Solving Every Step Is Not Enough: Milestone Oracles Reveal a Composition Gap in LLM Math Reasoning#1116566
- Optimization of a Triangular Delaunay Mesh Generator using Reinforcement Learning#798589
Record · ID 1157000
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive