Fetching the paper…
Reading the bibliography…
We study contextual bandit learning with an abstract policy class and continuous action space.
Introduction to multi-armed bandits
Aleksandrs Slivkins · 1904
Earlier work this paper cites.
On general minimax theorems
Maurice Sion · 1958
Earlier work this paper cites.
On measures with the doubling condition
A. L. Volberg and S. V. Konyagin · 1988
Earlier work this paper cites.
The continuum-armed bandit problem
Rajeev Agrawal · 1995
Earlier work this paper cites.
A decision-theoretic generalization of on-line learning and an application to boosting
Yoav Freund and Robert E. Schapire · 1997
Earlier work this paper cites.
Every complete doubling metric space carries a doubling measure
Jouni Luukkainen and Eero Saksman · 1998
Earlier work this paper cites.
Hausdorff dimension and doubling measures on metric spaces
Jang-Mei Wu · 1998
Earlier work this paper cites.
The small-world phenomenon: an algorithmic perspective
Jon Kleinberg · 2000
Earlier work this paper cites.
Spatial gossip and resource location protocols
David Kempe, Jon Kleinberg, and Alan Demers · 2001
Earlier work this paper cites.
The nonstochastic multiarmed bandit problem
Peter Auer, Nicolo Cesa-Bianchi, Yoav Freund, and Robert E Schapire · 2002
Earlier work this paper cites.
Protocols and impossibility results for gossip-based communication mechanisms
David Kempe and Jon Kleinberg · 2002
Earlier work this paper cites.
Bounded geometries, fractals, and low–distortion embeddings
Anupam Gupta, Robert Krauthgamer, and James R. Lee · 2003
Earlier work this paper cites.
The value of knowing a demand curve: Bounds on regret for online posted-price auctions
Robert Kleinberg and Tom Leighton · 2003
Earlier work this paper cites.
Nearly tight bounds for the continuum-armed bandit problem
Robert Kleinberg · 2004
Earlier work this paper cites.
Navigating nets: simple algorithms for proximity search
Robert Krauthgamer and James R. Lee · 2004
Earlier work this paper cites.
Measured descent: A new embedding method for finite metrics
Robert Krauthgamer, James Lee, Manor Mendel, and Assaf Naor · 2004
Earlier work this paper cites.
Bypassing the embedding: Algorithms for low-dimensional metrics
Kunal Talwar · 2004
Earlier work this paper cites.
Metric embeddings with relaxed guarantees
Hubert T-H. Chan, Kedar Dhamdhere, Anupam Gupta, Jon Kleinberg, and Aleksandrs Slivkins · 2005
Earlier work this paper cites.
Triangulation and embedding using small sets of beacons
Jon Kleinberg, Aleksandrs Slivkins, and Tom Wexler · 2005
Cited alongside, same era.
Fast construction of nets in low dimensional metrics, and their applications
Manor Mendel and Sariel Har-Peled · 2005
Cited alongside, same era.
Distance estimation and object location via rings of neighbors
Aleksandrs Slivkins · 2005
Cited alongside, same era.
Meridian: A lightweight network location service without virtual coordinates
Bernard Wong, Aleksandrs Slivkins, and Emin Gün Sirer · 2005
Cited alongside, same era.
Embedding, Distance Estimation and Object Location in Networks
Aleksandrs Slivkins · 2006
Cited alongside, same era.
Improved rates for the stochastic continuum-armed bandit problem
Peter Auer, Ronald Ortner, and Csaba Szepesvári · 2007
Cited alongside, same era.
Low-distortion inference of latent similarities from a multiplex social network
Ittai Abraham, Shiri Chechik, David Kempe, and Aleksandrs Slivkins · 2013
Later among the works it cites.
Estimation of extreme values and associated level sets of a regression function via selective sampling
Stanislav Minsker · 2013
Later among the works it cites.
Stochastic simultaneous optimistic optimization
Michal Valko, Alexandra Carpentier, and Rémi Munos · 2013
Later among the works it cites.
Taming the monster: A fast and simple algorithm for contextual bandits
Alekh Agarwal, Daniel Hsu, Satyen Kale, John Langford, Lihong Li, and Robert Schapire · 2014
Later among the works it cites.
Adaptive-treed bandits
Adam Bull · 2015
Later among the works it cites.
Black-box optimization of noisy functions with unknown smoothness
Jean-Bastien Grill, Michal Valko, and Rémi Munos · 2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
The epoch-greedy algorithm for contextual multi-armed bandits
John Langford and Tong Zhang · 2007
Cited alongside, same era.
Multi-armed bandits in metric spaces
Robert Kleinberg, Aleksandrs Slivkins, and Eli Upfal · 2008
Cited alongside, same era.
Sharp dichotomies for regret minimization in metric spaces
Robert Kleinberg and Aleksandrs Slivkins · 2010
Cited alongside, same era.
Bandits and experts in metric spaces
Robert Kleinberg, Aleksandrs Slivkins, and Eli Upfal · 2010
Cited alongside, same era.
Showing Relevant Ads via Lipschitz Context Multi-Armed Bandits
Tyler Lu, Dávid Pál, and Martin Pál · 2010
Cited alongside, same era.
Theoretical justification of popular link prediction heuristics
Purnamrita Sarkar, Deepayan Chakrabarti, and Andrew W. Moore · 2010
Cited alongside, same era.
Later among the works it cites.
Personalized dose finding using outcome weighted learning
Guanhua Chen, Donglin Zeng, and Michael R Kosorok · 2016
Later among the works it cites.
Loss minimization and parameter estimation with heavy tails
Daniel Hsu and Sivan Sabato · 2016
Later among the works it cites.
Contextual semibandits via supervised learning oracles
Akshay Krishnamurthy, Alekh Agarwal, and Miro Dudik · 2016
Later among the works it cites.
Algorithmic chaining and the role of partial feedback in online nonparametric learning
Nicolò Cesa-Bianchi, Pierre Gaillard, Claudio Gentile, and Sébastien Gerchinovitz · 2017
Later among the works it cites.
Policy evaluation and optimization with continuous treatments
Nathan Kallus and Angela Zhou · 2018
Later among the works it cites.
Bandit Algorithms
Tor Lattimore and Csaba Szepesvári · 2018
Later among the works it cites.
Adaptivity to smoothness in x-armed bandits
Andrea Locatelli and Alexandra Carpentier · 2018
Later among the works it cites.
Contextual bandits with stochastic experts
Rajat Sen, Karthikeyan Shanmugam, and Sanjay Shakkottai · 2018
Later among the works it cites.
No-regret bayesian optimization with unknown hyperparameters
Felix Berkenkamp, Angela P Schoellig, and Andreas Krause · 2019
Closest in time.
General parallel optimization a without metric
Xuedong Shang, Emilie Kaufmann, and Michal Valko · 2019
Closest in time.
Taking a hint: How to leverage loss predictors in contextual bandits?
Chen-Yu Wei, Haipeng Luo, and Alekh Agarwal · 2020
Closest in time.