Importance Sampling for Nonlinear Models
Not on the map. Why?
Abstract (arXiv)
While norm-based and leverage-score-based methods have been extensively studied for identifying "important" data points in linear models, analogous tools for nonlinear models remain significantly underdeveloped. By introducing the concept of the adjoint operator of a nonlinear map, we address this gap and generalize norm-based and leverage-score-based importance sampling to nonlinear settings. We demonstrate that sampling based on these generalized notions of norm and leverage scores provides approximation guarantees for the underlying nonlinear mapping, similar to linear subspace embeddings. As direct applications, these nonlinear scores not only reduce the computational complexity of training nonlinear models by enabling efficient sampling over large datasets but also offer a novel mechanism for model explainability and outlier detection. Our contributions are supported by both theoretical analyses and experimental results across a variety of supervised learning scenarios.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 34 of its 72 references that are in the map. First posted on arXiv 18 May 2025.
Builds on
34 of 72 references.
References · 34
- 2017AffectNet: A Database for Facial Expression, Valence, and Arousal Computing in the Wildcited by 492
- 2018Not All Samples Are Created Equal: Deep Learning with Importance Samplingcited by 328
- 2017A Neural Representation of Sketch Drawingscited by 313
- 2013Challenges in Representation Learning: A report on three machine learning contestscited by 302
- 2014Sketching as a Tool for Numerical Linear Algebracited by 288
- 2021Efficient training of physics-informed neural networks via importance samplingcited by 110
- 2022Learning Single-Index Models with Shallow Neural Networkscited by 92
- 2016Coresets for Scalable Bayesian Logistic Regressioncited by 79
- 2013Revisiting the Nystrom Method for Improved Large-Scale Machine Learningcited by 77
- 2018Random Fourier Features for Kernel Ridge Regression: Approximation Bounds and Statistical Guaranteescited by 71
- 2018On Coresets for Logistic Regressioncited by 67
- 2015Input Sparsity Time Low-Rank Approximation via Ridge Leverage Score Samplingcited by 46
22 more
- 2020Derivative-Informed Projected Neural Networks for High-Dimensional Parametric Maps Governed by PDEscited by 40
- 2017Training Gaussian Mixture Models at Scale via Coresetscited by 38
- 2023Randomized Numerical Linear Algebra : A Perspective on the Field With an Eye to Softwarecited by 38
- 2016Reliably Learning the ReLU in Polynomial Timecited by 36
- 2017Active Regression via Linear-Sample Sparsificationcited by 36
- 2021Coresets for Classification -- Simplified and Strengthenedcited by 28
- 2021Query Complexity of Least Absolute Deviation Regression via Robust Uniform Convergencecited by 24
- 2017Safe Adaptive Importance Samplingcited by 19
- 2017Lectures on Randomized Numerical Linear Algebracited by 19
- 2018Determinantal Point Processes for Coresetscited by 18
- 2020Fourier Sparse Leverage Scores and Approximate Kernel Learningcited by 16
- 2018Generic Coreset for Scalable Learning of Monotonic Kernels: Logistic Regression, Sigmoid and morecited by 14
- 2021IS-COUNT: Large-scale Object Counting from Satellite Images with Covariate-based Importance Samplingcited by 14
- 2016Black-box Importance Samplingcited by 13
- 2018A Universal Sampling Method for Reconstructing Signals with Simple Fourier Transformscited by 13
- 2022Active Learning for Single Neuron Models with Lipschitz Non-Linearitiescited by 12
- 2024Agnostic Active Learning of Single Index Models with Linear Sample Complexitycited by 11
- 2024Recent and Upcoming Developments in Randomized Numerical Linear Algebra for Machine Learningcited by 11
- 2019Lower Memory Oblivious (Tensor) Subspace Embeddings with Fewer Random Bits: Modewise Methods for Least Squarescited by 10
- 2023Winner-Take-All Column Row Sampling for Memory Efficient Adaptation of Language Modelcited by 9
- 2020Subspace Embeddings Under Nonlinear Transformationscited by 4
- 2024On computing approximate Lewis weightscited by 2
Built on by
Not cited yet.