Efficient Linear Bandits through Matrix Sketching
暂无分享,去创建一个
Ilja Kuzborskij | Nicolò Cesa-Bianchi | Leonardo Cella | N. Cesa-Bianchi | Ilja Kuzborskij | Leonardo Cella
[1] Luís Torgo,et al. OpenML: networked science in machine learning , 2014, SKDD.
[2] Claudio Gentile,et al. A Gang of Bandits , 2013, NIPS.
[3] David P. Woodruff,et al. Frequent Directions: Simple and Deterministic Matrix Sketching , 2015, SIAM J. Comput..
[4] David P. Woodruff. Sketching as a Tool for Numerical Linear Algebra , 2014, Found. Trends Theor. Comput. Sci..
[5] Michael R. Lyu,et al. CBRAP: Contextual Bandits with RAndom Projection , 2017, AAAI.
[6] Daniele Calandriello,et al. Efficient Second-Order Online Kernel Learning with Adaptive Embedding , 2017, NIPS.
[7] Shipra Agrawal,et al. Thompson Sampling for Contextual Bandits with Linear Payoffs , 2012, ICML.
[8] Nicholas J. Higham,et al. Functions of matrices - theory and computation , 2008 .
[9] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[10] Francesco Orabona,et al. Solving Ridge Regression using Sketched Preconditioned SVRG , 2016, ICML.
[11] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[12] Robert D. Nowak,et al. Scalable Generalized Linear Bandits: Online Computation and Hashing , 2017, NIPS.
[13] Thomas P. Hayes,et al. Stochastic Linear Optimization under Bandit Feedback , 2008, COLT.
[14] Haipeng Luo,et al. Efficient Second Order Online Learning by Sketching , 2016, NIPS.
[15] Alessandro Lazaric,et al. Linear Thompson Sampling Revisited , 2016, AISTATS.