arXiv Machine Learning By Ruijin Hua, Zichuan Liu, Zhuokai Zhao, Yujia Zheng

SplitJEPA: Learning Invariant and Variant Latent Worlds without Reconstruction

Read the original on arXiv Machine Learning →

SplitJEPA is a new joint embedding predictive architecture that learns a latent state and its invariant and variant components directly in representation space, without reconstructing observations. The method proves that, under stationary Gaussian predictive dynamics and a full‑rank variation condition, it can identify the invariant and variant subspaces up to independent block‑wise isometries. Experiments on synthetic nonlinear systems and robotic manipulation tasks confirm the theoretical guarantees and demonstrate practical benefits for robustness and efficiency.

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 Machine Learning
Sep 29

I Act Therefore I Am: When Is JEPA's Action-Conditioning Enough to Learn Causal Mechanisms?

The paper studies when joint-embedding predictive architectures (JEPAs) can recover underlying causal states from high‑dimensional observations. It introduces a latent variable model where observations arise from causal states with action‑conditioned dynamics, and proposes an information‑theoretic objective that maximizes conditional likelihood while preserving state entropy. The authors prove identifiability conditions—particularly sufficient action‑induced variation—and instantiate the objective as an action‑modulated Gaussian additive‑noise model (A‑JEPA), demonstrating theoretical and empirical success in synthetic and visual benchmarks.

By Yuhang Liu, Zhuo Huang, Javen Qinfeng Shi
arXiv Machine Learning
Oct 8

DSReg: Provably Recovering Individual World Latents without Reconstruction

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
arXiv AI
Jul 1

Delta-JEPA: Learning Action-Sensitive World Models via Latent Difference Decoding

arXiv:2606. 31232v1 Announce Type: new Abstract: Learning visual world models for planning requires compact latent dynamics that remain sensitive to actions, yet reconstruction-free joint-embedding objectives can collapse to action-insensitive representations.

By Zhenghao Zhang, Yuanxiang Wang, Zhenyu Guan, Yujia Yang, Bingkang Shi, Tianyu Zong, Hongzhu Yi, Guoqing Chao, Xingchen Chen, Tiankun Yang, Chenxi Bao, Tao Yu, Jingjing Zhou, Jungang Xu