Optimal terminal dimensionality reduction in Euclidean space
暂无分享,去创建一个
[1] Roman Vershynin,et al. High-Dimensional Probability , 2018 .
[2] Gábor Lugosi,et al. Concentration Inequalities - A Nonasymptotic Theory of Independence , 2013, Concentration Inequalities.
[3] J. van Leeuwen,et al. Theoretical Computer Science , 2003, Lecture Notes in Computer Science.
[4] M. Talagrand. Upper and Lower Bounds for Stochastic Processes: Modern Methods and Classical Problems , 2014 .
[5] M. Talagrand. Upper and Lower Bounds for Stochastic Processes , 2021, Ergebnisse der Mathematik und ihrer Grenzgebiete. 3. Folge / A Series of Modern Surveys in Mathematics.
[6] Michael Elkin,et al. Terminal embeddings , 2017, Theor. Comput. Sci..
[7] B. M. Fulk. MATH , 1992 .
[8] Sjoerd Dirksen,et al. Tail bounds via generic chaining , 2013, ArXiv.
[9] J. M. BoardmanAbstract,et al. Contemporary Mathematics , 2007 .
[10] W. B. Johnson,et al. Extensions of Lipschitz mappings into Hilbert space , 1984 .
[11] Noga Alon,et al. Optimal Compression of Approximate Inner Products and Dimension Reduction , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).
[12] Sjoerd Dirksen,et al. Dimensionality Reduction with Subgaussian Matrices: A Unified Theory , 2014, Foundations of Computational Mathematics.
[13] Konstantin Makarychev,et al. Nonlinear dimension reduction via outer Bi-Lipschitz extensions , 2018, STOC.
[14] J. Neumann. Zur Theorie der Gesellschaftsspiele , 1928 .
[15] G. G. Stokes. "J." , 1890, The New Yale Book of Quotations.
[16] Kasper Green Larsen,et al. Optimality of the Johnson-Lindenstrauss Lemma , 2016, 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS).