mlsanityData to 7 Oct 2026

Ghosts in Neural Networks: Existence, Structure and Role of Infinite-Dimensional Null Space

arXiv 2106.04770 ↗First posted 9 Jun 2021cs.LG stat.MLcited by 7

Not on the map. Why?

Abstract (arXiv)

We study parameter nonuniqueness in continuous-width depth-two fully connected neural networks. Our main contribution is a direct method for solving the neural-network equation S[γ]=f. Starting from the Fourier expression of the synthesis operator, separation of variables produces a ridgelet particular solution and identifies every homogeneous direction. To isolate the argument, we first prove an abstract reconstruction formula for unitary factorizations, yielding the adjoint, normalized right inverse, and orthogonal solution geometry. We then specialize this formula to neural-network synthesis: for tempered-distribution activations such as ReLU, we equip the activation class As,t with a Hilbert structure, construct compatible coefficient and parameter Hilbert spaces Hs,t and Gs,t, and prove that S:Gs,t→ L2(mathbb Rm) is bounded. The resulting ridgelet expansion exhausts the null space and the complete solution set and identifies the unique minimum-norm parameter distribution. Concrete examples give adjoint ridgelet functions for standard activations. Further developments show that finite-measure null elements admit normalized width-N discretizations with O(N-1/2) output error and characterize how additive parameter perturbations can reveal information encoded in the null space. A Lean 4 blueprint for the main results is available at https://shosonoda.github.io/lean-ridgelet/ .

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

Builds on

23 of 49 references.

References · 23

  1. 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,597
  2. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  3. 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
  4. 2019Wide Neural Networks of Any Depth Evolve as Linear Models Under Gradient Descentcited by 732
  5. 2017Spectrally-normalized margin bounds for neural networkscited by 681
  6. 2017Deep Neural Networks as Gaussian Processescited by 617
  7. 2019Benign Overfitting in Linear Regressioncited by 544
  8. 2019Surprises in High-Dimensional Ridgeless Least Squares Interpolationcited by 508
  9. 2018A Mean Field View of the Landscape of Two-Layers Neural Networkscited by 463
  10. 2018On the Global Convergence of Gradient Descent for Over-parameterized Models using Optimal Transportcited by 422
  11. 2018Stronger generalization bounds for deep nets via a compression approachcited by 306
  12. 2015Norm-Based Capacity Control in Neural Networkscited by 299
11 more
  1. 2017Size-Independent Sample Complexity of Neural Networkscited by 289
  2. 2019Uniform convergence may be unable to explain generalization in deep learningcited by 223
  3. 2019A Function Space View of Bounded Norm Infinite Width ReLU Nets: The Multivariate Casecited by 113
  4. 2019How do infinite width bounded norm networks look in function space?cited by 105
  5. 2017Implicit Regularization in Deep Learningcited by 90
  6. 2017The loss surface of deep and wide neural networkscited by 74
  7. 2015Neural Network with Unbounded Activation Functions is Universal Approximatorcited by 63
  8. 2019Width Provably Matters in Optimization for Deep Linear Neural Networkscited by 52
  9. 2019Compression based bound for non-compressed network: unified generalization error analysis of large compressible deep neural networkcited by 39
  10. 2019Global Convergence of Adaptive Gradient Methods for An Over-parameterized Neural Networkcited by 27
  11. 2020Universal Approximation Theorem for Equivariant Maps by Group CNNscited by 12

Built on by

Cited by year

Citing papers per year: 2022: 2; 2023: 2; 2024: 3.

7 papers.