Research map / Learning theory and algorithms / Sample complexity
Tractable and Near-Optimal Adversarial Algorithms for Robust Estimation in Contaminated Gaussian Models
Ziyue Wang, Zhiqiang Tan
Read the paperCheck your idea against 137,217 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- ROBUST ESTIMATION VIA GENERATIVE ADVERSARIAL NETWORKS (ICLR 2019 · similarity 0.91)
- On the Optimality of the Median-of-Means Estimator under Adversarial Contamination (NeurIPS 2025 · similarity 0.86)
- Sample and Computationally Efficient Robust Learning of Gaussian Single-Index Models (NeurIPS 2024 · similarity 0.86)
- Adversarial Robustness of Nonparametric Regression (NeurIPS 2025 · similarity 0.85)
- Provable Robust Overfitting Mitigation in Wasserstein Distributionally Robust Optimization (ICLR 2025 · similarity 0.85)
- Kernel Learning with Adversarial Features: Numerical Efficiency and Adaptive Regularization (NeurIPS 2025 · similarity 0.85)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
