Corruption-tolerant bandit learning
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 3320125 (Why is no real title available?)
- Bandits With Heavy Tail
- Corrupt bandits for preserving local privacy
- Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
- Exploration-exploitation tradeoff using variance estimates in multi-armed bandits
- Finite-time analysis of the multiarmed bandit problem
- Introduction to nonparametric estimation
- Learning from untrusted data
- Robust Estimation of a Location Parameter
- Robust Statistics
- Robust estimators in high-dimensions without the computational intractability
- Robust principal component analysis?
- Robustly learning a Gaussian: getting optimal error, efficiently
- Stochastic bandits robust to adversarial corruptions
- The Nonstochastic Multiarmed Bandit Problem
- Tuning Bandit Algorithms in Stochastic Environments
Cited in
(8)- Stochastic bandits robust to adversarial corruptions
- Negatively Correlated Bandits
- Corrupt bandits for preserving local privacy
- scientific article; zbMATH DE number 7370589 (Why is no real title available?)
- Contextual Search in the Presence of Adversarial Corruptions
- Best arm identification for contaminated bandits
- Secure cumulative reward maximization in linear stochastic bandits
- A new bandit setting balancing information from state evolution and corrupted context
This page was built for publication: Corruption-tolerant bandit learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q669323)