Robust Explanatory Analysis for Structured Optimization Networks (REASON) in Learning
We seek a hierarchical resolution of residual error under a composite learning objective as a principled mechanism for identifying and exploiting additional information, particularly under distribution shift and perturbation.
ProofPaper ↗
Key points
- Inspired by the System 1/System 2 paradigm, we formulate this principle as a two-loop mechanism serving a common inference goal.
- A fast, System 1-like loop resolves the residual addressable by the available evidence; the remaining epistemic residual triggers a medium speed, System 2-like loop that actively acquires additional evidence and measures its informational value through residual reduction.
- Over nested 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, outperforms staged classifiers and learning-to-defer methods at equal computational cost.
Sources (2)
- [1]Robust Explanatory Analysis for Structured Optimization Networks (REASON) in LearningarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 14, 01:24 AM
We seek a hierarchical resolution of residual error under a composite learning objective as a principled mechanism for identifying and exploiting additional information, particularly under distribution shift and perturbation.
Inspired by the System 1/System 2 paradigm, we formulate this principle as a two-loop mechanism serving a common inference goal.
- [2]Robust Explanatory Analysis for Structured Optimization Networks (REASON) in LearningHugging Face Daily Papers · Oct 14, 12:00 AM · same content
Extractive summary: sentences quoted from the sources.
Before this
- Oct 13, 2026Online Tokenization with Optimal Delay in Linear Time
- Oct 13, 2026Graph Coarsening Enables Escaping Local Optima in Compute-Constrained Nonconvex MAX-CUT
- Oct 13, 2026When More Objectives Make Identification Easier: The Role of Preferences and Feedback
- Oct 13, 2026Mobility-Budget-Constrained Submodular Maximization for Distributed Semantic Multi-Robot Exploration
- Oct 12, 2026Density-Matrix Reinforcement Learning
- Oct 12, 2026Teaching Vision-Language Models to Decline: Support Completion Against Mirage