Robust matrix estimations meet Frank-Wolfe algorithm
From MaRDI portal
Publication:6134341
Recommendations
- Robust low-rank matrix estimation
- Scalable robust matrix recovery: Frank-Wolfe meets proximal methods
- Improved complexities of conditional gradient-type methods with applications to robust matrix recovery problems
- Max-norm optimization for robust matrix recovery
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
Cites work
- A Bennett concentration inequality and its application to suprema of empirical processes
- A new perspective on robust \(M\)-estimation: finite sample theory and applications to dependence-adjusted multiple testing
- A shrinkage principle for heavy-tailed data: high-dimensional robust low-rank matrix recovery
- A simpler approach to matrix completion
- A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
- Adaptive Huber Regression
- An accelerated proximal gradient algorithm for nuclear norm regularized linear least squares problems
- An extended Frank-Wolfe method with ``in-face directions, and its application to low-rank matrix completion
- Concentration inequalities. A nonasymptotic theory of independence
- Estimation of (near) low-rank matrices with noise and high-dimensional scaling
- Estimation of high-dimensional low-rank matrices
- scientific article; zbMATH DE number 3954047 (Why is no real title available?)
- scientific article; zbMATH DE number 1220060 (Why is no real title available?)
- scientific article; zbMATH DE number 1134987 (Why is no real title available?)
- scientific article; zbMATH DE number 1964693 (Why is no real title available?)
- Low-rank matrix recovery with composite optimization: good conditioning and rapid convergence
- Matrix completion via an alternating direction method
- Matrix completion with noisy entries and outliers
- Multivariate reduced-rank regression
- New analysis and results for the Frank-Wolfe method
- Noisy low-rank matrix completion with general sampling distribution
- Noisy matrix decomposition via convex relaxation: optimal rates in high dimensions
- Nuclear-norm penalization and optimal rates for noisy low-rank matrix completion
- Probability in Banach spaces. Isoperimetry and processes
- Restricted strong convexity and weighted matrix completion: optimal bounds with noise
- Robust low-rank matrix estimation
- Robust reduced-rank regression
- Statistical consistency and asymptotic normality for high-dimensional robust \(M\)-estimators
- The Power of Convex Relaxation: Near-Optimal Matrix Completion
Cited in
(2)
This page was built for publication: Robust matrix estimations meet Frank-Wolfe algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6134341)