arXiv AI By Junzhou Chen

Wide Learning: Learning to Reach Evidence

Read the original on arXiv AI →

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.

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 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