Fetching the paper…
Reading the bibliography…
We introduce the bilinear bandit problem with low-rank structure in which an action takes the form of a pair of arms from two different entity types, and the reward is a bilinear function of the known feature vectors of the arms.
Hierarchical exploration for accelerating contextual bandits
Yue, Y., Hong, S. A. S., and Guestrin, C · 1902
Earlier work this paper cites.
Asymptotically Efficient Adaptive Allocation Rules
Lai, T. L. and Robbins, H · 1985
Earlier work this paper cites.
Matrix Perturbation Theory
Stewart, G. W. and Sun, J.-g · 1990
Earlier work this paper cites.
Using Confidence Bounds for Exploitation-Exploration Trade-offs
Auer, P · 2002
Earlier work this paper cites.
Finite-time Analysis of the Multiarmed Bandit Problem
Auer, P., Cesa-Bianchi, N., and Fischer, P · 2002
Earlier work this paper cites.
A nonlinear programming algorithm for solving semidefinite programs via low-rank factorization
Burer, S. and Monteiro, R. D. C · 2003
Earlier work this paper cites.
Finding maximum Volume sub-matrices of a matrix
Çivril, A. and Magdon-Ismail, M · 2007
Earlier work this paper cites.
Bernoulli Rank-1 Bandits for Click Feedback
Katariya, S., Kveton, B., Szepesvári, C., Vernade, C., and Wen, Z · 2007
Earlier work this paper cites.
Stochastic Linear Optimization under Bandit Feedback
Dani, V., Hayes, T. P., and Kakade, S. M · 2008
Earlier work this paper cites.
SoRec: Social Recommendation Using Probabilistic Matrix Factorization
Ma, H., Yang, H., Lyu, M. R., and King, I · 2008
Earlier work this paper cites.
Forced-exploration based algorithms for playing in stochastic linear bandits
Abbasi-Yadkori, Y., Antos, A., and Szepesvári, C · 2009
Earlier work this paper cites.
On selecting a maximum volume sub-matrix of a matrix and related problems
Çivril, A. and Magdon-Ismail, M · 2009
Earlier work this paper cites.
Column subset selection, matrix factorization, and eigenvalue optimization
Tropp, J. A · 2009
Earlier work this paper cites.
Parametric Bandits: The Generalized Linear Case
Filippi, S., Cappe, O., Garivier, A., and Szepesvári, C · 2010
Earlier work this paper cites.
Matrix Completion from Noisy Entries
Keshavan, R. H., Montanari, A., and Oh, S · 2010
Cited alongside, same era.
A Contextual-Bandit Approach to Personalized News Article Recommendation
Li, L., Chu, W., Langford, J., and Schapire, R. E · 2010
Cited alongside, same era.
New restricted isometry results for noisy low-rank recovery
Mohan, K. and Fazel, M · 2010
Cited alongside, same era.
Guaranteed Minimum-Rank Solutions of Linear Matrix Equations via Nuclear Norm Minimization
Recht, B., Fazel, M., and Parrilo, P. A · 2010
Cited alongside, same era.
Linearly Parameterized Bandits
Rusmevichientong, P. and Tsitsiklis, J. N · 2010
Cited alongside, same era.
Improved Algorithms for Linear Stochastic Bandits
Abbasi-Yadkori, Y., Pal, D., and Szepesvari, C · 2011
Cited alongside, same era.
Structured Stochastic Linear Bandits
Johnson, N., Sivakumar, V., and Banerjee, A · 2016
Later among the works it cites.
Collaborative Filtering Bandits
Li, S., Karatzoglou, A., and Gentile, C · 2016
Later among the works it cites.
Online Stochastic Linear Optimization under One-bit Feedback
Zhang, L., Yang, T., Jin, R., Xiao, Y., and Zhou, Z.-h · 2016
Later among the works it cites.
Active Positive Semidefinite Matrix Completion: Algorithms, Theory and Applications
Bhargava, A., Ganti, R., and Nowak, R · 2017
Later among the works it cites.
Multi-Task Learning for Contextual Bandits
Deshmukh, A. A., Dogan, U., and Scott, C · 2017
Later among the works it cites.
On Context-Dependent Clustering of Bandits
Gentile, C., Li, S., Kar, P., Karatzoglou, A., Zappella, G., and Etrue, E · 2017
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
An Empirical Evaluation of Thompson Sampling
Chapelle, O. and Li, L · 2011
Cited alongside, same era.
Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems
Bubeck, S. and Cesa-Bianchi, N · 2012
Cited alongside, same era.
A Gang of Bandits
Cesa-Bianchi, N., Gentile, C., and Zappella, G · 2013
Cited alongside, same era.
Online Clustering of Bandits
Gentile, C., Li, S., and Zappella, G · 2014
Cited alongside, same era.
Spectral Bandits for Smooth Graph Functions
Valko, M., Munos, R., Kveton, B., and Kocak, T · 2014
Cited alongside, same era.
ROP: Matrix recovery via rank-one projections
Cai, T. T., Zhang, A., and Others · 2015
Cited alongside, same era.
Later among the works it cites.
Sparse linear contextual bandits via relevance vector machines
Gilton, D. and Willett, R · 2017
Later among the works it cites.
Scalable Generalized Linear Bandits: Online Computation and Hashing
Jun, K.-S., Bhargava, A., Nowak, R., and Willett, R · 2017
Later among the works it cites.
Kveton, B., Szepesvári, C., Rao, A., Wen, Z., Abbasi-Yadkori, Y., and Muthukrishnan, S · 2017
Later among the works it cites.
A network integration approach for drug-target interaction prediction and computational drug repositioning from heterogeneous information
Luo, Y., Zhao, X., Zhou, J., Yang, J., Zhang, Y., Kuang, W., Peng, J., Chen, L., and Zeng, J · 2017
Later among the works it cites.
Contextual Bandits with Latent Confounders: An NMF Approach
Sen, R., Shanmugam, K., Kocaoglu, M., Dimakis, A., and Shakkottai, S · 2017
Later among the works it cites.
Horde of Bandits using Gaussian Markov Random Fields
Vaswani, S., Schmidt, M., and Lakshmanan, L. V. S · 2017
Later among the works it cites.
Bandit Algorithms
Lattimore, T. and Szepesvári, C · 2018
Later among the works it cites.
Zimmert, J. and Seldin, Y · 2018
Later among the works it cites.