Timezone: »
In both stochastic and online learning we have a good theoretical
understanding of the most difficult learning tasks through worst-case
or minimax analysis, and we have algorithms to match. Yet there are
commonly occurring cases that are much easier than the worst case
where these methods are overly conservative, showing a large gap
between the performance predicted by theory and observed in
practice. Recent work has refined our theoretical understanding of the
wide spectrum of easy cases, leading to the development of algorithms
that are robust to the worst case, but can also automatically adapt to
easier data and achieve faster rates whenever possible.
Examples of easier cases include (Tsybakov) margin conditions, low
noise or variance, probabilistic Lipschitzness and empirical curvature
of the loss (strong convexity, exp-concavity, mixability), as well as
low-complexity decision boundaries and comparators, quantile bounds,
and cases with few switches among few leaders. Adapting to such easy
data often involves data-dependent bias-variance trade-offs through
hyper-parameter learning, adaptive regularisation or exploration, or
hypothesis testing to distinguish between easy and hard cases.
The last two years have seen many exciting new developments in the
form of new desirable adaptivity targets, new algorithms and new
analysis techniques. In this workshop we aim to bring together
researchers and practitioners interested in adaptation to easy
data. The key questions we will discuss are: Which are the
data-dependent trade-offs encountered (bias-variance or other)?
Can we identify commonalities across different problem domains in
strategies that are being used to deal with these trade-offs? And what
is the price for adaptivity (if any)? Both theoretical and empirical
insights are welcomed.
Fri 6:00 a.m. - 6:30 a.m.
|
Learning Faster from Easy Data II: Introduction
(
Talk
)
|
Tim van Erven 🔗 |
Fri 6:30 a.m. - 7:00 a.m.
|
Clustering Is Easy When...
(
Talk
)
|
Shai Ben-David 🔗 |
Fri 7:30 a.m. - 8:00 a.m.
|
Tsybakov Noise Adaptive Margin-Based Active Learning
(
Talk
)
|
Aarti Singh 🔗 |
Fri 8:00 a.m. - 8:30 a.m.
|
Adaptive Online Learning
(
Talk
)
|
Dylan Foster 🔗 |
Fri 11:30 a.m. - 12:00 p.m.
|
Easy Data
(
Talk
)
|
Peter Grünwald 🔗 |
Fri 12:30 p.m. - 1:00 p.m.
|
Optimal and Adaptive Algorithms for Online Boosting
(
Talk
)
|
Satyen Kale 🔗 |
Fri 2:00 p.m. - 2:45 p.m.
|
Adaptive Regret Bounds for Non-Stochastic Bandits
(
Talk
)
|
Gergely Neu 🔗 |
Fri 2:45 p.m. - 3:30 p.m.
|
Discussion Panel
Speakers unknown |
Tim van Erven · Wouter Koolen · Peter Grünwald · Shai Ben-David · Dylan Foster · Satyen Kale · Gergely Neu 🔗 |
Author Information
Tim van Erven (Leiden University)
Wouter Koolen (Centrum Wiskunde & Informatica)
More from the Same Authors
-
2021 : Regret Minimization in Heavy-Tailed Bandits »
Shubhada Agrawal · Sandeep Juneja · Wouter Koolen -
2023 Poster: First- and Second-Order Bounds for Adversarial Linear Contextual Bandits »
Iuliia Olkhovskaia · Jack Mayo · Tim van Erven · Gergely Neu · Chen-Yu Wei -
2023 Poster: Towards Characterizing the First-order Query Complexity of Learning (Approximate) Nash Equilibria in Zero-sum Matrix Games »
Hedi Hadiji · Sarah Sachs · Tim van Erven · Wouter Koolen -
2023 Poster: Adaptive Selective Sampling for Online Prediction with Experts »
Rui Castro · Fredrik Hellström · Tim van Erven -
2022 Poster: Luckiness in Multiscale Online Learning »
Wouter Koolen · Muriel F. Pérez-Ortiz -
2022 Poster: Between Stochastic and Adversarial Online Convex Optimization: Improved Regret Bounds via Smoothness »
Sarah Sachs · Hedi Hadiji · Tim van Erven · Cristóbal Guzmán -
2021 Poster: A/B/n Testing with Control in the Presence of Subpopulations »
Yoan Russac · Christina Katsimerou · Dennis Bohle · Olivier Cappé · Aurélien Garivier · Wouter Koolen -
2021 Poster: Optimal Best-Arm Identification Methods for Tail-Risk Measures »
Shubhada Agrawal · Wouter Koolen · Sandeep Juneja -
2019 Poster: Pure Exploration with Multiple Correct Answers »
Rémy Degenne · Wouter Koolen -
2019 Poster: Non-Asymptotic Pure Exploration by Solving Games »
Rémy Degenne · Wouter Koolen · Pierre Ménard -
2018 Poster: Sequential Test for the Lowest Mean: From Thompson to Murphy Sampling »
Emilie Kaufmann · Wouter Koolen · Aurélien Garivier -
2017 Poster: Random Permutation Online Isotonic Regression »
Wojciech Kotlowski · Wouter Koolen · Alan Malek -
2017 Poster: Monte-Carlo Tree Search by Best Arm Identification »
Emilie Kaufmann · Wouter Koolen -
2017 Spotlight: Monte-Carlo Tree Search by Best Arm Identification »
Emilie Kaufmann · Wouter Koolen -
2016 Poster: Combining Adversarial Guarantees and Stochastic Fast Rates in Online Learning »
Wouter Koolen · Peter Grünwald · Tim van Erven -
2016 Poster: MetaGrad: Multiple Learning Rates in Online Learning »
Tim van Erven · Wouter Koolen -
2016 Oral: MetaGrad: Multiple Learning Rates in Online Learning »
Tim van Erven · Wouter Koolen -
2015 : Discussion Panel »
Tim van Erven · Wouter Koolen · Peter Grünwald · Shai Ben-David · Dylan Foster · Satyen Kale · Gergely Neu -
2015 : Learning Faster from Easy Data II: Introduction »
Tim van Erven -
2015 Poster: Minimax Time Series Prediction »
Wouter Koolen · Alan Malek · Peter Bartlett · Yasin Abbasi Yadkori -
2014 Poster: Efficient Minimax Strategies for Square Loss Games »
Wouter M Koolen · Alan Malek · Peter Bartlett -
2014 Poster: Learning the Learning Rate for Prediction with Expert Advice »
Wouter M Koolen · Tim van Erven · Peter Grünwald -
2013 Workshop: Learning Faster From Easy Data »
Peter Grünwald · Wouter M Koolen · Sasha Rakhlin · Nati Srebro · Alekh Agarwal · Karthik Sridharan · Tim van Erven · Sebastien Bubeck -
2013 Workshop: Large Scale Matrix Analysis and Inference »
Reza Zadeh · Gunnar Carlsson · Michael Mahoney · Manfred K. Warmuth · Wouter M Koolen · Nati Srebro · Satyen Kale · Malik Magdon-Ismail · Ashish Goel · Matei A Zaharia · David Woodruff · Ioannis Koutis · Benjamin Recht -
2013 Poster: The Pareto Regret Frontier »
Wouter M Koolen -
2012 Poster: Mixability in Statistical Learning »
Tim van Erven · Peter Grünwald · Mark Reid · Robert Williamson -
2012 Poster: Putting Bayes to sleep »
Wouter M Koolen · Dmitri Adamskiy · Manfred K. Warmuth -
2012 Spotlight: Putting Bayes to sleep »
Wouter M Koolen · Dmitri Adamskiy · Manfred K. Warmuth -
2011 Poster: Adaptive Hedge »
Tim van Erven · Peter Grünwald · Wouter M Koolen · Steven D Rooij -
2011 Poster: Learning Eigenvectors for Free »
Wouter M Koolen · Wojciech Kotlowski · Manfred K. Warmuth