On the relationship between multivariate splines and infinitely-wide neural networks
Not on the map. Why?
Abstract (arXiv)
We consider multivariate splines and show that they have a random feature expansion as infinitely wide neural networks with one-hidden layer and a homogeneous activation function which is the power of the rectified linear unit. We show that the associated function space is a Sobolev space on a Euclidean ball, with an explicit bound on the norms of derivatives. This link provides a new random feature expansion for multivariate splines that allow efficient algorithms. This random feature expansion is numerically better behaved than usual random Fourier features, both in theory and practice. In particular, in dimension one, we compare the associated leverage scores to compare the two random expansions and show a better scaling for the neural network expansion.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 6 of its 26 references that are in the map. First posted on arXiv 7 Feb 2023.
Builds on
6 of 26 references.
References · 6
- 2014Breaking the Curse of Dimensionality with Convex Neural Networkscited by 329
- 2016Generalization Properties of Learning with Random Featurescited by 163
- 2016Toward Deeper Understanding of Neural Networks: The Power of Initialization and a Dual View on Expressivitycited by 138
- 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 136
- 2018Relating Leverage Scores and Density using Regularized Christoffel Functionscited by 10
- 2020An Infinite-Feature Extension for Bayesian ReLU Nets That Fixes Their Asymptotic Overconfidencecited by 10
Built on by
Citing papers per year: 2023: 1; 2024: 1; 2025: 2; 2026: 1.
5 papers.
- 2025Solving Nonlinear PDEs with Sparse Radial Basis Function Networkscited by 3
- 2024Nonuniform random feature models using derivative informationcited by 2
- 2025A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coveragecited by 2
- 2023Approximation by non-symmetric networks for cross-domain learningcited by 1
- 2026Sparse RBF Networks for PDEs and nonlocal equations: function space theory, operator calculus, and training algorithmscited by 0
- 2026Sparse RBF Networks for PDEs and nonlocal equations: function space theory, operator calculus, and training algorithms24 Jan 2026
- 2025A Convex Loss Function for Set Prediction with Optimal Trade-offs Between Size and Conditional Coverage22 Dec 2025
- 2025Solving Nonlinear PDEs with Sparse Radial Basis Function Networks12 May 2025
- 2024Nonuniform random feature models using derivative information3 Oct 2024
- 2023Approximation by non-symmetric networks for cross-domain learning6 May 2023