Hugging Face Daily Papers · · 3 min read

AdaCodec: A Predictive Visual Code for Video MLLMs

Mirrored from Hugging Face Daily Papers for archival readability. Support the source by reading on the original site.

Homepage:<a href=\"https://haowenhou.github.io/AdaCodec-Page/\" rel=\"nofollow\">https://haowenhou.github.io/AdaCodec-Page/</a></p>\n","updatedAt":"2026-06-05T06:20:11.247Z","author":{"_id":"64b4eec4faa3181a5eab9c46","avatarUrl":"/avatars/bcc9bf5cbf67546ad2b4c9ec8b96ac96.svg","fullname":"Jiaqi Wang","name":"myownskyW7","type":"user","isPro":true,"isHf":false,"isHfAdmin":false,"isMod":false,"followerCount":26,"isUserFollowing":false}},"numEdits":0,"identifiedLanguage":{"language":"zh","probability":0.30066370964050293},"editors":["myownskyW7"],"editorAvatarUrls":["/avatars/bcc9bf5cbf67546ad2b4c9ec8b96ac96.svg"],"reactions":[],"isReport":false}}],"primaryEmailConfirmed":false,"paper":{"id":"2606.02569","authors":[{"_id":"6a20f92115100c5272a8477c","name":"Haowen Hou","hidden":false},{"_id":"6a20f92115100c5272a8477d","name":"Zhen Huang","hidden":false},{"_id":"6a20f92115100c5272a8477e","name":"Zheming Liang","hidden":false},{"_id":"6a20f92115100c5272a8477f","name":"Qingyi Si","hidden":false},{"_id":"6a20f92115100c5272a84780","name":"Chenglin Li","hidden":false},{"_id":"6a20f92115100c5272a84781","name":"Shuai Dong","hidden":false},{"_id":"6a20f92115100c5272a84782","name":"Kele Shao","hidden":false},{"_id":"6a20f92115100c5272a84783","name":"Ruilin Li","hidden":false},{"_id":"6a20f92115100c5272a84784","name":"Dianyi Wang","hidden":false},{"_id":"6a20f92115100c5272a84785","name":"Nan Duan","hidden":false},{"_id":"6a20f92115100c5272a84786","name":"Jiaqi Wang","hidden":false}],"publishedAt":"2026-06-01T00:00:00.000Z","submittedOnDailyAt":"2026-06-05T00:00:00.000Z","title":"AdaCodec: A Predictive Visual Code for Video MLLMs","submittedOnDailyBy":{"_id":"64b4eec4faa3181a5eab9c46","avatarUrl":"/avatars/bcc9bf5cbf67546ad2b4c9ec8b96ac96.svg","isPro":true,"fullname":"Jiaqi Wang","user":"myownskyW7","type":"user","name":"myownskyW7"},"summary":"Video is temporally redundant: adjacent frames usually share most objects, background, and layout. Yet existing video multimodal large language models (video MLLMs) usually encode each sampled frame as an independent RGB image, causing visual tokens to repeat content already present in earlier frames. This suggests a more direct video interface: send a full reference frame only when the scene cannot be predicted well from prior context, and otherwise transmit a compact description of inter-frame changes. We call this interface a predictive visual code, and instantiate it for video MLLMs as AdaCodec. AdaCodec spends full visual tokens on a reference frame only when its conditional predictive cost is high; otherwise, it encodes inter-frame changes, including motion and prediction residuals, as compact P-tokens. Across all eleven benchmarks, AdaCodec improves over the Qwen3-VL-8B per-frame RGB baseline at a matched visual-token budget. Even at 1/7 the budget, AdaCodec with 32k tokens surpasses the 224k baseline on all long-video benchmarks; on five general-video benchmarks, it raises the average score while substantially cutting time-to-first-token from 9.26s to 1.62s.","upvotes":2,"discussionId":"6a20f92115100c5272a84787","projectPage":"https://haowenhou.github.io/AdaCodec-Page/","ai_summary":"AdaCodec reduces video encoding redundancy by transmitting full visual tokens only when scene prediction fails, otherwise encoding compact inter-frame change descriptions.","ai_keywords":["video multimodal large language models","visual tokens","predictive visual code","P-tokens","conditional predictive cost","inter-frame changes","motion encoding","prediction residuals"],"ai_summary_model":"Qwen/Qwen2.5-Coder-32B-Instruct"},"canReadDatabase":false,"canManagePapers":false,"canSubmit":false,"hasHfLevelAccess":false,"upvoted":false,"upvoters":[{"_id":"64b4eec4faa3181a5eab9c46","avatarUrl":"/avatars/bcc9bf5cbf67546ad2b4c9ec8b96ac96.svg","isPro":true,"fullname":"Jiaqi Wang","user":"myownskyW7","type":"user"},{"_id":"65ab5332043d53781a115475","avatarUrl":"https://cdn-avatars.huggingface.co/v1/production/uploads/65ab5332043d53781a115475/UaxSFDWteYsByzx7G_KKy.jpeg","isPro":false,"fullname":"Zhixiong Zhang (SII)","user":"rookiexiong","type":"user"}],"acceptLanguages":["en"],"dailyPaperRank":0,"markdownContentUrl":"https://huggingface.co/buckets/huggingchat/papers-content/resolve/2606/2606.02569.md"}">
Papers
arxiv:2606.02569

AdaCodec: A Predictive Visual Code for Video MLLMs

Published on Jun 1
· Submitted by
Jiaqi Wang
on Jun 5
Authors:
,
,
,
,
,
,
,
,
,
,

Abstract

AdaCodec reduces video encoding redundancy by transmitting full visual tokens only when scene prediction fails, otherwise encoding compact inter-frame change descriptions.

Video is temporally redundant: adjacent frames usually share most objects, background, and layout. Yet existing video multimodal large language models (video MLLMs) usually encode each sampled frame as an independent RGB image, causing visual tokens to repeat content already present in earlier frames. This suggests a more direct video interface: send a full reference frame only when the scene cannot be predicted well from prior context, and otherwise transmit a compact description of inter-frame changes. We call this interface a predictive visual code, and instantiate it for video MLLMs as AdaCodec. AdaCodec spends full visual tokens on a reference frame only when its conditional predictive cost is high; otherwise, it encodes inter-frame changes, including motion and prediction residuals, as compact P-tokens. Across all eleven benchmarks, AdaCodec improves over the Qwen3-VL-8B per-frame RGB baseline at a matched visual-token budget. Even at 1/7 the budget, AdaCodec with 32k tokens surpasses the 224k baseline on all long-video benchmarks; on five general-video benchmarks, it raises the average score while substantially cutting time-to-first-token from 9.26s to 1.62s.

Community

Upload images, audio, and videos by dragging in the text input, pasting, or clicking here.
Tap or paste here to upload images

· Sign up or log in to comment

Get this paper in your agent:

hf papers read 2606.02569
Don't have the latest CLI?
curl -LsSf https://hf.co/cli/install.sh | bash

Models citing this paper 0

No model linking this paper

Cite arxiv.org/abs/2606.02569 in a model README.md to link it from this page.

Datasets citing this paper 0

No dataset linking this paper

Cite arxiv.org/abs/2606.02569 in a dataset README.md to link it from this page.

Spaces citing this paper 0

No Space linking this paper

Cite arxiv.org/abs/2606.02569 in a Space README.md to link it from this page.

Collections including this paper 0

No Collection including this paper

Add this paper to a collection to link it from this page.

Discussion (0)

Sign in to join the discussion. Free account, 30 seconds — email code or GitHub.

Sign in →

No comments yet. Sign in and be the first to say something.

More from Hugging Face Daily Papers