Learning Expressive Random Feature Models via Parametrized Activations
Not on the map. Why?
Abstract (arXiv)
The random feature (RF) method is a powerful kernel approximation technique, but it typically uses fixed activation functions, limiting its adaptability across diverse tasks. To overcome this limitation, we introduce the Random Feature Model with Learnable Activation Functions (RFLAF), a novel statistical model that parameterizes activation functions as weighted sums of basis functions within the random feature framework. Examples of basis functions include radial basis functions (RBFs), spline functions, polynomials, and so forth. For theoretical results, we consider RBFs as representative basis functions. We start with a single RBF as the activation, and then extend the results to multiple RBFs, demonstrating that RF models with a learnable activation component substantially expand the represented function space. We provide estimates on the required number of samples and random features to achieve low excess risk. In our experiments, we test RFLAF with three types of bases: radial basis functions, spline functions and polynomials. Experimental results show that RFLAFs with RBFs and splines consistently outperform other RF models, where RBFs are three times more computationally efficient than splines. We then unfreeze the first-layer parameters and retrain the models, validating the expressivity advantage of learnable activation components on regular two-layer neural networks. Our work provides a deeper understanding of learnable activation components within modern neural network architectures.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 59 references that are in the map. First posted on arXiv 29 Nov 2024.
Builds on
31 of 59 references.
References · 31
- 2018Neural Tangent Kernel: Convergence and Generalization in Neural Networkscited by 2,621
- 2020Rethinking Attention with Performerscited by 1,601
- 2024KAN: Kolmogorov-Arnold Networkscited by 649
- 2019On Exact Computation with an Infinitely Wide Neural Netcited by 573
- 2019Fine-Grained Analysis of Optimization and Generalization for Overparameterized Two-Layer Neural Networkscited by 566
- 2021Random Feature Attentioncited by 354
- 2020Implicit Bias of Gradient Descent for Wide Two-layer Neural Networks Trained with the Logistic Losscited by 268
- 2019Generalization Bounds of Stochastic Gradient Descent for Wide and Deep Neural Networkscited by 222
- 2016Generalization Properties of Learning with Random Featurescited by 164
- 2019Graph Neural Tangent Kernel: Fusing Graph Neural Networks with Graph Kernelscited by 161
- 2018Nonconvex Optimization Meets Low-Rank Matrix Factorization: An Overviewcited by 160
- 2015On the Equivalence between Kernel Quadrature Rules and Random Feature Expansionscited by 138
19 more
- 2024KAN 2.0: Kolmogorov-Arnold Networks Meet Sciencecited by 118
- 2021Generalization error of random features and kernel methods: hypercontractivity and kernel matrix concentrationcited by 110
- 2020Random Features for Kernel Approximation: A Survey on Algorithms, Theory, and Beyondcited by 109
- 2015Low-rank Solutions of Linear Matrix Equations via Procrustes Flowcited by 97
- 2019Beyond Linearization: On Quadratic and Higher-Order Approximation of Wide Neural Networkscited by 79
- 2015On the Error of Random Fourier Featurescited by 76
- 2018Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guaranteescited by 71
- 2023What can a Single Attention Layer Learn? A Study Through the Random Features Lenscited by 40
- 2019Learning Activation Functions: A new paradigm for understanding Neural Networkscited by 34
- 2022ExSpliNet: An interpretable and expressive spline-based neural networkcited by 33
- 2021Scaling Neural Tangent Kernels via Sketching and Random Featurescited by 32
- 2017Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamicscited by 28
- 2018But How Does It Work in Theory? Linear SVM with Random Featurescited by 28
- 2020Discovering Parametric Activation Functionscited by 22
- 2014Randomized Nonlinear Component Analysiscited by 18
- 2022Fast Neural Kernel Embeddings for General Activationscited by 18
- 2022Neural Network Architecture Beyond Width and Depthcited by 17
- 2022Optimal Activation Functions for the Random Features Regression Modelcited by 4
- 2023Optimal Nonlinearities Improve Generalization Performance of Random Featurescited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.
- 2025SchoenbAt: Rethinking Attention with Polynomial basiscited by 1
- 2025SchoenbAt: Rethinking Attention with Polynomial basis18 May 2025