Lee-Ad Gottlieb, Aryeh Kontorovich, and Robert Krauthgamer. Efficient regression in metric spaces via approximate lipschitz extension. IEEE Transactions on Information Theory, 63(8):4838-4849, 2017. doi: 10.1109/TIT.2017.2713820.
László Györfi, Michael Kohler, Adam Krzyżak, and Harro Walk. A distribution-free theory of nonparametric regression. Springer Series in Statistics. Springer-Verlag, New York, 2002. ISBN 0-387-95441-4. doi: 10.1007/b97848. URL http://dx.doi.org/10.1007/b97848.
Max Hopkins, Daniel M Kane, Shachar Lovett, and Gaurav Mahajan. Realizable learning is all you need. In Conference on Learning Theory, pages 3015-3069. PMLR, 2022.
Michael J Kearns and Umesh Vazirani. An introduction to computational learning theory. MIT press, 1994.
Samory Kpotufe, Ruth Urner, and Shai Ben-David. Hierarchical label queries with data-dependent partitions. In Peter Grünwald, Elad Hazan, and Satyen Kale, editors, Proceedings of The 28th Conference on Learning Theory, COLT 2015, Paris, France, July 3-6, 2015, volume 40 of JMLR Workshop and Conference Proceedings, pages 1176-1189. JMLR.org, 2015. URL http://proceedings.mlr.press/v40/Kpotufe15.html.
L. Kuipers and H. Niederreiter. Uniform distribution of sequences. Wiley-Interscience [John Wiley & Sons], New York-London-Sydney, 1974. Pure and Applied Mathematics.
Philip M. Long. Efficient algorithms for learning functions with bounded variation. Inf. Comput., 188 (1):99-115, 2004. doi: 10.1016/S0890-5401(03)00164-0. URL https://doi.org/10.1016/S0890-5401(03)00164-0.
Yu. V. Malykhin. Averaged modulus of continuity and bracket compactness. Mat. Zametki, 87(3): 468-471, 2010. ISSN 0025-567X. doi: 10.1134/S0001434610030181. URL https://doi.org/ 10.1134/S0001434610030181.
Richard Nickl and Benedikt M. Potscher. Bracketing metric entropy rates and empirical central limit theorems for function classes of Besov- and Sobolev-type. J. Theoret. Probab., 20(2):177-199, 2007. ISSN 0894-9840. doi: 10.1007/s10959-007-0058-1. URL https://doi.org/10.1007/s10959-007-0058-1.
Harald Niederreiter and Denis Talay, editors. Monte Carlo and quasi-Monte Carlo methods 2004, 2006. Springer-Verlag, Berlin. ISBN 978-3-540-25541-3; 3-540-25541-9. doi: 10.1007/3-540-31186-6. URL https://doi.org/10.1007/3-540-31186-6.
Adam M. Oberman. An explicit solution of the Lipschitz extension problem. Proc. Amer. Math. Soc., 136(12):4329-4338, 2008. ISSN 0002-9939. doi: 10.1090/S0002-9939-08-09457-4. URL https://doi.org/10.1090/S0002-9939-08-09457-4.
Nicolas Schreuder. Bounding the expectation of the supremum of empirical processes indexed by Hölder classes. Mathematical Methods of Statistics, 29(1):76-86, 2020.
Blagovest Sendov and Vasil A. Popov. The averaged moduli of smoothness. Pure and Applied Mathematics (New York). John Wiley & Sons, Ltd., Chichester, 1988. ISBN 0-471-91952-7. Applications in numerical methods and approximation, A Wiley-Interscience Publication.
Alexandre B. Tsybakov. Introduction to Nonparametric Estimation. Springer Publishing Company, Incorporated, 1st edition, 2008. ISBN 0387790519.
Ruth Urner and Shai Ben-David. Probabilistic Lipschitzness: A niceness assumption for deterministic labels. In Learning Faster from Easy Data WorkshopNIPS, 2013.
Ruth Urner, Sharon Wullf, and Shai Ben-David. PLAL: Cluster-based active learning. In Conference on Learning Theory, 2013.
Aad W. van der Vaart and Jon A. Wellner. Weak Convergence and Empirical Processes. Springer, 1996.
Roman Vershynin. High-dimensional probability: An introduction with applications in data science, volume 47. Cambridge university press, 2018.