Skip to content
DraconiticResearch
Search Sources API
186,546 studies31 sourcesUpdated 43 min ago
PreprintarXiv licencearXiv

DSReg: Provably Recovering Individual World Latents without Reconstruction

Abstract

Methods that recover individual latent variables of the world, from nonlinear ICA to dictionary learning and causal representation learning, anchor the latents to observations through reconstruction, auxiliary supervision, or distributional asymmetries such as non-Gaussianity. Methods without these anchors, including joint-embedding predictive architectures (JEPAs), identify the latent state only up to a linear transformation, so individual latents remain mixed. We close this gap: individual world latents can be provably recovered with no reconstruction, no decoder, and no labels. The key condition is Structural Diversity: different latents leave distinct dependency footprints on observations, just as no two snowflakes are alike. Building on the linear identifiability that LeJEPA provides, we prove that under Structural Diversity, DSReg (Dependency-Sparsity Regularization) recovers individual world latents up to signed permutation, without reconstruction or a decoder. It applies post hoc to any linearly identified representation, reusing trained checkpoints at no loss over joint training, and establishes the first fully identifiable JEPA that recovers every world latent. Moreover, as a condition on dependency footprints, Structural Diversity is strictly weaker than all structural conditions of prior identifiable latent variable models. Across synthetic regimes, world model probes, learned visual encoders, and external renderers, DSReg preserves dense prediction while improving individual-latent recovery and downstream use with scales.

Related

  1. StochIKM: Automated High-Fidelity Reconstruction of Individual Patient Data from Published Kaplan-Meier Curves
    Liangze Ke, Daniel Zelterman, Wei Wei +1
    arXivPreprintarXiv licenceFull textStatisticsarXiv
  2. One-Layer Transformer Provably Learns Multiclass One-Nearest Neighbor in Context
    Skanda Athreya, Yutong Wang
    arXivPreprintCC BY-NC-SA 4.0Full textStatisticsarXiv
  3. Orientation Diversity Provably Increases the Angular-Domain Rank of 3D MIMO Arrays
    Samer Henry, Elvino Sousa
    arXivPreprintarXiv licenceFull textGeneral mathematicsarXiv
  4. Plug-and-Play Methods Provably Converge Even with Improperly Trained Denoisers: Convergence by Architectural Design
    Henry Pritchard, Rahul Parhi
    arXivPreprintarXiv licenceFull textOptimisation & controlStatisticsarXiv
  5. Provably Safe Decentralized Contingency MPC under State-Only Information and Limited Sensing for Nonlinear Multi-agent Systems
    Max Studt, Georg Schildbach
    arXivPreprintCC BY 4.0Full textOptimisation & controlarXiv
BibTeX
@misc{zheng2026dsreg,
  title = {{DSReg: Provably Recovering Individual World Latents without Reconstruction}},
  author = {Yujia Zheng and David Klindt and Randall Balestriero and Bernhard Schölkopf},
  howpublished = {arXiv},
  year = {2026},
  month = oct,
  doi = {10.48550/arxiv.2610.09457},
  eprint = {2610.09457},
  archivePrefix = {arXiv},
  url = {https://arxiv.org/abs/2610.09457},
}
RIS
TY  - UNPB
TI  - DSReg: Provably Recovering Individual World Latents without Reconstruction
AU  - Yujia Zheng
AU  - David Klindt
AU  - Randall Balestriero
AU  - Bernhard Schölkopf
PY  - 2026
DA  - 2026/10/07
PB  - arXiv
DO  - 10.48550/arxiv.2610.09457
UR  - https://arxiv.org/abs/2610.09457
AB  - Methods that recover individual latent variables of the world, from nonlinear ICA to dictionary learning and causal representation learning, anchor the latents to observations through reconstruction, auxiliary supervision, or distributional asymmetries such as non-Gaussianity. Methods without these anchors, including joint-embedding predictive architectures (JEPAs), identify the latent state only up to a linear transformation, so individual latents remain mixed. We close this gap: individual world latents can be provably recovered with no reconstruction, no decoder, and no labels. The key condition is Structural Diversity: different latents leave distinct dependency footprints on observations, just as no two snowflakes are alike. Building on the linear identifiability that LeJEPA provides, we prove that under Structural Diversity, DSReg (Dependency-Sparsity Regularization) recovers individual world latents up to signed permutation, without reconstruction or a decoder. It applies post hoc to any linearly identified representation, reusing trained checkpoints at no loss over joint training, and establishes the first fully identifiable JEPA that recovers every world latent. Moreover, as a condition on dependency footprints, Structural Diversity is strictly weaker than all structural conditions of prior identifiable latent variable models. Across synthetic regimes, world model probes, learned visual encoders, and external renderers, DSReg preserves dense prediction while improving individual-latent recovery and downstream use with scales.
ER  -