SJEPA: Hybrid Symbolic-Neural Predictors for Elegant Latent Dynamics
A recent publication on arXiv (2608.04060) presents SJEPA, a reconstruction-free Joint-Embedding Predictive Architecture (JEPA) designed to develop predictive representations with concise symbolic descriptions. This framework integrates a symbolic transition law with a regularized neural correction to manage dynamics beyond the chosen grammar. Its fundamental aim is to discover the simplest sufficient dynamics: representation constraints maintain informative, non-collapsed predictive coordinates, while operator compression promotes low-complexity symbolic-neural transitions that are predictively sufficient. The authors define this through induced-dynamics complexity, examine the non-identifiability of predictive coordinates, and demonstrate that unrestricted operator compression leads directly to representation collapse. This paper serves as a cross-type announcement, suggesting it may have been shared at a conference or journal, and tackles the opacity of transition models in JEPA architectures by offering a hybrid solution that balances simplicity with predictive capability.
Key facts
- SJEPA is a reconstruction-free JEPA framework.
- It learns predictive representations with compact symbolic descriptions.
- The hybrid transition combines a symbolic law with a regularized neural correction.
- The principle is to learn the simplest adequate dynamics.
- Representation constraints preserve informative, non-collapsed predictive coordinates.
- Operator compression favors low-complexity symbolic-neural transitions.
- The paper analyzes predictive-coordinate non-identifiability.
- Unconstrained operator compression leads to representation collapse.
Entities
Institutions
- arXiv