Abramowitz, M., Stegun, I. A. and Romer, R. H. (1988). Handbook of mathematical functions with formulas, graphs, and mathematical tables.
Adams, R. A. and Fournier, J. J. (2003). Sobolev spaces. Elsevier.
Agarwal, N., Gonen, A. and Hazan, E. (2019). Learning in non-convex games with an optimization oracle. In Conference on Learning Theory. PMLR.
Allen-Zhu, Z., Li, Y. and Liang, Y. (2019). Learning and generalization in overparameterized neural networks, going beyond two layers. Advances in neural information processing systems, 32.
Blanchard, G. and Mücke, N. (2018). Optimal rates for regularization of statistical inverse learning problems. Foundations of Computational Mathematics, 18 971-1013.
Boyd, S., Boyd, S. P. and Vandenberghe, L. (2004). Convex optimization. Cambridge university press.
Bravo, M., Leslie, D. and Mertikopoulos, P. (2018). Bandit learning in concave n-person games. Advances in Neural Information Processing Systems, 31.
Brown, G., Hod, S. and Kalemaj, I. (2022). Performative prediction in a stateful world. In International Conference on Artificial Intelligence and Statistics. PMLR.
Caponnetto, A. and De Vito, E. (2007). Optimal rates for the regularized least-squares algorithm. Foundations of Computational Mathematics, 7 331-368.
Cotter, A., Jiang, H. and Sridharan, K. (2019). Two-player games for efficient non-convex constrained optimization. In Algorithmic Learning Theory. PMLR.
Cucker, F. and Smale, S. (2002). On the mathematical foundations of learning. Bulletin of the American mathematical society, 39 1-49.
Cutler, J., Diaz, M. and Drusvyatskiy, D. (2022). Stochastic approximation with decision-dependent distributions: asymptotic normality and optimality. arXiv preprint arXiv:2207.04173.
De Vito, E., Rosasco, L., Caponnetto, A., De Giovannini, U., Odone, F. and Bartlett, P. (2005). Learning from examples as an inverse problem. Journal of Machine Learning Research, 6.
Debreu, G. (1952). A social equilibrium existence theorem. Proceedings of the National Academy of Sciences, 38 886-893.
Dicker, L. H., Foster, D. P. and Hsu, D. (2017). Kernel ridge vs. principal component regression: Minimax bounds and the qualification of regularization operators. *Electronic Journal of Statistics*, 11 1022–1047.
Dieuleveut, A. and Bach, F. (2016). Nonparametric stochastic approximation with large step-sizes. The Annals of Statistics, 44 1363 - 1399.
Dieuleveut, A., Flammarion, N. and Bach, F. (2017). Harder, better, faster, stronger convergence rates for least-squares regression. The Journal of Machine Learning Research, 18 3520-3570.
Dong, J., Roth, A., Schutzman, Z., Waggoner, B. and Wu, Z. S. (2018). Strategic classification from revealed preferences. In Proceedings of the 2018 ACM Conference on Economics and Computation.
Drusvyatskiy, D., Fazel, M. and Ratliff, L. J. (2022). Improved rates for derivative free gradient play in strongly monotone games. In 2022 IEEE 61st Conference on Decision and Control (CDC). IEEE.
Drusvyatskiy, D. and Xiao, L. (2022). Stochastic optimization with decision-dependent distributions. Mathematics of Operations Research.
Fischer, S. and Steinwart, I. (2020). Sobolev norm learning rates for regularized least-squares algorithms. The Journal of Machine Learning Research, 21 8464-8501.
Fudenberg, D. and Tirole, J. (1991). Game theory. MIT press.
Hardt, M., Megiddo, N., Papadimitriou, C. and Wootters, M. (2016). Strategic classification. In Proceedings of the 2016 ACM conference on innovations in theoretical computer science.
Izzo, Z., Ying, L. and Zou, J. (2021). How to learn when data reacts to your model: performative gradient descent. In International Conference on Machine Learning. PMLR.