When Does LeJEPA Learn a World Model?

arXiv:2605.26379 · stat.ML, cs.LG · Submitted 2026-05-25 · Read on arXiv

Listen

Radio episode about this paper

Transcript

Introduction to the show: ident: AI Radio. Generated commentary on the latest Artificial Intelligence papers.

Tom: I'm Tom.

Jane: And I'm Jane, here with Lu, Meng and our in-house large language model, Lalam.

Tom: We're looking at the paper: "When Does LeJEPA Learn a World Model?".

Jane: Here's the gist of the paper. A representation that scrambles true degrees of freedom cannot support reliable planning or compositional generalization.

Tom: The paper investigates identifiability conditions for learning a world model, focusing on how different regularization techniques (SIGReg and VICReg) interact with alignment signals (like those from trajectory data) and latent distribution properties (Gaussianity and autocorrelation).

Jane: The core theoretical contribution centers on linear identifiability.

Tom: The paper proves that LeJEPA, which incorporates alignment plus Gaussian regularization, linearly recovers the world’s latent variables from nonlinear observations in a broad class of worlds where latents evolve under stationary, additive-noise transitions.

Title and authors: Tom: So we're looking at this paper called "When Does LeJEPA Learn a World Model?" and it’s asking if any representation that scrambles the true degrees of freedom of the world can actually support reliable planning or compositional generalization.

Jane: That sounds like a really big question for how much we can trust what an AI learns about the world, Tom. What’s the main idea here?

Tom: Well, they are investigating identifiability conditions for learning a world model and they focus on how different regularization techniques like SIGReg and VICReg interact with alignment signals from trajectory data and properties of the latent distribution like Gaussianity or autocorrelation.

Lu: The core theoretical contribution centers on linear identifiability. They prove that LeJEPA, which incorporates alignment plus Gaussian regularization, can linearly recover the world’s latent variables from nonlinear observations in a broad class of worlds where latents evolve under stationary, additive-noise transitions.

Tom: So it turns out that among all such worlds, the Gaussian distribution is the unique latent distribution for which this linear identifiability guarantee holds. That’s a strong statement there.

Jane: That means if you want this kind of recovery guarantee, the world itself has to follow a very specific mathematical structure—a Gaussian one. Is that what they mean?

Lu: Exactly, the forward direction shows that minimizing LeJEPA’s loss is equivalent to maximizing correlation between positive pairs, which forces the learned representation to be a rotation or reflection of the true latents and transition dynamics, as stated in Theorem one <ref:2605.26379#pg1>.

Tom: That means if you optimize this system correctly, you’re essentially forcing the AI to learn the right world model structure just by pulling together correlated data points.

Meng: From an engineering standpoint, I'm curious about what this means for deployment. Does this linear identifiability guarantee translate into something practical for running these models?

Jane: That’s a good question, Meng. The paper establishes four key results that move beyond just theory and look at how well the model actually performs and how it relates to planning.

Tom: Let's walk through those results quickly. First, Theorem one confirms that a Gaussian world is linearly identifiable with LeJEPA, which means it can recover the latent variables in a linear way <ref:2605.26379#pg1>.

Lu: Then Theorem two proves the uniqueness of the Gaussian distribution within its defined class, showing that this structure is necessary for this kind of recovery <ref:2605.26379#pg1>.

Title and authors: Jane: And then there’s Theorem three which gives an approximate identifiability result, bounding the recovery error by something like D plus epsilon squared plus D squared <ref:2605.26379#pg1>. The authors show that the alignment gap delta is a much stronger predictor of the error than epsilon, which is the whitening deviation.

Tom: That suggests that focusing on how aligned your data is is more important for accuracy than just making sure your latent distribution looks perfectly Gaussian.

Meng: What about planning? I always worry if a learned representation can actually be used to make decisions in a real system, not just predict the next frame.

Lu: Theorem four demonstrates that linear identifiability enables optimal latent-space planning, showing that trajectories planned in the learned latent space are mathematically identical to those planned in the true world with the same actions and value.

Jane: That’s huge for autonomy because it means a path you plan in this compressed space is a correct path in the real physical space.

Tom: And there’s also this point about control tools. Linear identifiability allows for covariant transformation of cost functions, which means LQR is a special case of Theorem four where the invariance comes from the quadratic structure and the covariance of all system matrices under rotation.

Jane: So we can use classical control methods on these latent representations because they preserve the physics structure when you rotate them. That’s a nice practical application for state estimation, right?

Meng: I still have concerns about running this at scale. The scaling experiment shows that SIGReg maintains an R squared value greater than zero point nine nine nine five across all tested dimensions up to N equals one thousand twenty-four suggesting linear identifiability is essentially perfect at all those dimensions with SIGReg on.

Lu: That’s because SIGReg’s plateau is consistently wider than whitening’s when tested across various latent distribution shapes, which is why it handles non-Gaussian latents better than just relying on simple whitening.

Jane: It sounds like this work gives us a way to be robust to non-Gaussian latent variables that might come up in goal-directed reinforcement learning policies, like SIGReg can do.

Tom: And they show that the alignment loss is the strongest single predictor of R squared, which is consistent with its direct connection to the alignment gap delta in Theorem three <ref:2605.26379#pg1>.

Title and authors: Meng: I also see a point about training efficiency here; they show that you can train this system using a loss function that directly predicts linear identifiability because the alignment loss is such a strong predictor.

Jane: So, it seems like we can design our training process to optimize for this linear structure rather than just trying to get some good visual fidelity.

Lu: The authors also showed that identifiability requires both approximate Gaussianity and non-trivial autocorrelation, with the R squared peaking in intermediate regimes where the model is near the Gaussian floor but in a regime of informative correlation.

Tom: That points to a sweet spot: you want it close to a simple Gaussian but still have enough correlation to be useful.

Jane: And they found that identifiability R squared peaks at intermediate temporal strides, specifically when delta, the alignment gap, is between eight and sixteen.

Meng: That suggests we need some control over how much we align the data; if you go too far or not far enough, the performance drops.

Lu: The analysis also reveals that the trajectory encoder exhibits massive asymmetry and only recovers at larger temporal strides where temporal variation provides a learning signal, while the shoulder recovers consistently but degrades at large delta because of wrapping beyond pi.

Jane: So, when we look at how long videos or trajectories we use for training, there’s an optimal length to get that alignment signal before it starts hurting us.

Tom: Overall, this paper on "When Does LeJEPA Learn a World Model?" shows that linear identifiability is a powerful tool because it turns a learned representation into something useful for planning by ensuring straight-latent plans correspond to straight joint-space paths.

Jane: It’s about moving away from representations that just scramble things in interesting ways and toward ones that actually recover the true underlying physics structure.

Lu: This work confirms that if you want reliable world modeling, you need a mathematical guarantee of linear identifiability, and Gaussianity seems to be the unique way to get that guarantee in this context.

Meng: For deployment, it means we can rely on these models for planning if they satisfy these conditions, but we still need robust regularization like SIGReg to handle messy real-world data.

Tom: So, we’ve seen how LeJEPA can recover the latent variables linearly when the world is Gaussian and constrained by stationary additive noise.

Jane: This paper gives us a very concrete direction for designing better representations that support reliable planning in complex environments.

The paper's summary: Tom: So, we’re looking at the summary of this paper called "When Does LeJEPA Learn a World Model?". Basically, they’re asking if any representation that scrambles the true degrees of freedom can actually support reliable planning or compositional generalization.

Jane: That sounds like a really big question for how much we can trust what an AI learns about the world, Tom. What’s the main idea here?

Tom: They are investigating identifiability conditions for learning a world model and they focus on how different regularization techniques like SIGReg and VICReg interact with alignment signals from trajectory data and properties of the latent distribution like Gaussianity or autocorrelation.

Jane: The core theoretical contribution centers on linear identifiability. They prove that LeJEPA, which incorporates alignment plus Gaussian regularization, can linearly recover the world’s latent variables from nonlinear observations in a broad class of worlds where latents evolve under stationary, additive-noise transitions.

Tom: So it turns out that among all such worlds, the Gaussian distribution is the unique latent distribution for which this linear identifiability guarantee holds. That’s a strong statement there.

Jane: That means if you want this kind of recovery guarantee, the world itself has to follow a very specific mathematical structure—a Gaussian one. Is that what they mean?

Tom: Exactly, the forward direction shows that minimizing LeJEPA’s loss is equivalent to maximizing correlation between positive pairs, which forces the learned representation to be a rotation or reflection of the true latents and transition dynamics, as stated in Theorem one.

Jane: That means if you optimize this system correctly, you’re essentially forcing the AI to learn the right world model structure just by pulling together correlated data points.

Tom: From an engineering standpoint, I'm curious about what this means for deployment. Does this linear identifiability guarantee translate into something practical for running these models?

Jane: That’s a good question, Meng. The paper establishes four key results that move beyond just theory and look at how well the model actually performs and how it relates to planning.

Tom: Let's walk through those results quickly. First, Theorem one confirms that a Gaussian world is linearly identifiable with LeJEPA, which means it can recover the latent variables in a linear way.

Jane: Then Theorem two proves the uniqueness of the Gaussian distribution within its defined class, showing that this structure is necessary for this kind of recovery.

The paper's summary: Tom: And then there’s Theorem three which gives an approximate identifiability result, bounding the recovery error by something like D plus epsilon squared plus D squared. The authors show that the alignment gap delta is a much stronger predictor of the error than epsilon, which is the whitening deviation.

Jane: That suggests that focusing on how aligned your data is is more important for accuracy than just making sure your latent distribution looks perfectly Gaussian.

Tom: What about planning? I always worry if a learned representation can actually be used to make decisions in a real system, not just predict the next frame.

Jane: Theorem four demonstrates that linear identifiability enables optimal latent-space planning, showing that trajectories planned in the learned latent space are mathematically identical to those planned in the true world with the same actions and value.

Tom: That’s huge for autonomy because it means a path you plan in this compressed space is a correct path in the real physical space.

Jane: And there’s also this point about control tools. Linear identifiability allows for covariant transformation of cost functions, which means LQR is a special case of Theorem four where the invariance comes from the quadratic structure and the covariance of all system matrices under rotation.

Tom: So we can use classical control methods on these latent representations because they preserve the physics structure when you rotate them. That’s a nice practical application for state estimation, right?

Jane: I still have concerns about running this at scale. The scaling experiment shows that SIGReg maintains an R squared value greater than zero point nine nine nine five across all tested dimensions up to N equals one thousand twenty-four suggesting linear identifiability is essentially perfect at all those dimensions with SIGReg on.

Tom: That’s because SIGReg’s plateau is consistently wider than whitening’s when tested across various latent distribution shapes, which is why it handles non-Gaussian latents better than just relying on simple whitening.

Jane: It sounds like this work gives us a way to be robust to non-Gaussian latent variables that might come up in goal-directed reinforcement learning policies, like SIGReg can do.

Tom: And they show that the alignment loss is the strongest single predictor of R squared, which is consistent with its direct connection to the alignment gap delta in Theorem three.

The paper's summary: Jane: I also see a point about training efficiency here; they show that you can train this system using a loss function that directly predicts linear identifiability because the alignment loss is such a strong predictor.

Tom: So, we can design our training process to optimize for this linear structure rather than just trying to get some good visual fidelity.

Jane: The authors also showed that identifiability requires both approximate Gaussianity and non-trivial autocorrelation, with the R squared peaking in intermediate regimes where the model is near the Gaussian floor but in a regime of informative correlation.

Tom: That points to a sweet spot: you want it close to a simple Gaussian but still have enough correlation to be useful.

Jane: And they found that identifiability R squared peaks at intermediate temporal strides, specifically when delta, the alignment gap, is between eight and sixteen.

Tom: That suggests we need some control over how much we align the data; if you go too far or not far enough, the performance drops.

Jane: The analysis also reveals that the trajectory encoder exhibits massive asymmetry and only recovers at larger temporal strides where temporal variation provides a learning signal, while the shoulder recovers consistently but degrades at large delta because of wrapping beyond pi.

Tom: So, when we look at how long videos or trajectories we use for training, there’s an optimal length to get that alignment signal before it starts hurting us.

Jane: Overall, this paper on "When Does LeJEPA Learn a World Model?" shows that linear identifiability is a powerful tool because it turns a learned representation into something useful for planning by ensuring straight-latent plans correspond to straight joint-space paths.

Tom: It’s about moving away from representations that just scramble things in interesting ways and toward ones that actually recover the true underlying physics structure.

Jane: This work confirms that if you want reliable world modeling, you need a mathematical guarantee of linear identifiability, and Gaussianity seems to be the unique way to get that guarantee in this context.

Tom: For deployment, it means we can rely on these models for planning if they satisfy these conditions, but we still need robust regularization like SIGReg to handle messy real-world data.

The paper's improvements: Tom: So, we’re looking at the improvements suggested by this paper for LeJEPA, which is basically how they think we can make it better than just using basic alignment and Gaussian regularization alone.

Jane: That sounds like they're trying to fix the gaps where things fall apart, Tom. What are these new tweaks?

Tom: The first big thing is that linear identifiability enables optimal latent-space planning, which means trajectories planned in the learned latent space are mathematically identical to those planned in the true world with the same actions and value.

Jane: That’s huge for autonomy because it means a path you plan in this compressed space is a correct path in the real physical space.

Tom: Then they suggest using linear identifiability to allow for covariant transformation of cost functions, which means LQR is a special case where the invariance comes from the quadratic structure and the covariance of all system matrices under rotation.

Jane: So we can use classical control methods on these latent representations because they preserve the physics structure when you rotate them. That’s a nice practical application for state estimation, right?

Tom: They also show that you can be robust to non-Gaussian latent variables, like those from goal-directed policies, by using a Gaussianity regularizer like SIGReg because its plateau is consistently wider than whitening’s across various shapes.

Jane: That means the system can handle messier data that doesn't look perfectly Gaussian without breaking.

Tom: And they’ve done scaling experiments showing that SIGReg maintains an R squared value greater than zero point nine nine nine five across all tested dimensions up to one thousand twenty-four suggesting linear identifiability is essentially perfect at all those dimensions with SIGReg on.

Jane: That’s good for deployment because it means we don't have to worry about the data getting too big for the model to handle.

Tom: They also show that you can train this system using a loss function that directly predicts linear identifiability because the alignment loss is such a strong predictor, which helps us optimize training.

Jane: So, instead of guessing what makes a good model, we can design the training process to directly target that linear structure.

Tom: Finally, they pinpoint when you need to be careful with temporal strides; identifiability R squared peaks at intermediate values between eight and sixteen because that's where the model is near the Gaussian floor but still has enough correlation.

Jane: It sounds like we need some control over how much we align the data; if you go too far or not far enough, the performance drops.

Tom: The paper also points out that there’s an optimal length for trajectories to get that alignment signal before it starts hurting us because the encoder is asymmetric and only recovers at larger temporal strides where variation provides a learning signal.

Jane: So, when we look at how long videos or trajectories we use for training, there’s an optimal length to get that alignment signal before it starts hurting us.

Tom: Overall, this work shows that linear identifiability is a powerful tool because it turns a learned representation into something useful for planning by ensuring straight-latent plans correspond to straight joint-space paths.

Conclusion: Tom: So, to wrap up, this paper on "When Does LeJEPA Learn a World Model?" shows that linear identifiability is a powerful tool because it turns a learned representation into something useful for planning by ensuring straight-latent plans correspond to straight joint-space paths.

Jane: It’s about moving away from representations that just scramble things in interesting ways and toward ones that actually recover the true underlying physics structure.

Tom: Basically, if you want reliable world modeling, you need a mathematical guarantee of linear identifiability, and Gaussianity seems to be the unique way to get that guarantee in this context.

Jane: This work gives us a very concrete direction for designing better representations that support reliable planning in complex environments.

Lu: I think what they’ve shown is that if you constrain your world model to be Gaussian, you get a solid mathematical foundation for recovery.

Meng: But it’s important to remember that this linear identifiability only holds under stationary, additive-noise transitions, so we can't just apply it everywhere.

Lalam: I’m confident in their answer; the requirement for a Gaussian distribution is mathematically unique within that specific class of world models they defined.

Tom: And from an engineering standpoint, it means we can rely on these models for planning if they satisfy these conditions, but we still need robust regularization like SIGReg to handle messy real-world data.

Jane: So the challenge isn't just getting the math right; it's making sure our training actually produces a model that respects those mathematical constraints in practice.

Meng: What breaks at scale is how much data you need to get that R squared value up to zero point nine nine nine five across one thousand twenty-four dimensions.

Lu: That scaling result is encouraging, but it shows we still have to manage the trade-off between informative correlation and approximate Gaussianity.

Tom: Yeah, the sweet spot for temporal strides being between eight and sixteen tells us exactly where we need to tune our data sampling interval.

Jane: It seems like this paper sets a very clear benchmark for what a reliable world model needs to be before we can trust its planning capabilities.

David Klindt, Yann LeCun, Randall Balestriero

Cold Spring Harbor Laboratory · New York University · Brown University

stat.ML, cs.LG

Submitted: 2026-05-25

Updated: 2026-11-09

Comments: NeurIPS 2026 camera-ready. 52 pages, 22 figures, 14 tables. Code: https://github.com/klindtlab/lejepa-identifiability

Code: https://github.com/klindtlab/lejepa-identifiability

License: http://creativecommons.org/licenses/by/4.0/

Importance score: 96/100

The gist: A representation that scrambles true degrees of freedom cannot support reliable planning or compositional generalization.

Key concepts

Linear Identifiability
This means the true underlying world variables can be recovered linearly from the nonlinear observations made by the AI system. If this holds, it guarantees that planning in a simplified latent space accurately reflects actions in the real world.
Gaussian Distribution
The paper proves that among all possible latent distributions, only a Gaussian distribution satisfies the linear identifiability guarantee for LeJEPA. This makes Gaussianity a key property to seek when learning a world model.
Alignment Signal (Trajectory Data)
This refers to signals derived from trajectory data used in the learning process. The paper shows that this alignment signal is crucial; it directly relates to the recovery error and helps force the learned representation to align with true dynamics.
LeJEPA
LeJEPA is a specific model architecture incorporating both alignment signals and Gaussian regularization. It is designed to learn a world model by leveraging these components, and its identifiability properties are central to the paper's findings.

Terminology

Summary

A representation that scrambles true degrees of freedom cannot support reliable planning or compositional generalization. p. 0

Where the paper says it

edu Randall Balestriero Brown University randall balestriero@brown. edu Abstract A representation that scrambles the true degrees of freedom of the world cannot support reliable planning or compositional generalization.

The paper investigates identifiability conditions for learning a world model, focusing on how different regularization techniques (SIGReg and VICReg) interact with alignment signals (like those from trajectory data) and latent distribution properties (Gaussianity and autocorrelation). p. 1
Where the paper says it

A recent shift changes the picture: LeJEPA [2] prevents collapse by explicitly regularizing the embedding distribution toward an isotropic Gaussian via Sketched Isotropic Gaussian Regularization (SIGReg). Along with an alignment loss this enables stable end-to-end training from raw pixels [9], but whether the resulting representation actually recovers the world’s latent variables still remains open.

The core theoretical contribution centers on linear identifiability. p. 6

Where the paper says it

1 is thus empirically supported across mixing functions, dimensions, and hyperparameters when the Gaussian-latent assumptions hold; the practical gap between methods appears only off the theoretical ideal. 2 Converse: Non-Gaussian Latent Variables Break Linear Identifiability Next, we validate Thm.

The paper proves that LeJEPA, which incorporates alignment plus Gaussian regularization, linearly recovers the world’s latent variables from nonlinear observations in a broad class of worlds where latents evolve under stationary, additive-noise transitions. p. 0
Where the paper says it

edu Abstract A representation that scrambles the true degrees of freedom of the world cannot support reliable planning or compositional generalization. We prove that LeJEPA (alignment plus Gaussian regularization) linearly recovers the world’s latent variables from nonlinear observations, a property known as linear identifiability, in a broad class of worlds where latents evolve under stationary, additive-noise transitions.

The main result is that among all such worlds, the Gaussian distribution is the unique latent distribution for which this linear identifiability guarantee holds. p. 0
Where the paper says it

We prove that LeJEPA (alignment plus Gaussian regularization) linearly recovers the world’s latent variables from nonlinear observations, a property known as linear identifiability, in a broad class of worlds where latents evolve under stationary, additive-noise transitions. Our main result is that among all such worlds, the Gaussian is the unique latent distribution for which this guarantee holds.

This forward direction establishes that minimizing LeJEPA's loss is equivalent to maximizing correlation between positive pairs, forcing the learned representation to be a rotation/reflection of the true latents and transition dynamics (Theorem 1). The converse direction proves that only Gaussian latents satisfy this constraint, as demanding an affine eigenfunction for the transition operator forces the score function to be linear, which uniquely characterizes a Gaussian density (Theorem 2). p. 4
Where the paper says it

Proof Sketch. Demanding an affine eigenfunction forces the score function (log p) ′ of the latent distribution to be linear.

The paper establishes four key results. p. 4

Where the paper says it

F (SL connection). 5 Theory We state four results that together characterize when LeJEPA learns the World Model.

Theorem 1 confirms that a Gaussian world is linearly identifiable with LeJEPA. p. 4
Where the paper says it

5 Theory We state four results that together characterize when LeJEPA learns the World Model. 1 shows that a Gaussian world is linearly identifiable with LeJEPA.

Theorem 2 proves the uniqueness of the Gaussian distribution within its defined class. p. 4
Where the paper says it

2 establishes that, within the class of worlds defined in Sec. 1, the Gaussian is the unique distribution with this property.

Theorem 3 provides an approximate identifiability result, bounding the recovery error by E[|h(z) - Qz| 2] at most D + (epsilon + D) squared, where delta (the alignment gap) is shown to be a much stronger predictor of recovery error than epsilon (the whitening deviation). Theorem 4 demonstrates that linear identifiability enables optimal latent-space planning, showing that trajectories planned in the learned latent space are mathematically identical to those planned in the true world (V hat* h(z 0) = V* z 0). p. 5
Where the paper says it

Interpretation. Linear identifiability turns the learned representation into a useful World Model for planning: trajectories planned in the learned latent are mathematically identical to trajectories planned in the true world, with the same actions and the same value.

Empirically, the paper validates these results across various mixing functions and dimensions. p. 6

Where the paper says it

999 up to N = 1024; InfoNCE degrades at scale under fixed kernel width. 1 is thus empirically supported across mixing functions, dimensions, and hyperparameters when the Gaussian-latent assumptions hold; the practical gap between methods appears only off the theoretical ideal.

Figure 6 shows that identifiability requires both approximate Gaussianity and non-trivial autocorrelation, with R2 peaking in intermediate regimes where the model is near the Gaussian floor but in a regime of informative correlation. Table 5 and Table 6 compare SIGReg and VICReg, showing they match on linear identifiability across dimensions. p. 6
Where the paper says it

We test all three Gaussianity-enforcing classes on the same setup: SIGReg [2], VICReg [3], and InfoNCE [26]. Table 1: batch-statistic estimators (SIGReg, VICReg) maintain R2 > 0.

Figure 13 illustrates that identifiability R2 peaks at intermediate temporal strides (delta in [8, 16]) where the model is near the Gaussian floor but in a regime of informative correlation.

Furthermore, planning equivalence is established through total cost equivalence between stage costs. p. 5

Where the paper says it

We now make explicit what orthogonal identifiability buys for a key motivation of World Models: planning actions in latent space. Theorem 4 (Optimal Latent Planning) Let h(z) = Qz with Q ∈ O(n), write zˆ := h(z), and consider any finite-horizon optimal control problem whose stage and terminal costs ℓ, ℓT are O(n)-invariant in the state argument: ℓ(Rz, a) = ℓ(z, a), ℓT (Rz) = ℓT (z), ∀ R ∈ O(n).

The analysis reveals that the trajectory encoder exhibits massive asymmetry, recovering only at larger temporal strides where temporal variation provides learning signal, while the shoulder recovers consistently but degrades at large delta due to wrapping beyond plus or minus pi. Overall, linear identifiability turns a learned representation into a useful World Model for planning by ensuring straight-latent plans correspond to straight joint-space paths. p. 5
Where the paper says it

Interpretation. Linear identifiability turns the learned representation into a useful World Model for planning: trajectories planned in the learned latent are mathematically identical to trajectories planned in the true world, with the same actions and the same value.

Green — the paper says it, and the page is printed. Red — no passage carries it, so treat that sentence as unverified. The same check runs on your own text: check a summary against its source, $5.

Improvements for AI systems

  1. Linear identifiability enables optimal latent-space planning because linear identifiability enables optimal latent-space planning (Theorem 4). This means trajectories planned in learned latent space are mathematically identical to trajectories planned in the true world, with the same actions and the same value (Theorem 4).

  2. The system can perform accurate state estimation using classical control tools because linear identifiability allows for covariant transformation of cost functions. LQR is therefore a special case of Thm. 4 in which the invariance is inherited from the quadratic structure and the covariance of all system matrices under the rotation (Theorem 4).

  3. The AI system can be robust to non-Gaussian latent variables, such as those arising from goal-directed reinforcement learning policies, by employing a Gaussianity regularizer like SIGReg. SIGReg’s plateau is consistently wider than whitening’s when tested across various latent distribution shapes (Section 6).

  4. The system can effectively handle high-dimensional data up to 1024 dimensions while maintaining linear identifiability, as demonstrated by the scaling experiment. "SIGReg (Tab. 5) maintains R2 > 0.9995 across all tested dimensions up to N=1024, showing that linear identifiability is essentially perfect at all dimensions" (Section H.10).

  5. The system can be trained using a loss function that directly predicts linear identifiability, as the alignment loss is the strongest predictor of R2. The alignment loss is the strongest single predictor of R2, consistent with its direct connection to the alignment gap delta in Thm. 3 (Section H.9).

Abstract

A representation that scrambles the true degrees of freedom of the world cannot support reliable planning or compositional generalization. We prove that LeJEPA (alignment plus Gaussian regularization) linearly recovers the world's latent variables from nonlinear observations, a property known as linear identifiability, in a class of worlds where latents evolve under stationary, additive-noise transitions. Our main result is that among all such worlds, the Gaussian is the unique latent distribution for which this guarantee holds. The forward direction rests on a spectral decomposition in which each degree of nonlinearity is strictly penalized by alignment, making the linear map the optimum; the converse rules out every non-Gaussian alternative. We further prove an approximate identifiability result where the guarantee degrades gracefully, and show that linear, orthogonal identifiability enables optimal latent-space planning. We validate the theory with experiments ranging from 2D examples to 4096-dimensional latents, including ablations, pixel-based robotic control, and natural images from ImageNet-X. Our theory turns an empirically successful recipe into a mathematical guarantee, providing the foundation for building World Models that provably recover the structure of the world.

Sources

Related papers