- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The paper is trying to study the geometry of classification task in a very general way.
Critical strengths
- Working on latent geometry is important and useful.
Critical weaknesses
-
The paper is short (only 8 pages of the main submission). I assume the authors mistakenly thought that this is the limit, nevertheless, the extra page could be helpful in several places like elaborate on the motivation more in the intro, more accurate definitions on the mathematical side, extra care when variables are introduced. The most low covered region is the Related Work section where I think that much more has been studied in the core of latent geometry, even when aiming to be task-oriented. The most prominent missing citation for me is this [1], but the authors should read and place their work more precisely within the already done research.
-
Writing level which is not up to top-tier conference level. The abstract is too general, talking generally on learned systems where the literature is focusing on specific regimes, making it vague regarding which type of machine learning methods the method is dealing. It dives fast to the details without explaining the motivation and rationale, sentences are seem to me like they out of context "Sufficiency implies isometry to this geometry; local deviations from a sufficient predictor determine excess loss". Some are generally vague for example: "Because a model is compositional, generalization at its output depends on its internal processes." - which model? Every model? or this: "we take a normative approach to this problem" - what a normative approach is? another example: ".Write PX for the marginal of X" - what does it mean? do you mean that you term P_x as the marginal of X?
-
The math formulations lack explanation for each variable. Walk over each definition and make sure you first introduce it before using it, moreover it would be appreciated if you would add a dimension for main variables.
-
The paper claims that it is solving a very general tasks, but at the end, as far as I understand it - is limited specifically to a certain loss (logarithmic), under specific constraints.
refs:
[1] INTO THE RABBIT HULL: FROM TASK-RELEVANT CONCEPTS IN DINO TO MINKOWSKI GEOMETRY. Fel et al.
Questions for authors
-
Classification is recovered by taking n=1. Do you mean by argmax?
-
"First we place a predictor exactly on the task, and just off it. Then we ask where the loss of a trained model comes from." - I dont understand nothing from this sentences, what do you mean by "just off it"? what is the second sentence even mean? what is the loss that the trained model comes from? I dont get it at all.
I feel like the paper is not aim for people but to AI agents. I didnt manage to follow majorities of the authors intentions - where I think the paper is lack of any intuition behind things, the textual non-mathematical parts are at the most not readable, the math derivations are not coherent and full, where it has holes that I dont know to fill. I think that the paper need a major revision. Sorry about that.