All events take place in the Calvin Lab auditorium

–
Coffee and Check-In
–
Opening Remarks
–
Constructing Extended Formulations
Volker Kaibel, Otto-von-Guericke-Universität Magdeburg
–
Break
–
Small (Explicit) Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
Sam Fiorini, Université Libre de Bruxelles
–
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Kanstantin Pashkovich, University of Waterloo
–
Lunch
–
A Lower Bound on the Positive Semidefinite Rank of Convex Bodies
Hamza Fawzi, University of Cambridge
–
Bounds for Matrix Factorization Ranks via Semidefinite Programming and Tracial Polynomial Optimization
Monique Laurent, CWI Amsterdam
–
Break
–
Symmetric Sums of Square
Annie Raymond, University of Washington
–
Sparse Polynomial Interpolation: Compressed Sensing, Super-resolution, or Prony?
Jean-Bernard Lasserre, CNRS
–
Coffee and Check-In
–
Pseudocalibration and SoS Lower Bounds
Sam Hopkins, Cornell University, Aaron Potechin, Institute for Advanced Study
–
Break
–
Weak Decoupling, Polynomial Folds, and Approximate Optimization over the Sphere
Vijay Bhattiprolu, Carnegie Mellon University
–
Spectral Aspects of Symmetric Matrix Signings
Alexandra Kolla, University of Illinois at Urbana-Champaign
–
Lunch
–
From Weak to Strong LP Gaps for all CSPs
Madhur Tulsiani, Toyota Technological Institute at Chicago
–
Break
–
LP, SOCP, and Optimization-Free Approaches to Polynomial Optimization
Amir Ali Ahmadi, Princeton University
–
Matrix Completion and Sums of Squares
Greg Blekherman, , Georgia Institute of Technology
–
SOS and the Dreaded Bit-complexity
Ryan O'Donnell, Carnegie Mellon University
–
Reception
–
Coffee and Check-In
–
Maximizing Sub-determinants and Connections to Permanents and Inequalities on Stable Polynomials
Mohit Singh, Georgia Institute of Technology
–
Spectrahedra and Directional Derivatives of Determinants
James Saunderson, Monash University
–
Break
–
Counting and Optimization Using Stable Polynomials
Nima Anari, Stanford University
–
Lunch
–
Independent Set Polytopes: Query vs. Communication Perspective
Mika Göös, University of Toronto
–
Break
–
Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs
Raghu Meka, UCLA
–
Short Announcements and Open Problems
–
Coffee and Check-In
–
From Proofs to Algorithms for Machine Learning Problems
David Steurer, Cornell University
–
Break
–
Nonnegative Polynomials, Nonconvex Polynomial Optimization, and Applications to Learning
Georgina Hall, Princeton University
–
Fast Spectral Algorithms from Sum-of-Squares Analyses
Tselil Schramm, UC Berkeley
–
Lunch
–
Computing the Independence Polynomial in Shearer's Region for the LLL
Nick Harvey, University of British Columbia
–
Quantum Entanglement, Sum of Squares, and the Log Rank Conjecture
Pravesh Kothari, Princeton University