LpWM改用稀疏世界模型
Computer Science > Machine Learning arXiv:2608.
22764 (cs) [Submitted on 24 Aug 2026] Title:LpWM: A Case for Sparse Representations in World Models Authors:Yilun Kuang, Yash Dagade, Quentin Le Lidec, Lucas Maes, Randall Balestriero, Yann LeCun View a PDF of the paper titled LpWM: A Case for Sparse Representations in World Models, by Yilun Kuang and 5 other authors View PDF HTML (experimental) Abstract:Joint-embedding predictive architectures (JEPAs) learn latent dynamics for planning and avoid representation collapse by matching features to maximum-entropy distributions such as isotropic Gaussians, yielding dense representations.
However, it is unclear whether dense representations are the most favorable geometry for modeling dynamics.
In this work, we ask whether a different geometry, sparse representations, can make action-conditioned latent dynamics easier to model, and what dynamical structure emerges from such representations.
We first show that nonlinear Lipschitz dynamics can be approximated arbitrarily well by action-conditioned linear dynamics in a sufficiently high-dimensional one-hot latent space, with rollout error vanishing as the dimension grows.
This motivates distributed sparse representations as a practical relaxation of one-hot sparsity.
We introduce LpWorldModel (LpWM), a JEPA model regularized with Rectified Distribution Matching Regularization (RDMReg) to match encoder features to a Rectified Generalized Gaussian distribution, yielding non-negative sparse codes.
Empirically, sparsity lowers the predictor complexity required for successful planning: on PushT, sparse LpWM outperforms dense LeWM by up to 57% in planning success at intermediate predictor capacities.
This advantage also extends beyond Gaussian distribution matching, with LpWM outperforming dense VICReg representations across multiple predictor families.
We further find that the learned sparse representations are mode-factored, with support encoding discrete dynamical regimes and feature magnitudes capturing continuous within-regime state.
Together, these results suggest that sparse representations can reduce the predictor complexity required for control while revealing interpretable structure.Subjects: Machine Learning (cs.LG) Cite as: arXiv:2608.22764 [cs.LG] (or arXiv:2608.22764v1 [cs.LG] for this version) https://doi.org/10.
48550/arXiv.2608.
22764 Focus to learn more arXiv-issued DOI via DataCite (pending registration) Submission history From: Yilun Kuang [view email] [v1] Mon, 24 Aug 2026 03:37:39 UTC (865 KB) Full-text links: Access Paper: View a PDF of the paper titled LpWM: A Case for Sparse Representations in World Models, by Yilun Kuang and 5 other authorsView PDFHTML (experimental)TeX Source view license Current browse context: cs.
LG < prev | next > new | recent | 2026-08 Change to browse by: cs References & Citations NASA ADSGoogle Scholar Semantic Scholar export BibTeX citation Loading...BibTeX formatted citation × loading...
Data provided by: Bookmark Bibliographic Tools Bibliographic and Citation Tools Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.
ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, Media Code, Data and Media Associated with this Article alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?
) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) Demos Demos Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.
AI (What is TXYZ.AI?) Related Papers Recommenders and Search Tools Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) IArxiv recommender toggle IArxiv Recommender (What is IArxiv?
) Author Venue Institution Topic About arXivLabs arXivLabs: experimental projects with community collaborators arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy.arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community?Learn more about arXivLabs.Which authors of this paper are endorsers?| Disable MathJax (What is MathJax?)
Related
相關文章
Google 開源 Harness²:遞迴代理程式框架,無需新模型也能提升效能
Google Cloud AI Research 開源了 Harness²,這是一個遞迴代理程式框架,透過改良凍結模型周圍的程式碼與檔案來增強效能。對開發者而言,重點很簡單:你的代理程式無需更強大的模型也能進步。重點摘要:規模為框架而非模型,訓練參數為0,包含8個可編輯的框架元件,版本0.1.0。執行環境為Linux、Python 3.12或3.13搭配uv,模型呼叫則透過Vertex AI。GPU需求未公開。效能方面:一次改良步驟即可在3個基準測試中,提升所有4個模型與框架組合的表現。最佳成果:GLM-5搭配OpenCode在WorkBuddy-Bench上從64.2提升至75.7(+11.5點);最差表現:GLM-5搭配Codex在JobBench上僅提升1.2點(23.6至24.8)。什麼是Harness²?它是Google研究推出的即插即用框架。
如何利用NVIDIA結構化資料模型進行零訓練表格預測
In this tutorial, we implement Structured Data Models, NVIDIA’s new library that puts several pretrained foundation models for tables behind one PyTorch interface, and use it to make predictions without training.
認識 Kyutai REKI:2.4B VLA 模型為機器人操控帶來高效記憶
Kyutai 與 Inria 及 École des Ponts 合作,推出了 REKI——一個用於機器人操控的 2.4B 參數視覺-語言-動作模型(VLA)。該模型僅使用公開數據進行預訓練,並配備了輕量級的近期記憶功能。在三個分佈外基準測試中,僅有規模約為其兩倍的模型能超越它。所有模型權重已於今日在 Hugging Face 上公開。核心資訊:規模:2.4B 參數(2.2B Qwen3.5-2B VLM + 0.2B 流匹配動作專家)。記憶涵蓋最近 3 幀,間隔 1 秒。運行環境:在 1 張 NVIDIA H100 上進行基準測試。從兩個 256×256 攝像頭輸入,編譯後每個動作區塊耗時 21.8 毫秒。權重以 BF16 格式提供,暫無量化版本。性能:在 LIBERO-Plus 和 RoboTwin Clean2Rand 基準測試中,為公開數據預訓練的 VLA 模型中最優;在 LIBERO-Plus 上達到 90.4% 的最高分。
DeepSeek 發布 V4.1-Flash-1017,DeepSWE 得分 77.0,並開放搜尋 API
DeepSeek 剛發布 DeepSeek-V4.1-Flash-1017,這是其 V4.1-Flash 模型的新檢查點,現已在 DeepSeek 網站、應用程式及 API 上線。DeepSeek 宣稱該版本在性能、任務完成速度與輸出簡潔度上均優於 9 月發布的 V4.1-Flash,並稱之為性能與成本的帕累託改進。同時,DeepSeek 也向所有開發者開放了搜尋與擷取 API。對代理建構者而言,這意味著更便宜的編碼模型加上單一 API 金鑰即可使用的第一方網路層。重點摘要:骨架參數 552B,另加 196B 的 Engram 參數;預填充階段每 token 啟用 8B 參數,解碼階段啟用 16B 參數;上下文長度達 1M tokens,最大輸出 384K tokens。運行於 DeepSeek API 的 deepseek-flash 模型。9 月版的 V4.1-Flash 權重(763B 參數,FP8)採 MIT 授權。
2026年20款Jev替代方案:挑戰TypeSafe的決策模型
TypeSafe於2026年9月15日推出Jev,這是一款決策模型而非聊天機器人。使用者可定義允許的答案,Jev將回傳標籤、分數或是否的機率。約4週內,至少20款Jev替代方案相繼問世,來自Cloudflare、OpenAI、Perplexity、Liquid AI、AWS的Strands Labs及獨立開發者。本指南比較各方案在規模、授權、硬體、價格、Jev API相容性及已發布基準測試的表現。重點摘要:規模範圍從287M(GLiNER2.5-multi-Decide)到35B-A3B(Mapika Decider),Jev規模未公開。執行環境:Von和Laya等編碼器可在CPU上運行,4B適配器適用24 GB GPU或32 GB Mac。效能:多數開源模型在困難推理上落後Jev,但在狹窄分類任務上數款與之匹敵或超越。最佳表現:Cloudflare Clef在BANKING7取得94.20分。
長鑫科技市值兩月內跌去1萬億;阿里加碼AI硬件品牌,天貓、速賣通聯動;國行版蘋果AI有望12月上線,百度、阿里參與合作丨雷峰早報
要聞提示1.長鑫科技市值兩月內跌去1萬億2.年內已至少18次故障!DeepSeek發放宕機補償,有人拿到3000元3.阿里加碼AI硬件品牌,天貓、速賣通聯動4.國行版蘋果AI有望12月上線,百度、阿里參與合作5.可靈AI新一代模型Kling 4.