- Rating
- 1
- Confidence
- 2
- Informativeness
- 1
- Presentation
- 2
- Soundness
- 1
Read review
Paper summary
The paper studies identifiability i.e to which degree a model's outputs determine its parameters up to obvious symmetries. It treats two models:
- Deep polynomial networks with monomial activations x ↦ xʳ and no biases.
- Linear causal disentanglement, with , where F need not be injective. The d-th cumulant of is , with the columns of .
The classical tool for such decompositions is the Alexander–Hirschowitz theorem: general double points impose independent conditions on degree-d forms, , outside a short list of exceptions. The paper calls this a vanishing theorem and makes three groups of claims.
- Section 3: a layer-wise "vanishing singularity theorem" that gives global identifiability of deep polynomial networks (Theorem 3.1, Proposition 3.2, Theorem 3.3).
- Section 4.1: a transfer to causal models through "module extensions" by cumulants, and identifiability from many interventions (Definition 4.1, Corollary 4.2, Proposition 4.3, Theorem 4.4, Proposition 4.5).
- Section 4.2 and Appendix E: a linear criterion for identifying the baseline pair (F, Λ) under multi-target interventions (Theorem E.2, Corollaries 4.6, 4.8, E.3).
The abstract presents these as the first formal proof of identifiability under strictly non-injective transformations, and as resolving a long-standing conjecture. The paper is purely theoretical and contains no experiments or applications.
The paper does not deliver on these promises. In my opinion, its singular novel contribution is Theorem E.2 and Corollary E.3 (see strenghs below). These are elementary linear algebra calculation on top of established techniques. It does not support the strong claims about identifiability that the paper makes. All other other claims in this paper are standard background that can be tracked back to published papers or have inconsistent and incomplete proofs (see weaknesses below).
Critical strengths
Theorem E.2 and Corollary E.3 extend the linear-system analysis of Carreno et al. (Section 3.3) from single-node to multi-target interventions, for soft and hard interventions respectively. The new step is eliminating the unknown post-intervention weights by a projection, which turns identifiability of the baseline parameters into one rank condition per latent node. The result assumes the mixing matrices are already aligned across contexts and that the graph and intervention targets are known. The proofs are elementary and I believe correct.
Critical weaknesses
All other claims in this purely theoretical paper are either standard results (e.g. Alexander–Hirschowitz, Lemmas D.1–D.2) or lack a valid proof. Several are not well-formed. For example, Appendix D.1 is titled "Proof of Theorem 3.3". It contains Lemma D.1, Lemma D.2 and Corollary D.3, and then stops. Theorem 3.3 does not follow from Corollary D.3. Passing from that diagram of sheaves to the diagram of and groups in Theorem 3.3 would need the vertical maps to be morphisms of sheaves of modules, which they are not because raising a section to a power is not additive. Even granting it, a commutative diagram of evaluation maps says nothing about the fibres of the map from weights to outputs. That step needs a dedicated argument. I believe Usevich et al. (Theorem 11) proves its finite version only under an extra hypothesis, and the uniqueness version is false in general.
There are many instances of this kind (e.g. Proposition 4.3, Theorem 4.4, Proposition 4.5), and I do not think they can be fixed by revision, because the irreducible mathematical content is not present. The, as far as I can tell, only novel and correct result, Theorem E.2, is linear algebra and does not use the sheaf-theoretic framework of Sections 3 and 4.1. Studying polynomial networks as toy models is interesting, but their benefit is theoretical tractability, which has to be exploited through rigorous and careful mathematics. The paper does not provide that.
The "long-standing conjecture" the abstract claims to resolve could not be identified by me. The conjecture quoted in Appendix A (Usevich et al., Conjecture 40) dates from October 2025 and concerns uniqueness, which the paper's finite notion of identifiability does not address.
Questions for authors
I want to apologize for this harsh review. I don't intent to be mean but believe that rigorous and objective evaluation is necessary in particular for theoretical contributions.
If you substantially disagree with my assessments, I encourage you to challenge them during the rebuttal phase. To facilitate a focussed discussion for example point out if and how my assessment of the claimed proof of Theorem 3.3 is wrong.