arXiv:2607. 16204v1 Announce Type: new Abstract: Recent growth in reinforcement learning (RL) has surfaced a need for diverse, specialized training environments.
By Darshan Deshpande
arXiv:2607. 18715v1 Announce Type: new Abstract: Latent world models underpin much of modern model-based control, yet current action-conditioned formulations supervise the next-latent transition with a single, undifferentiated target, forcing a monolithic learning signal to absorb every source of state change.
By Yi-Ge Zhang, Tianqi Du, Qi Zhang, Yisen Wang
arXiv:2608. 01049v1 Announce Type: cross Abstract: World models have attracted significant attention for their ability to capture and predict the structure and dynamics of the physical world.
By Kapil Wanaskar, Gaytri Jena, Aman Chadha, Vinija Jain, Vasu Sharma, Amitava Das
arXiv:2608. 10016v1 Announce Type: cross Abstract: Heterogeneous federated systems require agents to learn and exchange informative representations despite differences in data distributions, sensing modalities, model architectures, latent dimensionalities, and local learning objectives.
By Gabriele D'Acunto, Enrico Grimaldi, Valeria Avino, Mario Edoardo Pandolfo, Leonardo Di Nino, Sergio Barbarossa, Paolo Di Lorenzo
Subspace-Decomposed JEPAs (SD-JEPA) split the latent space of Joint-Embedding Predictive Architectures into two orthogonal subspaces: a low-dimensional progression subspace trained with a cosine-margin triplet loss and a high-dimensional content subspace regularised by SIGReg. The authors prove that the anti-collapse forces act on disjoint coordinates, allowing additive composition rather than competition. SD-JEPA outperforms the LeWM baseline on most control benchmarks and the strongest non-LeWM JEPA baseline on Push‑T, with a subspace-ablation confirming the split as essential. The 1‑D angular progression coordinate serves as a scene-aware compass, advancing with task progress, regressing on backtracking, and relocalising under perturbations to separate surprise from meaning.
By Lucas Thil, Jesse Read, Rim Kaddah, Guillaume Doquet
The paper introduces DSReg, a method that provably recovers individual world latent variables without relying on reconstruction, decoders, or labels. It leverages a Structural Diversity condition—distinct dependency footprints of different latents—to achieve full identifiability up to signed permutation. DSReg can be applied post hoc to any linearly identified representation, preserving dense prediction while improving latent recovery across synthetic and real-world experiments.
By Yujia Zheng, David Klindt, Randall Balestriero, Bernhard Sch\"olkopf