Paper shows robust estimators converge to true risk minimizers at optimal rates.
problem Understanding asymptotic properties of robust risk minimizers.
method Investigates robust analogues of empirical risk minimization, focusing on median of means estimator.
result Robust minimizers converge to true minimizers at optimal rates and have similar asymptotic variance.
The paper proves deep learning can be robust with certain loss functions.
problem The robustness of deep learning models under flawed data.
method Empirical-risk minimization with unbounded, Lipschitz-continuous loss functions.
result These loss functions provide efficient prediction under minimal data assumptions.
Paper tackles heavy-tailed data without finite variance, proposing robust risk minimization.
problem Empirical risk minimization under heavy-tailed data with finite p-th moment. method Minimizes risk values robustly estimated via Catoni's method, using generalized generic chaining.
result Shows better performance of optimizer based on empirical risks via Catoni-style estimation.
New method uses robust estimators for Newton's method in empirical risk minimization.
problem Improving robustness in empirical risk minimization.
method Robust Newton's method with gradient and Hessian replaced by robust estimators.
result Faster convergence rates in high-dimensional settings.
We propose a robust risk measurement approach that minimizes the expectation of overestimation plus underestimation costs. We consider uncertainty by taking the supremum over a collection of probability measures, relating our approach to dual sets in the representation of coherent risk measures. We provide results that…
Online TERM improves robustness and fairness in streaming data.
problem Streaming data's lack of worst-case fairness and robustness in ERM.
method Proposes an online TERM formulation to balance average-case accuracy with worst-case fairness and robustness.
result Negative tilting effectively suppresses outlier influence, positive tilting improves recall with minimal precision loss.
Paper introduces novel model selection for CRO to balance robustness and decision risk.
problem Balancing robustness and decision risk in CRO.
method Conformalized Robust Optimization with Model Selection (CROMS) framework.
result Significant improvements in decision efficiency across various applications.
We consider a general statistical learning problem where an unknown fraction of the training data is corrupted. We develop a robust learning method that only requires specifying an upper bound on the corrupted data fraction. The method minimizes a risk function defined by a non-parametric distribution with unknown prob…
New framework for conditional risk minimization using optimal transport.
problem High-stakes decisions with side information, especially economic conditions.
method Universal framework based on union-ball formulation in optimal transport.
result Offers interpretability, tractability, and scalability for various risk functionals.
New method reduces sample complexity for robust learning.
problem Developing simple, sample-efficient learning algorithms for robust classification.
method Tolerant empirical risk minimization (RERM) for robust learning.
result Tolerant RERM requires only O(VC(H)dlog(D/γδ)/ε^2) samples for robustness regions of diameter D.
This paper investigates robust versions of the general empirical risk minimization algorithm, one of the core techniques underlying modern statistical methods. Success of the empirical risk minimization is based on the fact that for a "well-behaved" stochastic process {f(X), f∈F} indexed b…
Develops a robust learning method for unknown context distributions.
problem Learning from data in different, unknown contexts.
method Focuses on excess risks, constructs distribution sets with statistical coverage.
result Shows robustness in worst-case scenarios without sacrificing nominal performance.
Simplifies risk minimization combining mean and standard deviation.
problem Minimizing mean and standard deviation under heavy-tailed losses.
method Adapting robust mean estimation technique to include standard deviation.
result Simple approach performs as well or better than alternative risk criteria.
Paper proposes a new method for WDRO with local perturbations, achieving better accuracy.
problem Wasserstein distributionally robust optimization's theoretical understanding needs improvement.
method Develops a new approximation theorem and risk consistency results for WDRO.
result The proposed method achieves significantly higher accuracy on noisy datasets.
The paper sets lower bounds for adversarial robustness in multiclass classification.
problem Adversarial robustness in multiclass classification with arbitrary loss functions.
method Dual and barycentric reformulations for robust risk minimization.
result Sharp lower bounds for adversarial risks are computed efficiently.
The problem of data uncertainty has motivated the incorporation of robust optimization in various arenas, beyond the Markowitz portfolio optimization. This work presents the extension of the robust optimization framework for the minimization of downside risk measures, such as Value-at-Risk (VaR) and Conditional Value-a…
Study improves adversarial classification using distributionally robust models.
problem Improving robustness against adversarial attacks in classification models.
method Distributionally robust chance constraints with Wasserstein ambiguity, reformulated as a regularized ramp loss minimization problem.
result Standard descent methods can converge to the global minimizer for the distributionally robust adversarial classification model.
MRCpy implements minimax risk classifiers with performance guarantees and distribution shift adaptability.
problem Classical risk minimization approaches are not robust to distribution shifts.
method Robust risk minimization approach for minimax risk classifiers.
result MRCs provide performance guarantees and adapt to distribution shifts.
Study generalizes property elicitation to imprecise probabilities.
problem Minimizing risk over imprecise probability distributions.
method Maximin risk minimization over a set of imprecise probabilities.
result Conditions for elicitability of IP-properties.
This study connects Jacobian regularization to adversarial robustness and improves generalization.
problem Adversarial attacks make deep neural networks vulnerable.
method Developed a connection between Jacobian regularization and adversarial training, and established robust generalization gaps.
result Jacobian norms are related to both standard and robust generalization.
We tackle imbalanced classification by weighting losses and derive robust risks.
problem Imbalanced classification where a label has low marginal probability.
method We examine convergence rates of weighted risks, define robust risks, and derive new robust risk problems.
result We show that particular weightings lead to conditional value at risk (CVaR) and derive new robust risk problems.
This work analyzes CVaR under heavy-tailed data, providing generalization and robustness bounds.
problem Understanding CVaR's behavior under heavy-tailed data and rare high-impact losses.
method Learning-theoretic analysis of CVaR-based empirical risk minimization.
result Sharp, high-probability generalization and excess risk bounds under minimal moment assumptions.
Proposes methods to learn from biased samples, ensuring robust decision rules.
problem Learning from biased samples can lead to poor performance in real-world applications.
method Modeling sampling bias, using distributionally robust optimization and deep learning.
result Proposes a method to minimize worst-case risk under various test distributions.
This manuscript introduces the idea of using Distributionally Robust Optimization (DRO) for the Counterfactual Risk Minimization (CRM) problem. Tapping into a rich existing literature, we show that DRO is a principled tool for counterfactual decision making. We also show that well-established solutions to the CRM probl…
Bayesian nonparametrics improves data-driven risk optimization under distributional uncertainty.
problem Improving out-of-sample performance in machine learning models due to distributional uncertainty.
method Combining Bayesian nonparametric theory and decision-theoretic preferences to propose a robust optimization criterion.
result The proposed robust optimization procedure provides favorable statistical guarantees and tractable approximations.
New method improves adversarial robustness of neural networks.
problem Vulnerability of neural networks to adversarial attacks.
method Integrates φ-divergence regularization into distributionally robust risk function.
result Achieves near-optimal sample complexity with efficient stochastic gradient methods.
This paper analyzes risk-sensitive reinforcement learning with Conditional Value-at-Risk (CVaR) for robust Markov Decision Processes.
problem Risk-sensitive reinforcement learning for robust Markov Decision Processes (RMDPs) with state-action-dependent ambiguity sets.
method The paper establishes a connection between robustness and risk sensitivity, defining a new risk measure NCVaR and proposing value iteration algorithms.
result The proposed approach using NCVaR optimization and value iteration algorithms can solve problems with state-action-dependent ambiguity sets.
Paper bounds convergence rate of adversarial surrogate risk.
problem Vulnerability of binary classification models to adversarial attacks.
method Characterizes conditions for adversarial consistency and provides surrogate risk bounds.
result Surrogate risk bounds quantify the rate of convergence of adversarial classification risk.
Investigates model risk and semi-static hedging for martingale constrained models.
problem Model risk distributionally robust sensitivities for functionals on the Wasserstein space.
method Introduces distributionally robust problem with semi-static hedging strategies.
result Explicit characterizations of model risk optimal semi-static hedging strategies.
We provide a new computationally-efficient class of estimators for risk minimization. We show that these estimators are robust for general statistical models: in the classical Huber epsilon-contamination model and in heavy-tailed settings. Our workhorse is a novel robust variant of gradient descent, and we provide cond…
The paper introduces a new measure of robustness for partially identifiable risks.
problem Achieving robustness when the robust risk is only partially identified.
method Introduces the worst-case robust risk and evaluates existing methods.
result Existing robustness methods are suboptimal in the partially identifiable case.
Deep neural networks reduce portfolio tail-risk by 99% in crisis-era simulations.
problem Managing tail risk in financial portfolios.
method Parameterizing convex-risk minimization with deep neural networks.
result Significant reduction in one-day 99% CVaR.
Unified framework TERM improves fairness and robustness.
problem Outliers and subgroup fairness in empirical risk minimization.
method Unified framework TERM with a hyperparameter tilt.
result TERM improves fairness and robustness.
MetaPhysiCa tackles robust physics-informed machine learning for OOD tasks.
problem Designing robust PIML methods for OOD forecasting tasks in physics.
method Meta-learning procedure for causal structure discovery including invariant risk minimization.
result Significantly outperforms existing PIML and deep learning methods in OOD tasks.
The paper develops fair machine learning models using causal path-specific effects.
problem Fairness in machine learning models under causal constraints.
method Lagrange multiplier approach for infinite-dimensional functional estimation, closed-form solutions for constrained optimization.
result Theoretical and flexible semiparametric estimation strategies for fair predictions.
We develop robust Markov Decision Processes with risk measures for uncertain environments.
problem Uncertainty in Markov Decision Processes and its impact on risk measures.
method Formulation as a Stackelberg game, robust cost and value iterations, existence of optimal policies.
result Existence of deterministic optimal policies for robust optimization and risk measures.
Paper introduces a method to create robust representations against covariate shifts.
problem Distribution shift between training and testing data in machine learning.
method Introduces a variational objective with two components: discriminative representation and invariant support.
result Optimal representations ensure robustness to covariate shifts, improving performance on DomainBed.
Adversarial consistency depends on the uniqueness of adversarial Bayes classifiers.
problem Consistency of adversarial surrogate losses is not guaranteed.
method Connected consistency of adversarial surrogate losses to the uniqueness of adversarial Bayes classifiers.
result A convex surrogate loss is statistically consistent for adversarial learning if and only if the adversarial Bayes classifier is unique.
This work evaluates risks over time using robust measures and neural networks.
problem Distributionally robust risk evaluation over temporal data.
method Characterizes alternative measures using causal optimal transport, approximates test functions by neural networks, and proves sample complexity.
result Framework outperforms classic counterparts in portfolio selection problems.
Robust MCVaR portfolio optimization using RKHS for risk management.
problem Minimizing portfolio risk while achieving higher returns under uncertainty.
method Introduces a robust MCVaR model with ellipsoidal support and RKHS uncertainty set for chance constraint.
result Robust model outperforms nominal and market portfolios in various market conditions.
Bayesian Robust Optimization for Imitation Learning (BROIL) balances risk and reward.
problem Learning robust policies for new states in imitation learning.
method Bayesian reward function inference and user-specific risk tolerance.
result BROIL outperforms risk-sensitive and risk-neutral algorithms.
Paper introduces robust kernel ridge regression using Cauchy loss for handling various noise types.
problem Developing robust regression methods for noisy data.
method Introduces kernel Cauchy ridge regressor (KCRR) using Cauchy loss function.
result Establishes almost minimax-optimal convergence rate for KCRR in terms of L2-risk. Label aggregation makes learning robust to noisy labels.
problem Learning from noisy labels.
method Label aggregation and risk consistency.
result Aggregated labels lead to stronger consistency guarantees.
Optimal decision-making using prediction sets to minimize risk.
problem Using prediction sets optimally for decision-making in uncertain scenarios.
method Decision-theoretic framework that seeks to minimize expected loss against a worst-case distribution.
result ROCP algorithm reduces critical mistakes compared to baselines, especially in costly out-of-set errors.
RAD improves robustness to domain annotation noise without explicit domain annotations.
problem Robustness to domain annotation noise in training data.
method Regularized Annotation of Domains (RAD) for last layer retraining.
result RAD outperforms state-of-the-art methods even with 5% noise in training data.
This work tackles robust multi-source domain adaptation under label shift.
problem Label shift and data contamination in multi-source domain adaptation.
method Domain-weighted empirical risk minimization framework with refinement procedure.
result The proposed method achieves superior performance in multi-category classification problems.
New framework calibrates decision robustness using inverse conformal risk control.
problem Inadequate robustness levels in decision-making due to ad hoc choices.
method Constructs valid estimators to trace miscoverage-regret Pareto frontier.
result Provides distribution-free, finite-sample guarantees on robustness levels.
New method optimizes risk estimation for financial losses.
problem Estimating expected shortfall risk for heavy-tailed distributions.
method Proposes a novel estimator for expected shortfall robust to data corruption.
result Demonstrates superior performance and robustness compared to classical methods.