SZodixStudyAcademic Library

Shelves Open access

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

On Following the Perturbed Leader in the Bandit Setting · Study

WorkOn Following the Perturbed Leader in the Bandit Setting

Jussi Kujala2005

Work2005

On Following the Perturbed Leader in the Bandit Setting

Jussi Kujala · Tapio Elomaa

57 citations·0/0 files stored·Lecture notes in computer science

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 Machine Learning and Algorithms Optimization and Search Problems

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 — 57 citations exist upstream.

References

2002The Nonstochastic Multiarmed Bandit Problem 2003Online convex programming and generalized infinitesimal gradient ascent 1997How to use expert advice 2004Online convex optimization in the bandit setting: gradient descent without a gradient 2004Adaptive routing with end-to-end feedback 2004Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversary 2005Adaptive Online Prediction by Following the Perturbed Leader 1960Contributions to the Theory of Games.

Cited by

20161Joint Channel Selection and Power Control in Infrastructureless Wireless Networks: A Multi-Player Multi-Armed Bandit Framework

Related works

Explore the map →

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

2012Online Bandit Learning against an Adaptive Adversary: from Regret to Policy Regretpreprint · 5 shared references 2011Introduction to Online Optimizationarticle · 5 shared references 2012Interior-Point Methods for Full-Information and Bandit Online Learningarticle · 5 shared references 2005Online decision problems with large strategy setsthesis · 5 shared references 2007Learning, Regret Minimization, and Equilibriachapter · 4 shared references 2008Competing in the dark: An efficient algorithm for bandit linear optimizationarticle · 4 shared references

Details

Year2005

Typeother

Published2005-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations57

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1007/11564089_29

openalex_workW2128398068

Links

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