Skip to main content

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
Berkeley University of California
Home Home

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Apply to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
  • News & Videos
    • News
    • Videos
  • About
Image
Computational Complexity of Statistical Inference_hi-res logo

Computational Complexity of Statistical Inference Boot Camp

Program
Computational Complexity of Statistical Inference
Location

Calvin Lab Auditorium

Date
Monday, Aug. 23 – Friday, Aug. 27, 2021
Back to calendar

Breadcrumb

  1. Home
  2. Workshop & Symposia
  3. Schedule

Secondary tabs

  • The Workshop
  • Schedule
  • Videos

9:30 – 9:35 a.m.
Opening Remarks
9:35 – 10:30 a.m.
In Search of New Algorithms Part I: Neural Networks

Adam Klivans (University of Texas at Austin)
Video
10:30 – 10:45 a.m.
Break
10:45 – 11:45 a.m.
In Search of New Algorithms Part II: Graphical Models

Adam Klivans (University of Texas at Austin)
Video
11:45 a.m. – 2 p.m.
Lunch
2 – 3 p.m.
The Fine Line between Hard and Easy Inference Problems: The View from CSPs

Boaz Barak (Harvard)
Video
3 – 3:15 p.m.
Break
3:15 – 4:15 p.m.
The Fine Line between Hard and Easy Inference Problems: The View from CSPs (continued)

Boaz Barak (Harvard)
Video
4:15 – 5:15 p.m.
Reception
9:30 – 10:30 a.m.
Lower Bounds on Statistical Estimation Rates Under Various Constraints

Po-Ling Loh (University of Cambridge)
Video
10:30 – 10:45 a.m.
Break
10:45 – 11:45 a.m.
Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)

Po-Ling Loh (University of Cambridge)
Video
11:45 a.m. – 2 p.m.
Lunch
2 – 3 p.m.
On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference

Prasad Raghavendra (UC Berkeley)
Video
3 – 3:15 p.m.
Break
3:15 – 4:15 p.m.
On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)

Prasad Raghavendra (UC Berkeley)
Video
9:30 – 10:30 a.m.
Lower Bounds on Statistical Estimation Rates Under Various Constraints

Po-Ling Loh (University of Cambridge)
Video
10:30 – 10:45 a.m.
Break
10:45 – 11:45 a.m.
Lower Bounds on Statistical Estimation Rates Under Various Constraints (continued)

Po-Ling Loh (University of Cambridge)
Video
11:45 a.m. – 2 p.m.
Lunch
2 – 3 p.m.
On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference

Prasad Raghavendra (UC Berkeley)
Video
3 – 3:15 p.m.
Break
3:15 – 4:15 p.m.
On Algorithms and Barriers of Intractability in High-Dimensional Statistical Inference (continued)

Prasad Raghavendra (UC Berkeley)
Video
9:30 – 10:30 a.m.
Average-Case Complexity Theory

Luca Trevisan (Bocconi University)
Video
10:30 – 10:45 a.m.
Break
10:45 – 11:45 a.m.
Average-Case Complexity Theory (continued)

Luca Trevisan (Bocconi University)
Video
11:45 a.m. – 2 p.m.
Lunch
2 – 3 p.m.
Approximate Message Passing Algorithms

Cynthia Rush (Columbia University)
Video
3 – 3:15 p.m.
Break
3:15 – 4:15 p.m.
Approximate Message Passing Algorithms (continued)

Cynthia Rush (Columbia University)
Video
9:30 – 10:30 a.m.
Average-Case Complexity Theory

Luca Trevisan (Bocconi University)
Video
10:30 – 10:45 a.m.
Break
10:45 – 11:45 a.m.
Average-Case Complexity Theory (continued)

Luca Trevisan (Bocconi University)
Video
11:45 a.m. – 2 p.m.
Lunch
2 – 3 p.m.
Optimal Iterative Algorithms for Problems With Random Data

Andrea Montanari (Stanford)
Video
3 – 3:15 p.m.
Break
3:15 – 4:15 p.m.
Optimal Iterative Algorithms for Problems With Random Data

Andrea Montanari (Stanford)
Video
Share this page
Copy URL of this page
Home
The Simons Institute for the Theory of Computing is the world's leading venue for collaborative research in theoretical computer science.

Footer

  • Programs & Events
  • About
  • Participate
  • Workshops & Symposia
  • Contact Us
  • Calendar
  • Accessibility

Footer social media

  • Twitter
  • Facebook
  • Youtube
© 2013–2025 Simons Institute for the Theory of Computing. All Rights Reserved.
link to homepage

Main navigation

  • Home
  • Programs & Events
    • Research Programs
    • Workshops & Symposia
    • Public Lectures
    • Research Pods
    • Internal Program Activities
    • Algorithms, Society, and the Law
  • People
    • Scientific Leadership
    • Staff
    • Current Long-Term Visitors
    • Research Fellows
    • Postdoctoral Researchers
    • Scientific Advisory Board
    • Governance Board
    • Industry Advisory Council
    • Affiliated Faculty
    • Science Communicators in Residence
    • Law and Society Fellows
  • Participate
    • Apply to Participate
    • Plan Your Visit
    • Location & Directions
    • Postdoctoral Research Fellowships
    • Law and Society Fellowships
    • Science Communicator in Residence Program
    • Circles
    • Breakthroughs Workshops and Goldwasser Exploratory Workshops
  • Support
    • Annual Fund
    • Funders
    • Industrial Partnerships
  • News & Videos
    • News
    • Videos
  • About

Utility navigation

  • Calendar
  • Contact
  • Login
  • MAKE A GIFT
link to homepage