| Stochastic Linear Bandits Robust To Adversarial Attacks | 0 | 0.34 | 2021 |
| Misspecified Gaussian Process Bandit Optimization. | 0 | 0.34 | 2021 |
| Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems | 0 | 0.34 | 2021 |
| Risk-averse Heteroscedastic Bayesian Optimization. | 0 | 0.34 | 2021 |
| Combining Pessimism With Optimism For Robust And Efficient Model-Based Deep Reinforcement Learning | 0 | 0.34 | 2021 |
| Contextual Games: Multi-Agent Learning with Side Information | 0 | 0.34 | 2020 |
| Learning to Play Sequential Games versus Unknown Opponents | 0 | 0.34 | 2020 |
| No-Regret Learning in Unknown Games with Correlated Payoffs | 0 | 0.34 | 2019 |
| Overlapping Multi-Bandit Best Arm Identification | 0 | 0.34 | 2019 |
| Adversarially Robust Optimization with Gaussian Processes. | 0 | 0.34 | 2018 |
| A Distributed Algorithm For Partitioned Robust Submodular Maximization | 0 | 0.34 | 2017 |
| Robust Submodular Maximization: A Non-Uniform Partitioning Approach. | 2 | 0.40 | 2017 |
| Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization. | 2 | 0.39 | 2017 |
| Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach | 0 | 0.34 | 2017 |
| Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation. | 1 | 0.35 | 2016 |
| Time-Varying Gaussian Process Bandit Optimization. | 2 | 0.42 | 2016 |
| An Efficient Streaming Algorithm for the Submodular Cover Problem. | 0 | 0.34 | 2016 |
| Learning-based Compressive Subsampling | 3 | 0.37 | 2015 |
| Active Learning Of Self-Concordant Like Multi-Index Functions | 0 | 0.34 | 2015 |
| Near-Optimally Teaching the Crowd to Classify. | 19 | 0.67 | 2014 |
