Stochastic Linear Optimization with Adversarial Corruption

Tight regret bounds for infinite-armed linear contextual bandits

Original

Li, Y., Wang, Y., and Zhou, Y. (2019) · 1905

Earlier work this paper cites.

Some aspects of the sequential design of experiments

Robbins, H. (1952) · 1952

Earlier work this paper cites.

Probability inequalities for sums of bounded random variables

Hoeffding, W. (1963) · 1963

Earlier work this paper cites.

An optimal algorithm for stochastic and adversarial bandits

Original

Zimmert, J. and Seldin, Y. (2018) · 1963

Earlier work this paper cites.

Geometric algorithms and combinatorial optimization

Grtschel, M., Lovsz, L., and Schrijver, A. (1988) · 1988

Earlier work this paper cites.

Geometric algorithms and algorithmic geometry

Lovász, L. (1991) · 1990

Cited alongside, same era.

Using confidence bounds for exploitation-exploration trade-offs

Auer, P. (2002) · 2002

Cited alongside, same era.

Stochastic linear optimization under bandit feedback

Dani, V., Hayes, T. P., and Kakade, S. M. (2008) · 2008

Cited alongside, same era.

Improved algorithms for linear stochastic bandits

Abbasi-Yadkori, Y., Pál, D., and Szepesvári, C. (2011) · 2011

Cited alongside, same era.

Contextual bandit algorithms with supervised learning guarantees

Beygelzimer, A., Langford, J., Li, L., Reyzin, L., and Schapire, R. (2011) · 2011

Cited alongside, same era.

The best of both worlds: stochastic and adversarial bandits

Bubeck, S. and Slivkins, A. (2012) · 2012

Later among the works it cites.

The end of optimism? An asymptotic analysis of finite-armed linear bandits

Lattimore, T. and Szepesvari, C. (2017) · 2017

Later among the works it cites.

Stochastic bandits robust to adversarial corruptions

Lykouris, T., Mirrokni, V., and Paes Leme, R. (2018) · 2018

Later among the works it cites.

Better algorithms for stochastic bandits with adversarial corruptions

Gupta, A., Koren, T., and Talwar, K. (2019) · 2019

Closest in time.

Corruption-tolerant bandit learning

Kapoor, S., Patel, K. K., and Kar, P. (2019) · 2019

Closest in time.