Optimality of Algorithms for Approximation and Computation - Rothschild Lecture
Offered By: Isaac Newton Institute for Mathematical Sciences via YouTube
Course Description
Overview
Explore the cutting-edge research on optimality of algorithms for approximation and computation in this Rothschild Lecture delivered by Professor Ronald DeVore from Texas A&M University. Delve into the intricate world of data science as the lecture covers topics related to approximation, sampling, and compression. Gain insights into the latest developments in mathematical sciences and their applications in the field of data analysis. Presented at the prestigious Isaac Newton Institute for Mathematical Sciences, this hour-long talk offers a deep dive into the theoretical foundations that underpin modern computational methods.
Syllabus
Date: Tuesday 21st May 2019 - 16:00 to
Taught by
Isaac Newton Institute for Mathematical Sciences
Related Courses
Sparse Representations in Signal and Image Processing: FundamentalsTechnion - Israel Institute of Technology via edX Filters and Other Potions for Early Vision and Recognition
MITCBMM via YouTube ADSI Summer Workshop- Algorithmic Foundations of Learning and Control, Pablo Parrilo
Paul G. Allen School via YouTube A Function Space View of Overparameterized Neural Networks - Rebecca Willet, University of Chicago
Alan Turing Institute via YouTube Approximation with Deep Networks - Remi Gribonval, Inria
Alan Turing Institute via YouTube