Optimal Iterative Algorithms for Problems With Random Data
Offered By: Simons Institute via YouTube
Course Description
Overview
Explore a thought-provoking lecture on optimal iterative algorithms for problems with random data, presented by Andrea Montanari from Stanford University. Delve into the intricacies of computational complexity in statistical inference as part of the Computational Complexity of Statistical Inference Boot Camp. Gain valuable insights into the development and application of efficient algorithms for solving problems involving random data sets. Discover how these algorithms can be optimized for improved performance and accuracy in various statistical inference tasks.
Syllabus
Optimal Iterative Algorithms for Problems With Random Data
Taught by
Simons Institute
Related Courses
Introduction to Bayesian StatisticsDatabricks via Coursera Probability via Computation - Week 4
The Julia Programming Language via YouTube On the Unreasonable Effectiveness of Compressive Imaging - Ben Adcock, Simon Fraser University
Alan Turing Institute via YouTube The Mother of All Representer Theorems for Inverse Problems and Machine Learning - Michael Unser
Alan Turing Institute via YouTube Affine Spline Insights into Deep Learning - Richard Baraniuk, Rice University
Alan Turing Institute via YouTube