Fetching the paper…
Reading the bibliography…
We propose a random feature model for approximating high-dimensional sparse additive functions called the hard-ridge random feature expansion method (HARFE).
Support vector machines
M. A. Hearst, S. T. Dumais, E. Osuna, J. Platt, and B. Scholkopf · 1998
Earlier work this paper cites.
Learning with kernels
A. J. Smola and B. Schölkopf · 1998
Earlier work this paper cites.
Kernel methods: a survey of current techniques
C. Campbell · 2002
Earlier work this paper cites.
The support vector machine under test
D. Meyer, F. Leisch, and K. Hornik · 2003
Earlier work this paper cites.
Learning bounds for kernel regression using effective data dimensionality
T. Zhang · 2005
Earlier work this paper cites.
Component selection and smoothing in multivariate nonparametric regression
Y. Lin and H. H. Zhang · 2006
Earlier work this paper cites.
Random features for large-scale kernel machines
A. Rahimi and B. Recht · 2007
Earlier work this paper cites.
Spam: Sparse additive models
P. Ravikumar, H. Liu, J. D. Lafferty, and L. A. Wasserman · 2007
Earlier work this paper cites.
Consistency of the group lasso and multiple kernel learning
F. R. Bach · 2008
Earlier work this paper cites.
Uniform approximation of functions with random bases
A. Rahimi and B. Recht · 2008
Earlier work this paper cites.
Weighted sums of random kitchen sinks: replacing minimization with randomization in learning
A. Rahimi and B. Recht · 2008
Earlier work this paper cites.
Multivariate regression and machine learning with sums of separable functions
G. Beylkin, J. Garcke, and M. J. Mohlenkamp · 2009
Earlier work this paper cites.
Iterative hard thresholding for compressed sensing
T. Blumensath and M. E. Davies · 2009
Earlier work this paper cites.
Coherence analysis of iterative thresholding algorithms
A. Maleki · 2009
Earlier work this paper cites.
Simple and efficient multiple kernel learning by group lasso
Z. Xu, R. Jin, H. Yang, I. King, and M. R. Lyu · 2010
Earlier work this paper cites.
Fast high-dimensional approximation with sparse occupancy trees
P. Binev, W. Dahmen, and P. Lamby · 2011
Earlier work this paper cites.
Hard thresholding pursuit: an algorithm for compressive sensing
S. Foucart · 2011
Earlier work this paper cites.
Multiple kernel learning algorithms
M. Gönen and E. Alpaydın · 2011
Cited alongside, same era.
A Mathematical Introduction to Compressive Sensing
S. Foucart and H. Rauhut · 2013
Cited alongside, same era.
A branch-and-cut decomposition algorithm for solving chance-constrained mathematical programs with finite support
J. Luedtke · 2014
Cited alongside, same era.
Sparse random feature algorithm as coordinate descent in Hilbert space
I. E.-H. Yen, T.-W. Lin, S.-D. Lin, P. K. Ravikumar, and I. S. Dhillon · 2014
Cited alongside, same era.
Hard thresholding pursuit algorithms: number of iterations
J.-L. Bouchot, S. Foucart, and P. Hitczenko · 2016
Cited alongside, same era.
Learning rates for the risk of kernel-based quantile regression estimators in additive models
A. Christmann and D.-X. Zhou · 2016
Towards a unified analysis of random Fourier features
Z. Li, J.-F. Ton, D. Oglic, and D. Sejdinovic · 2019
Later among the works it cites.
The generalization error of random features regression: Precise asymptotics and the double descent curve
S. Mei and A. Montanari · 2019
Later among the works it cites.
Approximation of high-dimensional periodic functions with Fourier-based methods
D. Potts and M. Schmischke · 2019
Later among the works it cites.
Deconstructing lottery tickets: Zeros, signs, and the supermask
H. Zhou, J. Lan, R. Liu, and J. Yosinski · 2019
Later among the works it cites.
Benign overfitting in linear regression
P. L. Bartlett, P. M. Long, G. Lugosi, and A. Tsigler · 2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Cited alongside, same era.
Additive approximations in high dimensional nonparametric regression via the salsa
K. Kandasamy and Y. Yu · 2016
Cited alongside, same era.
Learning sparse additive models with interactions in high dimensions
H. Tyagi, A. Kyrillidis, B. Gärtner, and A. Krause · 2016
Cited alongside, same era.
On the equivalence between kernel quadrature rules and random feature expansions
F. Bach · 2017
Cited alongside, same era.
UCI machine learning repository, 2017
D. Dua and C. Graff · 2017
Cited alongside, same era.
Subset selection with shrinkage: Sparse linear modeling when the snr is low
R. Mazumder, P. Radchenko, and A. Dedieu · 2017
Cited alongside, same era.
Generalization properties of learning with random features
A. Rudi and L. Rosasco · 2017
Cited alongside, same era.
Sparse high-dimensional regression: Exact scalable algorithms and phase transitions
D. Bertsimas and B. Van Parys · 2020
Later among the works it cites.
W. E, C. Ma, S. Wojtowytsch, and L. Wu · 2020
Later among the works it cites.
Fast best subset selection: Coordinate descent and local combinatorial optimization algorithms
H. Hazimeh and R. Mazumder · 2020
Later among the works it cites.
Just interpolate: Kernel “ridgeless” regression can generalize
T. Liang and A. Rakhlin · 2020
Later among the works it cites.
Sparse shrunk additive models
G. Liu, H. Chen, and H. Huang · 2020
Later among the works it cites.
Benign overfitting in ridge regression
A. Tsigler and P. L. Bartlett · 2020
Later among the works it cites.
Scalable algorithms for the sparse ridge regression
W. Xie and X. Deng · 2020
Later among the works it cites.
Conditioning of random feature matrices: Double descent and generalization error
Z. Chen and H. Schaeffer · 2021
Later among the works it cites.
Generalization bounds for sparse random feature expansions
A. Hashemi, H. Schaeffer, R. Shi, U. Topcu, G. Tran, and R. Ward · 2021
Later among the works it cites.
S. Mei, T. Misiakiewicz, and A. Montanari · 2021
Later among the works it cites.
Interpretable approximation of high-dimensional data
D. Potts and M. Schmischke · 2021
Later among the works it cites.
Shrimp: Sparser random feature models via iterative magnitude pruning
Y. Xie, B. Shi, H. Schaeffer, and R. Ward · 2021
Later among the works it cites.