Study shows robust method for estimating density ratios even with heavy contamination.
problem Estimating density ratios in the presence of heavy contamination.
method Weighted density ratio estimation (DRE) with doubly strong robustness.
result Weighted DRE achieves sparse consistency under heavy contamination.
A robust loss for anomaly mitigation and unsupervised contamination classification
problem Detecting and mitigating contamination in supervised and unsupervised settings
method Neural Bayesian Anomaly Mitigation (NBAM)
result Recovering the structure of contamination and identifying label-flip pairs
Robust score matching improves parameter estimation in contaminated data.
problem Parameter estimation in data contaminated by outliers.
method Geometric median of means to develop a robust score matching procedure.
result Consistent parameter estimates in contaminated data settings.
Study enhances robustness of In-CVaR based regression models under perturbation and contamination.
problem Enhancing robustness of nonlinear regression models under perturbation and contamination.
method Introduces interval conditional value-at-risk (In-CVaR) and rigorously analyzes its robustness properties under both perturbation and contamination.
result The In-CVaR based estimator is qualitatively robust in terms of the Prokhorov metric if and only if the largest portion of losses is trimmed.
Paper introduces RAS for robust MTL with contamination.
problem Representation-based multi-task learning struggles with contamination.
method Robust and Adaptive Spectral (RAS) method.
result RAS prevents negative transfer and performs well with up to 80% contamination.
Motivated by applications of bandit algorithms in education, we consider a stochastic multi-armed bandit problem with ε-contaminated rewards. We allow an adversary to give arbitrary unbounded contaminated rewards with full knowledge of the past and future. We impose the constraint that for each time t the…
Improved robust regression with clean covariates achieves better rates than Huber's model.
problem Robust regression under adaptive contamination of responses with clean covariates.
method Exploiting clean covariates to construct an estimator achieving better rates than Huber's model.
result Improved estimation rate even with constant contamination, achieving consistency.
Study tackles contamination and heterogeneity in multi-task learning, improving robustness and personalization.
problem Challenges in integrating related tasks due to contamination and heterogeneity.
method Proposes a filtering-based robust multi-task gradient descent method to estimate global and clean task-specific minimizers.
result Demonstrates improved robustness and personalization compared to existing methods.
Study on private and robust multi-armed bandits with contaminated heavy-tailed rewards.
problem Private and robust multi-armed bandits with contaminated heavy-tailed rewards.
method Proposed a meta-algorithm with a private and robust mean estimation sub-routine exttt{PRM}.
result Achieved nearly-optimal regret for two heavy-tailed settings.
Efficiently clusters data with weak assumptions, robust to contamination.
problem General-shaped clustering under weak parametric assumptions with data contamination.
method Two-step hybrid robust clustering algorithm combining trimmed k-means and hierarchical agglomeration.
result Outperforms state-of-the-art methods in various applications.
Study minimax robustness in statistical estimation under Wasserstein contamination.
problem Adversarial perturbations in statistical data.
method Developed minimax theory for ℓqr losses under Wasserstein-r contaminations. result Exact minimax risk identified for joint contaminations in location estimation and prediction in linear regression.
Paper proposes robust estimators for GANs under Wasserstein contamination.
problem Robust estimation of distributions under contamination.
method Wasserstein GAN-based estimators for location, covariance, and regression.
result Proposed estimators are minimax optimal in many scenarios.
Efficiently estimates mean in contaminated Gaussian data with near-optimal sample complexity.
problem Robust mean estimation in the presence of mean-shift contamination.
method First computationally efficient algorithm with near-optimal sample complexity and polynomial-time running.
result Approximates the target mean to any desired accuracy with constant fraction of outliers tolerated.
New winsorized mean improves robustness to up to 50% contamination.
problem Improving robustness of mean estimation in the presence of outliers.
method Outlyingness-induced winsorized mean approach.
result Achieves up to 50% contamination robustness with sub-Gaussian performance.
New algorithms improve robust estimation in contaminated Gaussian models.
problem Simultaneous estimation of location and variance matrix in contaminated Gaussian models.
method Tractable adversarial algorithms with spline discriminators for robust estimation.
result Achieve minimax optimal rates or near-optimal rates under Huber's contamination model.
New algorithms achieve optimal robustness in stochastic convex optimization under contamination.
problem Determining optimal rates for robust stochastic convex optimization under ε-contamination. method Developed novel algorithms achieving minimax-optimal excess risk under ε-contamination model without stringent assumptions. result Achieved minimax-optimal excess risk (up to logarithmic factors) under ε-contamination model. Study robustness of split conformal prediction in data contamination setting.
problem Robustness of split conformal prediction under data contamination.
method Analyze split conformal prediction's performance in a contaminated data setting and propose a new method.
result Demonstrated the impact of corrupted data on prediction intervals' coverage and efficiency.
Paper introduces MoM-KDE for robust density estimation robust to anomalous data.
problem Density estimation robustness to anomalous data.
method Combines Kernel Density Estimation and Median-of-Means principle.
result Achieves competitive results with lower computational complexity compared to other robust estimators.
Generative models can still learn from contaminated data, but with limitations.
problem How much contamination can generative models tolerate?
method Characterized robustness under contaminated enumerations, proving generation is achievable for all countable collections if contamination fraction converges to zero.
result Generation under contamination is achievable for all countable collections if contamination fraction converges to zero, but dense generation is strictly less robust.
Robust covariance testing requires significantly more samples in contaminated data.
problem Testing the covariance matrix of a high-dimensional Gaussian in the presence of contamination.
method We study the problem in the Huber's contamination model, distinguishing between the identity matrix and matrices far from it in Frobenius norm.
result The sample complexity of covariance testing increases dramatically to Ω(d2) in the contaminated setting. Algorithm identifies Pareto set in bandits with contaminated feedback.
problem Identifying Pareto set in multi-objective bandits with adversarial contamination.
method Sample median-based multi-objective adaptive elimination algorithm.
result Sample complexity bound that depends on contamination probability.
Robust estimators for Gaussian sparse tasks with optimal error under contamination.
problem Robust mean estimation, PCA, and linear regression in the presence of Huber contamination.
method Novel multidimensional filtering method for sparse regime.
result Optimal error guarantees within constant factors for Gaussian robust k-sparse mean estimation. New algorithm resists contamination in high-dimensional regression with optimal performance.
problem Adversarial and measurement errors in high-dimensional data.
method Adversarial Contamination-resistant Iterative Hard Thresholding (AC-IHT) algorithm.
result Achieves minimax near-optimal estimation and signal-adaptive support recovery.
Improved robust regression for heavy-tailed and contaminated data.
problem Linear regression with heavy-tailed and adversarially contaminated covariates and responses.
method Applying a filtering algorithm to covariates and then using Huber regression, least trimmed squares, or least absolute deviation estimators on the remaining data.
result Near-optimal error rates achieved for the Huber regression estimator.
Study improves robustness of Bayesian inference for cognitive models.
problem Outliers and contaminants affect parameter estimation in cognitive models.
method Robustness of parameter estimation using amortized Bayesian inference (ABI) with neural networks.
result Introducing contaminants from a Cauchy distribution increases robustness.
Unified framework improves neural network robustness against label noise and adversarial attacks.
problem High sensitivity of neural networks to data contamination, including label noises and adversarial perturbations.
method Unified minimum-divergence estimation problem, rSDNet framework.
result Improves robustness to label corruption and adversarial attacks while maintaining competitive accuracy on clean data.
Robustly aligns datasets with partial GW distance to handle contamination.
problem Aligning contaminated datasets using Gromov-Wasserstein distances.
method Proposes a partial GW distance estimator to minimize distortion from outliers.
result The partial GW distance estimator is minimax optimal and near-optimal in finite samples.
Develops a computationally tractable differentially private mean estimator called the balloon mean.
problem Robust mean estimation in the presence of outliers and heavy-tailed distributions.
method Iterative clipping procedure over Mahalanobis balls.
result Balloon mean is robust to outliers and outperforms existing estimators in contaminated settings.
New method calibrates ambiguity sets for robust decision-making under contamination.
problem Minimizing worst-case expected loss over distributional shifts in out-of-sample environments.
method Bulk-calibrated credal ambiguity sets that learn a high-mass bulk set from data and bound tail contributions.
result Closed-form, finite robust objective and tractable optimization for various losses and geometries.
New proof shows faster convergence rate for robust estimation with Lasso in adversarially contaminated outputs.
problem Robust estimation of parameters in the presence of adversarial output contamination.
method Extended Lasso with Huber loss function and L1 penalty, focusing on specific properties of the Huber function. result Same convergence rate as Dalalyan and Thompson (2019), but with a different proof.
Novel methods robustify Gromov-Wasserstein distance for cross-domain alignment.
problem Robustifying Gromov-Wasserstein distance for cross-domain alignment.
method Three novel techniques derived from robust statistics to improve GW and its variants.
result Empirical validation shows superior resilience to contamination.
A new robust time series distance metric for k-NN classification.
problem Robustness against arbitrary data contamination in time series classification.
method Proposes a novel distance metric with worst-case O(nlogn) complexity. result Demonstrates competitive classification accuracy in k-NN time series classification.
Paper shows MoM is optimal under adversarial contamination for certain distributions.
problem Optimality of MoM under adversarial contamination.
method Upper and lower bounds for MoM's error under adversarial contamination.
result MoM is (minimax) optimal for distributions with finite variance and infinite variance with finite absolute moments.
Replacing MSE with f-divergence in diffusion models improves robustness under data contamination.
problem Improving robustness of diffusion models under data contamination.
method Replacing MSE with f-divergence in diffusion models.
result Empirical improvement in performance under data contamination.
A new robust Wasserstein distance is proposed to handle outliers in probability distributions.
problem Outliers in probability distributions make Wasserstein distances sensitive and impractical.
method Introduces a new outlier-robust Wasserstein distance Wpε. result Achieves strong robust estimation guarantees under the Huber ε-contamination model. This paper studies robust regression in the settings of Huber's ε-contamination models. We consider estimators that are maximizers of multivariate regression depth functions. These estimators are shown to achieve minimax rates in the settings of ε-contamination models for various regression problems including nonpa…
New algorithm optimizes robust estimation under mixed local and global corruptions.
problem Combining local and global corruptions in robust statistics.
method Information-theoretic approach using sliced-Wasserstein metric.
result Optimal error achieved in polynomial time for stronger local perturbations.
A theory of cellwise contamination for compositional data using log-ratios.
problem Contamination in compositional data analysis.
method Develops a theory combining contamination model and propagation theorem.
result Reduction in cellwise breakdown value by (D−1)/D for certain estimators. We consider the dimensionality-reduction problem (finding a subspace approximation of observed data) for contaminated data in the high dimensional regime, where the number of observations is of the same magnitude as the number of variables of each observation, and the data set contains some (arbitrarily) corrupted obse…
This paper studies active learning in the context of robust statistics. Specifically, we propose a variant of the Best Arm Identification problem for \emph{contaminated bandits}, where each arm pull has probability ε of generating a sample from an arbitrary contamination distribution instead of the true und…
RKUM is an R package for robust kernel-based unsupervised methods.
problem Robust analysis under contaminated or noisy data conditions.
method Robust kernel covariance and cross-covariance operators using generalized loss functions.
result RKUM reduces sensitivity to contamination and effectively identifies outliers.
Study sample complexity of robust binary hypothesis testing under different contamination models.
problem Analyzing the sample complexity of robust binary hypothesis testing under various contamination models.
method Examined three standard contamination models: ε-additive (Huber), ε-subtractive, and ε-total variation (TV). Provided explicit formulas for least favourable distributions and compared sample complexities across models.
result Sample complexities are highly unstable in the contamination parameter ε and comparable up to constant-factor rescaling of ε across models.
We consider principal component analysis for contaminated data-set in the high dimensional regime, where the dimensionality of each observation is comparable or even more than the number of observations. We propose a deterministic high-dimensional robust PCA algorithm which inherits all theoretical properties of its ra…
The paper analyzes how conformal prediction works with contaminated reference data.
problem The impact of contamination on the validity and power of conformal prediction methods.
method The paper analyzes the impact of contamination on the validity of conformal methods and proposes a data-cleaning framework to enhance power.
result The proposed data-cleaning framework can effectively enhance power while maintaining type-I error control.
SHIFT improves robustness in estimating dose-response functions with heavy-tailed contamination.
problem Outliers bias estimates of average dose-response functions in heavy-tailed data.
method SHIFT combines cross-fit nuisance orthogonalization, Welsch-loss, and defensive OLS refit.
result SHIFT reduces RMSE from 1.03 to 0.33 on localized contamination test.
A new robust GP regression algorithm that trims outliers improves model accuracy.
problem Severe bias in GP regression due to data contamination by outliers.
method Iterative trimming of extreme data points.
result Significantly outperforms standard and robust GP variants in most test cases.
Survey of robust statistical methods for efficient computation.
problem Efficient robust statistical methods for various forms of data contamination and heavy-tailed distributions.
method Survey and technical connections between robustness forms, showing efficient algorithms.
result Same algorithmic ideas lead to efficient estimators for robustness in different settings.
To the best of our knowledge, there are no general well-founded robust methods for statistical unsupervised learning. Most of the unsupervised methods explicitly or implicitly depend on the kernel covariance operator (kernel CO) or kernel cross-covariance operator (kernel CCO). They are sensitive to contaminated data, …