← Authors

Wouter M. Koolen

32 papers · 2011–2023 · 3 conferences · across top CS/AI conferences

Achievements

πŸ—ΊοΈ Taxonomy Completionist (15) 🐣 Hot Topic Early Bird 🐝 Cross-Pollinator (15) 🌍 Conference Polyglot (3) πŸƒ Academic Marathon (12) 🧭 Keyword Pioneer πŸŒ‰ Interdisciplinary Bridge πŸ”¬ Deep Specialist (18) πŸ† Keyword Champion (2) πŸ—ƒοΈ Keyword Collector (138) πŸ“ˆ Trend Setter πŸ’Ž Century Club (32) πŸ”₯ Unstoppable (13) ⚑ Prolific Year (5)

Conferences

NIPS (18) COLT (10) JMLR (4)

Top co-authors

Tim van Erven (8) Manfred K. Warmuth (5) Alan Malek (5) Emilie Kaufmann (4) AurΓ©lien Garivier (3) Peter GrΓΌnwald (3) Peter L. Bartlett (3) Shubhada Agrawal (2) RΓ©my Degenne (2) Dmitry Adamskiy (2)

Research topics

Statistics (1)

Keywords

regret bound (14) online learning (13) multi-armed bandit (10) learning rate (5) expert advice (4) game theory (4) adversarial learning (3) sequential testing (3) regret minimization (3) online convex optimization (3) stochastic optimization (3) pure exploration (3) sample complexity (2) minimax regret (2) learning theory (2) hedge algorithm (2) minimax optimization (2) isotonic regression (2) minimax strategy (2) adaptive learning rate (2)

Papers

Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games NIPS 2023
Luckiness in Multiscale Online Learning NIPS 2022
Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals JMLR 2021
A/B/n Testing with Control in the Presence of Subpopulations NIPS 2021
Optimal Best-Arm Identification Methods for Tail-Risk Measures NIPS 2021
Regret Minimization in Heavy-Tailed Bandits COLT 2021
MetaGrad: Adaptation using Multiple Learning Rates in Online Learning JMLR 2021
Lipschitz and Comparator-Norm Adaptivity in Online Learning COLT 2020
Open Problem: Fast and Optimal Online Portfolio Selection COLT 2020
Non-Asymptotic Pure Exploration by Solving Games NIPS 2019
Pure Exploration with Multiple Correct Answers NIPS 2019
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling NIPS 2018
Monte-Carlo Tree Search by Best Arm Identification NIPS 2017
Random Permutation Online Isotonic Regression NIPS 2017
Online Isotonic Regression COLT 2016
Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning NIPS 2016
MetaGrad: Multiple Learning Rates in Online Learning NIPS 2016
A Closer Look at Adaptive Regret JMLR 2016
Maximin Action Identification: A New Bandit Framework for Games COLT 2016
Minimax Time Series Prediction NIPS 2015
Open Problem: Online Sabotaged Shortest Path COLT 2015
Minimax Fixed-Design Linear Regression COLT 2015
Second-order Quantile Methods for Experts and Combinatorial Games COLT 2015
Open Problem: Shifting Experts on Easy Data COLT 2014
Efficient Minimax Strategies for Square Loss Games NIPS 2014
Learning the Learning Rate for Prediction with Expert Advice NIPS 2014
Follow the Leader If You Can, Hedge If You Must JMLR 2014
The Pareto Regret Frontier NIPS 2013
Learning a set of directions COLT 2013
Putting Bayes to sleep NIPS 2012
Learning Eigenvectors for Free NIPS 2011
Adaptive Hedge NIPS 2011