Bandits and Experts in Metric Spaces

DOI10.1145/3299873zbMath1476.91073arXiv1312.1277OpenAlexW2963506504WikidataQ127767591 ScholiaQ127767591MaRDI QIDQ5215459

Eli Upfal, Aleksandrs Slivkins, Robert D. Kleinberg

Publication date: 11 February 2020

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1312.1277

zbMATH Keywords

metric spacescovering dimensiononline learningregretmulti-armed banditsLipschitz-continuity

Mathematics Subject Classification ID

Decision theory (91B06) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Online algorithms; streaming algorithms (68W27) Probabilistic metric spaces (54E70)

Related Items (4)

A Single-Index Model With a Surface-Link for Optimizing Individualized Dose Rules ⋮ Learning approximately optimal contracts ⋮ Estimation and inference for minimizer and minimum of convex functions: optimality, adaptivity and uncertainty principles ⋮ Stochastic continuum-armed bandits with additive models: minimax regrets and adaptive algorithm

This page was built for publication: Bandits and Experts in Metric Spaces