Regret bounds for sleeping experts and bandits
type: Item
instance of: scholarly article
title: Regret bounds for sleeping experts and bandits
zbMATH Open document ID: 1370.68254
author: Robert D. Kleinberg
author: Alexandru Niculescu-Mizil
author: Yogeshwer Sharma
published in: Machine Learning
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 5796876
zbMATH Keywords: online algorithms
zbMATH Keywords: computational learning theory
zbMATH Keywords: regret
MaRDI profile type: Publication
full work available at URL: s10994-010-5178-7
OpenAlex ID: W2008098735
cites work: Some aspects of the sequential design of experiments
cites work: Finite-time analysis of the multiarmed bandit problem
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Weighted sums of certain dependent random variables
cites work: Learning Theory
cites work: How to use expert advice
cites work: Q4023085
cites work: Adaptive game playing using multiplicative weights
cites work: Q4526998
cites work: Q4198056
cites work: Q4197923
cites work: Q3245635
cites work: Probability Inequalities for Sums of Bounded Random Variables
cites work: Efficient algorithms for online decision problems
cites work: Q2934677
cites work: Asymptotically efficient adaptive allocation rules
cites work: The weighted majority algorithm
cites work: A game of prediction with expert advice
DOI: 10.1007/S10994-010-5178-7
description: scientific article; zbMATH DE number 5796876