arXiv AI

Wide Learning: Learning to Reach Evidence

The paper introduces the concept of Wide Learning, which examines how a learner’s internal state can expand its ability to generate informative evidence under fixed resources and primitive affordances. By formalizing effective epistemic reach—defined by learner state, deployment budget, reliability threshold, and evaluation distribution—the authors demonstrate, through a controlled construction, that learning can significantly alter the probability of successfully realizing a diagnostic that was previously unlikely. The study shows that even with identical observable laws, a calibrated learner can achieve perfect diagnostic realization, highlighting the impact of learning on the scope of attainable evidence.

arXiv Machine Learning
Oct 8

When Should an In-Context Learner Expand Its Hypothesis Space?

The paper investigates when an in‑context learner should expand its hypothesis space, framing the decision as a costly sequential problem where prediction failures must be translated into structural evidence and then into an action. Using a Structural Revision Environment that allows exact Bayesian analysis, the authors find that the optimal decision to expand is governed by a value boundary rather than a simple evidence threshold, and that this boundary depends on the price of expansion, the remaining horizon, and the specific predictions that cannot be repaired locally. Experiments with transformers and language models show that while these models exhibit a failure‑sensitive signal, they often fail to incorporate cost and horizon considerations into their expansion decisions, and post‑training adjustments to priors or prediction sharpness do not alter the expansion criterion.

By Weihan Li, Xinlei Chen, Junhao Wu, Tianshi Zheng
arXiv AI
Sep 11

TRACE: Training Reasoning Agents for Causal Exploration with Synthesized Rewards

The paper introduces TRACE, a digital‑advertising diagnostic environment that uses simulated interventions to generate verifiable rewards for training reasoning agents. By injecting controlled interventions into a simulator, the hidden cause of anomalies becomes an oracle label, enabling agents to learn to identify root causes and affected segments through noisy, confounded evidence. Experiments show that reinforcement learning with these synthesized rewards outperforms large prompted baselines, achieving higher accuracy while using fewer tool calls.

By Rui Sun, Zhan Shi, Bing He
arXiv Machine Learning
Aug 27

Toward Machine Learning with the Unit as a Primitive: Learning from Unit-Linked Events

The paper proposes treating the ‘unit’—a persistent referent that multiple events may refer to—as an explicit primitive in machine learning tasks. It formalizes supervised learning as learning a pair of a tokenizer that generates a contextual unit token and a shared response law that uses this token, thereby distinguishing homogeneous from heterogeneous worlds. The work also introduces concepts such as unit abduction and trusted resolvers to handle cases where unit identity is unresolved.

By Heyang Gong
arXiv AI
Sep 2

Explore More, Drift Less: Outcome-Only Reinforcement Learning Can Suffice for Long-Horizon Interactive Agents

The paper proposes CANOPY, a minimalist reinforcement learning protocol that addresses two common pitfalls—signal starvation and policy drift—in outcome‑only RL for long‑horizon interactive tasks. By scaling same‑task exploration, keeping updates on‑policy, and anchoring updates with KL divergence, CANOPY enables a Qwen3‑14B agent to achieve top leaderboard results on the AppWorld coding benchmark without auxiliary supervision or elaborate scaffolding. The approach also improves performance on SWE‑bench for a Qwen3.5‑9B model.

By Liming Pu, Xiaoxia Li, Yifu Liu, Teng Cao, Bin Yang
arXiv Computation and Language
Oct 16

From Observation to Intervention: Distilling Self-Generated In-Context Demonstrations via Executable Causal Intervention

The paper introduces ECI2D, a method that distills self-generated in-context demonstrations by converting language rationales into executable programs and applying causal interventions to ensure transfer invariance across logically similar samples. It addresses the problem of observational equivalence, where both faithful and spurious rationales can produce correct outputs, by filtering demonstrations that remain effective under causal manipulation. Experiments on math, logic, and commonsense reasoning tasks show that ECI2D outperforms observation-based in-context learning, achieving over 7‑point gains when test distributions shift while using far fewer demonstrations.

By Minming Ye, Min Liu, Haoang Chi, Ciheng Wu, Naiyang Guan