Compressed Least-Squares Regression
@inproceedings{Maillard2009CompressedLR, title={Compressed Least-Squares Regression}, author={O. Maillard and R. Munos}, booktitle={NIPS}, year={2009} }
We consider the problem of learning, from K data, a regression function in a linear space of high dimension N using projections onto a random subspace of lower dimension M. From any algorithm minimizing the (possibly penalized) empirical risk, we provide bounds on the excess risk of the estimate computed in the projected subspace (compressed domain) in terms of the excess risk of the estimate built in the high-dimensional space (initial domain). We show that solving the problem in the… CONTINUE READING
Supplemental Presentations
Topics from this paper
102 Citations
Fast Sparse Least-Squares Regression with Non-Asymptotic Guarantees
- Computer Science, Mathematics
- ArXiv
- 2015
- 2
- PDF
Compressed fisher linear discriminant analysis: classification of randomly projected data
- Mathematics, Computer Science
- KDD
- 2010
- 46
- PDF
Efficient Private Empirical Risk Minimization for High-dimensional Learning
- Mathematics, Computer Science
- ICML
- 2016
- 31
- PDF
References
SHOWING 1-10 OF 30 REFERENCES
On the Complexity of Linear Prediction: Risk Bounds, Margin Bounds, and Regularization
- Computer Science, Mathematics
- NIPS
- 2008
- 269
- PDF
Some sharp performance bounds for least squares regression with L1 regularization
- Mathematics
- 2009
- 244
- PDF
Persistence in high-dimensional linear predictor selection and the virtue of overparametrization
- Mathematics, Psychology
- 2004
- 333
- PDF
Signal recovery from random projections
- Mathematics, Engineering
- IS&T/SPIE Electronic Imaging
- 2005
- 251
- PDF