arXiv:2605.28190v2 Announce Type: replace Abstract: Embedding benchmarks like MTEB report a single score per model, implicitly treating robustness as a static, scalar property. We argue that embeddin...
arXiv:2608.22390v1 Announce Type: new Abstract: Large language models (LLMs) have demonstrated strong potential in graphical user interface (GUI) generation, but reliable evaluation remains challengi...
The paper examines how new vocabulary tokens are added to language models for generative recommendation tasks. It shows that the common practice of initializing these tokens as the mean of existing embeddings collapses them into a degenerate subspace, hindering fine‑tuning. The authors propose Grounded Token Initialization (GTI), which places new tokens at semantically meaningful positions in the pretrained embedding space using linguistic supervision, and demonstrate that GTI outperforms mean initialization and other adaptation methods across several benchmarks.
TRACE is a new framework that reorganizes 168 tasks for text‑vision embedding models into General, Adaptability, and Challenge categories. Experiments on two models show that adding general and adaptation data boosts Adaptability scores by 7.67 and 7.09 points while keeping General performance largely unchanged, yet Challenge performance stays below 5.0 with minimal gains from more data. The study highlights that data adaptation alone cannot overcome weaknesses in multilingual and visual‑document tasks, indicating a need for methodological advances.
The paper uncovers a systematic mismatch in modern text embeddings: while sentiment can be extracted with high accuracy from frozen encoders, the embeddings’ cosine similarity metric barely reflects polarity differences. Across eleven models from 2021–2026, a linear probe achieves up to 91.3% accuracy, yet cosine similarity margins are only 0.003–0.064, leading to poor retrieval performance (e.g., Qwen3-Embedding-4B’s 64.3 MAP). Introducing a lightweight supervised‑contrastive head (Sentiment‑Injected Sentence Embeddings) dramatically improves probe accuracy, retrieval MAP, and polarity margins, but at the cost of downstream semantic similarity. "whyItMatters":"The findings reveal that widely used retrieval and clustering systems may ignore valuable sentiment information encoded in embeddings, impacting their effectiveness."
arXiv:2607.00171v2 Announce Type: replace Abstract: Text embeddings are standard for semantic similarity tasks, yet their evaluation remains an open challenge. Current benchmarks are static, cover on...
The paper introduces the Generative Embedding Benchmark (GEB), which evaluates how much content from an embedding can be recovered by a decoder that only has access to the frozen embedding and a question, without the original image or intermediate features. GEB uses a curated visual‑question‑answering dataset with 1,800 development and 900 test items covering natural images, scene text, and visual documents. Experiments on seven public embedding models show that visual‑only scores range from 28.25 to 33.21, while joint image‑question encoding boosts scores up to 65.56, revealing that generative readout uncovers information bottlenecks not captured by traditional separability‑based benchmarks.
arXiv:2608. 14841v1 Announce Type: new Abstract: Long-document visual question answering (VQA) over documents of tens to hundreds of pages mixing text, tables, charts, and figures typically follows retrieve-then-read pipelines.
arXiv:2607. 04071v1 Announce Type: cross Abstract: Portuguese remains underrepresented in text embedding evaluation, despite being one of the most widely spoken languages in the world.
arXiv:2608. 12611v1 Announce Type: cross Abstract: Existing screenshot-to-code systems face a trade-off between flexibility and controllability.
arXiv:2606. 24716v1 Announce Type: cross Abstract: Sparse autoencoders (SAEs) are increasingly used to extract interpretable concepts from vision and vision language models, yet existing evaluation methods largely rely on proxy metrics or qualitative inspection rather than measuring semantic correspondence.
FastE is a training‑free, plug‑and‑play method that compresses token prefixes in large language model (LLM) embedding inference. It uses a shared fixed threshold on batch‑mean readout‑prefix alignment to decide when to compress and ranks prefix states by readout attention scores to keep the most important ones. Experiments on Qwen3‑Embedding models show that FastE can cut decoder‑backbone FLOPs by over 40% while preserving more than 99% of the original ranking quality across multiple benchmarks and tasks.