SZodixStudyAcademic Library

Shelves Open access

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

Personalized optimization with user’s feedback · Study

ArticleShelves

ArticlePersonalized optimization with user’s feedback

Andrea Simonetto2021

OA

Articlebronze2021

Personalized optimization with user’s feedback

Andrea Simonetto · Emiliano Dall’Anese · Julien Monteil · Andrey Bernstein

27 citations·0/0 files stored·Automatica

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 Advanced Control Systems Optimization 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 — 27 citations exist upstream.

References

1979Prospect Theory: An Analysis of Decision under Risk 1988Prospect theory: An analysis of decision under risk 2000Mixed MNL models for discrete response 2012Information-Theoretic Regret Bounds for Gaussian Process Optimization in the Bandit Setting 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems 2012Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems 2012Online Learning and Online Convex Optimization 2011Online Learning and Online Convex Optimization

Related works

Explore the map →

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

2019Introduction to Multi-Armed Banditsarticle · 7 shared references 2018Bandit Convex Optimization for Scalable and Dynamic IoT Managementarticle · 6 shared references 2017Stochastic online optimization. Single-point and multi-point non-linear multi-armed bandits. Convex and strongly-convex casearticle · 6 shared references 2020Bandit Algorithmsbook · 5 shared references 2018Learning in games with continuous action sets and unknown payoff functionsarticle · 5 shared references 2014Bandits with concave rewards and convex knapsacksother · 5 shared references

Details

Year2021

Typearticle

Published2021-06-22

VenueAutomatica

ISSN-L0005-1098

Languageen

Citations27

Files0 public / 0

ShelfAdvanced Bandit Algorithms Research

Identifiers

doi10.1016/j.automatica.2021.109767

openalex_workW2942565007

Links

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