Extracting certainty from uncertainty: regret bounded by variation in costs
type: Item
instance of: scholarly article
title: Extracting certainty from uncertainty: regret bounded by variation in costs
zbMATH Open document ID: 1470.68115
author: Elad Hazan
author: Satyen Kale
published in: Machine Learning
publication date: 2010-10-07T00:00:00Z
Mathematics Subject Classification ID: 68T05
Mathematics Subject Classification ID: 68W27
zbMATH DE Number: 5796873
zbMATH Keywords: individual sequences
zbMATH Keywords: prediction with expert advice
zbMATH Keywords: online learning
zbMATH Keywords: regret minimization
describes a project that uses: AdaBoost.MH
MaRDI profile type: Publication
full work available at URL: s10994-010-5175-x
OpenAlex ID: W1964009380
cites work: Algorithmic Learning Theory
cites work: The Nonstochastic Multiarmed Bandit Problem
cites work: Prediction, Learning, and Games
cites work: Improved second-order bounds for prediction with expert advice
cites work: Universal Portfolios
cites work: A decision-theoretic generalization of on-line learning and an application to boosting
cites work: Q3245635
cites work: Q4633809
cites work: Q5396640
cites work: Tracking the best linear predictor
cites work: Efficient algorithms for online decision problems
cites work: Exponentiated gradient versus gradient descent for linear predictors
cites work: The weighted majority algorithm
cites work: A game of prediction with expert advice
DOI: 10.1007/S10994-010-5175-X
description: scientific article; zbMATH DE number 5796873