暂无分享,去创建一个
Babak Hassibi | Kamyar Azizzadenesheli | Anima Anandkumar | Sahin Lale | B. Hassibi | K. Azizzadenesheli | Anima Anandkumar | Sahin Lale
[1] Rémi Munos,et al. Bandit Theory meets Compressed Sensing for high dimensional Stochastic Linear Bandit , 2012, AISTATS.
[2] T. L. Lai Andherbertrobbins. Asymptotically Efficient Adaptive Allocation Rules , 2022 .
[3] Alexandros G. Dimakis,et al. Compressed Sensing using Generative Models , 2017, ICML.
[4] Peter Auer,et al. Finite-time Analysis of the Multiarmed Bandit Problem , 2002, Machine Learning.
[5] John N. Tsitsiklis,et al. Linearly Parameterized Bandits , 2008, Math. Oper. Res..
[6] Csaba Szepesvári,et al. Online-to-Confidence-Set Conversions and Application to Sparse Stochastic Bandits , 2012, AISTATS.
[7] Namrata Vaswani,et al. Finite sample guarantees for PCA in non-isotropic and data-dependent noise , 2017, 2017 55th Annual Allerton Conference on Communication, Control, and Computing (Allerton).
[8] Prateek Jain,et al. Streaming PCA: Matching Matrix Bernstein and Near-Optimal Finite Sample Guarantees for Oja's Algorithm , 2016, COLT.
[9] Chandler Davis. The rotation of eigenvectors by a perturbation , 1963 .
[10] T. W. Anderson. ASYMPTOTIC THEORY FOR PRINCIPAL COMPONENT ANALYSIS , 1963 .
[11] Aditya Gopalan,et al. Low-rank Bandits with Latent Mixtures , 2016, ArXiv.
[12] Wei Chu,et al. A contextual-bandit approach to personalized news article recommendation , 2010, WWW '10.
[13] Erkki Oja,et al. Independent component analysis: algorithms and applications , 2000, Neural Networks.
[14] Peter Auer,et al. Near-optimal Regret Bounds for Reinforcement Learning , 2008, J. Mach. Learn. Res..
[15] Alex Krizhevsky,et al. Learning Multiple Layers of Features from Tiny Images , 2009 .
[16] Thomas P. Hayes,et al. Stochastic Linear Optimization under Bandit Feedback , 2008, COLT.
[17] Prateek Jain,et al. Non-convex Robust PCA , 2014, NIPS.
[18] Karl Pearson F.R.S.. LIII. On lines and planes of closest fit to systems of points in space , 1901 .
[19] C. Eckart,et al. The approximation of one matrix by another of lower rank , 1936 .
[20] Geoffrey E. Hinton,et al. ImageNet classification with deep convolutional neural networks , 2012, Commun. ACM.
[21] Peter Auer,et al. Using Confidence Bounds for Exploitation-Exploration Trade-offs , 2003, J. Mach. Learn. Res..
[22] D. Freedman. On Tail Probabilities for Martingales , 1975 .
[23] I. M. Glazman,et al. Theory of linear operators in Hilbert space , 1961 .
[24] Robert D. Kleinberg,et al. Regret bounds for sleeping experts and bandits , 2010, Machine Learning.
[25] B. Nadler. Finite sample approximation results for principal component analysis: a matrix perturbation approach , 2009, 0901.3245.
[26] Simon Haykin,et al. GradientBased Learning Applied to Document Recognition , 2001 .
[27] Csaba Szepesvári,et al. Regret Bounds for the Adaptive Control of Linear Quadratic Systems , 2011, COLT.
[28] Csaba Szepesvári,et al. Improved Algorithms for Linear Stochastic Bandits , 2011, NIPS.
[29] H. Robbins. Some aspects of the sequential design of experiments , 1952 .
[30] Emmanuel J. Candès,et al. Near-Optimal Signal Recovery From Random Projections: Universal Encoding Strategies? , 2004, IEEE Transactions on Information Theory.