- Rating
- 1
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
In this paper, the authors build the theoretical framework for analyzing the impact of different learning conditions to neural networks training through similarity analysis that go beyond the comparison between only two models. To achieve this, the authors introduce Representational Dispersion to measure variability and Triplet-Derived Representation Descriptor (TRD), which characterizes each model’s representation through relative distances over shared observations. Furthermore, the authors propose a Compact version of TRD that can be readily obtained by efficiently optimizing an observation subset under a fixed budget (SGSO).
Critical strengths
- Extending similarity measurements from two sets of paired representations towards more than two is conceptually interesting
- Providing an algorithmic approach enabling the selection of a subset of observations that is representative of the set of all observations across the various models is a practically useful idea
Critical weaknesses
- Despite showcasing interesting methodological ideas, I find the manuscript difficult to read due to phrasing that leads to potentially wrongful interpretations, the use of functions that were not defined before, overwhelming notation and missing intuitive schemes describing the method.
-
The Abstract and Introduction of the paper are somewhat confusing for readers coming from a representation alignment background. It seems as though the paper is proposing new similarity metrics that do not leverage pairwise distances/comparisons, but rather higher order relational structures. For instance:
Yet, most analyses focus on pairwise comparisons, limiting characterization of population variability and individual representations.
Centered Kernel Alignment (CKA) (Kornblith et al., 2019), for example, compares two representations but does not directly quantify variability across a population of independently trained models.
These seem like the authors are proposing a new similarity measure that instead of considering the pairwise distances, as does CKA, it considers another relational structure. This made me very confused while reading the paper for the first time.
-
Algorithm 1 is a bit too informal for scientifical understanding
-
Functions like sim, corr and cos are not defined - making it hard to understand the methological section in 3.3
-
No figure explaining the method makes it more challenging for readers to understand the paper.
-
The pairwise ranking loss in section 3.4 is not defined, making it difficult to analyze the loss
-
I find the experiment section hard to understand, making it difficult for me to accurately review it.
-
- A recent published paper utilizing triplet relationships for representation alignment is conceptually very similar to the computation of TRD [1]
[1] Soares, D., Gawade, P., Dittadi, A. & Szczurek, E.. (2026). Scalable and Interpretable Representation Alignment with Ordinal Similarity. Proceedings of the 43rd International Conference on Machine Learning
Questions for authors
How does your TRD differ from the approach in [1]?
How does your work advance the field of representation learning? Which limitations of existing work does your approach address? Why are these limitations important to solve?