Active Learning for Single Neuron Models with Lipschitz Non-Linearities
Not on the map. Why?
Abstract (arXiv)
We consider the problem of active learning for single neuron models, also sometimes called ``ridge functions'', in the agnostic setting (under adversarial label noise). Such models have been shown to be broadly effective in modeling physical phenomena, and for constructing surrogate data-driven models for partial differential equations. Surprisingly, we show that for a single neuron model with any Lipschitz non-linearity (such as the ReLU, sigmoid, absolute value, low-degree polynomial, among others), strong provable approximation guarantees can be obtained using a well-known active learning strategy for fitting linear functions in the agnostic setting. % -- i.e. for the case when there is no non-linearity. Namely, we can collect samples via statistical leverage score sampling, which has been shown to be near-optimal in other active learning scenarios. We support our theoretical results with empirical simulations showing that our proposed active learning strategy based on leverage score sampling outperforms (ordinary) uniform sampling when fitting single neuron models.
Key facts. Cited by 12 papers in the map (data through 7 Oct 2026). Builds on 19 of its 51 references that are in the map. First posted on arXiv 24 Oct 2022.
Builds on
19 of 51 references.
References · 19
- 2014Sketching as a Tool for Numerical Linear Algebracited by 285
- 2016Approximation by Combinations of ReLU and Squared ReLU Ridge Functions with ℓ1 and ℓ0 Controlscited by 84
- 2018On Coresets for Logistic Regressioncited by 65
- 2020Near-Optimal SQ Lower Bounds for Agnostically Learning Halfspaces and ReLUs under Gaussian Marginalscited by 57
- 2020Learning a Single Neuron with Gradient Methodscited by 50
- 2015Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Samplingcited by 46
- 2020Derivative-Informed Projected Neural Networks for High-Dimensional Parametric Maps Governed by PDEscited by 40
- 2016Reliably Learning the ReLU in Polynomial Timecited by 36
- 2017Active Regression via Linear-Sample Sparsificationcited by 36
- 2020Approximation Schemes for ReLU Regressioncited by 34
- 2019Time/Accuracy Tradeoffs for Learning a ReLU with respect to Gaussian Marginalscited by 32
- 2014Uniform Sampling for Matrix Approximationcited by 31
7 more
- 2021Coresets for Classification -- Simplified and Strengthenedcited by 28
- 2021Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergencecited by 24
- 2020Deep Neural Networks Are Effective At Learning High-Dimensional Hilbert-Valued Functions From Limited Datacited by 22
- 2022Learning a Single Neuron with Adversarial Label Noise via Gradient Descentcited by 20
- 2020Fourier Sparse Leverage Scores and Approximate Kernel Learningcited by 16
- 2018A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transformscited by 13
- 2016On Learning High Dimensional Structured Single Index Modelscited by 6
Built on by
Citing papers per year: 2023: 3; 2024: 4; 2025: 3; 2026: 2.
12 papers.
- 2024Provably Accurate Shapley Value Estimation via Leverage Score Samplingcited by 23
- 2023CS4ML: A general framework for active learning with arbitrary data based on Christoffel functionscited by 11
- 2024Agnostic Active Learning of Single Index Models with Linear Sample Complexitycited by 11
- 2023Improved Active Learning via Dependent Leverage Score Samplingcited by 6
- 2024Optimal sampling for least-squares approximationcited by 6
- 2023A unified framework for learning with nonlinear model classes from arbitrary linear samplescited by 5
- 2024One-shot Active Learning Based on Lewis Weight Sampling for Multiple Deep Modelscited by 2
- 2025Near-optimal Active Regression of Single-Index Modelscited by 2
- 2026Active Learning for Decision Trees with Provable Guaranteescited by 1
- 2025Near-Polynomially Competitive Active Logistic Regressioncited by 0
- 2025Importance Sampling for Nonlinear Modelscited by 0
- 2026Active Regression for Single-Index Models with Unknown Link Functionscited by 0
- 2026Active Regression for Single-Index Models with Unknown Link Functions2 Aug 2026
- 2026Active Learning for Decision Trees with Provable Guarantees28 Jan 2026
- 2025Importance Sampling for Nonlinear Models18 May 2025
- 2025Near-Polynomially Competitive Active Logistic Regression7 Mar 2025
- 2025Near-optimal Active Regression of Single-Index Models25 Feb 2025
- 2024Provably Accurate Shapley Value Estimation via Leverage Score Sampling2 Oct 2024
- 2024Optimal sampling for least-squares approximation4 Sep 2024
- 2024One-shot Active Learning Based on Lewis Weight Sampling for Multiple Deep Models23 May 2024
- 2024Agnostic Active Learning of Single Index Models with Linear Sample Complexity15 May 2024
- 2023A unified framework for learning with nonlinear model classes from arbitrary linear samples25 Nov 2023
- 2023Improved Active Learning via Dependent Leverage Score Sampling8 Oct 2023
- 2023CS4ML: A general framework for active learning with arbitrary data based on Christoffel functions1 Jun 2023