- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The authors propose a new principle of identification in SSL algorithms they term Variance Fingerprints. They observe that if variances of augmentations are changed independently and the ratio of the change is unique then the relevant factor can be identified. This extends existing SSL identification proofs, which typically show recovery up to affine transformations, to recovery up to (block) permutation and scaling. They then introduce a learning algorithm to estimate the proposed model and apply it to synthetic datasets.
Critical strengths
The formal exposition of the paper appears to be coherent.
Critical weaknesses
The theoretical novelty appears limited. The central identification mechanism is the classical observation that independent Gaussian sources become identifiable when their conditional variance profiles vary non-proportionally across an auxiliary variable. This principle is well established in nonstationary ICA and auxiliary-variable nonlinear ICA (e.g., Pham & Cardoso). The proposed variance fingerprints instantiate this mechanism by making the auxiliary variation experimentally controlled. It remains unclear what fundamentally new insight the theoretical result contributes beyond this specialization of existing identification principles.
This particular novelty is also the central weakness of the paper, since it highly limits the usefulness of the setup. The authors propose to employ designed augmentation variances to steer the model to learn specific factors. However, training the model requires access and detailed control over these factors. What then is gained by subsequently recovering these factors through representation learning? Consequently, the experiments that are presented are not convincing in the sense that they use highly simplified setups with strongly controlled dataset augmentations.
Another problem is the writing, which in many places is hard to understand. Many statements are vague and employ unnecessary jargon that make reading the paper challenging. Additionally, many statements are not sufficiently explained, and variables are left unintroduced - already in the introduction, equation 1, what is alpha? This is never defined, leaving the reader to figure out alone what the authors mean to say. For publication a major rewrite of the paper would be required.
Questions for authors
How could this method conceivably be applied to any real-world use case?
Can you present evidence that the algorithm learns useful factors on non-synthetic datasets where the ground truth factors cannot be controlled?
3 comments
I thank the authors for their reply which addressed some of my concerns. Unfortunately, I don't find the results interesting enough to recommend publication at ICLR and will maintain my rating.
Thank you for your reply. You wrote that our response addressed some of your concerns. Could you tell us which concerns remain open? We would be grateful for the chance to address them.
Author response
Thank you for the review. The paper was very hard to read. We spent considerable effort on restructuring and revising the text. Though it remains challenging in some places, we believe the current version does a much better job of communicating our ideas and findings.
We also agree that the identification mechanism is classical. Our contribution is a way to create the auxiliary variation it needs in SSL, where the data usually supply none, and the paper now presents this more clearly as a proof of concept with known factors.
Responses follow in the order of your comments. Page numbers refer to the revised PDF.
Thank you again. Your comments on clarity changed the paper throughout.