A new framework for performative prediction robust to distributional misspecification.
problem Performative prediction models can be influenced by their own predictions, leading to suboptimal outcomes.
method Introduces distributionally robust performative prediction (DRPO) to approximate the true performative optimum (PO) robustly.
result DRPO provides provable guarantees as a robust approximation to the true PO when the nominal distribution map is misspecified.
This work improves certifiably robust models by distilling knowledge from adversarially robust teachers.
problem Certifiably robust models suffer from poor standard performance.
method Knowledge distillation from adversarially robust teachers to improve standard performance.
result Distillation from adversarially robust teachers consistently improves certified training performance.
Paper presents robust boosting methods for label noise.
problem Boosting methods degrade in noisy environments.
method Robust Minimax Boosting (RMBoost) with theoretical guarantees.
result RMBoost provides strong classification accuracy and robustness.
The paper tackles robust reinforcement learning with performance guarantees.
problem Finding a robust policy for RMDP with state space uncertainties.
method Proposes RLSPI algorithm for learning optimal robust policy with performance bounds.
result Demonstrates the performance of RLSPI on standard benchmark problems.
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.
Framework learns robust control policies from expert demonstrations.
problem Adversarial robustness and closed-loop generalization in feedback control policies.
method Lipschitz-constrained loss minimization for certified robustness and generalization.
result Finite sample bound on policy learning error and robust closed-loop stability.
The vulnerability to slight input perturbations is a worrying yet intriguing property of deep neural networks (DNNs). Despite many previous works studying the reason behind such adversarial behavior, the relationship between the generalization performance and adversarial behavior of DNNs is still little understood. In …
New mechanisms from primate vision improve neural network robustness.
problem Demonstrating robust neural networks to small adversarial perturbations.
method Investigated two biologically plausible mechanisms: non-uniform retina sampling and receptive field diversity.
result Non-uniform retina sampling and receptive field diversity improve adversarial robustness.
Proposes a new framework for balancing average- and worst-case performance in machine learning.
problem Robustness issues in machine learning, especially in safety-critical domains.
method Probabilistic robustness framework that balances average- and worst-case performance.
result Effective algorithm balances average- and worst-case performance with lower computational cost.
The study assesses ML model robustness under worst-case subpopulations.
problem ML model performance degradation under non-training population.
method Two-stage estimation procedure for evaluating worst-case robustness over subpopulations.
result The method certifies model robustness and prevents unreliable deployments.
Adversarial robustness improved by abstaining from decisions.
problem Improving classification accuracy in the presence of adversarial perturbations.
method Introducing an abstain option in binary classification problems, using metrics to quantify performance and robustness.
result There is a tradeoff between nominal performance and adversarial robustness.
Previous work on adversarially robust neural networks for image classification requires large training sets and computationally expensive training procedures. On the other hand, few-shot learning methods are highly vulnerable to adversarial examples. The goal of our work is to produce networks which both perform well a…
Ditto improves fairness and robustness in federated learning.
problem Fairness and robustness in statistically heterogeneous federated learning networks.
method Personalized federated learning framework (Ditto) with a scalable solver.
result Ditto achieves competitive performance and superior fairness and robustness compared to existing methods.
Paper studies robust MDPs, improving sample complexity and asymptotic performance.
problem Optimal robust policy and value function in robust MDPs with generative models.
method Improves prior results on non-asymptotic and asymptotic performances of robust MDPs, considering various uncertainty sets.
result Improved sample complexity and asymptotic normality of optimal robust value function.
The emergence of robust optimization has been driven primarily by the necessity to address the demerits of the Markowitz model. There has been a noteworthy debate regarding consideration of robust approaches as superior or at par with the Markowitz model, in terms of portfolio performance. In order to address this skep…
New robustness certificates for streaming models with a sliding window.
problem Applying robustness certificates to streaming data with correlated inputs.
method Deriving robustness certificates for models using a sliding window over a sequence of potentially correlated inputs.
result Guarantees hold for the average model performance across the entire stream, independent of stream size.
A common goal in statistics and machine learning is to learn models that can perform well against distributional shifts, such as latent heterogeneous subpopulations, unknown covariate shifts, or unmodeled temporal effects. We develop and analyze a distributionally robust stochastic optimization (DRO) framework that lea…
New method improves robustness of smoothed classifiers against adversarial attacks.
problem Improving robustness of smoothed classifiers against adversarial attacks.
method Proposes worst-case adversarial loss over input distributions as a robustness certificate, and uses duality and smoothness properties to provide an easy-to-compute upper bound.
result Shows superior robustness performance over state-of-the-art certified or heuristic methods.
Proposes robust model through Wasserstein geodesic interpolation of training data.
problem Improving model robustness through data augmentation.
method Augment data by finding worst-case Wasserstein barycenter on geodesic path.
result Improves robustness on CIFAR-10 up to 7.7% and on CIFAR-100 up to 16.8%.
The DoD needs a robust process to evaluate AI/ML model performance and robustness.
problem AI/ML models are brittle and nonrobust, posing risks in national security.
method Reviews AI/ML development process and best practices for evaluation.
result Recommendations for DoD evaluators to ensure robust AI/ML capabilities.
We provide a framework for incorporating robustness -- to perturbations in the transition dynamics which we refer to as model misspecification -- into continuous control Reinforcement Learning (RL) algorithms. We specifically focus on incorporating robustness into a state-of-the-art continuous control RL algorithm call…
Develops robust MDPs for unknown disturbances with performance guarantees.
problem Unknown disturbance distribution in MDPs.
method Empirical distribution, sublevel set of distance function, weak convergence, concentration inequality.
result Robust optimal value function converges to true optimal value function with increasing sample sizes.
Extends ML fairness to handle minority groups over time.
problem Limitations of existing fairness criteria.
method Performative Distributionally Robust Optimization.
result Improves fairness for minority groups over time.
Adversarial robustness has emerged as an important topic in deep learning as carefully crafted attack samples can significantly disturb the performance of a model. Many recent methods have proposed to improve adversarial robustness by utilizing adversarial training or model distillation, which adds additional procedure…
Proposes robust ITRs integrating multiple datasets to handle posterior shift.
problem Posterior shift in conditional outcome distributions between source and target populations.
method Distributionally robust approach with closed-form solution and adaptive uncertainty tuning.
result Achieves superior performance compared to existing methods in simulations and real-data applications.
ART improves transfer learning performance with robust theory and methods.
problem Improving performance of primary tasks using auxiliary data.
method Adaptive Robust Transfer Learning (ART) pipeline with theoretical guarantees.
result ART provides a provable theoretical guarantee for adaptive transfer and robustness.
The paper solves investment problems with uncertain factors using game theory.
problem Optimal forward investment in an incomplete market with model uncertainty.
method Combining stochastic differential games and ergodic BSDE approach.
result Representation of robust forward performance processes in factor form.
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.
Study uses RL to hedge financial derivatives, showing robust strategies outperform non-robust ones.
problem Risk mitigation and gain-seeking in hedging path-dependent financial derivatives.
method Robust risk-aware reinforcement learning (RL) with policy gradient approach.
result Robust hedging strategies outperform non-robust ones under varying data generating processes.
We propose a robust elastic net (REN) model for high-dimensional sparse regression and give its performance guarantees (both the statistical error bound and the optimization bound). A simple idea of trimming the inner product is applied to the elastic net model. Specifically, we robustify the covariance matrix by trimm…
Replicated and validated Rank-N-Contrast for robust regression.
problem Deep regression models struggle with continuous sample orders.
method Contrastive learning of continuous representations by ranking samples.
result Improved performance and robustness of RNC framework.
We study the robustness of active learning (AL) algorithms against prior misspecification: whether an algorithm achieves similar performance using a perturbed prior as compared to using the true prior. In both the average and worst cases of the maximum coverage setting, we prove that all α-approximate algorithms are …
New approach connects reinforcement learning robustness and regularization.
problem Dealing with external uncertainty in reinforcement learning.
method Introducing Wasserstein distributionally robust MDPs and a new regularizer.
result Established a dual relation between robust MDPs and regularization.
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…
TAROT enhances robustness and domain adaptability with domain-invariant features.
problem Developing models robust to adversarial attacks across diverse domains.
method Derives a new generalization bound and proposes TAROT algorithm.
result TAROT outperforms state-of-the-art methods in accuracy and robustness.
Adversarially robust models transfer better than standard models in image classification.
problem Improving transfer learning performance in image classification.
method Focused on adversarially robust ImageNet classifiers, compared to standard models.
result Adversarially robust models yield improved accuracy on downstream classification tasks.
We argue that robustness of explanations---i.e., that similar inputs should give rise to similar explanations---is a key desideratum for interpretability. We introduce metrics to quantify robustness and demonstrate that current methods do not perform well according to these metrics. Finally, we propose ways that robust…
Study shows how pretraining robustness transfers to downstream tasks.
problem Understanding how robustness is transferred from pretraining to downstream tasks.
method Theoretical analysis and practical validation of robustness constraints.
result Robustness of a linear predictor on downstream tasks can be constrained by the robustness of its underlying representation.
Safe reinforcement learning framework using optimal transport for robustness.
problem Robustness and safety in deep reinforcement learning with limited data assumptions.
method Optimal transport perturbations to construct worst-case virtual state transitions.
result Significantly improved safety at deployment time compared to standard methods.
Heterophily affects GNN robustness; separating ego- and neighbor-embeddings improves defense.
problem The robustness of GNNs to adversarial attacks.
method Formalized relation between heterophily and GNN robustness; empirical analysis; design principles for improved robustness.
result Separating ego- and neighbor-embeddings increases GNN robustness.
Robust deep neural networks estimate multi-dimensional functional data robustly.
problem Estimating location function from multi-dimensional functional data robustly.
method Deep neural networks with ReLU activation, robust to outliers and model misspecification.
result Uniform convergence rates for robust deep neural network estimators.
We study the problem of off-policy critic evaluation in several variants of value-based off-policy actor-critic algorithms. Off-policy actor-critic algorithms require an off-policy critic evaluation step, to estimate the value of the new policy after every policy gradient update. Despite enormous success of off-policy …
State-of-the art vision models can achieve superhuman performance on image classification tasks when testing and training data come from the same distribution. However, when models are tested on corrupted images (e.g. due to scale changes, translations, or shifts in brightness or contrast), performance degrades signifi…
Improves robust transfer learning with side information.
problem Addressing environmental shift in MDPs with side information.
method Estimate-centered uncertainty sets with side information integration.
result Improved robust policy with reduced sub-optimality gap.
AlphaSharpe uses LLMs to improve financial metrics robustness and predictive power.
problem Traditional financial metrics struggle with robustness and generalization in volatile markets.
method Iterative optimization of financial metrics using LLMs, including crossover, mutation, and evaluation.
result AlphaSharpe discovers enhanced risk-return metrics with 3x predictive power and 2x portfolio performance.
Study improves portfolio risk estimation methods using robust covariance and CVaR constraints.
problem Improving portfolio risk estimation in the presence of financial data noise and extreme market conditions.
method Exploration of robust covariance estimators, application of CVaR constraints, use of K-means clustering in optimization.
result Robust covariance estimators can outperform market-weighted benchmarks, especially during bull markets.
Paper develops a robust federated recommendation system against poisoning attacks.
problem Low-cost poisoning attacks degrade federated recommendation systems' performance.
method Develops a robust learning strategy using gradients to filter out Byzantine clients.
result Empirically validated robust learning strategy on four datasets.
New measure assesses deep neural networks' robustness to adversarial attacks.
problem Deep learning's fragility to adversarial attacks limits its adoption in mission-critical applications.
method Introduces residual error as a new performance measure for assessing adversarial robustness.
result Demonstrates effectiveness of residual error in assessing robustness of deep neural networks.