arXiv:2608. 10145v1 Announce Type: new Abstract: LeWorldModel trains a latent world model with a prediction loss and a single anti-collapse regulariser, and reports approximately 87% of goals reached on TwoRoom, its simplest diagnostic environment.
By Joyjeet Singh
arXiv:2609.36569v1 Announce Type: cross
Abstract: Checkpoint selection is a routine decision in supervised fine-tuning (SFT): training produces multiple checkpoints, but only one is retained. Yet fix...
By Yupeng Chang, Wenxuan Zhang, Yuan Wu
The paper investigates whether the latent states reconstructed during inference match those stored during training in temporal models, focusing on State Discovery in World Machine. By comparing stored state tables with rollouts from the best‑validation checkpoint and the last‑epoch weights, the authors find that reloading the checkpoint used to write the table eliminates 90–91% of the mean per‑dimension Wasserstein‑1 distance, explaining most of the observed state gap. Causal distillation and frozen SD updates fail to meet their criteria under either checkpoint.
By Weijia Han, Lisha Qu
Temporal models that maintain per-sequence latent states during training must reconstruct those states when the stored table is unavailable at inference. This creates a basic consistency question: do...
arXiv:2609.39934v1 Announce Type: cross
Abstract: Checkpoint selection in domain generalization often relies on source-validation accuracy, yet the selected checkpoint need not provide reliable proba...
By Jinshi Liu, Jiahao Li, Pan Liu, Yanfeng Li, Rui Qian, Zhao Tong, Yue Sun, Tao Tan
The paper investigates how a probe can decode in‑context bindings on model errors and how probe‑guided steering can repair them. It tracks probe accuracy, model output, and steering response across public pretraining and post‑training checkpoints, noting that probe accuracy improves during Pythia pretraining and that steering benefits grow with model size. The study also shows that decoders trained on final state or candidate logits do not outperform each other on late‑checkpoint errors, and presents an information‑theoretic counterexample explaining why decodability on errors alone cannot prove discarded output information.
By Manas Venkata Sai Ravulapalli, Samrath Singh Chadha