SZodixStudyAcademic Library

Shelves Open access

Study · an open academic library·Metadata from OpenAlex (CC0)·Shelves·OpenAlex metadata, de-duplicated

Optimal learning with Bernstein online aggregation · Study

ArticleShelves

ArticleOptimal learning with Bernstein online aggregation

Olivier Wintenberger2016

OA

Articlebronze2016

Optimal learning with Bernstein online aggregation

Olivier Wintenberger

52 citations·0/0 files stored·Machine Learning

No readable copy stored yet — this record is metadata only.

No open-access location is known for this record yet.

Literature note Cite in a project Citation map

Advanced Bandit Algorithms Research Statistical Methods and Inference Machine Learning and Algorithms

Abstract

No abstract was published for this record.

Paper brief

Loading…

Cite this work

Citation unavailable for this work.

BibTeX RIS CSL-JSON

No public copy is stored for this record, so only the metadata is cited.

Citations in this library

Citation map →

Stored only when both papers are in the corpus — 52 citations exist upstream.

References

2006Prediction, Learning, and Games 1990AGGREGATING STRATEGIES 1998Sequential prediction of individual sequences under general loss functions 2006Improved second-order bounds for prediction with expert advice 2010Extracting certainty from uncertainty: regret bounded by variation in costs 2008On the Generalization Ability of Online Strongly Convex Programming Algorithms 2009A Stochastic View of Optimal Regret through Minimax Duality 2014A Second-order Bound with Excess Losses

Cited by

2015Second-order Quantile Methods for Experts and Combinatorial Games

Related works

Explore the map →

Papers that cite the same references — the relational fallback while embeddings are still backfilling.

2015Second-order Quantile Methods for Experts and Combinatorial Gamespreprint · 4 shared references 2012A Closer Look at Adaptive Regretother · 3 shared references 2010Online Learning: Beyond Regretpreprint · 3 shared references 2014Approachability, regret and calibration: Implications and equivalencesarticle · 3 shared references 2014Exploiting easy data in online optimizationother · 3 shared references 2012The best of both worlds: stochastic and adversarial banditspreprint · 2 shared references

Details

Year2016

Typearticle

Published2016-10-04

VenueMachine Learning

ISSN-L0885-6125

Languageen

Citations52

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1007/s10994-016-5592-6

openalex_workW1835684196

Links

Imported from OpenAlex (CC0) — nothing here is generated.