Stochastic bandits robust to adversarial corruptions

DOI10.1145/3188745.3188918zbMath1428.68246arXiv1803.09353OpenAlexW2794925984MaRDI QIDQ5230281

Thodoris Lykouris, Renato Paes Leme, Vahab S. Mirrokni

Publication date: 22 August 2019

Published in: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1803.09353

zbMATH Keywords

online learningbandits

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Related Items (5)

Dynamic Learning and Market Making in Spread Betting Markets with Informed Bettors ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Relaxing the i.i.d. assumption: adaptively minimax optimal regret via root-entropic regularization ⋮ Corruption-tolerant bandit learning

This page was built for publication: Stochastic bandits robust to adversarial corruptions