arXiv Machine Learning By Jingzhi Hu, Ouya Wang, Geoffrey Ye Li

Token Encoding for Semantic Recovery

Read the original on arXiv Machine Learning →

The paper introduces TokCode, a token encoding framework that enhances robustness in generative semantic communication by restructuring redundancy in the semantic domain. TokCode leverages a lightweight adapter to transform a large language model into a token encoder, avoiding the need for a dedicated deep model. A channel-quality-aware distillation method (CADET) trains the adapter across diverse erasure rates, producing a reconfigurable low‑rank adapter that enables efficient reinforcement learning and achieves significant improvements in image similarity over existing receiver‑side recovery benchmarks.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

arXiv Computer Vision
2d ago

MoETok: Sparse Expert Routing for 1D Visual Tokenizers

MoETok introduces a sparse expert routing mechanism for 1D visual tokenizers, enabling distinct Content and Detail queries to specialize in high‑level semantics and fine‑grained visual details, respectively. By jointly optimizing reconstruction and semantic objectives, the router learns role‑specialized processing paths that improve reconstruction, semantic representation, and autoregressive generation across various model scales and token budgets. On ImageNet, MoETok achieves state‑of‑the‑art class‑conditional generation within the 1D tokenizer family and, when scaled to a unified autoregressive model, matches or surpasses diffusion‑based models on benchmarks such as DPG‑Bench, GenEval2, and WISE.

By Jiahao Guo, Bao Tang, Haoxiang Cao, Jingfeng Yao, Bo Li, Wenyu Liu, Kun Gai, Changqian Yu, Xinggang Wang
arXiv Machine Learning
Aug 27

Token-Oriented Semantic Communication with Pretrained Vision Transformers

The paper introduces a token‑oriented semantic communication framework that transmits only task‑relevant image latents instead of full token embeddings, reducing communication cost and improving interoperability. It leverages a spatial alignment between vision transformer patch tokens and learned image compression latents, enabling token‑level relevance estimation and selective transmission. Experiments on ImageNet demonstrate a superior rate–accuracy trade‑off compared to existing semantic communication methods and hand‑crafted codecs.

By Jiwoong Im, Minwoo Kim, Jaeho Lee, Yo-Seb Jeon, Yongjune Kim
arXiv Computer Vision
Oct 28

Improving Flexible Image Tokenizers for Autoregressive Image Generation

The paper introduces ReToK, a flexible image tokenizer that uses redundant token padding and hierarchical semantic regularization to better utilize all tokens in autoregressive image generation. By activating tail tokens more frequently and aligning early token features with a pre‑trained vision model while gradually reducing regularization, ReToK mitigates the information concentration problem of traditional nested dropout tokenizers. Experiments on ImageNet 256×256 show that ReToK outperforms both flexible and fixed‑length tokenizers in generation quality.

By Zixuan Fu, Lanqing Guo, Chong Wang, Binbin Song, Ding Liu, Bihan Wen
arXiv Computer Vision
Oct 19

CatchUp: Depth-Aware Re-Admission of Visual Tokens for Efficient Large Vision-Language Models

CatchUp is a training‑free framework that improves efficiency in large vision‑language models by depth‑aware re‑admission of visual tokens. It repeatedly evaluates query‑conditioned relevance, processes only selected tokens per decoder interval, and preserves deferred tokens for later re‑admission, using reference‑to‑current transition signals to approximate missed representation evolution. Experiments on three referring‑expression grounding datasets and six multimodal benchmarks show that CatchUp retains over 92% of full‑model performance with 88.9% fewer active tokens and reduces end‑to‑end latency by 8.0% at a 64‑token budget.

By Eunju Park, Uiwon Hwang