- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The authors propose a dimension-reduction approach called OySTER, which consists of four steps: First, an SVD decomposition is used to obtain an orthogonal basis; next, the embedding is projected onto each orthogonal basis and converted to spherical coordinates; then, the first K angles are retained as the compressed spherical coordinate embedding; finally, when calculating similarity, the vector is reconstructed from the spherical coordinate embedding. The authors claim that their method outperforms PCA and UMAP.
Critical strengths
- The research question has practical significance, and the method requires no pre-training.
- The study considers multiple embedding tasks, as well as models with different architectures and different compression ratios.
Critical weaknesses
- After reading the paper, I had a question: following the authors’ method of retaining the first k angles and reconstructing the first k coordinates seems to yield the same results as directly retaining the first k coordinates of the orthogonal projection. I confirmed this with an AI, which corroborated my understanding. I also had the AI implement Python code to perform numerical simulations, which validated my hypothesis. If the paper’s description is accurate, then I believe the method proposed by the authors is essentially not a new method.
- Based on the previous point, I do not understand why there is a discrepancy between the authors’ method and PCA. However, the authors do not appear to report which data set was used for the SVD decomposition, nor do they provide implementation code. Therefore, I am actually unclear as to why the authors’ method is effective, and it is also because the description of the proposed method in the main text is incorrect.
- The experiments lack a sufficient number of baselines, which should at least include (1) the product quantization methods listed by the authors themselves, and (2) a basic baseline obtained by directly extracting the first K dimensions of the original embeddings (since Qwen3 Embedding has already been trained using matryoshka representation learning, the embeddings formed by the first K-dimensional vectors should also be of high quality).
- The organizational structure of the paper’s Introduction is problematic; the “Related Work” section takes up a significant amount of space while lacking a description of the authors’ own method.
- The paper contains several instances of imprecise wording, such as claiming that GPT-6 Astra has 16,384 dimensions without providing evidence, and asserting that their method can generate “Matryoshka” embeddings—which should actually be the name of a supervised training method.
Questions for authors
- Can you provide the exact algorithmic implementation of OySTER and explain how it differs from retaining the first k coordinates after a direct orthogonal projection?
- Why is there only one result for Qwen3 Embedding 0.6B? Since it already used matryoshka representation learning during training, it could have reported low-quality results.