[35] Kasper Green Larsen and Jelani Nelson. The Johnson-Lindenstrauss lemma is optimal for linear dimensionality reduction. In 43rd International Colloquium on Automata, Languages, and Programming, volume 55 of LIPIcs. Leibniz Int. Proc. Inform., pages Art. No. 82, 11. Schloss Dagstuhl. Leibniz-Zent. Inform., Wadern, 2016.
[36] Kasper Green Larsen and Jelani Nelson. Optimality of the Johnson-Lindenstrauss lemma. In 58th Annual IEEE Symposium on Foundations of Computer Science—FOCS 2017, pages 633–638. IEEE Computer Soc., Los Alamitos, CA, 2017.
[37] Jisu Kim, Jaehyeok Shin, Alessandro Rinaldo, and Larry Wasserman. Uniform convergence rate of the kernel density estimator adaptive to intrinsic volume dimension. In Kamalika Chaudhuri and Ruslan Salakhutdinov, editors, Proceedings of the 36th International Conference on Machine Learning, volume 97 of Proceedings of Machine Learning Research, pages 3398-3407. PMLR, 09-15 Jun 2019. URL https://proceedings.mlr.press/v97/kim19e.html.
[38] Michael H. Neumann. Strong approximation of density estimators from weakly dependent observations by density estimators from independent observations. Ann. Statist., 26(5):2014-2048, 1998. ISSN 0090-5364. doi: 10.1214/aos/1024691367. URL https://doi.org/10.1214/aos/1024691367.
[39] Herbert Federer. Curvature measures. Transactions of the American Mathematical Society, 93:418-491, 1959. ISSN 0002-9947. doi: 10.2307/1993504. URL https://doi.org/10.2307/1993504.
[40] Christoph Thäle. 50 years sets with positive reach—a survey. Surv. Math. Appl., 3:123-165, 2008. ISSN 1843-7265. doi: 10.1007/s11590-008-0097-2. URL https://doi.org/10.1007/s11590-008-0097-2.
[41] Erik Carlsson, Gunnar Carlsson, and Vin De Silva. An algebraic topological method for feature identification. International Journal of Computational Geometry & Applications, 16(04):291-314, 2006.
[42] Frédéric Chazal, Brittany Fasy, Fabrizio Lecci, Bertrand Michel, Alessandro Rinaldo, Alessandro Rinaldo, and Larry Wasserman. Robust topological inference: Distance to a measure and kernel distance. The Journal of Machine Learning Research, 18(1):5845-5884, 2017.
[43] Hubert Wagner, Chao Chen, and Erald Vuçini. Efficient computation of persistent homology for cubical data. In Topological methods in data analysis and visualization II, pages 91-106. Springer, 2012.
[44] George R Terrell and David W Scott. Variable kernel density estimation. The Annals of Statistics, pages 1236-1265, 1992.
[45] Richard W Hamming. Error detecting and error correcting codes. The Bell system technical journal, 29(2): 147-160, 1950.
[46] Alex Krizhevsky, Geoffrey Hinton, et al. Learning multiple layers of features from tiny images. 2009.
[47] Markus M Breunig, Hans-Peter Kriegel, Raymond T Ng, and Jorg Sander. Lof: identifying density-based local outliers. In Proceedings of the 2000 ACM SIGMOD international conference on Management of data, pages 93-104, 2000.
[48] Fei Tony Liu, Kai Ming Ting, and Zhi-Hua Zhou. Isolation forest. In 2008 eighth ieee international conference on data mining, pages 413-422. IEEE, 2008.
[49] Jiyeon Han, Hwanil Choi, Yunjey Choi, Junho Kim, Jung-Woo Ha, and Jaesik Choi. Rarity score: A new metric to evaluate the uncommonness of synthesized images. arXiv preprint arXiv:2206.08549, 2022.