arXiv Machine Learning By Chu-Cheng Lin, Eugene Ie

How Fast Should a Model Commit to Supervision? Training Reasoning Models on the Tsallis Loss Continuum

Read the original on arXiv Machine Learning →

arXiv:2604. 25907v3 Announce Type: replace Abstract: The standard recipe for training reasoning models---SFT on rationale annotations followed by RLVR---relies on rationale annotations being available and clean.

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 Machine Learning.

arXiv AI
Sep 1

Locked at the Entrance, Open Inside: Where RLVR Narrows the Solution Space

The paper investigates why reinforcement learning with verifiable rewards (RLVR) reduces the diversity of solutions in reasoning tasks. By analyzing the Countdown task, the authors show that RLVR contracts the solution space mainly at the entrance—before the first arithmetic operation—causing a 67% drop in solution coverage. They demonstrate that providing an unselected entrance prefix or applying entrance‑targeted interventions can restore or even improve coverage without harming accuracy.

By Qiancheng Zhou, Ruizhe Li
arXiv Statistics ML
Oct 28

When is Fine-Tuning Scalable? Certified Recovery from Noisy Data and Linear-Cost Fine-Tuning on Structured Task Shifts

arXiv:2509. 00924v2 Announce Type: replace Abstract: Transformers often transfer across related tasks with little fine-tuning; we study this question in noisy nonparametric regression for continuous maps $f,g:[0,1]^d\to\mathbb{R}^D$, representing the source and shifted tasks, using a single-query, single-head transformer $\mathcal{T}(\cdot)=V\operatorname{Softmax}(-\alpha(\cdot,K))$ with $\ell^{\infty}$-based alignment scores $\alpha$.

By Anastasis Kratsios, Tin Sum Cheng, Bum Jun Kim, Daniel Roy
arXiv Machine Learning
Oct 15

One-Step Prediction Fidelity Is a Poor Proxy for Planning Performance in JEPA World Models

The paper challenges the common practice of selecting latent world models based on one‑step prediction loss, arguing that this metric poorly predicts planning performance. Using a frozen‑decoder protocol, the authors decompose one‑step error into encoder‑inherent and predictor‑added components and evaluate goal‑conditioned planning across three continuous‑control environments. Their experiments show that improvements in one‑step fidelity do not correlate with planning success, with correlation coefficients near zero and inconsistent exchange rates across tasks.

By Joshua Cheung, Zhang He