Simons Institute Courses

In Search of New Algorithms Part I - Neural Networks

Explore neural networks and their role in developing new algorithms, focusing on computational complexity and statistical inference challenges.

• YouTube
• 1 hour 9 minutes
• Self-Paced
• Free Video

Provably Efficient Machine Learning for Quantum Many-Body Problems

Explore efficient machine learning techniques for solving quantum many-body problems, focusing on provable methods and their applications in computational physics and quantum computing.

• YouTube
• 43 minutes
• Self-Paced
• Free Video

Breakthroughs - A Refined Laser Method and Faster Matrix Multiplication

Explore advanced techniques in matrix multiplication, including the refined Laser method, to enhance computational efficiency and speed in mathematical operations.

• YouTube
• 1 hour 3 minutes
• Self-Paced
• Free Video

Look-Ahead SAT Solvers - Smart vs. Fast

Explore advanced SAT solver techniques, comparing "smart" look-ahead methods with "fast" conflict-driven approaches in this theoretical foundations lecture by Marijn Heule.

• YouTube
• 39 minutes
• Self-Paced
• Free Video

Answer Set Programming in a Nutshell

Explore Answer Set Programming's foundations, applications, and problem-solving capabilities in this comprehensive overview by expert Torsten Schaub from the University of Potsdam.

• YouTube
• 1 hour 30 minutes
• Self-Paced
• Free Video

Belief and Survey Propagation

Explore belief and survey propagation algorithms for solving complex satisfiability problems, examining their applications and theoretical foundations in computational theory.

• YouTube
• 1 hour 18 minutes
• Self-Paced
• Free Video

A Brief Introduction to Theoretical Foundations of Machine Learning and Machine Teaching

Explore theoretical foundations of machine learning and machine teaching, focusing on synthesis of models and systems in this comprehensive lecture by Jerry Zhu from University of Wisconsin-Madison.

• YouTube
• 2 hours 11 minutes
• Self-Paced
• Free Video

Quantum Fault Tolerance with Flag Qubits - Quantum Colloquium

Explore fault-tolerant quantum computing using flag qubits, a qubit-efficient method for error detection and correction in quantum circuits, with applications and theoretical implications.

• YouTube
• 1 hour 41 minutes
• Self-Paced
• Free Video

SAT-Solving

Explore the theory and practice of SAT-solving, delving into satisfiability concepts and advanced techniques in this comprehensive lecture by Armin Biere.

• YouTube
• 4 hours 23 minutes
• Self-Paced
• Free Video

Dancing Around SAT

Explore the intricacies of SAT complexity theory with Valentine Kabanets, delving into theoretical aspects and practical implications of satisfiability in computer science.

• YouTube
• 21 minutes
• Self-Paced
• Free Video

Games: From Logic and Automata to Algorithms

Explore the intersection of logic, automata, and algorithms through game theory, focusing on theoretical foundations and computational applications.

• YouTube
• 46 minutes
• Self-Paced
• Free Video

Pseudorandomness

Explorations in pseudorandomness: SoS lower bounds, block rigidity, unbounded-width permutation branching programs, computational entropies, and random projections in circuit complexity.

• YouTube
• 1 hour 11 minutes
• Self-Paced
• Free Video

Learning Ising Models from One, Ten or a Thousand Samples

Explore statistical learning theory and Ising models, focusing on sample complexity and efficient algorithms for learning in high-dimensional settings.

• YouTube
• 1 hour 6 minutes
• Self-Paced
• Free Video

Geometric Aspects of Sampling and Optimization

Explore geometric perspectives on sampling and optimization techniques, uncovering insights for data science applications and algorithm design.

• YouTube
• 30 minutes
• Self-Paced
• Free Video

Berkeley in the 80s - Richard Karp and the Theory of Computing

In-depth interview with Turing Laureate Richard Karp, exploring his groundbreaking research on computational theory at Berkeley in the 1980s and its lasting impact on computer science.

• YouTube
• 1 hour 24 minutes
• Self-Paced
• Free Video