YoVDO

Optimal Iterative Algorithms for Problems With Random Data

Offered By: Simons Institute via YouTube

Tags

Algorithm Design Courses Computational Complexity Courses Statistical Inference Courses Computational Statistics Courses

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

Advanced Algorithms and Complexity
University of California, San Diego via Coursera
Advanced Data Structures in Java
University of California, San Diego via Coursera
Conception et mise en œuvre d'algorithmes.
École Polytechnique via Coursera
Practical Steps for Building Fair AI Algorithms
Fred Hutchinson Cancer Center via Coursera
算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera