Image de couverture de livre

Heavy-tailed Contamination is Easier than Adversarial Contamination

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Cherapanamjeri, Yeshwanth, Lee, Daniel
Format:	Preprint
Publié:	2024
Sujets:	Statistics Theory Data Structures and Algorithms Machine Learning Methodology
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

High-Dimensional Gaussian Mean Estimation under Realizable Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Information-Computation Tradeoffs for Noiseless Linear Regression with Oblivious Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Sample Complexity Bounds for Robust Mean Estimation with Mean-Shift Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Robust Sparse Estimation for Gaussians with Optimal Error under Huber Contamination
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Robust Regression with Adaptive Contamination in Response: Optimal Rates and Computational Barriers
par: Diakonikolas, Ilias, et autres
Publié: (2026)

Terminal Embeddings in Sublinear Time
par: Cherapanamjeri, Yeshwanth, et autres
Publié: (2021)

The Power of Iterative Filtering for Supervised Learning with (Heavy) Contamination
par: Klivans, Adam R., et autres
Publié: (2025)

The Conflict Graph Design: Estimating Causal Effects under Arbitrary Neighborhood Interference
par: Kandiros, Vardis, et autres
Publié: (2024)

Optimal Robust Estimation under Local and Global Corruptions: Stronger Adversary and Smaller Error
par: Pittas, Thanasis, et autres
Publié: (2024)

Linear Regression under Missing or Corrupted Coordinates
par: Diakonikolas, Ilias, et autres
Publié: (2025)

On Learning Parallel Pancakes with Mostly Uniform Weights
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Adversarially-Robust Inference on Trees via Belief Propagation
par: Hopkins, Samuel B., et autres
Publié: (2024)

A Note on Non-Negative $L_1$-Approximating Polynomials
par: Lee, Jane H., et autres
Publié: (2026)

Smoothed Analysis of Learning from Positive Samples
par: Lee, Jane H., et autres
Publié: (2025)

Implicit High-Order Moment Tensor Estimation and Learning Latent Variable Models
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Distributionally Robust Optimization with Adversarial Data Contamination
par: Li, Shuyao, et autres
Publié: (2025)

SQ Lower Bounds for Non-Gaussian Component Analysis with Weaker Assumptions
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Statistical Query Lower Bounds for Learning Truncated Gaussians
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Robust Learning of Multi-index Models via Iterative Subspace Approximation
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Entangled Mean Estimation in High-Dimensions
par: Diakonikolas, Ilias, et autres
Publié: (2025)

Batch List-Decodable Linear Regression via Higher Moments
par: Diakonikolas, Ilias, et autres
Publié: (2025)

List-Decodable Sparse Mean Estimation via Difference-of-Pairs Filtering
par: Diakonikolas, Ilias, et autres
Publié: (2022)

Robust Sparse Mean Estimation via Sum of Squares
par: Diakonikolas, Ilias, et autres
Publié: (2022)

Breaking the Heavy-Tailed Noise Barrier in Stochastic Optimization Problems
par: Puchkin, Nikita, et autres
Publié: (2023)

A smoothed-Bayesian approach to frequency recovery from sketched data
par: Beraha, Mario, et autres
Publié: (2023)

Learning Mixtures of Gaussians Using Diffusion Models
par: Gatmiry, Khashayar, et autres
Publié: (2024)

Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
par: Lee, Jane H., et autres
Publié: (2024)

Rényi-infinity constrained sampling with $d^3$ membership queries
par: Kook, Yunbum, et autres
Publié: (2024)

Is Transductive Learning Equivalent to PAC Learning?
par: Dughmi, Shaddin, et autres
Publié: (2024)

In-and-Out: Algorithmic Diffusion for Sampling Convex Bodies
par: Kook, Yunbum, et autres
Publié: (2024)

Sampling and Integration of Logconcave Functions by Algorithmic Diffusion
par: Kook, Yunbum, et autres
Publié: (2024)

A Sub-Quadratic Time Algorithm for Robust Sparse Mean Estimation
par: Pensia, Ankit
Publié: (2024)

Simple and Nearly-Optimal Sampling for Rank-1 Tensor Completion via Gauss-Jordan
par: Gomez-Leos, Alejandro, et autres
Publié: (2024)

Covariance estimation using Markov chain Monte Carlo
par: Kook, Yunbum, et autres
Publié: (2024)

SoS Certifiability of Subgaussian Distributions and its Algorithmic Applications
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Revisiting Agnostic PAC Learning
par: Hanneke, Steve, et autres
Publié: (2024)

Online Learning of Halfspaces with Massart Noise
par: Diakonikolas, Ilias, et autres
Publié: (2024)

Sample-Efficient Private Learning of Mixtures of Gaussians
par: Ashtiani, Hassan, et autres
Publié: (2024)

A mixing time bound for Gibbs sampling from log-smooth log-concave distributions
par: Wadia, Neha S.
Publié: (2024)