Starbucks-v2: Improved Training for 2D Matryoshka Embeddings
Not on the map. Why?
Abstract (arXiv)
2D Matryoshka training enables a single embedding model to generate sub-network representations across different layers and embedding dimensions, offering adaptability to diverse computational and task constraints. However, its effectiveness remains well below that of individually trained models of equivalent sizes. To address this, we propose Starbucks, a new training strategy for Matryoshka-style embedding models that combines structured fine-tuning with masked autoencoder (MAE) pre-training. During fine-tuning, we compute the loss over a fixed set of layer-dimension pairs, from small to large, which significantly improves performance over randomly sampled sub-networks and matches that of separately trained models. Our MAE-based pre-training further enhances the representation quality of sub-networks, providing a stronger backbone for downstream tasks. Experiments on both in-domain (semantic similarity and passage retrieval) and out-of-domain (BEIR) benchmarks show that Starbucks consistently outperforms 2D Matryoshka models and matches or exceeds the performance of individually trained models, while maintaining high efficiency and adaptability. Ablation studies confirm our loss design choices, the impact of SMAE pre-training and demonstrate the applicability of Starbucks across backbones. We further show that depth- and width-wise Starbucks variants capture complementary information, and that their hybridization yields additional performance gains with minimal latency overhead due to parallelization. Code available at https://github.com/ielab/Starbucks
Key facts. Cited by 7 papers in the map (data through 14 Oct 2026). First posted on arXiv 17 Oct 2024.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 1; 2026: 6.
7 papers.
- 2026Unlocking Multimodal Document Intelligence: From Current Triumphs to Future Frontiers of Visual Document Retrievalcited by 8
- 2026CausalEmbed: Auto-Regressive Multi-Vector Generation in Latent Space for Visual Document Embeddingcited by 7
- 2026CSRv2: Unlocking Ultra-Sparse Embeddingscited by 6
- 2026Learning Retrieval Models with Sparse Autoencoderscited by 6
- 2025Making Large Language Models Efficient Dense Retrieverscited by 3
- 2026Embedding World Knowledge into Tabular Models: Towards Best Practices for Embedding Pipeline Designcited by 2
- 2026MM-Matryoshka: Towards Budget-Elastic Visual Document Retrieval via a 2D Multimodal Matryoshka Training Frameworkcited by 2
- 2026MM-Matryoshka: Towards Budget-Elastic Visual Document Retrieval via a 2D Multimodal Matryoshka Training Framework3 Jun 2026
- 2026Embedding World Knowledge into Tabular Models: Towards Best Practices for Embedding Pipeline Design18 Mar 2026
- 2026Learning Retrieval Models with Sparse Autoencoders27 Feb 2026
- 2026Unlocking Multimodal Document Intelligence: From Current Triumphs to Future Frontiers of Visual Document Retrieval23 Feb 2026
- 2026CSRv2: Unlocking Ultra-Sparse Embeddings5 Feb 2026
- 2026CausalEmbed: Auto-Regressive Multi-Vector Generation in Latent Space for Visual Document Embedding29 Jan 2026
- 2025Making Large Language Models Efficient Dense Retrievers23 Dec 2025