[49] Krishnaram Kenthapadi, Aleksandra Korolova, Ilya Mironov, and Nina Mishra. Privacy via the johnson-lindenstrauss transform. J. Priv. Confidentiality, 5(1), 2013.
[50] Karin Knudson, Rayan Saab, and Rachel Ward. One-bit compressive sensing with norm estimation. IEEE Trans. Inf. Theory, 62(5):2748-2758, 2016.
[51] Alex Krizhevsky and Geoffrey Hinton. Learning multiple layers of features from tiny images. Technical Report, University of Toronto, 2009.
[52] Béatrice Laurent and Pascal Massart. Adaptive estimation of a quadratic functional by model selection. The Annals of Statistics, pages 1302-1338, 2000.
[53] Yann LeCun, Léon Bottou, Yoshua Bengio, and Patrick Haffner. Gradient-based learning applied to document recognition. Proc. IEEE, 86(11):2278-2324, 1998.
[54] Cong Leng, Jian Cheng, and Hanqing Lu. Random subspace for binary codes learning in large scale image retrieval. In Proceedings of the 37th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR), pages 1031-1034, Gold Coast, Australia, 2014.
[55] Ping Li. Sign-full random projections. In Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence (AAAI), pages 4205–4212, Honolulu, HI, 2019.
[56] Ping Li, Trevor Hastie, and Kenneth Ward Church. Very sparse random projections. In proceedings of the Twelfth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD), pages 287-296, Philadelphia, PA, 2006.
[57] Ping Li and Xiaoyun Li. OPORP: one permutation + one random projection. In Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data Mining (KDD), pages 1303-1315, Long Beach, CA, 2023.
[58] Ping Li, Michael Mitzenmacher, and Anshumali Shrivastava. Coding for random projections. In Proceedings of the 31th International Conference on Machine Learning (ICML), pages 676-684, Beijing, China, 2014.
[59] Ping Li and Weijie Zhao. Gcwsnet: Generalized consistent weighted sampling for scalable and accurate training of neural networks. In Proceedings of the 31st ACM International Conference on Information & Knowledge Management (CIKM), pages 1188-1198, Atlanta, GA, 2022.
[60] Xiaoyun Li and Ping Li. Generalization error analysis of quantized compressive learning. In Advances in Neural Information Processing Systems (NeurIPS), pages 15124-15134, Vancouver, Canada, 2019.
[61] Xiaoyun Li and Ping Li. Random projections with asymmetric quantization. In Advances in Neural Information Processing Systems (NeurIPS), pages 10857-10866, Vancouver, Canada, 2019.
[62] Xiaoyun Li and Ping Li. One-sketch-for-all: Non-linear random features from compressed linear measurements. In Proceedings of the 24th International Conference on Artificial Intelligence and Statistics (AISTATS), pages 2647-2655, Virtual Event, 2021.
[63] Xiaoyun Li and Ping Li. Quantization algorithms for random Fourier features. In Proceedings of the 38th International Conference on Machine Learning (ICML), pages 6369-6380, Virtual Event, 2021.
[64] Xiaoyun Li and Ping Li. Signrff: Sign random fourier features. In Advances in Neural Information Processing Systems (NeurIPS), pages 17802-17817, New Orleans, LA, 2022.
[65] Xiaoyun Li and Ping Li. Differentially private one permutation hashing and bin-wise consistent weighted sampling. arXiv preprint arXiv:2306.07674, 2023.
[66] Kobbi Nissim, Sofya Raskhodnikova, and Adam D. Smith. Smooth sensitivity and sampling in private data analysis. In Proceedings of the 39th Annual ACM Symposium on Theory of Computing (STOC), pages 75-84, San Diego, CA, 2007.