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.
By Junzhou Chen
arXiv:2506. 20699v2 Announce Type: replace Abstract: Learning in non-stationary and multi-context environments requires more than ordinary within-task generalization.
By Xin Li
arXiv:2608. 10441v1 Announce Type: new Abstract: Many pipelines can pay a per-example cost to acquire an auxiliary, model-derived observation -- an LLM's structured reasoning, a slow oracle, an expensive measurement -- and then must decide when the acquired signal is worth using.
By Ying Yuan
arXiv:2502.04131v2 Announce Type: replace
Abstract: The successful application of modern machine learning for time series classification is often hampered by limitations in quality and quantity of av...
By Janis Norden, Elisa Oostwal, Michael Chappell, Peter Tino, Kerstin Bunte
The paper introduces a framework that distinguishes world models by the channel they represent—environment, agent, or joint agent‑environment—using computational mechanics to define canonical predictive models as ε-transducers or ε-machines. It shows how closed‑loop coupling induces support‑restricted models whose states factor through the joint causal states, and demonstrates with a POMDP example that such restriction can reduce an otherwise infinite‑state environment model to a finite one.
By Manuel Baltieri, Filippo Torresan, Yivan Zhang, Alexander Boyd, Fernando E. Rosas
arXiv:2607. 16741v1 Announce Type: new Abstract: B\"urger et al.
By Francesco Karim Vicidomini
arXiv:2507. 01414v2 Announce Type: replace Abstract: We introduce a new family of toy problems that combine features of linear-regression-style continuous in-context learning (ICL) with discrete associative recall.
By Sultan Daniels, Dylan Davis, Dhruv Gautam, Wentinn Liao, Gireeja Ranade, Anant Sahai
arXiv:2512. 07355v2 Announce Type: replace Abstract: Two traditions of interpretability have evolved side by side but seldom spoken to each other: Concept Bottleneck Models (CBMs), which prescribe what a concept should be, and Sparse Autoencoders (SAEs), which discover what concepts emerge.
By Alexandre Rocchi, Thomas Fel, Gianni Franchi
IDEA is a training‑free, input‑dependent steering method for large language models that matches activations to cluster‑specific directions aligned with a target concept. It clusters positive and negative activation supports per attention head, solves an optimal‑matching problem to create a pool of cluster‑conditional directions, and selects the best match for each input at inference time. This approach preserves the input’s original representation while improving the truth × info rate on TruthfulQA by an average of 9.9% (up to 23.5%) over input‑independent baselines.
By Zheng Wang, Muchen Li, Renjie Liao, Yan Leng
arXiv:2605. 11644v3 Announce Type: replace-cross Abstract: Positive data can show that two tuple occurrences share a successful sentence context without certifying that they are safely interchangeable.
By Takayuki Kuriyama
arXiv:2607. 02234v1 Announce Type: new Abstract: On-policy self-distillation (OPSD) has emerged as a promising paradigm for improving LLM reasoning, where a privileged teacher with access to reference solutions provides token-level supervision on the student's own generated trajectories.
By Zhanming Shen, Jintao Tong, Shaotian Yan, Chen Shen, Hao Chen, Wentao Ye, Xiaomeng Hu, Rui Miao, Haobo Wang, Junbo Zhao, Gang Chen, Jieping Ye
arXiv:2606. 04045v1 Announce Type: cross Abstract: Representation learning is often described as preserving the information in an input that is relevant for prediction.
By Vasileios Sevetlidis