Fetching the paper…
Reading the bibliography…
We present a framework for analyzing the exact dynamics of a class of online learning algorithms in the high-dimensional scaling limit.
R. J. Aumann, “Markets with a continuum of traders,” Econom. J. Econom. Soc. , pp. 39–50, 1964
1964
Earlier work this paper cites.
——, “A class of Markov processes associated with nonlinear parabolic equations,” Proc. Natl. Acad. Sci. , vol. 56, no. 6, pp. 1907–1911, 1966
1966
Earlier work this paper cites.
H. P. McKean, “Propagation of chaos for a class of non-linear parabolic equations,” Stoch. Differ. Equations (Lecture Ser. Differ. Equations, Sess. 7, Cathol. Univ., 1967) , pp. 41–57, 1967
1967
Earlier work this paper cites.
1970
Earlier work this paper cites.
P. Diaconis, “Finite forms of de Finetti’s theorem on exchangeability,” Synthese , vol. 36, no. 2, pp. 271–281, 1977. [Online]. Available: http://link.springer.com/article/10.1007/BF00486116
1977
Earlier work this paper cites.
P. Diaconis and D. Freedman, “Finite Exchangeable Sequences,” The Annals of Probability , vol. 8, no. 4, pp. 745–764, Aug. 1980. [Online]. Available: http://projecteuclid.org/euclid.aop/1176994663
1980
Earlier work this paper cites.
A. Nemirovski, D.-B. Yudin, and E.-R. Dawson, Problem complexity and method efficiency in optimization . John Wiley & Sons, Inc., 1982
1982
Earlier work this paper cites.
E. Oja and J. Karhunen, “On stochastic approximation of the eigenvectors and eigenvalues of the expectation of a random matrix,” Journal of mathematical analysis and applications , vol. 106, no. 1, pp. 69–84, 1985
1985
Earlier work this paper cites.
D. J. Aldous, “Exchangeability and related topics,” in {
1985
Earlier work this paper cites.
S. N. Ethier and T. G. Kurtz, Markov Processes: Characterization and Convergence . Wiley, 1985
1985
Earlier work this paper cites.
S. Meleard and S. Roelly-Coppoletta, “A propagation of chaos result for a system of particles with moderate interaction,” Stochastic Processes and their Applications , vol. 26, pp. 317–332, Jan. 1987
1987
Earlier work this paper cites.
A. Benveniste, M. Metivier, and P. Priouret, Adaptive algorithms and stochastic approximations . Springer-Verlag, 1990
1990
Earlier work this paper cites.
A.-S. Sznitman, “Topics in propagation of chaos,” in Ecole d’Eté de Probabilités de Saint-Flour XIX — 1989 , ser. Lecture Notes in Mathematics, P.-L. Hennequin, Ed. Springer Berlin Heidelberg, 1991, no. 1464, pp. 165–251
1991
Earlier work this paper cites.
H. Risken, The Fokker-Planck equation: methods of solution and applications , 2nd ed., ser. Springer series in synergetics. New York: Springer-Verlag, 1996, no. v. 18
1996
Earlier work this paper cites.
M. Bossy and D. Talay, “A stochastic particle method for the McKean-Vlasov and the Burgers equation,” Mathematics of Computation of the American Mathematical Society , vol. 66, no. 217, pp. 157–192, 1997
1997
Earlier work this paper cites.
G. O. Roberts, A. Gelman, W. R. Gilks, and Others, “Weak convergence and optimal scaling of random walk Metropolis algorithms,” Ann. Appl. Probab. , vol. 7, no. 1, pp. 110–120, 1997
1997
Earlier work this paper cites.
P. Billingsley, Convergence of probability measures , 2nd ed., ser. Wiley series in probability and statistics. Probability and statistics section. New York: Wiley, 1999
1999
Earlier work this paper cites.
I. M. Johnstone, “On the distribution of the largest eigenvalue in principal components analysis,” The Annals of Statistics , vol. 29, no. 2, pp. 295–327, Apr. 2001
2001
Earlier work this paper cites.
T. Tanaka, “A statistical-mechanics approach to large-system analysis of CDMA multiuser detectors,” Information Theory, IEEE Transactions on , vol. 48, no. 11, pp. 2888–2910, 2002
2002
Earlier work this paper cites.
B. Oksendal, Stochastic Differential Equations , ser. Universitext. Berlin, Heidelberg: Springer Berlin Heidelberg, 2003
2003
Earlier work this paper cites.
H. J. Kushner and G. G. Yin, Stochastic Approximation and Recursive Algorithms and Applications . Springer, 2003
2003
Earlier work this paper cites.
B. Ristic, S. Arulampalam, and N. Gordon, Beyond the Kalman filter: Particle filters for tracking applications . Artech house Boston, 2004, vol. 685
2004
Earlier work this paper cites.
E. J. Candès, J. Romberg, and T. Tao, “Stable signal recovery from incomplete and inaccurate information,” Comm. Pure and Applied Math. , 2005
2005
Cited alongside, same era.
E. J. Candès and T. Tao, “Near optimal signal recovery from random projections: Universal encoding strategies?” IEEE Trans. Inf. Theory , vol. 52, no. 12, pp. 5406–5425, Dec. 2006
2006
Cited alongside, same era.
D. Donoho, “Compressed sensing,” IEEE Trans. Inf. Theory , vol. 52, no. 4, pp. 1289–1306, Apr. 2006
2006
Cited alongside, same era.
H. Zou, T. Hastie, and R. Tibshirani, “Sparse principal component analysis,” J. Comp. Graph. Stat. , vol. 15, no. 2, pp. 265–286, 2006
2006
Cited alongside, same era.
O. Kallenberg, Foundations of modern probability . Springer Science & Business Media, 2006
2006
Cited alongside, same era.
Z. Harmany, R. Marcia, and R. Willett, “This is SPIRAL-TAP: Sparse Poisson intensity reconstruction algorithms — Theory and practice,” IEEE Trans. Image Process. , vol. 21, no. 3, pp. 1084 –1096, Mar. 2012
2012
Later among the works it cites.
S. Rangan, A. K. Fletcher, and V. K. Goyal, “Asymptotic analysis of MAP estimation via the replica method and applications to compressed sensing,” Information Theory, IEEE Transactions on , vol. 58, no. 3, pp. 1902–1923, 2012
2012
Later among the works it cites.
V. Chandrasekaran, B. Recht, P. A. Parrilo, and A. S. Willsky, “The convex geometry of linear inverse problems,” Found. Comput. Math. , vol. 12, no. 6, pp. 805–849, 2012
2012
Later among the works it cites.
N. L. Roux, M. Schmidt, and F. R. Bach, “A stochastic gradient method with an exponential convergence _rate for finite training sets,” in Adv. Neural Inf. Process. Syst. , 2012, pp. 2663–2671
2012
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. d’Aspremont, L. El Ghaoui, M. I. Jordan, and G. R. G. Lanckriet, “A Direct Formulation for Sparse PCA Using Semidefinite Programming,” SIAM Review , vol. 49, no. 3, pp. 434–448, Jan. 2007. [Online]. Available: http://epubs.siam.org/doi/abs/10.1137/050645506
2007
Cited alongside, same era.
D. Guo and C.-C. Wang, “Random sparse linear systems observed via arbitrary channels: A decoupling principle,” in IEEE International Symposium on Information Theory, 2007. ISIT 2007 , Jun. 2007, pp. 946 –950
2007
Cited alongside, same era.
M. F. Duarte, M. A. Davenport, D. Takhar, J. N. Laska, T. Sun, K. E. Kelly, R. G. Baraniuk, and Others, “Single-pixel imaging via compressive sampling,” IEEE Signal Process. Mag. , vol. 25, no. 2, p. 83, 2008
2008
Cited alongside, same era.
T. Richardson and R. Urbanke, Modern coding theory . Cambridge University Press, 2008
2008
Cited alongside, same era.
D. Donoho and J. Tanner, “Counting faces of randomly projected polytopes when the projection radically lowers dimension,” J. Am. Math. Soc. , vol. 22, no. 1, pp. 1–53, 2009
2009
Cited alongside, same era.
——, “Observed universality of phase transitions in high-dimensional geometry, with implications for modern data analysis and signal processing,” Philos. Trans. R. Soc. London A Math. Phys. Eng. Sci. , vol. 367, no. 1906, pp. 4273–4293, 2009
2009
Cited alongside, same era.
Y. Kabashima, T. Wadayama, and T. Tanaka, “A typical reconstruction limit for compressed sensing based on lp-norm minimization,” Journal of Statistical Mechanics: Theory and Experiment , vol. 2009, no. 09, p. L09003, Sep. 2009
2009
Cited alongside, same era.
E. J. Candes, T. Strohmer, and V. Voroninski, “Phaselift: Exact and stable signal recovery from magnitude measurements via convex programming,” Communications on Pure and Applied Mathematics , vol. 66, no. 8, pp. 1241–1274, 2013
2013
Later among the works it cites.
K. Jaganathan, S. Oymak, and B. Hassibi, “Sparse phase retrieval: Convex algorithms and limitations,” in Information Theory Proceedings (ISIT), 2013 IEEE International Symposium on . IEEE, 2013, pp. 1022–1026
2013
Later among the works it cites.
S. Oymak, C. Thrampoulidis, and B. Hassibi, “The squared-error of generalized lasso: A precise analysis,” in Commun. Control. Comput. (Allerton), 2013 51st Annu. Allert. Conf. IEEE, 2013, pp. 1002–1009
2013
Later among the works it cites.
V. Chandrasekaran and M. I. Jordan, “Computational and statistical tradeoffs via convex relaxation,” Proceedings of the National Academy of Sciences , vol. 110, no. 13, 2013
2013
Later among the works it cites.
J. P. Vila and P. Schniter, “Expectation-maximization Gaussian-mixture approximate message passing,” IEEE Trans. Signal Process. , vol. 61, no. 19, pp. 4658–4672, 2013
2013
Later among the works it cites.
D. Amelunxen, M. Lotz, M. B. McCoy, and J. A. Tropp, “Living on the edge: Phase transitions in convex programs with random data,” Inf. Inference , p. iau005, 2014
2014
Later among the works it cites.
J. J. Bruer, J. A. Tropp, V. Cevher, and S. R. Becker, “Time–data tradeoffs by aggressive smoothing,” in Advances in Neural Information Processing Systems , 2014
2014
Later among the works it cites.
N. Parikh and S. Boyd, “Proximal Algorithms,” Found. Trends Optim. , vol. 1, no. 3, pp. 127–239, Jan. 2014. [Online]. Available: http://dx.doi.org/10.1561/2400000003
2014
Later among the works it cites.
A. Iouditski and Y. Nesterov, “Primal-dual subgradient methods for minimizing uniformly convex functions,” arXiv Prepr. arXiv1401.1792 , 2014
2014
Later among the works it cites.
I. Waldspurger, A. d’Aspremont, and S. Mallat, “Phase recovery, maxcut and complex semidefinite programming,” Mathematical Programming , vol. 149, no. 1-2, pp. 47–81, 2015
2015
Later among the works it cites.
S. Oymak, B. Recht, and M. Soltanolkotabi, “Sharp Time–Data Tradeoffs for Linear Inverse Problems,” arXiv Prepr. arXiv1507.04793 , 2015
2015
Later among the works it cites.
B. Jourdain, T. Lelièvre, and B. Miasojedow, “Optimal scaling for the transient phase of the random walk Metropolis algorithm: The mean-field limit,” The Annals of Applied Probability , vol. 25, no. 4, pp. 2263–2300, Aug. 2015
2015
Later among the works it cites.
2016
Later among the works it cites.
A. Javanmard, A. Montanari, and F. Ricci-Tersenghi, “Phase transitions in semidefinite relaxations,” Proc. Natl. Acad. Sci. , vol. 113, no. 16, pp. E2218—-E2223, 2016
2016
Later among the works it cites.
R. Giryes, Y. C. Eldar, A. M. Bronstein, and G. Sapiro, “Tradeoffs between Convergence Speed and Reconstruction Accuracy in Inverse Problems,” arXiv Prepr. arXiv1605.09232 , 2016
2016
Later among the works it cites.
S. Rangan, P. Schniter, and A. Fletcher, “Vector approximate message passing,” arXiv Prepr. arXiv1610.03082 , 2016
2016
Later among the works it cites.
——, “The scaling limit of high-dimensional online independent component analysis,” in Proc. Conference on Neural Information Processing Systems (NIPS) , Long Beach, CA, Dec. 2017
2017
Closest in time.