Corruption-tolerant bandit learning
type: Item
instance of: scholarly article
title: Corruption-tolerant bandit learning
zbMATH Open document ID: 1483.68303
author: Sayash Kapoor
author: Kumar Kshitij Patel
author: Purushottam Kar
published in: Machine Learning
publication date: 2019-03-15T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 62C25
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 7036683
zbMATH Keywords: robust learning
zbMATH Keywords: online learning
zbMATH Keywords: bandit algorithms
describes a project that uses: robustbase
MaRDI profile type: MaRDI publication profile
full work available at URL: s10994-018-5758-5
OpenAlex ID: W2888960341
cites work: Tuning Bandit Algorithms in Stochastic Environments
cites work: Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Bandits With Heavy Tail
cites work: Robust principal component analysis?
cites work: Learning from untrusted data
cites work: Robust Estimators in High-Dimensions Without the Computational Intractability
cites work: Robustly Learning a Gaussian: Getting Optimal Error, Efficiently
cites work: Q4617614
cites work: Robust Estimation of a Location Parameter
cites work: Stochastic bandits robust to adversarial corruptions
cites work: Robust Statistics
cites work: Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
cites work: Introduction to nonparametric estimation
cites work: Q5600636
DOI: 10.1007/S10994-018-5758-5
description: scientific article; zbMATH DE number 7036683