worst-case guarantee

Algorithm Design and Stronger Guarantees for the Improving Multi-Armed Bandits Problem UAI 2026 Best-Effort Policies for Robust Markov Decision Processes AAAI 2026 Learning-Augmented Frequent Directions ICLR 2025 Optimal Zero-shot Regret Minimization for Selective Classification with Out-of-Distribution Detection UAI 2025 Robust Fair Clustering with Group Membership Uncertainty Sets AISTATS 2025 Causal Fairness under Unobserved Confounding: A Neural Sensitivity Framework ICLR 2024 Distribution Learning with Valid Outputs Beyond the Worst-Case NeurIPS 2024 Learning-Augmented Online Algorithm for Two-Level Ski-Rental Problem AAAI 2024 Localized Adaptive Risk Control NeurIPS 2024 Applied Online Algorithms with Heterogeneous Predictors ICML 2023 Optimal robustness-consistency tradeoffs for learning-augmented metrical task systems AISTATS 2023 Sorting and Hypergraph Orientation under Uncertainty with Predictions IJCAI 2023 Algorithms with Prediction Portfolios NeurIPS 2022 Differentially Private Approximate Quantiles ICML 2022 More Efficient Sampling for Tensor Decomposition With Worst-Case Guarantees ICML 2022 Robustness Guarantees for Credal Bayesian Networks via Constraint Relaxation over Probabilistic Circuits IJCAI 2022 Tight Lower Bounds on Worst-Case Guarantees for Zero-Shot Learning with Attributes NeurIPS 2022 Linear Models are Robust Optimal Under Strategic Behavior AISTATS 2021 Robust Learning-Augmented Caching: An Experimental Study ICML 2021 Sequential Random Sampling Revisited: Hidden Shuffle Method AISTATS 2021 The Importance of Pessimism in Fixed-Dataset Policy Optimization ICLR 2021 Certifiably Adversarially Robust Detection of Out-of-Distribution Data NeurIPS 2020 Learning Augmented Energy Minimization via Speed Scaling NeurIPS 2020 Beyond Confidence Regions: Tight Bayesian Ambiguity Sets for Robust MDPs NeurIPS 2019 Oracle Complexity of Second-Order Methods for Finite-Sum Problems ICML 2017