[18] L. Breiman. Random forests. Machine Learning, 45:5-32, 2001.
[19] Y. Cao and Q. Gu. Generalization bounds of stochastic gradient descent for wide and deep neural networks. Advances in Neural Information Processing Systems, 32:10836-10846, 2019.
[20] Y. Cao and Q. Gu. Generalization error bounds of gradient descent for learning overparameterized deep relu networks. Proceedings of the AAAI Conference on Artificial Intelligence, 34(04):3349-3356, 2020.
[21] E. D. Carvalho, R. Clark, A. Nicastro, and P. H. Kelly. Scalable uncertainty for computer vision with functional variational inference. In Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition, pages 12003-12013, 2020.
[22] H. Chen, Z. Huang, H. Lam, H. Qian, and H. Zhang. Learning prediction intervals for regression: Generalization and calibration. In International Conference on Artificial Intelligence and Statistics, 2021.
[23] L. Chizat, E. Oyallon, and F. Bach. On lazy training in differentiable programming. Advances in neural information processing systems, 32, 2019.
[24] A. Christmann and R. Hable. On the consistency of the bootstrap approach for support vector machines and related kernel-based methods. Empirical inference: Festschrift in honor of vladimir n. vapnik, pages 231-244, 2013.
[25] A. Christmann and I. Steinwart. Consistency and robustness of kernel-based regression in convex risk minimization. Bernoulli, 13(3):799-819, 2007.
[26] A. Christmann and I. Steinwart. How svms can estimate quantiles and the median. Advances in Neural Information Processing Systems, 20:305-312, 2007.
[27] F. Cucker and S. Smale. On the mathematical foundations of learning. Bulletin of the American Mathematical Society, 39(1):1-49, 2002.
[28] G. Cybenko. Approximation by superpositions of a sigmoidal function. Mathematics of Control, Signals and Systems, 2(4):303-314, 1989.
[29] N. Dalmasso, T. Pospisil, A. B. Lee, R. Izbicki, P. E. Freeman, and A. I. Malz. Conditional density estimation tools in python and r with applications to photometric redshifts and likelihood-free cosmological inference. *Astronomy and Computing*, 30:100362, 2020.
[30] A. C. Davison and D. V. Hinkley. Bootstrap methods and their application. Cambridge university press, 1997.
[31] M. Debruyne, M. Hubert, and J. A. Suykens. Model selection in kernel based regression using the influence function. Journal of Machine Learning Research, 9(10), 2008.
[32] S. Depeweg, J. M. Hernández-Lobato, F. Doshi-Velez, and S. Udluft. Learning and policy search in stochastic dynamical systems with bayesian neural networks. arXiv preprint arXiv:1605.07127, 2016.
[33] S. Depeweg, J.-M. Hernandez-Lobato, F. Doshi-Velez, and S. Udluft. Decomposition of uncertainty in bayesian deep learning for efficient and risk-sensitive learning. In International Conference on Machine Learning, pages 1184–1193. PMLR, 2018.
[34] S. Du, J. Lee, H. Li, L. Wang, and X. Zhai. Gradient descent finds global minima of deep neural networks. In International Conference on Machine Learning, pages 1675-1685. PMLR, 2019.
[35] S. S. Du, X. Zhai, B. Poczos, and A. Singh. Gradient descent provably optimizes overparameterized neural networks. In International Conference on Learning Representations, 2018.
[36] V. Dutordoir, H. Salimbeni, J. Hensman, and M. Deisenroth. Gaussian process conditional density estimation. In Advances in Neural Information Processing Systems, pages 2385-2395, 2018.