Skip to content
AI News HubLIVE
Original source2 min read

Visual Text Compression as Measure Transport

Summary

Researchers propose a measure transport framework for visual text compression (VTC) to predict information loss. They decompose the cost into precision and coverage terms, enabling a label-free routing criterion and adaptive foveation. On 24 NLP datasets with Qwen3-4B, their method matches the per-dataset oracle on 70.8% of datasets, improving task scores by 3.3% while reducing token usage by 10.3%.

SourcearXiv Computer VisionAuthor: Lv Tang, Tianyi Zheng, Yang Liu, Bo Li, Xingyu Li
Visual Text Compression as Measure Transport
Report an error

The correction channel is not available yet. You can copy the article reference below for later.

Correction instructions
Read article

[2605.06708] Visual Text Compression as Measure Transport

[Submitted on 6 May 2026]

Title:Visual Text Compression as Measure Transport

View a PDF of the paper titled Visual Text Compression as Measure Transport, by Lv Tang and 4 other authors

View PDF HTML (experimental)

Abstract:Visual text compression (VTC) promises efficient long-context processing by rendering text into an image and re-encoding it with a vision-language model, often producing $3$--$20\times$ fewer decoder tokens than subword tokenization. Yet token savings do not translate predictably into downstream utility: on some tasks the visual path matches or exceeds the text path, on others it collapses, and the compression ratio itself does not predict which regime will occur. The missing quantity is therefore not another summary of efficiency, but a principled measure of task-relevant information loss induced by visual encoding. We address this problem by formulating VTC in the language of measure transport. Treating text and visual tokens as empirical probability measures, we show that the ViT patch encoder induces a push-forward map whose transport cost decomposes into a precision cost from within-patch aggregation and a coverage cost from cross-patch fragmentation. Both terms are estimable from downstream-label-free probes. This formulation yields two operational consequences: a downstream-label-free routing criterion that selects whether to use the visual path for a given input or benchmark instance, and a transport-informed foveation mechanism that re-encodes high-cost regions at higher resolution. Across $24$ NLP datasets at Qwen3-4B, our label-free rule matches the per-dataset oracle on $17/24$ datasets ($70.8\%$), and improves the average task score by $+3.3\%$ with $-10.3\%$ average tokens relative to a pure-LLM.

Subjects:

Computer Vision and Pattern Recognition (cs.CV); Artificial Intelligence (cs.AI)

Cite as: arXiv:2605.06708 [cs.CV]

(or arXiv:2605.06708v1 [cs.CV] for this version)

https://doi.org/10.48550/arXiv.2605.06708

arXiv-issued DOI via DataCite

Submission history

From: Lv Tang [view email] [v1] Wed, 6 May 2026 19:02:27 UTC (1,717 KB)

Full-text links:

Access Paper:

View a PDF of the paper titled Visual Text Compression as Measure Transport, by Lv Tang and 4 other authors

View PDF

HTML (experimental)

TeX Source

view license

Current browse context:

cs.CV

new | recent | 2026-05

Change to browse by:

cs cs.AI

References & Citations

NASA ADS

Google Scholar

Semantic Scholar

Loading...

Data provided by:

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?)

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?)

Key points and analysis

Article intelligence

EngineersAdvanced

Key points

  • Visual text compression (VTC) can reduce tokens by 3-20x but downstream utility is unpredictable.
  • The paper formulates VTC as measure transport, decomposing information loss into precision and coverage costs.
  • A label-free routing criterion and adaptive foveation mechanism are derived from the transport cost.
  • Experiments on Qwen3-4B across 24 NLP datasets show 70.8% oracle match, +3.3% score, -10.3% tokens.

Highlights and analysis are generated automatically and may contain errors. Check the original source.