research
∙
08/21/2023
An Improved Best-of-both-worlds Algorithm for Bandits with Delayed Feedback
We propose a new best-of-both-worlds algorithm for bandits with variably...
share
research
∙
05/30/2023
Delayed Bandits: When Do Intermediate Observations Help?
We study a K-armed bandit with delayed feedback and intermediate observa...
research
∙
06/29/2022
A Best-of-Both-Worlds Algorithm for Bandits with Delayed Feedback
We present a modified tuning of the algorithm of Zimmert and Seldin [202...
research
∙
06/01/2022
Split-kl and PAC-Bayes-split-kl Inequalities
We present a new concentration of measure inequality for sums of indepen...
research
∙
06/01/2022
A Near-Optimal Best-of-Both-Worlds Algorithm for Online Learning with Feedback Graphs
We consider online learning with feedback graphs, a sequential decision-...
research
∙
06/25/2021
Chebyshev-Cantelli PAC-Bayes-Bennett Inequality for the Weighted Majority Vote
We present a new second-order oracle bound for the expected risk of a we...
research
∙
03/23/2021
Improved Analysis of Robustness of the Tsallis-INF Algorithm to Adversarial Corruptions in Stochastic Multiarmed Bandits
We derive improved regret bounds for the Tsallis-INF algorithm of Zimmer...
research
∙
02/19/2021
An Algorithm for Stochastic and Adversarial Bandits with Switching Costs
We propose an algorithm for stochastic and adversarial multiarmed bandit...
research
∙
10/14/2019
An Optimal Algorithm for Adversarial Bandits with Arbitrary Delays
We propose a new algorithm for adversarial multi-armed bandits with unre...
research
∙
06/03/2019
Nonstochastic Multiarmed Bandits with Unrestricted Delays
We investigate multiarmed bandits with delayed feedback, where the delay...
research
∙
10/23/2018
On PAC-Bayesian Bounds for Random Forests
Existing guarantees in terms of rigorous upper bounds on the generalizat...
research
∙
07/19/2018
An Optimal Algorithm for Stochastic and Adversarial Bandits
We provide an algorithm that achieves the optimal (up to constants) fini...
research
∙
07/04/2018
Factored Bandits
We introduce the factored bandits model, which is a framework for learni...
research
∙
07/02/2018
Adaptation to Easy Data in Prediction with Limited Advice
We derive an online learning algorithm with improved regret guarantees f...
research
∙
02/20/2017
An Improved Parametrization and Analysis of the EXP3++ Algorithm for Stochastic and Adversarial Bandits
We present a new strategy for gap estimation in randomized algorithms fo...
research
∙
08/22/2016
Multi-Dueling Bandits and Their Application to Online Ranker Evaluation
New ranking algorithms are continually being developed and refined, nece...
research
∙
08/19/2016
A Strongly Quasiconvex PAC-Bayesian Bound
We propose a new PAC-Bayesian bound and a way of constructing a hypothes...
research
∙
04/12/2013
Advice-Efficient Prediction with Expert Advice
Advice-efficient prediction with expert advice (in analogy to label-effi...
research
∙
10/31/2011
PAC-Bayesian Inequalities for Martingales
We present a set of high-probability inequalities that control the conce...
research
∙
05/23/2011
PAC-Bayesian Analysis of the Exploration-Exploitation Trade-off
We develop a coherent framework for integrative simultaneous analysis of...
research
∙
05/12/2011
PAC-Bayesian Analysis of Martingales and Multiarmed Bandits
We present two alternative ways to apply PAC-Bayesian analysis to sequen...
research
∙
09/02/2010