Skip to content
conftrace_

robust optimization

332 papers

RO

Papers

Fast Algorithms for L_∞-constrained S-rectangular Robust MDPs NeurIPS 2021 Fast Training of Provably Robust Neural Networks by SingleProp AAAI 2021 Fundamental Tradeoffs in Distributionally Adversarial Training ICML 2021 Generalised Lipschitz Regularisation Equals Distributional Robustness ICML 2021 Integrated Defense for Resilient Graph Matching ICML 2021 Monotonic Robust Policy Optimization with Model Discrepancy ICML 2021 Observation-Free Attacks on Stochastic Bandits NeurIPS 2021 On Lower Bounds for Standard and Robust Gaussian Process Bandit Optimization ICML 2021 On Robust Optimal Transport: Computational Complexity and Barycenter Computation NeurIPS 2021 Outlier-Robust Optimal Transport ICML 2021 Out-of-Distribution Generalization via Risk Extrapolation (REx) ICML 2021 Policy Gradient Bayesian Robust Optimization for Imitation Learning ICML 2021 Regularized Policies are Reward Robust AISTATS 2021 Reinforcement Learning for Route Optimization with Robustness Guarantees IJCAI 2021 Robust and Fully-Dynamic Coreset for Continuous-and-Bounded Learning (With Outliers) Problems NeurIPS 2021 Robust Bandit Learning with Imperfect Context AAAI 2021 Robust Learning for Data Poisoning Attacks ICML 2021 Robustness and scalability under heavy tails, without strong convexity AISTATS 2021 Robust Optimization for Multilingual Translation with Imbalanced Data NeurIPS 2021 RoMA: Robust Model Adaptation for Offline Model-based Optimization NeurIPS 2021 Sageflow: Robust Federated Learning against Both Stragglers and Adversaries NeurIPS 2021 Stable Adversarial Learning under Distributional Shifts AAAI 2021 Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021 To be Robust or to be Fair: Towards Fairness in Adversarial Training ICML 2021 Training Adversarially Robust Sparse Networks via Bayesian Connectivity Sampling ICML 2021