Learning One-hidden-layer Neural Networks under General Input Distributions
Not on the map. Why?
Abstract (arXiv)
Significant advances have been made recently on training neural networks, where the main challenge is in solving an optimization problem with abundant critical points. However, existing approaches to address this issue crucially rely on a restrictive assumption: the training data is drawn from a Gaussian distribution. In this paper, we provide a novel unified framework to design loss functions with desirable landscape properties for a wide range of general input distributions. On these loss functions, remarkably, stochastic gradient descent theoretically recovers the true parameters with global initializations and empirically outperforms the existing approaches. Our loss function design bridges the notion of score functions with the topic of neural network optimization. Central to our approach is the task of estimating the score function from samples, which is of basic and independent interest to theoretical statistics. Traditional estimation methods (example: kernel based) fail right at the outset; we bring statistical methods of local likelihood to design a novel estimator of score functions, that provably adapts to the local geometry of the unknown density.
Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Oct 2018.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 1; 2022: 0; 2023: 3; 2024: 2; 2025: 1.
7 papers.
- 2023DiffFit: Unlocking Transferability of Large Diffusion Models via Simple Parameter-Efficient Fine-Tuningcited by 82
- 2024Provably learning a multi-head attention layercited by 21
- 2023Learning Narrow One-Hidden-Layer ReLU Networkscited by 14
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activationscited by 7
- 2023A faster and simpler algorithm for learning shallow networkscited by 7
- 2025Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guaranteescited by 4
- 2024Unrolled denoising networks provably learn optimal Bayesian inferencecited by 1
- 2025Learning Neural Networks with Distribution Shift: Efficiently Certifiable Guarantees22 Feb 2025
- 2024Unrolled denoising networks provably learn optimal Bayesian inference19 Sep 2024
- 2024Provably learning a multi-head attention layer6 Feb 2024
- 2023A faster and simpler algorithm for learning shallow networks24 Jul 2023
- 2023Learning Narrow One-Hidden-Layer ReLU Networks20 Apr 2023
- 2023DiffFit: Unlocking Transferability of Large Diffusion Models via Simple Parameter-Efficient Fine-Tuning13 Apr 2023
- 2021Spurious Local Minima Are Common for Deep Neural Networks with Piecewise Linear Activations25 Feb 2021