English

Learning to Reason in LLMs by Expectation Maximization

Machine Learning 2026-02-03 v2 Computation and Language Machine Learning

Abstract

Large language models (LLMs) solve reasoning problems by first generating a rationale and then answering. We formalize reasoning as a latent variable model and derive a reward-based filtered expectation-maximization (FEM) objective for learning to reason. This view connects EM and modern reward-based optimization, and shows that the main challenge lies in designing a sampling distribution of rationales that justify correct answers. We instantiate and compare three sampling schemes: rejection sampling with a budget, self-taught reasoner (STaR), and prompt posterior sampling (PPS), which only keeps the rationalization stage of STaR that conditions on the correct answer in the prompt. We experiment with LLM-as-a-judge calibration and summarization from feedback tasks, where conditioning on the correct answer provides a strong guidance for generating rationales. Our experiments show the efficacy of PPS over other sampling schemes, and that the sampling scheme can have a significant impact on performance.

Keywords

Cite

@article{arxiv.2512.20169,
  title  = {Learning to Reason in LLMs by Expectation Maximization},
  author = {Junghyun Lee and Branislav Kveton and Anup Rao and Subhojyoti Mukherjee and Ryan A. Rossi and Sunav Choudhary and Alexa Siu},
  journal= {arXiv preprint arXiv:2512.20169},
  year   = {2026}
}

Comments

27 pages, 15 figures, 5 tables (ver2: major revision, including new experiments, reorganization, etc)

R2 v1 2026-07-01T08:38:13.646Z