Efficient Algorithms for Learning Depth-2 Neural Networks with General ReLU Activations
Pranjal Awasthi, Alex Tang, Aravindan Vijayaraghavan
Abstract
We present polynomial time and sample efficient algorithms for learning an unknown depth-2 feedforward neural network with general ReLU activations, under mild non-degeneracy assumptions. In particular, we consider learning an unknown network of the form , where is drawn from the Gaussian distribution, and is the ReLU activation. Prior works for learning networks with ReLU activations assume that the bias is zero. In order to deal with the presence of the bias terms, our proposed algorithm consists of robustly decomposing multiple higher order tensors arising from the Hermite expansion of the function . Using these ideas we also establish identifiability of the network parameters under minimal assumptions.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 892b0221-e1a0-44df-b086-bccc27fe651cCited by top-tier papers9
- Identifiability of Deep Polynomial Neural NetworksKonstantin Usevich, Ricardo Augusto Borsoi, Clara Dérand, Marianne ClauselNeurIPS 2025 · 21 citations
- Computational Complexity of Learning Neural Networks: Smoothness and DegeneracyAmit Daniely, Nati Srebro, Gal VardiNeurIPS 2023 · 11 citations
- Convex Relaxations of ReLU Neural Networks Approximate Global Optima in Polynomial TimeSungyoon Kim, Mert PilanciICML 2024 · 10 citations
- Efficiently Learning One Hidden Layer ReLU Networks From QueriesSitan Chen, Adam R. Klivans, Raghu MekaNeurIPS 2021 · 8 citations
- Efficient Learning of CNNs using Patch Based FeaturesAlon Brutzkus, Amir Globerson, Eran Malach, Alon Regev Netser et al.ICML 2022 · 6 citations
Builds on3
- Superpolynomial Lower Bounds for Learning One-Layer Neural Networks using Gradient DescentSurbhi Goel, Aravind Gollakota, Zhihan Jin, Sushrut Karmalkar et al.ICML 2020 · 75 citations
- Small Covers for Near-Zero Sets of Polynomials and Learning Latent Variable ModelsIlias Diakonikolas, Daniel M. KaneFOCS 2020 · 11 citations
- Learning Deep ReLU Networks Is Fixed-Parameter TractableSitan Chen, Adam R. Klivans, Raghu MekaFOCS 2021 · 7 citations
Related papers
- An Exact Poly-Time Membership-Queries Algorithm for Extracting a Three-Layer ReLU NetworkAmit Daniely, Elad GranotICLR 2023
- Reverse-engineering deep ReLU networksDavid Rolnick, Konrad P. KordingICML 2020 · 121 citations
- Learning Polynomial Transformations via Generalized Tensor DecompositionsSitan Chen, Jerry Li, Yuanzhi Li, Anru R. ZhangSTOC 2023 · 2 citations
- Learning (Very) Simple Generative Models Is HardSitan Chen, Jerry Li, Yuanzhi LiNeurIPS 2022 · 12 citations
- Most Neural Networks Are Almost LearnableAmit Daniely, Nati Srebro, Gal VardiNeurIPS 2023 · 1 citation
