This version of Talks.cam will be replaced by 1 July 2026, further information is available on the UIS Help Site
 

University of Cambridge > Talks.cam > Applied and Computational Analysis > Stay flexible, get lucky: nonlinear approximation and random sampling meet scientific machine learning

Stay flexible, get lucky: nonlinear approximation and random sampling meet scientific machine learning

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact Georg Maierhofer.

Nonlinear approximation and random sampling are two vital mathematical pillars of machine learning. On the one hand, nonlinear approximation provides flexible models, such as sparse polynomials or deep neural networks, able to accurately represent very complex functions. On the other hand, random sampling allows us to solve data-starved inverse problems via, e.g., compressive sensing. In recent years, these tools have been frequently employed to tackle challenging problems in scientific computing within the research field now known as scientific machine learning. In this talk, I will review recent advances in this area by showcasing results in high-dimensional approximation, surrogate modelling, and PDE solvers. Throughout the talk, the emphasis will be on numerical techniques accompanied by rigorous mathematical guarantees of performance.

This talk is part of the Applied and Computational Analysis series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.

 

© 2006-2026 Talks.cam, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity