Pith. sign in

REVIEW 1 cited by

Distilling Algorithmic Reasoning from LLMs via Explaining Solution Programs

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

arxiv 2404.08148 v1 pith:5ISNEZIK submitted 2024-04-11 cs.CL

classification cs.CL
keywords reasoningmodelsllmspairsproblemproblemsabilitiesalgorithmic
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Distilling explicit chain-of-thought reasoning paths has emerged as an effective method for improving the reasoning abilities of large language models (LLMs) across various tasks. However, when tackling complex tasks that pose significant challenges for state-of-the-art models, this technique often struggles to produce effective chains of thought that lead to correct answers. In this work, we propose a novel approach to distill reasoning abilities from LLMs by leveraging their capacity to explain solutions. We apply our method to solving competitive-level programming challenges. More specifically, we employ an LLM to generate explanations for a set of <problem, solution-program> pairs, then use <problem, explanation> pairs to fine-tune a smaller language model, which we refer to as the Reasoner, to learn algorithmic reasoning that can generate "how-to-solve" hints for unseen problems. Our experiments demonstrate that learning from explanations enables the Reasoner to more effectively guide program implementation by a Coder, resulting in higher solve rates than strong chain-of-thought baselines on competitive-level programming problems. It also outperforms models that learn directly from <problem, solution-program> pairs. We curated an additional test set in the CodeContests format, which includes 246 more recent problems posted after the models' knowledge cutoff.

Discussion (0). Sign in to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. AutoSDT: Scaling Data-Driven Discovery Tasks Toward Open Co-Scientists

    cs.LG 2025-06 conditional novelty 6.0 of 10

    An LLM-driven pipeline automatically creates a 5,404-task dataset of data-driven scientific coding problems, and fine-tuning Qwen2.5-Coder on it improves performance on ScienceAgentBench and DiscoveryBench.

Pith tools