REVIEW 5 cited by
MindStar: Enhancing Math Reasoning in Pre-trained LLMs at Inference Time
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
Although Large Language Models (LLMs) achieve remarkable performance across various tasks, they often struggle with complex reasoning tasks, such as answering mathematical questions. Recent efforts to address this issue have primarily focused on leveraging mathematical datasets through supervised fine-tuning or self-improvement techniques. However, these methods often depend on high-quality datasets that are difficult to prepare, or they require substantial computational resources for fine-tuning. Inspired by findings that LLMs know how to produce the right answer but struggle to select the correct reasoning path, we propose a purely inference-based searching method -- MindStar (M*). This method formulates reasoning tasks as searching problems and proposes two search ideas to identify the optimal reasoning paths. We evaluate the M* framework on both the GSM8K and MATH datasets, comparing its performance with existing open and closed-source LLMs. Our results demonstrate that M* significantly enhances the reasoning abilities of open-source models, such as Llama-2-13B and Mistral-7B, and achieves comparable performance to GPT-3.5 and Grok-1, but with substantially reduced model size and computational costs.
Forward citations
Cited by 5 Pith papers
-
Sticker-TTS: Learn to Utilize Historical Experience with a Sticker-driven Test-Time Scaling Framework
Sticker-TTS uses three collaborating models to distill and reuse compact summaries (stickers) of past reasoning attempts, improving math benchmark accuracy at a claimed equivalent inference cost.
-
MATT-CTR: Unleashing a Model-Agnostic Test-Time Paradigm for CTR Prediction with Confidence-Guided Inference Paths
MATT is a model-agnostic test-time method that estimates feature-combination frequency from training data and uses it to sample and average multiple masked-input CTR predictions.
-
Boosting LLM's Molecular Structure Elucidation with Knowledge Enhanced Tree Search Reasoning
K-MSE adds a substructure knowledge base, a learned molecule-spectrum scorer, and Monte Carlo tree search, lifting LLM exact-match accuracy on MolPuzzle from 3.7% to 27.3% (GPT-4o-mini) and from 27.8% to 57.8% (GPT-4o).
-
Step-level Verifier-guided Hybrid Test-Time Scaling for Large Language Models
A step-level verifier-guided hybrid of Best-of-N sampling, Monte Carlo tree search, and conditional self-refinement improves reasoning in small instruction-tuned LLMs, claiming up to 28.6-point gains.
-
Enhancing Reasoning Capabilities in SLMs with Reward Guided Dataset Distillation
AdvDistill uses group relative advantages computed from rule-based rewards to weight teacher responses during distillation, reportedly improving a 1.5B student on math tasks beyond its 7B teacher.
Discussion (0). Sign in to comment.