Ilija Bogunovic

PROSAC: Provably Safe Certification for Machine Learning Models under Adversarial Attacks AAAI 2025 Right Now, Wrong Then: Non-Stationary Direct Preference Optimization under Preference Drift ICML 2025 Adversarially Robust Decision Transformer NeurIPS 2024 Distributionally Robust Model-based Reinforcement Learning with Large State Spaces AISTATS 2024 Group Robust Preference Optimization in Reward-free RLHF NeurIPS 2024 REDUCR: Robust Data Downsampling using Class Priority Reweighting NeurIPS 2024 Sample-efficient Bayesian Optimisation Using Known Invariances NeurIPS 2024 Efficient Planning in Combinatorial Action Spaces with Applications to Cooperative Multi-Agent Reinforcement Learning AISTATS 2023 Near-optimal Policy Identification in Active Reinforcement Learning ICLR 2023 A Robust Phased Elimination Algorithm for Corruption-Tolerant Gaussian Process Bandits NeurIPS 2022 Graph Neural Network Bandits NeurIPS 2022 Movement Penalized Bayesian Optimization with Application to Wind Energy Systems NeurIPS 2022 Combining Pessimism with Optimism for Robust and Efficient Model-Based Deep Reinforcement Learning ICML 2021 Misspecified Gaussian Process Bandit Optimization NeurIPS 2021 Online Submodular Resource Allocation with Applications to Rebalancing Shared Mobility Systems ICML 2021 Risk-averse Heteroscedastic Bayesian Optimization NeurIPS 2021 Stochastic Linear Bandits Robust to Adversarial Attacks AISTATS 2021 Contextual Games: Multi-Agent Learning with Side Information NeurIPS 2020 Corruption-Tolerant Gaussian Process Bandit Optimization AISTATS 2020 Distributionally Robust Bayesian Optimization AISTATS 2020 Learning to Play Sequential Games versus Unknown Opponents NeurIPS 2020 Mixed Strategies for Robust Optimization of Unknown Objectives AISTATS 2020 No-Regret Learning in Unknown Games with Correlated Payoffs NeurIPS 2019 Adversarially Robust Optimization with Gaussian Processes NeurIPS 2018 High-Dimensional Bayesian Optimization via Additive Models with Overlapping Groups AISTATS 2018 Robust Maximization of Non-Submodular Objectives AISTATS 2018 Lower Bounds on Regret for Noisy Gaussian Process Bandit Optimization COLT 2017 Robust Submodular Maximization: A Non-Uniform Partitioning Approach ICML 2017 Streaming Robust Submodular Maximization: A Partitioned Thresholding Approach NeurIPS 2017 An Efficient Streaming Algorithm for the Submodular Cover Problem NeurIPS 2016 Time-Varying Gaussian Process Bandit Optimization AISTATS 2016 Truncated Variance Reduction: A Unified Approach to Bayesian Optimization and Level-Set Estimation NeurIPS 2016 Near-Optimally Teaching the Crowd to Classify ICML 2014