- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The paper studies the surjectivity of several neural networks architectures. They prove that ReLU/GeLU MLPs as well as attention networks are not almost always surjective. On the other hand, when they are precomposed with pre-layer norm, then they are almost always surjective meaning that they are for almost all parameter choices surjective. These results are based on a general theorem developped in the paper that shows that composing a continuous function with pre-layer norm and adding skip connections makes the function surjective. As a corollary, they obtain that transformers are almost always surjective. They also provide experiments showing that GPT-2 has preimages for 20 sentences from 2025 New York Times articles in the embedding space. Finally, the authors discuss implications of surjectivity in vision models and robotics.
Critical strengths
I enjoyed reading the paper, it investigates a fundamental mathematical property of practically relevant neural networks and contains strong and clean results. Moreover, the general result that composing continuous with pre-layer norm and adding skip connections results in a surjective map might be of independent interest. In particular, that transformers are surjective, which is based on this, is an interesting result with an overall simple proof, which, from my perspective, can also be seen as a strength.
Critical weaknesses
My main concern it that the implicaion for AI safety are somewhat stronger than what is established. In particular, the results for transformers show surjectivity in the embedding space, not surjectivity of the generating process. Although the authors acknowledge these limitations, I think the practical implications could be discussed more carefully.
Moreover, in the introduction, the notion of almost always surjective is motivated that trained networks should satisfy the genericity assumption, which would need a justification since, in certain cases, training also tends towards more "singular" solution. However, this weakness can mainly be circumvented by answering my first question below.
The related work could be expanded to include previous theoretical studies on surjectivity in ReLU networks who investigated the computational complexity of deciding if a ReLU network is surjective:
Questions for authors
- Corollary 4.1 says that transformers are almost always surjective. But by your arguments it should follow that they are always surjective without a genericity assumption, which of course would be stronger. Or am I missing something?
- I have a question regarding the proof of Theorem 3.4. The application of Lemma 4 seems to need some additional justification since the matrices have constrained ranks and are thereby not covered by the generic rank argument?
2 comments
Thank you for the response and the clarifications. I have no further questions and will keep my score.
We thank the reviewer for the positive assessment and the stronger Transformer observation.
Embedding-space surjectivity does not establish surjectivity of text generation. Section 4.1 explicitly assumes continuous embedding control and excludes direct conclusions about discrete autoregressive prompting. Theorem C.3 proves non-surjectivity of its two-step continuous autoregressive map; Appendix D.2 discusses search difficulty.
We have specified residual-stream and diffusion-state output spaces in the abstract and applications, stated the final-normalization limitation after Corollary 4.1, and restricted Appendix D.2's safety conclusion to excluding outputs over the entire continuous input domain. These results establish neither valid discrete prompts nor efficient search.
A trained parameter distribution with a density avoids Lebesgue-null exceptional sets with probability one; randomness alone gives no such guarantee for singular or quantized distributions.
We state this condition in Section 1's almost-always paragraph and Section 3's opening. The Pre-LayerNorm and Transformer residual-stream results hold for every finite parameter choice without this assumption.
We have cited both studies in the new related-work discussion in Appendix F: Froese, Grillo, and Skutella (COLT 2025) and Froese et al. (ICLR 2026).
These works characterize surjectivity and its complexity for given ReLU networks, including connections to verification and zonotope containment. Our guarantees concern normalized residual blocks and generic Retention layers. Appendix F makes this distinction; we also removed wording suggesting that we initiate neural-network surjectivity research.
Yes. With positive ε, Theorems 3.1–3.2 make each Pre-LayerNorm residual map surjective for every finite parameter choice. Composing these maps gives the TF blocks in Section 2.1 and preserves surjectivity without a genericity assumption.
Corollary 4.1 now states this stronger result for the residual stream before final normalization and the LM head. Final normalization restricts reachable states to its bounded image.
Lemma 4 requires no full-rank assumption: a continuously differentiable map between equal-dimensional Euclidean spaces sends null sets to null sets (Appendix A, p. 14). Section 3.2 handles constrained ranks separately:
Appendix B.6 (pp. 19–20) gives the induction, including target-dependent exceptional sets and transfer to (K,Q,V). The main proof sketch now distinguishes Lemma 2's structured genericity from Lemma 4's null-image argument.