Learning from Reward-Free Offline Data: A Case for Planning with Latent Dynamics Models

Documenti analoghi

• $\mathbb{X}$-Sample Contrastive Loss: Improving Contrastive Learning with Sample Similarity Graphs
  di: Sobal, Vlad, et al.
  Pubblicazione: (2024)
• Light-weight probing of unsupervised representations for Reinforcement Learning
  di: Zhang, Wancong, et al.
  Pubblicazione: (2022)
• Learning by Reconstruction Produces Uninformative Features For Perception
  di: Balestriero, Randall, et al.
  Pubblicazione: (2024)
• LeJEPA: Provable and Scalable Self-Supervised Learning Without the Heuristics
  di: Balestriero, Randall, et al.
  Pubblicazione: (2025)
• Temporal Straightening for Latent Planning
  di: Wang, Ying, et al.
  Pubblicazione: (2026)