The paper evaluates Laya, a small model that processes a multiple‑choice question, its options, and a text in a single 512‑token sequence. Experiments show that when the relevant evidence lies beyond the window, accuracy drops to about 26–27%, and confidence metrics fail to warn of truncation. Fine‑tuning on longer documents improves performance on visible evidence but not on cut evidence, and a larger window or a 312‑token scan can yield modest gains.
By Mohammed Nayeem Khan, Allan Kevin T
The paper introduces a selection‑safe conformal early‑exit method that calibrates a single split‑conformal quantile using a terminal‑path score derived from prefix maxima. This approach guarantees coverage for any data‑dependent stopping policy that preserves terminal‑set containment, without requiring an α/L correction. Empirical results on eight encoder backbones and CIFAR‑100 show that pathwise selection achieves higher macro coverage (0.901 vs. 0.814) with smaller set sizes and lower latency fractions compared to naive layer‑wise selection, and remains robust to deployment‑time budget changes.
By Adria Binte Habib, Ibne Farabi Shihab
The paper presents a certified rule that determines whether unseen data should be incorporated into a pretrained model’s context or its weights, based on an exact law for their information value. This law quantifies the code length saved on held‑out queries as the expected bits stored about the query, adjusted by a prior repair and decoding loss, and applies to any model, architecture, dataset, or task. The authors demonstrate that the rule’s ceilings correctly certify choices across diverse models—including transformers, TabPFN, occupancy networks, and stereo networks—and that an anytime‑valid test can reliably select the better approach (e.g., TabPFN over XGBoost or GPT‑2’s cache over fine‑tuning) with controlled error rates.
By Leon Chlon, Julie Huang
arXiv:2610.15218v1 Announce Type: new
Abstract: A recurrent-depth language model reuses one block of weights several times in a row. The number of repetitions, which we call loops, is chosen when the...
By Seyedarmin Azizi, Erfan Baghaei Potraghloo, Arya Fayyazi, Saeid Shokoufa, Massoud Pedram
arXiv:2608.20873v1 Announce Type: new
Abstract: Every way of teaching a deployed language model something new -- full fine-tuning, adapter merging, model editing -- replaces the released checkpoint,...
By Zifeng Liu, Zhiyong Du, Yaxin Lu, Yiming Mao, Zhenhe Wang, Wenqi Shi, Zhengkun Jing
The paper shows that AI‑text detectors, rather than learning a clear AI‑versus‑human boundary, amplify an inherited predictability axis that already exists in language models. This amplification causes detectors to over‑flag fluent, formal human writing while missing high‑temperature AI outputs, and the bias persists across languages, code, and detector architectures. A training‑free operator can relocate the bias but cannot erase it, underscoring that the unfairness is a structural cost of out‑of‑distribution generalization.
By Alexander Smirnov