SZodixStudyAcademic Library

Shelves Open access

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

Robust Risk-Averse Stochastic Multi-armed Bandits · Study

WorkRobust Risk-Averse Stochastic Multi-armed Bandits

Odalric-Ambrym Maillard2013

OA

Workgreen2013

Robust Risk-Averse Stochastic Multi-armed Bandits

Odalric-Ambrym Maillard

42 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 Reinforcement Learning in Robotics 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 — 42 citations exist upstream.

References

2019Theory of games and economic behavior 2002Finite-time Analysis of the Multiarmed Bandit Problem 1945Theory of Games and Economic Behavior 2002The Nonstochastic Multiarmed Bandit Problem 1952Some aspects of the sequential design of experiments 1960Portfolio Selection: Efficient Diversification of Investments.2009Exploration–exploitation tradeoff using variance estimates in multi-armed bandits 2006Coherent multiperiod risk adjusted values and Bellman’s principle

Related works

Explore the map →

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

2015Non-asymptotic analysis of a new bandit algorithm for semi-bounded rewardsarticle · 9 shared references 2017Normal bandits of unknown means and variancesarticle · 7 shared references 2014From Bandits to Monte-Carlo Tree Search: The Optimistic Principle Applied to Optimization and Planningarticle · 6 shared references 2018On Bayesian index policies for sequential resource allocationarticle · 6 shared references 2013Lower Bounds and Selectivity of Weak-Consistent Policies in Stochastic Multi-Armed Bandit Problemarticle · 6 shared references 2013Optimality of Thompson Sampling for Gaussian Bandits Depends on Priorspreprint · 6 shared references

Details

Year2013

Typeother

Published2013-01-01

VenueLecture notes in computer science

ISSN-L0302-9743

Languageen

Citations42

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1007/978-3-642-40935-6_16

openalex_workW952196006

Links

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