The First Token Is a Clue: Verbalizing Multi-Token Concepts from the J-lens
Read the original on arXiv Computation and Language →The Flow has not summarised this story yet — read it at arXiv Computation and Language.
The Flow has not summarised this story yet — read it at arXiv Computation and Language.
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.
FastJEV addresses redundancy in JEV models by reusing context and intermediate states during candidate evaluation, eliminating repeated token matching and full backbone execution. It introduces shared context anchoring and candidate prefix sharing to preserve necessary states for branching, and applies decision‑guided pruning based on score changes from a small unlabeled set. Experiments on OmniJev models across five benchmarks show that FastJEV can reduce candidate depth by up to ~45% while maintaining over 94% of original task scores.
arXiv:2606. 06320v1 Announce Type: new Abstract: Machine unlearning aims to remove targeted knowledge from a trained model while preserving its general capabilities.
arXiv:2604.16656v2 Announce Type: replace Abstract: All languages are equal; when it comes to tokenization, some are more equal than others. Tokens are the hidden currency that dictates the cost and...
arXiv:2602.22453v4 Announce Type: replace Abstract: Retrieval heads, a subset of attention heads in Transformers, were studied in English, showing its crucial role in retrieving information from the...
Raincheck is a framework that defers multimodal prefill for large language models, allowing initial token selection to be decoupled from later information needs. It preserves unselected tokens and progressively prefills them during decoding, using unused compute capacity and scheduling gaps. Experiments on Qwen3-VL-8B and Qwen3.5-9B show that Raincheck recovers a significant portion of quality lost to hard pruning and reduces first-turn time-to-first-token by up to 24.1% with minimal impact on token generation speed.