REVIEW 2 cited by
GFlowNet Fine-tuning for Diverse Correct Solutions in Mathematical Reasoning Tasks
Not yet reviewed by Pith; the record is open.
This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.
SPECIMEN: schema-true, not a live event
T0 review · schema-true
One-sentence machine reading of the paper's core claim.
pith:XXXXXXXX · record.json · timestamp
read the original abstract
Mathematical reasoning problems are among the most challenging, as they typically require an understanding of fundamental laws to solve. The laws are universal, but the derivation of the final answer changes depending on how a problem is approached. When training large language models (LLMs), learning the capability of generating such multiple solutions is essential to accelerate their use in mathematical education. To this end, we train LLMs using generative flow network (GFlowNet). Different from reward-maximizing reinforcement learning (RL), GFlowNet fine-tuning seeks to find diverse solutions by training the LLM whose distribution is proportional to a reward function. In numerical experiments, we evaluate GFlowNet fine-tuning and reward-maximizing RL in terms of accuracy and diversity. The results show that GFlowNet fine-tuning derives correct final answers from diverse intermediate reasoning steps, indicating the improvement of the capability of alternative solution generation.
Forward citations
Cited by 2 Pith papers
-
GFlowGR: Fine-tuning Generative Recommendation Frameworks with Generative Flow Networks
GFlowGR fine-tunes generative recommender LLMs with GFlowNet losses and multi-signal rewards, beating SFT, DPO, and GRPO baselines on three datasets and in production.
-
Discrete Flow-Based Generative Models for Measurement Optimization in Quantum Computing
GFlowNet-based graph coloring finds Hamiltonian groupings with lower estimated measurement costs than sorted insertion on small molecules, subject to selection bias and a missing abstract claim.
Discussion (0). Continue with ORCID to comment.