arXiv:2607. 22602v1 Announce Type: new Abstract: Inference-time scaling has emerged as a powerful paradigm for improving large language model reasoning, often delivering larger gains on difficult reasoning tasks than parameter scaling alone.
By Tingxin Yang, Zefeng Wang, Mengyue Wang, Xingcheng Zhou, Yunpu Ma
arXiv:2603. 22016v3 Announce Type: replace-cross Abstract: Large Reasoning Models (LRMs) often reach a correct solution before their long Chain-of-Thought trace ends, yet continue with redundant verification, repeated attempts, or unnecessary exploration that wastes computation and can even overturn the correct answer.
By Xinyan Wang, Xiaogeng Liu, Ming Pei, Chaowei Xiao
arXiv:2604. 23054v2 Announce Type: replace-cross Abstract: Predicting the outcomes of prospective clinical trials remains a major challenge.
By Youze Zheng, Jianyou Wang, Yuhan Chen, Matthew Feng, Longtian Bao, Hanyuan Zhang, Maxim Khan, Aditya K. Sehgal, Christopher D. Rosin, Umber Dube, Ramamohan Paturi
SCOPE compiles natural‑language policies into neurosymbolic predicate programs that combine small neural models, deterministic extractors, and logical composition. The system is jointly optimized with adversarially generated counterexamples, achieving higher accuracy than prompt‑optimization, task‑decomposition, and workflow‑generation baselines on real‑world policy benchmarks. Programs trained with the weakest executor transfer to other models, enabling deployment on inexpensive models with stable, interpretable predictions.
By Arnon Mazza, Elad Levi
arXiv:2606. 05263v1 Announce Type: new Abstract: Reinforcement learning with verifiable rewards improves reasoning and tool use, yet long-horizon language agents still learn unsupported evidence chains, belief drift, and shortcut actions that satisfy terminal checks.
By Renwei Meng
arXiv:2609.37304v1 Announce Type: new
Abstract: Large reasoning models improve performance on challenging problems by allocating additional computation before answering, but longer reasoning does not...
By Zhibin Wen, Tao Han, Lei Bai, Can Li, Yang Xu
The paper identifies a new failure mode in neurosymbolic systems called Verdict‑Preserving‑Unfaithfulness (VPU), where incorrect formal encodings can still pass solver checks. It introduces Generative Verification (GenV), a method that uses a language model to produce a continuous reference‑equivalence score without relying on explicit localization. Experiments show GenV+HN achieves high AUROC, generalizes to unseen translators, and improves downstream agent performance by 11.3 points.
By Vikash Singh, Debargha Ganguly, Aman Goel, Ali Torkamani, Xiaoxue Han, Joseph Lilien, Ferhat Erata, Vipin Chaudhary
DeepLook is a training‑free decoding framework that uses segment‑level confidence to guide branching during inference. It only expands the search tree at points of high uncertainty and ranks candidate continuations by Average Lookahead Confidence (ALC), a mean confidence over fixed‑horizon rollouts, before finalizing and voting on a pruned subset. Experiments on four mathematics benchmarks show that DeepLook matches or surpasses DeepConf‑low in 12 of 16 settings while reducing token usage by 87.3%, though its advantage disappears on the knowledge‑intensive GPQA‑Diamond task due to hallucinations receiving high ALC.
By Tingxin Yang, Zefeng Wang, Mengyue Wang, Jinhe Bi, Xingcheng Zhou, Volker Tresp, Yunpu Ma
The paper introduces an adaptive triggering mechanism for bias correction in large language model (LLM) reasoning. By framing bias intervention as an online change‑point detection problem, the authors update a CUSUM statistic at each step using either a white‑box next‑token probability signal or a black‑box LLM judge signal, and inject corrective prompts only when the accumulated evidence exceeds a calibrated threshold. Experiments on gpt‑4o‑mini and six open‑weight models show that adaptive black‑box triggering restores most of the accuracy lost by fixed‑interval interventions while reducing the number of corrections, whereas the white‑box signal improves ambiguous‑item accuracy but can hurt disambiguated‑item accuracy due to difficulty distinguishing stereotype reliance from correct evidence.
By Nayoung Kim, Mickey Mancenido, Huan Liu
Aligned language models routinely misreport under non-evidential incentive pressure: they agree with a confident user or overstate certainty even when their internal belief is unchanged. We cast this as a failure of internal incentive-compatibility (IC) and present a method for learning and certifying counterfactual report mediators that hold a model's reports to a causal contract: invariant to forbidden influences (pressure, prestige, restyling) and responsive to licensed ones (genuine evidence).
arXiv:2607. 12985v1 Announce Type: new Abstract: Aligned language models routinely misreport under non-evidential incentive pressure: they agree with a confident user or overstate certainty even when their internal belief is unchanged.
By Sen Yang, Yuen-Hei Yeung
Mimir is a 1.78‑B parameter language model built on the Hierarchical Reasoning Model Text (HRM‑Text) architecture, which interleaves low‑level and high‑level transformer stacks. It is trained from scratch on a curated mix of 161 instruction, reasoning, tool‑use, multilingual, and synthetic datasets totaling 70.5 B tokens per epoch (103 B for the continued‑training version Mimir v1.5), using only data that meets permissibility criteria. Across 20 benchmarks in English, Danish, and Math & Code, Mimir v1.5 outperforms all other sub‑2 B models and matches or exceeds the performance of larger 9 B‑parameter models, while memorisation audits show low risk and inference‑time ablations reveal graceful degradation when adjusting low‑level stack applications.
By Peter Schneider-Kamp, Jacob Nielsen, Gianluca Barmina, Danial Namazifard, Annemette Brok Pirchert, Kenneth Enevoldsen, Lukas Galke Poech