mlsanityData to 7 Oct 2026

Local Identifiability of Deep ReLU Neural Networks: the Theory

arXiv 2206.07424 ↗First posted 15 Jun 2022math.ST stat.ML stat.THcited by 12

Not on the map. Why?

Abstract (arXiv)

Is a sample rich enough to determine, at least locally, the parameters of a neural network? To answer this question, we introduce a new local parameterization of a given deep ReLU neural network by fixing the values of some of its weights. This allows us to define local lifting operators whose inverses are charts of a smooth manifold of a high dimensional space. The function implemented by the deep ReLU neural network composes the local lifting with a linear operator which depends on the sample. We derive from this convenient representation a geometrical necessary and sufficient condition of local identifiability. Looking at tangent spaces, the geometrical condition provides: 1/ a sharp and testable necessary condition of identifiability and 2/ a sharp and testable sufficient condition of local identifiability. The validity of the conditions can be tested numerically using backpropagation and matrix rank computations.

Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 23 of its 53 references that are in the map. First posted on arXiv 15 Jun 2022.

Builds on

23 of 53 references.

References · 23

  1. 2015Faster R-CNN: Towards Real-Time Object Detection with Region Proposal Networkscited by 9,617
  2. 2015You Only Look Once: Unified, Real-Time Object Detectioncited by 4,829
  3. 2013Efficient Estimation of Word Representations in Vector Spacecited by 4,346
  4. 2016Adversarial examples in the physical worldcited by 1,762
  5. 2018The Secret Sharer: Evaluating and Testing Unintended Memorization in Neural Networkscited by 847
  6. 2014Deep Speech: Scaling up end-to-end speech recognitioncited by 354
  7. 2019Two models of double descent for weak featurescited by 194
  8. 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
  9. 2017Recovery Guarantees for One-hidden-layer Neural Networkscited by 94
  10. 2019Reverse-Engineering Deep ReLU Networkscited by 81
  11. 2017Learning One-hidden-layer Neural Networks with Landscape Designcited by 79
  12. 2020Cryptanalytic Extraction of Neural Network Modelscited by 65
11 more
  1. 2017Globally Optimal Gradient Descent for a ConvNet with Gaussian Inputscited by 61
  2. 2018Learning One-hidden-layer ReLU Networks via Gradient Descentcited by 50
  3. 2021Parameter identifiability of a deep feedforward ReLU neural networkcited by 24
  4. 2018Guaranteed Recovery of One-Hidden-Layer Neural Networks via Cross Entropycited by 22
  5. 2021An Embedding of ReLU Networks and an Analysis of their Identifiabilitycited by 20
  6. 2020TRU-NET: A Deep Learning Approach to High Resolution Prediction of Rainfallcited by 19
  7. 2019How degenerate is the parametrization of neural networks with the ReLU activation function?cited by 15
  8. 2013Provable Bounds for Learning Some Deep Representationscited by 14
  9. 2019Positively Scale-Invariant Flatness of ReLU Neural Networkscited by 11
  10. 2017On the stable recovery of deep structured linear networks under sparsity constraintscited by 5
  11. 2014Provable Methods for Training Neural Networks with Sparse Connectivitycited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 2; 2023: 1; 2024: 2; 2025: 3; 2026: 4.

12 papers.