References
Published online by Cambridge University Press: 21 April 2022
Summary
A summary is not available for this content so a preview has been provided. Please use the Get access link above for information on how to access this content.
- Type
- Chapter
- Information
- Mathematical Pictures at a Data Science Exhibition , pp. 311 - 314Publisher: Cambridge University PressPrint publication year: 2022
References
Bach, F. 2017. Breaking the curse of dimensionality with convex neural networks. Journal of Machine Learning Research, 18(1), 629–681.Google Scholar
Bartlett, P. L, Montanari, A., and Rakhlin, A. 2021. Deep learning: a statistical viewpoint. Acta Numerica, 30, 87–201.CrossRefGoogle Scholar
Belkin, M. 2021. Fit without fear: remarkable mathematical phenomena of deep learning through the prism of interpolation. Acta Numerica, 30, 203–248.Google Scholar
Ben-Tal, A., El Ghaoui, L., and Nemirovski, A. 2009. Robust Optimization. Princeton University Press.CrossRefGoogle Scholar
Bilyk, D., and Lacey, M. T. 2015. Random tessellations, restricted isometric embeddings, and one bit sensing. arXiv preprint arXiv:1512.06697.Google Scholar
Binev, P., Cohen, A., Dahmen, W., DeVore, R. A., Petrova, G., and Wojtaszczyk, P. 2017. Data assimilation in reduced modeling. SIAM/ASA Journal on Uncertainty Quantification, 5(1), 1–29.CrossRefGoogle Scholar
Boucheron, S., Lugosi, G., and Massart, P. 2013. Concentration Inequalities: A Nonasymptotic Theory of Independence. Oxford University Press.Google Scholar
Buldygin, V. V., and Kozachenko, Yu. V. 2000. Metric Characterization of Random Variables and Random Processes. American Mathematical Society.CrossRefGoogle Scholar
Chazelle, B. 2001. The Discrepancy Method: Randomness and Complexity. Cambridge University Press.Google Scholar
Cheney, E. W., and Light, W. A. 2009. A Course in Approximation Theory. American Mathematical Society.CrossRefGoogle Scholar
DeVore, R., and Lorentz, G. G. 1993. Constructive Approximation. Springer Science & Business Media.Google Scholar
DeVore, R., Foucart, S., Petrova, G., and Wojtaszczyk, P. 2019. Computing a quantity of interest from observational data. Constructive Approximation, 49(3), 461–508.Google Scholar
DeVore, R., Hanin, B., and Petrova, G. 2021. Neural network approximation. Acta Numerica, 30, 327–444.Google Scholar
Dey, T. K., and Wang, Y. 2022. Computational Topology for Data Analysis. Cambridge University Press.Google Scholar
Dick, J., and Pillichshammer, F. 2010. Digital Nets and Sequences: Discrepancy Theory and Quasi-Monte Carlo Integration. Cambridge University Press.CrossRefGoogle Scholar
Dick, J., Kuo, F. Y., and Sloan, I. H. 2013. High-dimensional integration: the quasi-Monte Carlo way. Acta Numerica, 22, 133–288.CrossRefGoogle Scholar
Du, D., and Hwang, F. K. 2000. Combinatorial Group Testing and Its Applications. World Scientific.Google Scholar
D’yachkov, A. G., Vorob’ev, I. V., Polyansky, N. A., and Shchukin, V. Yu. 2014. Bounds on the rate of disjunctive codes. Problems of Information Transmission, 50(1), 27–56.Google Scholar
Eldar, Y. C., and Kutyniok, G. 2012. Compressed Sensing: Theory and Applications. Cambridge University Press.CrossRefGoogle Scholar
Foucart, S. 2017. Flavors of compressive sensing. Pages 61–104 of: Approximation Theory XV: San Antonio 2016. Springer Proceedings in Mathematics & Statistics. Springer.Google Scholar
Foucart, S. 2019. Sampling schemes and recovery algorithms for functions of few coordinate variables. Journal of Complexity, 101457.Google Scholar
Foucart, S. 2021. Facilitating OWL norm minimizations. Optimization Letters, 15(1), 263–269.Google Scholar
Foucart, S., and Lasserre, J. B. 2019. Computation of Chebyshev polynomials for union of intervals. Computational Methods and Function Theory, 19(4), 625–641.Google Scholar
Foucart, S., and Powers, V. 2017. Basc: constrained approximation by semidefinite programming. IMA Journal of Numerical Analysis, 37(2), 1066–1085.Google Scholar
Foucart, S., and Rauhut, H. 2013. A Mathematical Introduction to Compressive Sensing. Applied and Numerical Harmonic Analysis. Birkhäuser/Springer.CrossRefGoogle Scholar
Foucart, S., Minner, M. F., and Needham, T. 2015. Sparse disjointed recovery from non-inflating measurements. Applied and Computational Harmonic Analysis, 39(3), 558–567.Google Scholar
Hastie, T., Tibshirani, R., and Friedman, J. 2009. The Elements of Statistical Learning. Second edn. Springer.Google Scholar
Higham, C. F., and Higham, D. J. 2019. Deep learning: an introduction for applied mathematicians. SIAM Review, 61(4), 860–891.CrossRefGoogle Scholar
Horn, R. A., and Johnson, C. R. 2013. Matrix Analysis. Second edn. Cambridge University Press.Google Scholar
Lasserre, J. B. 2010. Moments, Positive Polynomials and Their Applications. World Scientific.Google Scholar
Lasserre, J. B. 2015. An Introduction to Polynomial and Semi-Algebraic Optimization. Cambridge University Press.CrossRefGoogle Scholar
Law, K., Stuart, A., and Zygalakis, K. 2015. Data Assimilation: A Mathematical Introduction. Springer International Publishing.Google Scholar
Matousek, J. 2009. Geometric Discrepancy: An Illustrated Guide. Springer Science & Business Media.Google Scholar
Micchelli, C. A., and Rivlin, T. J. (eds). 1977. Optimal Estimation in Approximation Theory. Plenum Press.CrossRefGoogle Scholar
Mohri, M., Rostamizadeh, A., and Talwalkar, A. 2018. Foundations of Machine Learning. MIT Press.Google Scholar
Muthukrishnan, S. 2005. Data streams: algorithms and applications. Foundations and Trends® in Theoretical Computer Science, 1(2), 117–236.Google Scholar
Nesterov, Yu. 2013. Introductory Lectures on Convex Optimization: A Basic Course. Springer Science & Business Media.Google Scholar
Nesterov, Yu., and Nemirovskii, A. 1994. Interior-Point Polynomial Algorithms in Convex Programming. SIAM.CrossRefGoogle Scholar
Novak, E., and Woźniakowski, H. 2008. Tractability of Multivariate Problems: Linear Information. European Mathematical Society.CrossRefGoogle Scholar
Ovchinnikov, S. 2002. Max-min representation of piecewise linear functions. Contributions to Algebra and Geometry, 43(1), 297–302.Google Scholar
Pinkus, A. 1999. Approximation theory of the MLP model in neural networks. Acta Numerica, 8, 143–195.CrossRefGoogle Scholar
Renegar, J. 2001. A Mathematical View of Interior-Point Methods in Convex Optimization. SIAM.CrossRefGoogle Scholar
Scholkopf, B., and Smola, A. J. 2001. Learning with Kernels: Support Vector Machines, Regularization, Optimization, and Beyond. MIT Press.Google Scholar
Shalev-Shwartz, S., and Ben-David, S. 2014. Understanding Machine Learning: From Theory to Algorithms. Cambridge University Press.Google Scholar
Sloan, I. H., and Woźniakowski, H. 1998. When are quasi-Monte Carlo algorithms efficient for high dimensional integrals? Journal of Complexity, 14(1), 1–33.CrossRefGoogle Scholar
Smith, R. C. 2013. Uncertainty Quantification: Theory, Implementation, and Applications. SIAM.Google Scholar
Sukharev, A. G. 1979. Optimal numerical integration formulas for some classes of functions of several variables. Pages 282–285 of: Doklady Akademii Nauk, vol. 246. Russian Academy of Sciences.Google Scholar
Sutton, R. S., and Barto, A. G. 2018. Reinforcement Learning: An Introduction. MIT Press.Google Scholar
Venturi, L., Bandeira, A. S., and Bruna, J. 2019. Spurious valleys in one-hidden-layer neural network optimization landscapes. Journal of Machine Learning Research, 20(133), 1–34.Google Scholar
Vershynin, R. 2018. High-Dimensional Probability: An Introduction with Applications in Data Science. Cambridge University Press.CrossRefGoogle Scholar
Vybíral, J. 2020. A variant of Schur’s product theorem and its applications. Advances in Mathematics, 368, 107140.CrossRefGoogle Scholar
Wright, S. J., and Recht, B. 2022. Optimization for Data Analysis. Cambridge University Press.Google Scholar
Yarotsky, D. 2018. Optimal approximation of continuous functions by very deep ReLU networks. Pages 639–649 of: Conference on Learning Theory. Proceedings of Machine Learning Research.Google Scholar