Fetching the paper…
Reading the bibliography…
We provide a simple and efficient algorithm for adversarial $k$-action $d$-outcome non-degenerate locally observable partial monitoring game for which the $n$-round minimax regret is bounded by $6(d+1) k^{3/2} \sqrt{n \log(k)}$, matching the best known information-theoretic upper bound.
Connections between mirror descent, Thompson sampling and the information ratio
Zimmert, J. and Lattimore, T. (2019) · 1905
Earlier work this paper cites.
Gambling in a rigged casino: The adversarial multi-armed bandit problem
Auer, P., Cesa-Bianchi, N., Freund, Y., and Schapire, R. E. (1995) · 1995
Earlier work this paper cites.
Anti-hadamard matrices, coin weighing, threshold gates, and indecomposable hypergraphs
Alon, N. and Vũ, V. H. (1997) · 1997
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Freund, Y. and Schapire, R. E. (1997) · 1997
Earlier work this paper cites.
Minimizing regret: The general case
Rustichini, A. (1999) · 1999
Earlier work this paper cites.
On-line learning with imperfect monitoring
Mannor, S. and Shimkin, N. (2003) · 2003
Earlier work this paper cites.
Regret minimization under partial monitoring
Cesa-Bianchi, N., Lugosi, G., and Stoltz, G. (2006) · 2006
Earlier work this paper cites.
Beating the adaptive bandit with high probability
Abernethy, J. D. and Rakhlin, A. (2009) · 2009
Earlier work this paper cites.
Minimax policies for adversarial and stochastic bandits
Audibert, J.-Y. and Bubeck, S. (2009) · 2009
Earlier work this paper cites.
Tighter bounds for multi-armed bandits with expert advice
McMahan, H. B. and Streeter, M. J. (2009) · 2009
Earlier work this paper cites.
Minimax regret of finite partial-monitoring games in stochastic environments
Bartók, G., Pál, D., and Szepesvári, C. (2011) · 2011
Earlier work this paper cites.
Approachability of convex sets in games with partial monitoring
Perchet, V. (2011) · 2011
Cited alongside, same era.
Towards minimax policies for online linear optimization with bandit feedback
Bubeck, S., Cesa-Bianchi, N., and Kakade, S. (2012) · 2012
Cited alongside, same era.
No internal regret via neighborhood watch
Foster, D. and Rakhlin, A. (2012) · 2012
Cited alongside, same era.
Toward a classification of finite partial-monitoring games
Antos, A., Bartók, G., Pál, D., and Szepesvári, C. (2013) · 2013
Cited alongside, same era.
Optimization, learning, and games with predictable sequences
Rakhlin, S. and Sridharan, K. (2013) · 2013
Cited alongside, same era.
Partial monitoring—classification, regret bounds, and algorithms
Bartók, G., Foster, D. P., Pál, D., Rakhlin, A., and Szepesvári, C. (2014) · 2014
Cited alongside, same era.
Refined lower bounds for adversarial bandits
Gerchinovitz, S. and Lattimore, T. (2016) · 2016
Later among the works it cites.
Introduction to online convex optimization
Hazan, E. (2016) · 2016
Later among the works it cites.
Conic optimization via operator splitting and homogeneous self-dual embedding
O’Donoghue, B., Chu, E., Parikh, N., and Boyd, S. (2016) · 2016
Later among the works it cites.
An information-theoretic analysis of Thompson sampling
Russo, D. and Van Roy, B. (2016) · 2016
Later among the works it cites.
SCS: Splitting conic solver, version 2.1.1
O’Donoghue, B., Chu, E., Parikh, N., and Boyd, S. (2017) · 2017
Later among the works it cites.
Sparsity, variance and curvature in multi-armed bandits
Bubeck, S., Cohen, M., and Li, Y. (2018) · 2018
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Combinatorial partial monitoring game with linear feedback and its applications
Lin, T., Abrahao, B., Kleinberg, R., Lui, J., and Chen, W. (2014) · 2014
Cited alongside, same era.
Set-valued approachability and online learning with partial monitoring
Mannor, S., Perchet, V., and Stoltz, G. (2014) · 2014
Cited alongside, same era.
Efficient partial monitoring with prior information
Vanchinathan, H. P., Bartók, G., and Krause, A. (2014) · 2014
Cited alongside, same era.
Online learning with feedback graphs: Beyond bandits
Alon, N., Cesa-Bianchi, N., Dekel, O., and Koren, T. (2015) · 2015
Cited alongside, same era.
Regret lower bound and optimal algorithm in finite stochastic partial monitoring
Komiyama, J., Honda, J., and Nakagawa, H. (2015) · 2015
Cited alongside, same era.
Cleaning up the neighborhood: A full classification for adversarial partial monitoring
Lattimore, T. and Szepesvári, C. (2019a)
Cited in the paper.
More adaptive algorithms for adversarial bandits
Wei, C.-Y. and Luo, H. (2018) · 2018
Later among the works it cites.
Improved path-length regret bounds for bandits
Bubeck, S., Li, Y., Luo, H., and Wei, C.-Y. (2019) · 2019
Closest in time.
Bandit Algorithms
Lattimore, T. and Szepesvári, C. (2019) · 2019
Closest in time.
On first-order bounds, variance and gap-dependent bounds for adversarial bandits
Pogodin, R. and Lattimore, T. (2019) · 2019
Closest in time.
Beating stochastic and adversarial semi-bandits optimally and simultaneously
Zimmert, J., Luo, H., and Wei, C.-Y. (2019) · 2019
Closest in time.