Toggle Poster Visibility
Oral
Tue Jul 19 11:30 PM -- 11:50 PM (KST) @ Room 309
Online Learning for Min Sum Set Cover and Pandora’s Box
Spotlight
Tue Jul 19 11:50 PM -- 11:55 PM (KST) @ Room 309
Smoothed Adversarial Linear Contextual Bandits with Knapsacks
Spotlight
Tue Jul 19 11:55 PM -- 12:00 AM (KST) @ Room 309
Simultaneously Learning Stochastic and Adversarial Bandits with General Graph Feedback
Spotlight
Wed Jul 20 12:00 AM -- 12:05 AM (KST) @ Room 309
Thompson Sampling for (Combinatorial) Pure Exploration
Spotlight
Wed Jul 20 12:05 AM -- 12:10 AM (KST) @ Room 309
Revisiting Online Submodular Minimization: Gap-Dependent Regret Bounds, Best of Both Worlds and Adversarial Robustness
Spotlight
Wed Jul 20 12:10 AM -- 12:15 AM (KST) @ Room 309 None
Rotting Infinitely Many-Armed Bandits
Oral
Wed Jul 20 12:15 AM -- 12:35 AM (KST) @ Room 309
Batched Dueling Bandits
Spotlight
Wed Jul 20 12:35 AM -- 12:40 AM (KST) @ Room 309
Equivalence Analysis between Counterfactual Regret Minimization and Online Mirror Descent
Spotlight
Wed Jul 20 12:40 AM -- 12:45 AM (KST) @ Room 309
Consistent Polyhedral Surrogates for Top-k Classification and Variants
Spotlight
Wed Jul 20 12:45 AM -- 12:50 AM (KST) @ Room 309
Stochastic Contextual Dueling Bandits under Linear Stochastic Transitivity Models
[
Paper PDF]
Spotlight
Wed Jul 20 12:50 AM -- 12:55 AM (KST) @ Room 309
Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits
Spotlight
Wed Jul 20 12:55 AM -- 01:00 AM (KST) @ Room 309
Online Nonsubmodular Minimization with Delayed Costs: From Full Information to Bandit Feedback
Successful Page Load