Summary
This paper presents an analysis focusing on the disentanglement of the characteristics of internal representations obtained by contrastive learning. The aim is to recover the internal representation of the true latent space up to some transformation by placing certain assumptions on the data generation process. Particularly, it generalizes Zimmerman's theoretical analysis so that it can be applied to some loss function variants and relaxes the data distribution assumptions. The paper successfully derives the results of identifiability without the common assumption of independence in the research of disentangled representation.
Strengths
While I could not fully follow the entire proof, the theoretical claim appears technically sound and solid. Including the analysis of the identifiability of Nonlinear ICA, the theoretical contributions obtained in this study are meaningful for the community focusing on acquiring disentangled representation with theoretical guarantees. Significantly, they have removed the independence assumption typically used in the analysis of disentangled representation. As it is difficult to sample all disentanglement factors in real-world datasets uniformly, this is an important direction for constructing practical theories. However, there are already several preceding studies on the approach of removing the independence assumption, so the positioning of this paper should be properly discussed, which I will mention in the Weakness section.
Weaknesses
**There are certain concerns about the gap between theoretical claims and realistic experimental settings.** The fundamental theoretical claims in this paper are based on the conditional distribution in the true latent variable space defined in Equation 1. As far as I understand the claims in the paper, the identifiability can be guaranteed by training with the contrastive learning objective by assuming that the positive pair samples can be obtained in the form following this latent conditional distribution. However, it is questionable how much validity can be claimed to assume that positive pair samples can be obtained in such a distribution form when considering practical situations. If the true joint distribution of positive pairs is considered known, supervised learning should be done by simply generating labels from the distribution, so the significance should be in the setting where samples can be implicitly obtained while the explicit form of distribution is unknown. This concern relates to the practical applicability of the theoretical claims concluded in the paper and is important in positioning the contributions and significance of this paper. For example, SimCLR, widely known for its practical effectiveness, uses two different views augmented from data as a positive pair, but can this be justified from the perspective of Equation 1? How meaningful is it to consider the corresponding latent variable space?
**It is necessary to show the contributions of existing related studies appropriately.** While the paper claims to have successfully derived the results of identifiability without the typical independence assumption in the research of disentangled representation, there are already preceding studies that theoretically guarantee disentanglement without imposing independence assumption using weak supervision [1, 2]. In particular, while [1] adopts a GAN-based approach for training the model, it strongly relates to the problem setting of this study, as it uses pairs that share a part of the disentangled factors as supervision signals. What advantages can be recognized in the preceding studies compared to these approaches?
**A fair comparison is needed between contrastive objectives.** In the paper, a slightly different objective function is adopted from the original spectral contrastive learning (SCL) objective in order to fit into the theoretical framework of the proposed method (Equation 5). Some numerical experiments have pointed out the numerical instability of SCL, but could this be due to the influence of modifying the original objective function? It should be verified whether the same problem occurs in the objective function presented in the original paper. If the numerical instability pointed out in this paper is due to the modification introduced, it should be explicitly mentioned, as it could potentially mislead readers about the effectiveness of SCL.
**References**
1. Shu, R., Chen, Y., Kumar, A., Ermon, S., & Poole, B. (2019, September). Weakly Supervised Disentanglement with Guarantees. In *International Conference on Learning Representations*.
2. Locatello, F., Poole, B., Rätsch, G., Schölkopf, B., Bachem, O., & Tschannen, M. (2020, November). Weakly-supervised disentanglement without compromises. In *International Conference on Machine Learning* (pp. 6348-6359). PMLR.
Questions
- **In the numerical experiments using synthetic datasets, why were the values of $\beta$ not set to be compositional for each scenario?** For example, $\beta=1/2$ tested in the Box (simple) scenario does not seem to be tested in other scenarios like Hollow ball and Cube grid. Specifically, for the Cube grid scenario, only this condition seems to skip the intermediate value of $\beta=3$. Is there a clear reason for this? The validity of the parameter range used in the experiments should be clearly indicated.
- **Sampling of positive pairs seems to be a crucial assumption in theory, but I could not glean from the text what assumptions were made.** In the Weakness section above, I have raise some concerns based on my understanding that positive pairs are sampled from a probability distribution derived from the conditional distribution of the true latent variables defined in Equation 1. Is this understanding correct? If this interpretation is wrong, it would be helpful to explicitly mention in the text about the assumption of the probability distribution of the positive pair samples.
Rating
6: Weak Accept: Technically solid, moderate-to-high impact paper, with no major concerns with respect to evaluation, resources, reproducibility, ethical considerations.
Confidence
4: You are confident in your assessment, but not absolutely certain. It is unlikely, but not impossible, that you did not understand some parts of the submission or that you are unfamiliar with some pieces of related work.
Limitations
This paper analyzes the acquisition of disentangled representation using contrastive learning from the viewpoint of identifiability, successfully relaxing some of the assumptions required in previous research. This is a theoretically solid result, and the results have been verified in numerical experiments using several benchmark datasets. However, as mentioned at the beginning of the Weakness section, there are significant concerns about applying the claims of this paper to practical situations. By appropriately discussing the practical validity of the assumed premises, I believe the significance of this paper will become more firmly established.