arXiv Machine Learning

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.

arXiv Machine Learning
4d ago

Complete or Sparse: A Tale of Two Identifiabilities

The paper investigates when supervised learning can recover the true latent variables that generate data, focusing on two causal settings: generative (labels cause latents) and discriminative (latents cause labels). It shows that if the representation space has at least as many dimensions as the latent space, optimal encoders are linear; otherwise, identifiability fails and encoders become nonlinear. Additional constraints—such as non‑negative activations in the generative case or sparsity and spark conditions in the discriminative case—enable recovery of individual latent variables, linking nonlinear ICA, compressed sensing, and neural network interpretability.

By Junze Zhou, David Klindt
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 AI
1d ago

MOSAIC: Module Discovery via Sparse Additive Identifiable Causal Learning for Scientific Time Series

MOSAIC is a sparse temporal variational autoencoder that merges causal representation learning with support recovery to identify interpretable latent modules in scientific time series. It leverages regime‑conditioned temporal variation to discover latent variables and uses an additive decoder to recover a sparse set of observations linked to each latent, providing module‑level interpretability. The method offers theoretical guarantees for ANOVA main‑effect identifiability under smooth mixing functions and demonstrates empirical success across diverse domains such as RNA dynamics, solar wind, ENSO climate, industrial process control, and synthetic tokamak data.

By Shicheng Fan, Nour Elhendawy, Jianle Sun, Ke Fang, Kun Zhang, Yihang Wang, Lu Cheng
arXiv AI
4d ago

Learning Intrinsic Dynamics in Latent World Models

The paper investigates how encouraging action predictability in latent world models can preserve intrinsic dynamics, which are crucial for planning. By deriving a theoretical lower bound and conducting empirical tests, the authors show that action predictability prevents the encoder from merging distinct action outcomes, even when visual appearance varies. Using a method called Concat IDM, they achieve a substantial increase in planning success on the Push‑T benchmark, from 9.1% to 77.2%, demonstrating the practical benefit of this inductive bias.

By Jiamin Shi, Yuanhong Zhang, Zhiyang Liu, Jiawei Sun, Jingwen Fu
arXiv Machine Learning
Sep 17

Subspace-Decomposed JEPAs: Disentangling Progression and Content in Latent World Models

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
arXiv Machine Learning
Oct 9

SplitJEPA: Learning Invariant and Variant Latent Worlds without Reconstruction

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.

By Ruijin Hua, Zichuan Liu, Zhuokai Zhao, Yujia Zheng