Wouter M. Koolen

Orcid: 0000-0002-1053-6701

According to our database1, Wouter M. Koolen authored at least 59 papers between 2008 and 2024.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Sequential learning of the Pareto front for multi-objective bandits.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2024

2023
Hebbian learning inspired estimation of the linear regression parameters from queries.
CoRR, 2023

Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games.
Proceedings of the Advances in Neural Information Processing Systems 36: Annual Conference on Neural Information Processing Systems 2023, 2023

2022
Testing exchangeability: Fork-convexity, supermartingales and e-processes.
Int. J. Approx. Reason., 2022

Log-optimal anytime-valid E-values.
Int. J. Approx. Reason., 2022

A composite generalization of Ville's martingale theorem.
CoRR, 2022

Luckiness in Multiscale Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

2021
Mixture Martingales Revisited with Applications to Sequential Tests and Confidence Intervals.
J. Mach. Learn. Res., 2021

MetaGrad: Adaptation using Multiple Learning Rates in Online Learning.
J. Mach. Learn. Res., 2021

How can one test if a binary sequence is exchangeable? Fork-convex hulls, supermartingales, and Snell envelopes.
CoRR, 2021

A/B/n Testing with Control in the Presence of Subpopulations.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Optimal Best-Arm Identification Methods for Tail-Risk Measures.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Robust Online Convex Optimization in the Presence of Outliers.
Proceedings of the Conference on Learning Theory, 2021

Regret Minimization in Heavy-Tailed Bandits.
Proceedings of the Conference on Learning Theory, 2021

2020
Safe Testing.
Proceedings of the Information Theory and Applications Workshop, 2020

Structure Adaptive Algorithms for Stochastic Bandits.
Proceedings of the 37th International Conference on Machine Learning, 2020

Lipschitz and Comparator-Norm Adaptivity in Online Learning.
Proceedings of the Conference on Learning Theory, 2020

Open Problem: Fast and Optimal Online Portfolio Selection.
Proceedings of the Conference on Learning Theory, 2020

2019
Non-Asymptotic Pure Exploration by Solving Games.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Pure Exploration with Multiple Correct Answers.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Efficient Algorithms for Minimax Decisions Under Tree-Structured Incompleteness.
Proceedings of the Symbolic and Quantitative Approaches to Reasoning with Uncertainty, 2019

Lipschitz Adaptivity with Multiple Learning Rates in Online Learning.
Proceedings of the Conference on Learning Theory, 2019

2018
Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling.
Proceedings of the Advances in Neural Information Processing Systems 31: Annual Conference on Neural Information Processing Systems 2018, 2018

2017
Random Permutation Online Isotonic Regression.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

Monte-Carlo Tree Search by Best Arm Identification.
Proceedings of the Advances in Neural Information Processing Systems 30: Annual Conference on Neural Information Processing Systems 2017, 2017

2016
A Closer Look at Adaptive Regret.
J. Mach. Learn. Res., 2016

Robust probability updating.
Int. J. Approx. Reason., 2016

Robust and Adaptive Methods for Sequential Decision Making.
ERCIM News, 2016

Online Isotonic Regression.
CoRR, 2016

Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

MetaGrad: Multiple Learning Rates in Online Learning.
Proceedings of the Advances in Neural Information Processing Systems 29: Annual Conference on Neural Information Processing Systems 2016, 2016

Maximin Action Identification: A New Bandit Framework for Games.
Proceedings of the 29th Conference on Learning Theory, 2016

2015
Worst-case Optimal Probability Updating.
CoRR, 2015

Minimax Time Series Prediction.
Proceedings of the Advances in Neural Information Processing Systems 28: Annual Conference on Neural Information Processing Systems 2015, 2015

Open Problem: Online Sabotaged Shortest Path.
Proceedings of The 28th Conference on Learning Theory, 2015

Second-order Quantile Methods for Experts and Combinatorial Games.
Proceedings of The 28th Conference on Learning Theory, 2015

Minimax Fixed-Design Linear Regression.
Proceedings of The 28th Conference on Learning Theory, 2015

2014
Combining initial segments of lists.
Theor. Comput. Sci., 2014

Buy low, sell high.
Theor. Comput. Sci., 2014

Follow the leader if you can, hedge if you must.
J. Mach. Learn. Res., 2014

Efficient Minimax Strategies for Square Loss Games.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Learning the Learning Rate for Prediction with Expert Advice.
Proceedings of the Advances in Neural Information Processing Systems 27: Annual Conference on Neural Information Processing Systems 2014, 2014

Open Problem: Shifting Experts on Easy Data.
Proceedings of The 27th Conference on Learning Theory, 2014

2013
Universal Codes From Switching Strategies.
IEEE Trans. Inf. Theory, 2013

Switching investments.
Theor. Comput. Sci., 2013

The Pareto Regret Frontier.
Proceedings of the Advances in Neural Information Processing Systems 26: 27th Annual Conference on Neural Information Processing Systems 2013. Proceedings of a meeting held December 5-8, 2013

A Long-Range Self-similarity Approach to Segmenting DJ Mixed Music Streams.
Proceedings of the Artificial Intelligence Applications and Innovations, 2013

Learning a set of directions.
Proceedings of the COLT 2013, 2013

2012
Putting Bayes to sleep.
Proceedings of the Advances in Neural Information Processing Systems 25: 26th Annual Conference on Neural Information Processing Systems 2012. Proceedings of a meeting held December 3-6, 2012

2011
Some Mathematical Refinements Concerning Error Minimization in the Genetic Code.
IEEE ACM Trans. Comput. Biol. Bioinform., 2011

Learning Eigenvectors for Free.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

Adaptive Hedge.
Proceedings of the Advances in Neural Information Processing Systems 24: 25th Annual Conference on Neural Information Processing Systems 2011. Proceedings of a meeting held 12-14 December 2011, 2011

2010
Freezing and Sleeping: Tracking Experts that Learn by Evolving Past Posteriors
CoRR, 2010

Switching between Hidden Markov Models using Fixed Share
CoRR, 2010

Hedging Structured Concepts.
Proceedings of the COLT 2010, 2010

2009
Time-bounded incompressibility of compressible strings and sequences.
Inf. Process. Lett., 2009

2008
Kolmogorov Complexity Theory over the Reals.
Proceedings of the Fifth International Conference on Computability and Complexity in Analysis, 2008

On Time-Bounded Incompressibility of Compressible Strings
CoRR, 2008

Combining Expert Advice Efficiently.
Proceedings of the 21st Annual Conference on Learning Theory, 2008


  Loading...