Corruption-tolerant bandit learning

DOI10.1007/s10994-018-5758-5zbMath1483.68303OpenAlexW2888960341MaRDI QIDQ669323

Sayash Kapoor, Purushottam Kar, Kumar Kshitij Patel

Publication date: 15 March 2019

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-018-5758-5

zbMATH Keywords

online learningrobust learningbandit algorithms

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27) Compound decision problems in statistical decision theory (62C25)

Related Items (1)

Unnamed Item

Uses Software

• robustbase

Cites Work

• Unnamed Item
• Unnamed Item
• Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
• Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
• Robust principal component analysis?
• Tuning Bandit Algorithms in Stochastic Environments
• Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
• Robust Estimators in High-Dimensions Without the Computational Intractability
• The Nonstochastic Multiarmed Bandit Problem
• Learning from untrusted data
• Stochastic bandits robust to adversarial corruptions
• Bandits With Heavy Tail
• Robust Statistics
• Robust Estimation of a Location Parameter
• Introduction to nonparametric estimation
• Finite-time analysis of the multiarmed bandit problem

This page was built for publication: Corruption-tolerant bandit learning