Fetching the paper…
Reading the bibliography…
High-dimensional representations often have a lower dimensional underlying structure.
On lines and planes of closest fit to systems of points in space
Pearson, K · 1901
Earlier work this paper cites.
The approximation of one matrix by another of lower rank
Eckart, C. and Young, G · 1936
Earlier work this paper cites.
Asymptotic theory for principal component analysis
Anderson, T. W. et al · 1963
Earlier work this paper cites.
The rotation of eigenvectors by a perturbation. iii
Davis, C. and Kahan, W. M · 1970
Earlier work this paper cites.
On tail probabilities for martingales
Freedman, D. A · 1975
Earlier work this paper cites.
Asymptotically efficient adaptive allocation rules
Lai, T. L. and Robbins, H · 1985
Earlier work this paper cites.
Some aspects of the sequential design of experiments
Robbins, H · 1985
Earlier work this paper cites.
Gradient-based learning applied to document recognition
LeCun, Y., Bottou, L., Bengio, Y., and Haffner, P · 1998
Earlier work this paper cites.
Independent component analysis: algorithms and applications
Hyvärinen, A. and Oja, E · 2000
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.
Near-optimal signal recovery from random projections: Universal encoding strategies?
Candes, E. J. and Tao, T · 2006
Cited alongside, same era.
Stochastic linear optimization under bandit feedback
Dani, V., Hayes, T. P., and Kakade, S. M · 2008
Cited alongside, same era.
Finite sample approximation results for principal component analysis: A matrix perturbation approach
Nadler, B · 2008
Cited alongside, same era.
Learning multiple layers of features from tiny images
Krizhevsky, A. and Hinton, G · 2009
Cited alongside, same era.
Near-optimal regret bounds for reinforcement learning
Jaksch, T., Ortner, R., and Auer, P · 2010
Cited alongside, same era.
Regret bounds for sleeping experts and bandits
Kleinberg, R., Niculescu-Mizil, A., and Sharma, Y · 2010
Cited alongside, same era.
Online-to-confidence-set conversions and application to sparse stochastic bandits
Abbasi-Yadkori, Y., Pal, D., and Szepesvari, C · 2012
Later among the works it cites.
Bandit theory meets compressed sensing for high dimensional stochastic linear bandit
Carpentier, A. and Munos, R · 2012
Later among the works it cites.
Imagenet classification with deep convolutional neural networks
Krizhevsky, A., Sutskever, I., and Hinton, G. E · 2012
Later among the works it cites.
Theory of linear operators in Hilbert space
Akhiezer, N. I. and Glazman, I. M · 2013
Later among the works it cites.
Non-convex robust pca
Netrapalli, P., Niranjan, U., Sanghavi, S., Anandkumar, A., and Jain, P · 2014
Later among the works it cites.
An introduction to matrix concentration inequalities
Tropp, J. A · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
A contextual-bandit approach to personalized news article recommendation
Li, L., Chu, W., Langford, J., and Schapire, R. E · 2010
Cited alongside, same era.
Linearly parameterized bandits
Rusmevichientong, P. and Tsitsiklis, J. N · 2010
Cited alongside, same era.
Regret bounds for the adaptive control of linear quadratic systems
Abbasi-Yadkori, Y. and Szepesvári, C · 2011
Cited alongside, same era.
Improved algorithms for linear stochastic bandits
Abbasi-Yadkori, Y., Pál, D., and Szepesvári, C · 2011
Cited alongside, same era.
Low-rank bandits with latent mixtures
Gopalan, A., Maillard, O.-A., and Zaki, M · 2016
Later among the works it cites.
Streaming pca: Matching matrix bernstein and near-optimal finite sample guarantees for oja’s algorithm
Jain, P., Jin, C., Kakade, S. M., Netrapalli, P., and Sidford, A · 2016
Later among the works it cites.
Compressed sensing using generative models
Bora, A., Jalal, A., Price, E., and Dimakis, A. G · 2017
Later among the works it cites.
Finite sample guarantees for pca in non-isotropic and data-dependent noise
Vaswani, N. and Narayanamurthy, P · 2017
Later among the works it cites.