Pith. sign in

REVIEW 4 cited by

Injectivity of ReLU networks: perspectives from statistical physics

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.14112 v2 pith:ISO3GE5X submitted 2023-02-27 cond-mat.dis-nn cs.LGmath.PRstat.ML

classification cond-mat.dis-nncs.LGmath.PRstat.ML
keywords characteristiceulerinjectivityphysicsrelustatisticalgeometryintegral
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
abstract

When can the input of a ReLU neural network be inferred from its output? In other words, when is the network injective? We consider a single layer, $x \mapsto \mathrm{ReLU}(Wx)$, with a random Gaussian $m \times n$ matrix $W$, in a high-dimensional setting where $n, m \to \infty$. Recent work connects this problem to spherical integral geometry giving rise to a conjectured sharp injectivity threshold for $\alpha = \frac{m}{n}$ by studying the expected Euler characteristic of a certain random set. We adopt a different perspective and show that injectivity is equivalent to a property of the ground state of the spherical perceptron, an important spin glass model in statistical physics. By leveraging the (non-rigorous) replica symmetry-breaking theory, we derive analytical equations for the threshold whose solution is at odds with that from the Euler characteristic. Furthermore, we use Gordon's min--max theorem to prove that a replica-symmetric upper bound refutes the Euler characteristic prediction. Along the way we aim to give a tutorial-style introduction to key ideas from statistical physics in an effort to make the exposition accessible to a broad audience. Our analysis establishes a connection between spin glasses and integral geometry but leaves open the problem of explaining the discrepancies.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Optimal spectral initializers impact on phase retrieval phase transitions -- an RDT view

    stat.ML 2025-06 conditional novelty 6.0 of 10

    Optimal spectral initializers at the theoretical phase retrieval threshold sit in flat landscape regions, so roughly 15% oversampling is needed for reliable descending algorithms.

  2. Phase transition of \emph{descending} phase retrieval algorithms

    stat.ML 2025-06 reject novelty 6.0 of 10

    The paper derives RDT-based lower bounds and predicts a phase transition at oversampling ratio α≈1.4 where descending phase retrieval algorithms transition from failing to succeeding, but the key isomorphism with conv...

  3. Deep ReLU networks -- injectivity capacity upper bounds

    stat.ML 2024-12 reject novelty 6.0 of 10

    For deep ReLU networks with random Gaussian weights, the paper gives upper bounds on the layer expansion needed for injectivity and finds the expansion need saturates by four layers.

  4. Phase retrieval with rank $d$ measurements -- \emph{descending} algorithms phase transitions

    stat.ML 2025-06 conditional novelty 5.0 of 10

    For rank d phase retrieval with Gaussian measurements, descending gradient algorithms are predicted to succeed above a sample complexity ratio near 2.79 for d=2, with lifted bounds lowering this estimate and simulatio...

Pith tools