Computationally efficient and statistically optimal robust high-dimensional linear regression
From MaRDI portal
Cites work
- A general decision theory for Huber's \(\epsilon\)-contamination model
- A New Principle for Tuning-Free Huber Regression
- A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
- A polynomial algorithm for best-subset selection problem
- A Robust Version of the Probability Ratio Test
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- A tail inequality for suprema of unbounded empirical processes with applications to Markov chains
- A tight bound of hard thresholding
- A tuning-free robust and efficient approach to high-dimensional regression
- Accelerating ill-conditioned low-rank matrix estimation via scaled gradient descent
- Adaptive Huber Regression
- Challenging the empirical mean and empirical variance: a deviation study
- Computationally efficient and statistically optimal robust high-dimensional linear regression
- CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
- Edgeworth expansions for network moments
- Estimation bounds and sharp oracle inequalities of regularized procedures with Lipschitz loss functions
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Estimation of high-dimensional low-rank matrices
- Estimation of low rank density matrices: bounds in Schatten norms and other distances
- Exponential screening and optimal rates of sparse estimation
- Generalized Low-Rank Plus Sparse Tensor Estimation by Fast Riemannian Optimization
- Geometric median and robust estimation in Banach spaces
- Globally adaptive quantile regression with ultra-high dimensional data
- Guarantees of Riemannian optimization for low rank matrix recovery
- High-dimensional linear regression via implicit regularization
- High-Dimensional Quantile Regression: Convolution Smoothing and Concave Regularization
- High-dimensional regression with noisy and missing data: provable guarantees with nonconvexity
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 845714 (Why is no real title available?)
- scientific article; zbMATH DE number 1420699 (Why is no real title available?)
- Iterative hard thresholding for compressed sensing
- Iteratively reweighted _1-penalized robust regression
- Latent Space Model for Higher-Order Networks and Generalized Tensor Decomposition
- Learning from MOM's principles: Le Cam's approach
- Least angle regression. (With discussion)
- Low-rank matrix completion by Riemannian optimization
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Low-Rank Matrix Recovery With Scaled Subgradient Methods: Fast and Robust Convergence Without the Condition Number
- Mean estimation and regression under heavy-tailed distributions: A survey
- Mean estimation with sub-Gaussian rates in polynomial time
- Minimax Rates of Estimation for High-Dimensional Linear Regression Over \ell_q-Balls
- Nonconvex Robust Low-Rank Matrix Recovery
- On convergence rates of subgradient optimization methods
- On M-processes and M-estimation
- Oracle inequalities and optimal inference under group sparsity
- Provable sparse tensor decomposition
- Quantile Regression for Analyzing Heterogeneity in Ultra-High Dimension
- Randomized smoothing for stochastic optimization
- Rate minimaxity of the Lasso and Dantzig selector for the \(l_{q}\) loss in \(l_{r}\) balls
- Regression Quantiles
- Regularization, sparse recovery, and median-of-means tournaments
- 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 low-rank matrix completion by Riemannian optimization
- Robust low-rank matrix estimation
- Robust matrix completion
- Robust principal component analysis?
- Robust reduced rank regression in a distributed setting
- Robust statistical learning with Lipschitz and convex loss functions
- Robust Statistics
- Robust sub-Gaussian estimation of a mean vector in nearly linear time
- Robust subgaussian estimation with VC-dimension
- ROP: matrix recovery via rank-one projections
- Sparse recovery under weak moment assumptions
- Square-root lasso: pivotal recovery of sparse signals via conic programming
- Statistical Inferences of Linear Forms for Noisy Matrix Completion
- Statistically optimal and computationally efficient low rank tensor completion from noisy entries
- Sub-Gaussian estimators of the mean of a random matrix with heavy-tailed entries
- Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay
- The convex geometry of linear inverse problems
- Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
- Volume Ratio, Sparsity, and Minimaxity Under Unitarily Invariant Norms
Cited in
(2)
This page was built for publication: Computationally efficient and statistically optimal robust high-dimensional linear regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7013962)
