Corpus ID: 15134950

# Minimax Subsampling for Estimation and Prediction in Low-Dimensional Linear Regression

@article{Wang2016MinimaxSF,
title={Minimax Subsampling for Estimation and Prediction in Low-Dimensional Linear Regression},
author={Yining Wang and Aarti Singh},
journal={ArXiv},
year={2016},
volume={abs/1601.02068}
}
• Published 2016
• Computer Science, Mathematics
• ArXiv
Subsampling strategies are derived to sample a small portion of design (data) points in a low-dimensional linear regression model $y=X\beta+\varepsilon$ with near-optimal statistical rates. Our results apply to both problems of estimation of the underlying linear model $\beta$ and predicting the real-valued response $y$ of a new data point $x$. The derived subsampling strategies are minimax optimal under the fixed design setting, up to a small $(1+\epsilon)$ relative factor. We also give… Expand
2 Citations

#### Figures, Tables, and Topics from this paper

Minimax Linear Regression under Measurement Constraints
We consider the problem of linear regression under measurement constraints and derive computationally feasible subsampling strategies to sample a small portion of design (data) points in a linearExpand
Error Analysis of Generalized Nyström Kernel Regression
• Mathematics, Computer Science
• NIPS
• 2016
The generalized Nystr\"{o}m kernel regression (GNKR) with $\ell_2$ coefficient regularization is considered, where the kernel just requires the continuity and boundedness and the fast learning rate with polynomial decay is reached for the GNKR. Expand

#### References

SHOWING 1-10 OF 49 REFERENCES
Optimal Subsampling Approaches for Large Sample Linear Regression
• Rong Zhu
• Mathematics
• 2015
A significant hurdle for analyzing large sample data is the lack of effective statistical computing and inference methods. An emerging powerful approach for analyzing large sample data isExpand
Regression Shrinkage and Selection via the Lasso
SUMMARY We propose a new method for estimation in linear models. The 'lasso' minimizes the residual sum of squares subject to the sum of the absolute value of the coefficients being less than aExpand
Random Design Analysis of Ridge Regression
• Mathematics, Geology
• COLT
• 2012
This work gives a simultaneous analysis of both the ordinary least squares estimator and the ridge regression estimator in the random design setting under mild assumptions on the covariate/responseExpand
Active Regression by Stratification
• Computer Science, Mathematics
• NIPS
• 2014
This is the first active learner for this setting that provably can improve over passive learning and provides finite sample convergence guarantees for general distributions in the misspecified model. Expand
A statistical perspective on algorithmic leveraging
• Computer Science, Mathematics
• J. Mach. Learn. Res.
• 2015
This work provides an effective framework to evaluate the statistical properties of algorithmic leveraging in the context of estimating parameters in a linear regression model and shows that from the statistical perspective of bias and variance, neither leverage-based sampling nor uniform sampling dominates the other. Expand
Fast Randomized Kernel Ridge Regression with Statistical Guarantees
• Computer Science, Mathematics
• NIPS
• 2015
A version of this approach that comes with running time guarantees as well as improved guarantees on its statistical performance is described, and a fast algorithm is presented to quickly compute coarse approximations to these scores in time linear in the number of samples. Expand
On the sample covariance matrix estimator of reduced effective rank population matrices, with applications to fPCA
• Mathematics
• 2012
This work provides a unified analysis of the properties of the sample covariance matrix $\Sigma_n$ over the class of $p\times p$ population covariance matrices $\Sigma$ of reduced effective rankExpand
Fast Relative-Error Approximation Algorithm for Ridge Regression
• Mathematics, Computer Science
• UAI
• 2015
To the best of the knowledge, this is the first algorithm for ridge regression that runs in o(n2p) time with provable relative-error approximation bound on the output vector and shows empirical results on both synthetic and real datasets. Expand
Relative-Error CUR Matrix Decompositions
• Computer Science, Mathematics
• SIAM J. Matrix Anal. Appl.
• 2008
These two algorithms are the first polynomial time algorithms for such low-rank matrix approximations that come with relative-error guarantees; previously, in some cases, it was not even known whether such matrix decompositions exist. Expand
Faster least squares approximation
• Computer Science, Mathematics
• Numerische Mathematik
• 2011
This work presents two randomized algorithms that provide accurate relative-error approximations to the optimal value and the solution vector of a least squares approximation problem more rapidly than existing exact algorithms. Expand