SpecMRL: Redesign Matryoshka Representation Learning within Parametric Spectrum

Zhongxin Chen, Songhao Wu, Heng Cui, Cong Li, Xiao Zhou, Rui Yan

Renmin University of China · Lenovo Group · Wuhan University

Published October 19, 2026 · on the feed October 20, 2026 · ▲ 87 · arXiv 2610.26824

Efficiency & inference Code arXiv ↗Hugging Face ↗

The abstract

Matryoshka Representation Learning (MRL) is designed to support flexible representation sizes by jointly optimizing nested prefixes. While effective, this design lacks an explicit constraint to ensure that the leading portion provides a suitable compact encoding. To address this, we propose SpecMRL, which reorganizes the feature space to enable more effective prefix readout. Specifically, we extend MRL with a parameter-derived spectral basis organized with feature importance. SpecMRL otherwise follows standard MRL, with prefix readout performed in the learned spectral space. Experiments on MTEB show that SpecMRL outperforms MRL at all evaluated reduced dimensions, with larger gains under more aggressive compression. These results suggest that the learned spectral basis better prioritizes informative directions, enabling more effective representation compression. Notably, SpecMRL extends the performance frontier of MRL, surpassing full-dimensional MRL with only half the embedding dimensions.

The Brief

1:55

A short podcast summary of the paper. Written and voiced by AI.

Transcript

SpecMRL. Redesign Matryoshka Representation Learning within Parametric Spectrum. By Zhongxin Chen and five others, from Renmin University of China, Lenovo Group, and one other institution. Published on the nineteenth of October. Its code repository is public and real: about twenty-five source files.

Matryoshka Representation Learning, or MRL, is designed so that one embedding can be used at many sizes. It jointly optimizes nested prefixes: the first few dimensions should work as a small embedding, a longer prefix as a larger one, and so on, like dolls inside dolls. The design is effective, but it lacks an explicit constraint ensuring that the leading portion really is a suitable compact encoding. Training asks each prefix to work, without arranging the space so that the front is where the most useful information sits.

SpecMRL reorganizes the feature space so that reading out a prefix becomes more effective. It extends MRL with a spectral basis that is derived from the model's parameters and organized by feature importance.

Beyond that, SpecMRL follows standard MRL. The change is where the prefix is read: readout happens in the learned spectral space rather than in the original one. Because that basis is ordered by importance, cutting it short keeps the directions it ranks first.

On MTEB, SpecMRL outperforms MRL at every reduced dimension evaluated, and its gains grow larger as compression becomes more aggressive. It also extends the performance frontier of MRL. Using only half the embedding dimensions, SpecMRL surpasses MRL at its full dimensionality.

The authors read these results as a sign that the learned spectral basis better prioritizes informative directions, which makes representations more compressible. The pattern of gains fits that reading. If the ordering is what helps, it should matter most when only the first few dimensions survive, and that is exactly where the margin is widest.

More with an account

Listen to every day’s papers

Daily playlists, deep dives, quests for the papers, and quizzes on their key terms.

Join free
KipQuest: the day’s AI research, as podcasts and quests. All papers Android app Privacy Contact Episodes are written and voiced by AI from each paper. Summaries can contain mistakes: the paper is the source.