arXiv AI By Jingkai Huang, Will Ma, Zhengyuan Zhou

Optimal Bayesian Stopping for Efficient Inference of Consistent LLM Answers

Read the original on arXiv AI →

arXiv:2602. 05395v2 Announce Type: replace-cross Abstract: A simple strategy for improving LLM accuracy, especially in math and reasoning problems, is to sample multiple responses and submit the answer most consistently reached.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jul 23

Statistical Early Stopping for Reasoning Models

arXiv:2602. 13935v2 Announce Type: replace Abstract: While LLMs have seen substantial improvement in reasoning capabilities, they also sometimes overthink, generating unnecessary reasoning steps, particularly under uncertainty, given ill-posed or ambiguous queries.

By Yangxinyu Xie, Tao Wang, Soham Mallick, Yan Sun, Georgy Noarov, Mengxin Yu, Tanwi Mallick, Weijie J. Su, Edgar Dobriban
arXiv AI
3d ago

Adaptive Self-Consistency: From Black-Box Sampling to Distribution-Valued Feedback

The paper introduces Adaptive Self-Consistency (ASC), a method that treats large language models as grey-boxes by leveraging the full answer distribution from log‑probabilities rather than single sampled answers. It formulates inference as sequential mode identification with distribution‑valued observations, proving that this approach never performs worse than traditional black‑box sampling and can stop earlier. The proposed ASC‑D algorithm, a betting‑based stopping rule, achieves significant reductions in required trajectories—up to 95.6% fewer—while attaining the best fixed‑budget correct‑certification rates on MMLU‑Redux across three open‑source models.

By Jingkai Huang, Yunfan Zhang, Will Ma, Weihua Zhou, Zhengyuan Zhou