Robust Structured Statistical Estimation via Conditional Gradient Type Methods
Jiacheng Zhuo, Liu Liu, Constantine Caramanis

TL;DR
This paper introduces robust Conditional Gradient methods that are resistant to data corruption and heavy-tailed distributions, with improved sample complexity for high-dimensional sparse problems.
Contribution
It develops a robust, projection-free optimization framework using Pairwise CG methods and introduces the RASC condition for efficient high-dimensional sparse estimation.
Findings
Methods are stable and do not accumulate error.
Guarantees robustness to data corruption and heavy tails.
Achieves linear convergence with sample complexity depending on sparsity.
Abstract
Structured statistical estimation problems are often solved by Conditional Gradient (CG) type methods to avoid the computationally expensive projection operation. However, the existing CG type methods are not robust to data corruption. To address this, we propose to robustify CG type methods against Huber's corruption model and heavy-tailed data. First, we show that the two Pairwise CG methods are stable, i.e., do not accumulate error. Combined with robust mean gradient estimation techniques, we can therefore guarantee robustness to a wide class of problems, but now in a projection-free algorithmic framework. Next, we consider high dimensional problems. Robust mean estimation based approaches may have an unacceptably high sample complexity. When the constraint set is a norm ball, Iterative-Hard-Thresholding-based methods have been developed recently. Yet extension is…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStatistical Methods and Inference · Sparse and Compressive Sensing Techniques · Advanced Statistical Methods and Models
