Robust Explanatory Analysis for Structured Optimization Networks (REASON) in Learning
Summary
该论文提出 REASON 双循环推理框架,通过快速(System 1 式)和中速(System 2 式)循环分层解决残差误差,在分布偏移和未见扰动下以约一半计算量显著提升模型鲁棒性,并优于分级分类器和学习延迟方法。
View Cached Full Text
Cached at: 10/19/26, 11:31 PM
Paper page - Robust Explanatory Analysis for Structured Optimization Networks (REASON) in Learning
Source: https://huggingface.co/papers/2610.19378
Abstract
A two-loop inference framework resolves residual errors via fast and evidence-seeking loops to improve robustness under distribution shift with lower computation.
We seek a hierarchical resolution ofresidual errorunder acomposite learning objectiveas a principled mechanism for identifying and exploiting additional information, particularly underdistribution shiftand perturbation. Inspired by theSystem 1/System 2paradigm, we formulate this principle as atwo-loop mechanismserving a common inference goal. A fast, System 1-like loop resolves the residual addressable by the available evidence; the remainingepistemic residualtriggers a medium speed, System 2-like loop that actively acquires additional evidence and measures its informational value through residual reduction. Overnested solution spaces, the medium-loop optimum is provably no worse than the fast-loop optimum. Experiments show that the resulting two-loop model consistently improves upon the fast loop at approximately half the computation of the medium loop, including under unseen corruptions, and, when provided a cleaner observation, outperformsstaged classifiersandlearning-to-defermethods at equal computational cost.
View arXiv pageView PDFAdd to collection
Models citing this paper0
No model linking this paper
Cite arxiv.org/abs/2610.19378 in a model README.md to link it from this page.
Datasets citing this paper0
No dataset linking this paper
Cite arxiv.org/abs/2610.19378 in a dataset README.md to link it from this page.
Spaces citing this paper0
No Space linking this paper
Cite arxiv.org/abs/2610.19378 in a Space README.md to link it from this page.
Collections including this paper0
No Collection including this paper
Add this paper to acollectionto link it from this page.
Similar Articles
REDaCT: Collapse-Free Unlearning in Large Reasoning Models
REDaCT提出一种面向大型推理模型的推理时无遗忘框架,通过二元泄漏检测器与纠正性嵌入优化,在彻底移除遗忘集信息的同时完全避免推理链崩溃,实现近乎完美的答案与CoT遗忘并显著保留推理能力。
Rationale-Guided Policy Optimization: Learning to Reason with Adaptive Rationale Scaffolding
The paper introduces Rationale-Guided Policy Optimization (RGPO), a framework that adaptively uses ground-truth rationales as temporary scaffolds during on-policy reinforcement learning to mitigate reward sparsity, achieving consistent gains over RLVR baselines in both language-only and vision-language reasoning settings.
RL-ARC: Calibrating Large Reasoning Models via Reasoning-guided Uncertainty
本文提出 RL-ARC,一个校准感知的训练框架,通过联合利用推理置信度与答案置信度来校准大型推理模型,缓解 RLVR 训练导致的过度自信问题,并在 ID 和 OOD 设置下提升校准表现而不显著牺牲推理性能。
REDAR: Reinforcement-Driven Adaptive Regularisation for Class Incremental Learning
提出REDAR:将类增量学习中的正则化强度选择建模为序列决策问题,用轻量级RL智能体根据当前性能与数据统计动态输出每个阶段的知识蒸馏系数,在CIFAR-100和Tiny-ImageNet上降低了遗忘并提升了前向迁移。
Enhanced and Efficient Reasoning in Large Learning Models
This paper proposes a method for improving reasoning in large language models by recoding data to explicitly represent relationships, enabling efficient principled reasoning with polynomial-time learnability for relational rules, which addresses hallucinations and supports sound reasoning across multiple calls.