Skip to content
Preprint

SJEPA: Learning Elegant Latent Dynamics with Hybrid Symbolic-Neural Predictors

Aug 2026 · 0 citations · 38 references
Computer Science

TL;DR

Joint-embedding predictive architectures learn abstract states by predicting target embeddings from context embeddings from context embeddings, but their transition models are typically opaque neural maps, so SJEPA is introduced, a reconstruction-free JEPA framework that learns predictive representations whose induced dynamics admit compact symbolic descriptions.

Abstract

Joint-embedding predictive architectures learn abstract states by predicting target embeddings from context embeddings, but their transition models are typically opaque neural maps. We introduce SJEPA, a reconstruction-free JEPA framework that learns predictive representations whose induced dynamics admit compact symbolic descriptions. Its hybrid transition combines a symbolic law with a regularised neural correction for dynamics outside the selected grammar. The central principle is to learn the simplest adequate dynamics: representation constraints preserve informative, non-collapsed predictive coordinates, while operator compression favours low-complexity symbolic-neural transitions that remain predictively adequate. We formalise this principle through induced-dynamics complexity, analyse predictive-coordinate non-identifiability, and show that unconstrained operator compression creates a direct shortcut to representation collapse. The framework supports both alternating representation-equation learning and symbolic dynamics fitted to fixed representations. In controlled pendulum experiments, joint learning discovers substantially simpler symbolic dynamics with lower long-horizon rollout error and divergence than post-hoc fitting, while an unconstrained one-step diagnostic realises the predicted collapse shortcut. Under grammar misspecification, correction regularisation preserves the representable symbolic mechanism and directs the neural component towards residual dynamics. The results expose a controllable trade-off among predictive fidelity, representation quality, symbolic parsimony, and symbolic-neural allocation.

View source

Similar papers

#machine learning Preprint Sep 2026

Optimal Transport Dropout for Structured Predictive Uncertainty

Deterministic neural networks and neural operators provide point predictions with no intrinsic measure of reliability. Yet, predictive uncertainty may stem from irreducible outcome variability, finite data, or limitations of the chosen model class. Monte Carlo dropout offers a computationally convenient way to construc...

Giacomo Lorenzon, Francesco Regazzoni · 0 citations
Preprint Sep 2026

Machine-Learned Dynamical Representations for Accelerated RiteWeight Convergence

Two machine-learned representations are compared, DeepTICA and SPIB-VAE, with linear TICA for recovering steady-state observables from flawed distributions and a kinetic score computed from a coarse MSM at a resolution comparable to that used for RiteWeight random clustering is provided.

Sagar Kania · 0 citations
#artificial intelligence Preprint Sep 2026

LRC-JEPA: Disentangling Dynamics and Residual Context for Efficient World Models

This work introduces LRC-JEPA, a lightweight end-to-end world model that routes information into a compact predictive latent and learned-query residual-context embeddings and shows that the resulting representation is sufficient, minimal, nuisance-invariant, and disentangled.

Lu-Zhe Huang, Lei Chu, Jing-Yi Liang et al. · 0 citations
Preprint Aug 2026

LpWM: A Case for Sparse Representations in World Models

This work introduces LpWorldModel, a JEPA model regularized with Rectified Distribution Matching Regularization to match encoder features to a Rectified Generalized Gaussian distribution, yielding non-negative sparse codes, and finds that the learned sparse representations are mode-factored.

Yilun Kuang, Yash Dagade, Quentin Le Lidec et al. · 5 citations
Preprint Sep 2026

Bilinear World Models: Learning Representations with Structured Dynamics for Efficient Control

World models jointly learn latent representations and dynamics that predict how high-dimensional observations evolve under actions. In this work, we propose a JEPA-style world model in which, rather than learning arbitrary latent dynamics, we restrict them to follow a bilinear parameterization. This structure enables e...

Antonio Pariente, Ignacio Boero, Nikolai Matni et al. · 0 citations
Open access Sep 2026

PRISM-M: A Recurrent Framework for the Formation of Stable Internal Neural Models

PRISM-M, a simple recurrent mathematical implementation of the Principle of Representation Integration for Stable Models, treats extraction, compression, integration, stabilization, and prediction/action as five interacting operations and tests whether they can produce internal states that persist over time while remai...

E. Masliah · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.