Pith. sign in

REVIEW 14 cited by

Learning and Leveraging World Models in Visual Representation Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2403.00504 v1 pith:LDLQHR4B submitted 2024-03-01 cs.CV cs.AIcs.LG

Learning and Leveraging World Models in Visual Representation Learning

classification cs.CV cs.AIcs.LG
keywords learningworldimagemodelrepresentationsapproachjepalearned
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Joint-Embedding Predictive Architecture (JEPA) has emerged as a promising self-supervised approach that learns by leveraging a world model. While previously limited to predicting missing parts of an input, we explore how to generalize the JEPA prediction task to a broader set of corruptions. We introduce Image World Models, an approach that goes beyond masked image modeling and learns to predict the effect of global photometric transformations in latent space. We study the recipe of learning performant IWMs and show that it relies on three key aspects: conditioning, prediction difficulty, and capacity. Additionally, we show that the predictive world model learned by IWM can be adapted through finetuning to solve diverse tasks; a fine-tuned IWM world model matches or surpasses the performance of previous self-supervised methods. Finally, we show that learning with an IWM allows one to control the abstraction level of the learned representations, learning invariant representations such as contrastive methods, or equivariant representations such as masked image modelling.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 14 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. World Action Verifier: Self-Improving World Models via Forward-Inverse Asymmetry

    cs.LG 2026-04 accept novelty 7.0

    WAV self-improves action-conditioned world models by cycle-consistent verification of state plausibility and sparse action reachability, doubling sample efficiency and lifting policy reward by over 22% on nine tasks.

  2. Separating Representation from Reconstruction Enables Scalable Text Encoders

    cs.CL 2026-07 accept novelty 6.5

    Separating representation from token reconstruction via a bipartite CrossBERT architecture restores scalable frozen text embeddings and enables high-masking complementary training.

  3. Three-in-One World Model: Energy-Based Consistency, Prediction, and Counterfactual Inference for Marketing Intervention

    cs.AI 2026-05 unverdicted novelty 6.0

    A DBM-based architecture learns consumer beliefs to enable consistent prediction and counterfactual inference for marketing interventions, outperforming baselines on heterogeneous treatment effects in simulation.

  4. AeroJEPA: Learning Semantic Latent Representations for Scalable 3D Aerodynamic Field Modeling

    cs.LG 2026-05 unverdicted novelty 6.0

    AeroJEPA applies joint-embedding predictive learning to produce scalable, semantically organized latent representations for 3D aerodynamic fields that support both field reconstruction and downstream design tasks.

  5. Text-Conditional JEPA for Learning Semantically Rich Visual Representations

    cs.LG 2026-05 unverdicted novelty 6.0

    TC-JEPA conditions masked feature prediction on text captions via sparse cross-attention to produce more semantically rich visual representations and outperforms contrastive methods on fine-grained tasks.

  6. Toward Consistent World Models with Multi-Token Prediction and Latent Semantic Enhancement

    cs.LG 2026-04 unverdicted novelty 6.0

    MTP induces representational contractivity for coherent world models in LLMs but causes illegal latent shortcuts; LSE-MTP anchors to true trajectories to reduce hallucinations and improve consistency.

  7. Dreamer-CDP: Improving Reconstruction-free World Models Via Continuous Deterministic Representation Prediction

    cs.LG 2026-03 unverdicted novelty 6.0

    Dreamer-CDP achieves reconstruction-free world modeling via a JEPA-style predictor on continuous deterministic representations and matches Dreamer's performance on Crafter.

  8. GeoWorld: Geometric World Models

    cs.CV 2026-02 unverdicted novelty 6.0

    GeoWorld applies hyperbolic geometry to JEPA world models and introduces geometric reinforcement learning, reporting modest success-rate gains of ~3% and ~2% on 3- and 4-step planning tasks versus V-JEPA 2.

  9. Scaling World-Model Reinforcement Learning Through Diffusion Policy Optimization

    cs.LG 2026-05 unverdicted novelty 5.0

    MBDPO reformulates policy optimization as a diffusion process over searched trajectories in latent world models to reduce misalignment between search and value learning.

  10. stable-worldmodel: A Platform for Reproducible World Modeling Research and Evaluation

    cs.LG 2026-05 unverdicted novelty 5.0

    The paper presents stable-worldmodel (swm), a platform with high-performance data layer, modern world model baselines, planning solvers, and extended environments for reproducible research and generalization evaluation.

  11. The Lov\'{a}sz Local Lemma: Foundations and Applications

    math.CO 2026-03 conditional novelty 5.0

    LEPA predicts geometrically transformed patch embeddings from context and transform parameters, lifting MRR from <0.2 (interpolation) to >0.8 while keeping competitive PANGAEA segmentation scores.

  12. Self-Predictive Representations for Combinatorial Generalization in Behavioral Cloning

    cs.LG 2025-06 unverdicted novelty 5.0

    BYOL-γ uses self-predictive representations to approximate successor representations, improving zero-shot combinatorial generalization in goal-conditioned behavioral cloning.

  13. Efficient On-policy Visual-RL via Stochastic Decoupled Policy Gradient

    cs.RO 2026-05 unverdicted novelty 4.0

    SDPG is a new on-policy visual RL algorithm that estimates gradients via stochastic perturbations of rollouts, achieving faster training and lower memory use than baselines on visual MuJoCo tasks while adding new robo...

  14. The Lov\'{a}sz Local Lemma: Foundations and Applications

    math.CO 2026-03 unverdicted novelty 1.0

    An expository review presenting a pedagogically reformulated proof of the Lovász Local Lemma using unconditional inequalities, plus revisited applications and algorithmic perspectives.