Fetching the paper…
Reading the bibliography…
Generalized Linear Bandits (GLBs), a natural extension of the stochastic linear bandits, has been popular and successful in recent years.
Generalized Linear Models
McCullagh, P and Nelder, J A · 1989
Earlier work this paper cites.
Relevance feedback: a power tool for interactive content-based image retrieval
Rui, Yong, Huang, T S, Ortega, M, and Mehrotra, S · 1998
Earlier work this paper cites.
Using Confidence Bounds for Exploitation-Exploration Trade-offs
Auer, Peter and Long, M · 2002
Earlier work this paper cites.
Locality-sensitive Hashing Scheme Based on P-stable Distributions
Datar, Mayur, Immorlica, Nicole, Indyk, Piotr, and Mirrokni, Vahab S · 2004
Earlier work this paper cites.
Logarithmic Regret Algorithms for Online Convex Optimization
Hazan, Elad, Agarwal, Amit, and Kale, Satyen · 2007
Earlier work this paper cites.
Stochastic Linear Optimization under Bandit Feedback
Dani, Varsha, Hayes, Thomas P, and Kakade, Sham M · 2008
Earlier work this paper cites.
Graphical Models, Exponential Families, and Variational Inference
Wainwright, Martin J and Jordan, Michael I · 2008
Earlier work this paper cites.
The Isotron Algorithm: High-Dimensional Isotonic Regression
Kalai, Adam Tauman and Sastry, Ravi · 2009
Earlier work this paper cites.
Spectral algorithms
Kannan, Ravindran, Vempala, Santosh, and Others · 2009
Earlier work this paper cites.
Robust selective sampling from single and multiple teachers
Dekel, Ofer, Gentile, Claudio, and Sridharan, Karthik · 2010
Earlier work this paper cites.
Parametric Bandits: The Generalized Linear Case
Filippi, Sarah, Cappe, Olivier, Garivier, Aurélien, and Szepesvári, Csaba · 2010
Earlier work this paper cites.
Hashing Hyperplane Queries to Near Points with Applications to Large-Scale Active Learning
Jain, Prateek, Vijayanarasimhan, Sudheendra, and Grauman, Kristen · 2010
Earlier work this paper cites.
A Contextual-Bandit Approach to Personalized News Article Recommendation
Li, Lihong, Chu, Wei, Langford, John, and Schapire, Robert E · 2010
Earlier work this paper cites.
Linearly Parameterized Bandits
Rusmevichientong, Paat and Tsitsiklis, John N · 2010
Earlier work this paper cites.
Improved Algorithms for Linear Stochastic Bandits
Abbasi-Yadkori, Yasin, Pal, David, and Szepesvari, Csaba · 2011
Cited alongside, same era.
An Empirical Evaluation of Thompson Sampling
Chapelle, Olivier and Li, Lihong · 2011
Cited alongside, same era.
Contextual Bandits with Linear Payoff Functions
Chu, Wei, Li, Lihong, Reyzin, Lev, and Schapire, Robert E · 2011
Cited alongside, same era.
Contextual Bandits for Information Retrieval
Hofmann, Katja, Whiteson, Shimon, and de Rijke, Maarten · 2011
Cited alongside, same era.
Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits
Abbasi-Yadkori, Yasin, Pal, David, and Szepesvari, Csaba · 2012
Cited alongside, same era.
Thompson Sampling for Contextual Bandits with Linear Payoffs
Agrawal, Shipra and Goyal, Navin · 2012
Cited alongside, same era.
Content-based image retrieval with hierarchical Gaussian Process bandits with self-organizing maps
Konyushkova, Ksenia and Glowacka, Dorota · 2013
Later among the works it cites.
On Multilabel Classification and Ranking with Bandit Feedback
Gentile, Claudio and Orabona, Francesco · 2014
Later among the works it cites.
Contextual Combinatorial Bandit and its Application on Diversified Online Recommendation
Qin, Lijing, Chen, Shouyuan, and Zhu, Xiaoyan · 2014
Later among the works it cites.
Asymmetric LSH ( ALSH ) for Sublinear Time Maximum Inner Product Search ( MIPS )
Shrivastava, Anshumali and Li, Ping · 2014
Later among the works it cites.
Hashing for Similarity Search: A Survey
Wang, Jingdong, Shen, Heng Tao, Song, Jingkuan, and Ji, Jianqiu · 2014
Later among the works it cites.
Balancing Exploration and Exploitation: Empirical Parameterization of Exploratory Search Systems
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Selective sampling and active learning from single and multiple teachers
Dekel, Ofer, Gentile, Claudio, and Sridharan, Karthik · 2012
Cited alongside, same era.
Approximate nearest neighbor: towards removing the curse of dimensionality
Har-Peled, Sariel, Indyk, Piotr, and Motwani, Rajeev · 2012
Cited alongside, same era.
An Unbiased Offline Evaluation of Contextual Bandit Algorithms with Generalized Linear Models
Li, Lihong, Chu, Wei, Langford, John, Moon, Taesup, and Wang, Xuanhui · 2012
Cited alongside, same era.
Beyond Logarithmic Bounds in Online Learning
Orabona, Francesco, Cesa-Bianchi, Nicolo, and Gentile, Claudio · 2012
Cited alongside, same era.
Optimal parameters for locality-sensitive hashing
Slaney, Malcolm, Lifshits, Yury, and He, Junfeng · 2012
Cited alongside, same era.
Hierarchical exploration for accelerating contextual bandits
Yue, Yisong, Hong, Sue Ann Sa, and Guestrin, Carlos · 2012
Cited alongside, same era.
Ahukorala, Kumaripaba, Medlar, Alan, Ilves, Kalle, and Glowacka, Dorota · 2015
Later among the works it cites.
On Symmetric and Asymmetric LSHs for Inner Product Search
Neyshabur, Behnam and Srebro, Nathan · 2015
Later among the works it cites.
Improved Asymmetric Locality Sensitive Hashing (ALSH) for Maximum Inner Product Search (MIPS)
Shrivastava, Anshumali and Li, Ping · 2015
Later among the works it cites.
Quantization based Fast Inner Product Search
Guo, Ruiqi, Kumar, Sanjiv, Choromanski, Krzysztof, and Simcha, David · 2016
Later among the works it cites.
Volumetric Spanners: An Efficient Exploration Basis for Learning
Hazan, Elad and Karnin, Zohar · 2016
Later among the works it cites.
Online Stochastic Linear Optimization under One-bit Feedback
Zhang, Lijun, Yang, Tianbao, Jin, Rong, Xiao, Yichi, and Zhou, Zhi-hua · 2016
Later among the works it cites.
Linear Thompson Sampling Revisited
Abeille, Marc and Lazaric, Alessandro · 2017
Closest in time.
Provable Optimal Algorithms for Generalized Linear Contextual Bandits
Li, Lihong, Lu, Yu, and Zhou, Dengyong · 2017
Closest in time.