SZodixStudyAcademic Library

Shelves Open access

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

Online linear optimization and adaptive routing · Study

ArticleShelves

ArticleOnline linear optimization and adaptive routing

Baruch Awerbuch2007

OA

Articlebronze2007

Online linear optimization and adaptive routing

Baruch Awerbuch · Robert Kleinberg

177 citations·0/0 files stored·Journal of Computer and System Sciences

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 Complexity and Algorithms in Graphs 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 — 177 citations exist upstream.

References

1997A Decision-Theoretic Generalization of On-Line Learning and an Application to Boosting 2002The Nonstochastic Multiarmed Bandit Problem 2003Online convex programming and generalized infinitesimal gradient ascent 2002Gambling in a rigged casino: The adversarial multi-armed bandit problem 2004Online convex optimization in the bandit setting: gradient descent without a gradient 2004Efficient algorithms for online decision problems 1987Bandit Problems, Sequential Allocation of Experiments.2004Nearly Tight Bounds for the Continuum-Armed Bandit Problem

Cited by

2012Projection-free Online Learning 2016Online Context-Aware Recommendation with Time Varying Multi-Armed Bandit 2016Multi-armed bandits with application to 5G small cells 2017Minimal Exploration in Structured Stochastic Bandits 2009A Structured Multiarmed Bandit Problem and the Greedy Policy 2013Deterministic Sequencing of Exploration and Exploitation for Multi-Armed Bandit Problems

Related works

Explore the map →

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

2005Online decision problems with large strategy setsthesis · 9 shared references 2006Robbing the bandit: less regret in online geometric optimization against an adaptive adversaryarticle · 6 shared references 2007Learning, Regret Minimization, and Equilibriachapter · 5 shared references 2008Competing in the dark: An efficient algorithm for bandit linear optimizationarticle · 5 shared references 2004Online Geometric Optimization in the Bandit Setting Against an Adaptive Adversaryother · 5 shared references 2008Adapting to a Changing Environment: the Brownian Restless Bandits.article · 5 shared references

Details

Year2007

Typearticle

Published2007-04-26

VenueJournal of Computer and System Sciences

ISSN-L0022-0000

Languageen

Citations177

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1016/j.jcss.2007.04.016

openalex_workW2012731843

Links

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

2016Adaptive algorithms for online convex optimization with long-term constraints

2012Interior-Point Methods for Full-Information and Bandit Online Learning