conftrace_

Ilija Bogunovic

33 papers · 2014–2025 · 6 conferences · across top CS/AI conferences

Achievements

Jump to papers ↓
+11 more ↓ 🐣 Hot Topic Early Bird πŸŒ‰ Interdisciplinary Bridge πŸ—ΊοΈ Taxonomy Completionist (12) 🧭 Keyword Pioneer 🌍 Conference Polyglot (6)
🐣 Hot Topic Early Bird 🐝 Cross-Pollinator (13) 🌈 Renaissance Researcher (6) 🀝 Dynamic Duo (18) πŸ† Grand Slam πŸ”¬ Deep Specialist (10) πŸ’Ž Century Club (33) ⚑ Prolific Year (5) πŸ—ƒοΈ Keyword Collector (142) πŸ“ˆ Trend Setter πŸ”₯ Unstoppable (10)

Conferences

NIPS (16) AISTATS (9) ICML (5) AAAI (1) COLT (1) ICLR (1)

Papers

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