Growing axons: greedy learning of neural networks with application to function approximation
Not on the map. Why?
Abstract (arXiv)
We propose a new method for learning deep neural network models that is based on a greedy learning approach: we add one basis function at a time, and a new basis function is generated as a non-linear activation function applied to a linear combination of the previous basis functions. Such a method (growing deep neural network by one neuron at a time) allows us to compute much more accurate approximants for several model problems in function approximation.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). First posted on arXiv 28 Oct 2019.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 3; 2022: 2; 2023: 0; 2024: 0; 2025: 1.
6 papers.
- 2021SPINN: Sparse, Physics-based, and partially Interpretable Neural Networks for PDEscited by 32
- 2021Partition of unity networks: deep hp-approximationcited by 15
- 2022Numerical Computation of Partial Differential Equations by Hidden-Layer Concatenated Extreme Learning Machinecited by 9
- 2021Probabilistic partition of unity networks: clustering based deep approximationcited by 2
- 2022Parameter-varying neural ordinary differential equations with partition-of-unity networkscited by 0
- 2025SUPN: Shallow Universal Polynomial Networkscited by 0
- 2025SUPN: Shallow Universal Polynomial Networks26 Nov 2025
- 2022Parameter-varying neural ordinary differential equations with partition-of-unity networks1 Oct 2022
- 2022Numerical Computation of Partial Differential Equations by Hidden-Layer Concatenated Extreme Learning Machine24 Apr 2022
- 2021Probabilistic partition of unity networks: clustering based deep approximation7 Jul 2021
- 2021SPINN: Sparse, Physics-based, and partially Interpretable Neural Networks for PDEs25 Feb 2021
- 2021Partition of unity networks: deep hp-approximation27 Jan 2021