[16] A. Javanmard, M. Soltanolkotabi, and H. Hassani. Precise tradeoffs in adversarial training for linear regression. In Conference on Learning Theory, pages 2034-2078. PMLR, 2020.
[17] T. Liang and A. Rakhlin. Just interpolate: Kernel "ridgeless" regression can generalize. The Annals of Statistics, 48(3):1329-1347, 2020.
[18] Q. Ma, E. Wagh, J. Wen, Z. Xia, R. Ormandi, and D. Chen. Score look-alike audiences. In 2016 IEEE 16th International Conference on Data Mining Workshops (ICDMW), pages 647-654. IEEE, 2016.
[19] Q. Ma, M. Wen, Z. Xia, and D. Chen. A sub-linear, massive-scale look-alike audience extension system a massive-scale look-alike audience extension. In Workshop on Big Data, Streams and Heterogeneous Source Mining: Algorithms, Systems, Programming Models and Applications, pages 51-67. PMLR, 2016.
[20] M. Malekzadeh, A. Borovykh, and D. Gündüz. Honest-but-curious nets: Sensitive attributes of private inputs can be secretly coded into the classifiers' outputs. In Proceedings of the 2021 ACM SIGSAC Conference on Computer and Communications Security, pages 825-844, 2021.
[21] A. Mangalampalli, A. Ratnaparkhi, A. O. Hatch, A. Bagherjeiran, R. Parekh, and V. Pudi. A feature-pair-based associative classification approach to look-alike modeling for conversion-oriented user-targeting in tail campaigns. In Proceedings of the 20th international conference companion on World wide web, pages 85-86, 2011.
[22] S. Mei and A. Montanari. The generalization error of random features regression: Precise asymptotics and the double descent curve. Communications on Pure and Applied Mathematics, 75(4):667-766, 2022.
[23] H. Park and K. Shim. Approximate algorithms for k-anonymity. In Proceedings of the 2007 ACM SIGMOD international conference on Management of data, pages 67-78, 2007.
[24] A. Sarker, W.-K. Sung, and M. S. Rahman. A linear time algorithm for the r-gathering problem on the line. Theoretical Computer Science, 866:96-106, 2021.
[25] R. E. Schapire. Explaining adaboost. In Empirical inference, pages 37-52. Springer, 2013.
[26] J. Shen, S. C. Geyik, and A. Dasdan. Effective audience extension in online advertising. In Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pages 2099–2108, 2015.
[27] C. Song and V. Shmatikov. Overlearning reveals sensitive attributes. arXiv preprint arXiv:1905.11742, 2019.
[28] G. W. Stewart. On the perturbation of pseudo-inverses, projections and linear least squares problems. SIAM review, 19(4):634-662, 1977.
[29] C. Thrampoulidis, E. Abbasi, and B. Hassibi. Precise error analysis of regularized  $m$ -estimators in high dimensions. IEEE Transactions on Information Theory, 64(8):5592-5628, 2018.
[30] C. Thrampoulidis, S. Oymak, and B. Hassibi. Regularized linear regression: A precise analysis of the estimation error. In Conference on Learning Theory, pages 1683-1709, 2015.
[31] S. Tu. On the smallest singular value of non-centered gaussian designs, 2020.
[32] A. J. Wyner, M. Olson, J. Bleich, and D. Mease. Explaining the success of adaboost and random forests as interpolating classifiers. The Journal of Machine Learning Research, 18(1):1558-1590, 2017.
[33] C. Zhang, S. Bengio, M. Hardt, M. C. Mozer, and Y. Singer. Identity crisis: Memorization and generalization under extreme overparameterization. In International Conference on Learning Representations, 2020.
[34] C. Zhang, S. Bengio, M. Hardt, B. Recht, and O. Vinyals. Understanding deep learning (still) requires rethinking generalization. Communications of the ACM, 64(3):107-115, 2021.