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
Automata TheoryStanford University via edX Introduction to Computational Thinking and Data Science
Massachusetts Institute of Technology via edX 算法设计与分析 Design and Analysis of Algorithms
Peking University via Coursera How to Win Coding Competitions: Secrets of Champions
ITMO University via edX Introdução à Ciência da Computação com Python Parte 2
Universidade de São Paulo via Coursera