Outlier robust and sparse estimation of linear regression coefficients
From MaRDI portal
Cites work
- A Bound on Tail Probabilities for Quadratic Forms in Independent Random Variables
- A bound on tail probabilities for quadratic forms in independent random variables whose distributions are not necessarily symmetric
- A note on the Hanson-Wright inequality for random vectors with dependencies
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- A tail inequality for quadratic forms of subgaussian random vectors
- About the constants in Talagrand's concentration inequalities for empirical processes.
- Adaptive Huber Regression
- Agnostic estimation of mean and covariance
- All-in-one robust estimator of the Gaussian mean
- Asymptotically Minimax Adaptive Estimation. I: Upper Bounds. Optimally Adaptive Estimates
- Benign overfitting in linear regression
- Concentration inequalities. A nonasymptotic theory of independence
- CVXPY: a Python-embedded modeling language for convex optimization
- Efficient algorithms and lower bounds for robust linear regression
- Efficiently learning halfspaces with Tsybakov noise
- ERM and RERM are optimal estimators for regression problems when malicious outliers corrupt the labels
- Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
- Estimation of High Dimensional Mean Regression in the Absence of Symmetry and Light Tail Assumptions
- High-dimensional probability. An introduction with applications in data science
- High-dimensional robust mean estimation in nearly-linear time
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- I-LAMM for sparse learning: simultaneous control of algorithmic complexity and statistical error
- Improved bounds for square-root Lasso and square-root slope
- Localized Gaussian width of \(M\)-convex hulls with applications to Lasso and convex aggregation
- Model Selection and Estimation in Regression with Grouped Variables
- Multiplier bootstrap for quantile regression: non-asymptotic theory under random design
- Nearly unbiased variable selection under minimax concave penalty
- One-bit compressed sensing by linear programming
- Optimal pointwise adaptive methods in nonparametric estimation
- Outlier detection using nonconvex penalized regression
- Regularization and the small-ball method. I: Sparse recovery
- Regularization and Variable Selection Via the Elastic Net
- Risk minimization by median-of-means tournaments
- Robust and tuning-free sparse linear regression via square-root slope
- Robust covariance and scatter matrix estimation under Huber's contamination model
- Robust estimators in high-dimensions without the computational intractability
- Robust high dimensional learning for Lipschitz and convex losses
- Robust inference via multiplier bootstrap
- Robust Lasso With Missing and Grossly Corrupted Observations
- Robust linear regression: optimal rates in polynomial time
- Robust machine learning by median-of-means: theory and practice
- Robust moment estimation and improved clustering via sum of squares
- Robust multivariate mean estimation: the optimality of trimmed mean
- Robust regression via mutivariate regression depth
- Robust sub-Gaussian estimation of a mean vector in nearly linear time
- Robustly learning a Gaussian: getting optimal error, efficiently
- Settling the robust learnability of mixtures of Gaussians
- Sharp oracle inequalities for square root regularization
- Simultaneous analysis of Lasso and Dantzig selector
- SLOPE is adaptive to unknown sparsity and asymptotically minimax
- Slope meets Lasso: improved oracle bounds and optimality
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Statistical and computational trade-offs in estimation of sparse principal components
- Statistical query lower bounds for robust estimation of high-dimensional Gaussians and Gaussian mixtures
- Statistics for high-dimensional data. Methods, theory and applications.
- Tail bounds via generic chaining
- The Dantzig selector: statistical estimation when \(p\) is much larger than \(n\). (With discussions and rejoinder).
- Upper and lower bounds for stochastic processes. Modern methods and classical problems
- Variable Selection via Nonconcave Penalized Likelihood and its Oracle Properties
Cited in
(2)
This page was built for publication: Outlier robust and sparse estimation of linear regression coefficients
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6947039)
