Skip to main content
Search
Utility navigation
Calendar
Contact
Login
MAKE A GIFT
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
Hierarchies, Extended Formulations and Matrix-Analytic Techniques
Program
Bridging Continuous and Discrete Optimization
Location
Calvin Lab Auditorium
Date
Monday, Nov. 6
–
Thursday, Nov. 9, 2017
Back to calendar
Breadcrumb
Home
Workshop & Symposia
Schedule
Secondary tabs
The Workshop
Schedule
Videos
All events take place in the Calvin Lab auditorium
Monday, Nov. 6, 2017
9:30
–
9:50 a.m.
Coffee and Check-In
9:50
–
10 a.m.
Opening Remarks
10
–
11 a.m.
Constructing Extended Formulations
Volker Kaibel, Otto-von-Guericke-Universität Magdeburg
11
–
11:30 a.m.
Break
11:30 a.m.
–
12 p.m.
Small (Explicit) Extended Formulation for Knapsack Cover Inequalities from Monotone Circuits
Sam Fiorini, Université Libre de Bruxelles
12
–
12:30 p.m.
Computing the Nucleolus of Weighted Cooperative Matching Games in Polynomial Time
Kanstantin Pashkovich, University of Waterloo
12:30
–
2:30 p.m.
Lunch
2:30
–
3 p.m.
A Lower Bound on the Positive Semidefinite Rank of Convex Bodies
Hamza Fawzi, University of Cambridge
3
–
3:30 p.m.
Bounds for Matrix Factorization Ranks via Semidefinite Programming and Tracial Polynomial Optimization
Monique Laurent, CWI Amsterdam
3:30
–
4 p.m.
Break
4
–
4:30 p.m.
Symmetric Sums of Square
Annie Raymond, University of Washington
4:30
–
5 p.m.
Sparse Polynomial Interpolation: Compressed Sensing, Super-resolution, or Prony?
Jean-Bernard Lasserre, CNRS
Tuesday, Nov. 7, 2017
9:30
–
10 a.m.
Coffee and Check-In
10
–
11 a.m.
Pseudocalibration and SoS Lower Bounds
Sam Hopkins, Cornell University
,
Aaron Potechin, Institute for Advanced Study
11
–
11:30 a.m.
Break
11:30 a.m.
–
12 p.m.
Weak Decoupling, Polynomial Folds, and Approximate Optimization over the Sphere
Vijay Bhattiprolu, Carnegie Mellon University
12
–
12:30 p.m.
Spectral Aspects of Symmetric Matrix Signings
Alexandra Kolla, University of Illinois at Urbana-Champaign
12:30
–
2:30 p.m.
Lunch
2:30
–
3 p.m.
From Weak to Strong LP Gaps for all CSPs
Madhur Tulsiani, Toyota Technological Institute at Chicago
3
–
3:30 p.m.
Break
3:30
–
4 p.m.
LP, SOCP, and Optimization-Free Approaches to Polynomial Optimization
Amir Ali Ahmadi, Princeton University
4
–
4:30 p.m.
Matrix Completion and Sums of Squares
Greg Blekherman
,
, Georgia Institute of Technology
4:30
–
5 p.m.
SOS and the Dreaded Bit-complexity
Ryan O'Donnell, Carnegie Mellon University
5
–
6 p.m.
Reception
Wednesday, Nov. 8, 2017
9:30
–
10 a.m.
Coffee and Check-In
10 a.m.
–
10:30 p.m.
Maximizing Sub-determinants and Connections to Permanents and Inequalities on Stable Polynomials
Mohit Singh, Georgia Institute of Technology
10:30
–
11 a.m.
Spectrahedra and Directional Derivatives of Determinants
James Saunderson, Monash University
11
–
11:30 a.m.
Break
11:30 a.m.
–
12:30 p.m.
Counting and Optimization Using Stable Polynomials
Nima Anari, Stanford University
12:30
–
2:30 p.m.
Lunch
2:30
–
3:30 p.m.
Independent Set Polytopes: Query vs. Communication Perspective
Mika Göös, University of Toronto
3:30
–
4 p.m.
Break
4
–
4:30 p.m.
Approximating Rectangles by Juntas and Weakly-Exponential Lower Bounds for LP Relaxations of CSPs
Raghu Meka, UCLA
4:30
–
5:30 p.m.
Short Announcements and Open Problems
Thursday, Nov. 9, 2017
9:30
–
10 a.m.
Coffee and Check-In
10
–
11 a.m.
From Proofs to Algorithms for Machine Learning Problems
David Steurer, Cornell University
11
–
11:30 a.m.
Break
11:30 a.m.
–
12 p.m.
Nonnegative Polynomials, Nonconvex Polynomial Optimization, and Applications to Learning
Georgina Hall, Princeton University
12
–
12:30 p.m.
Fast Spectral Algorithms from Sum-of-Squares Analyses
Tselil Schramm, UC Berkeley
12:30
–
2:30 p.m.
Lunch
2:30
–
3 p.m.
Computing the Independence Polynomial in Shearer's Region for the LLL
Nick Harvey, University of British Columbia
3
–
3:30 p.m.
Quantum Entanglement, Sum of Squares, and the Log Rank Conjecture
Pravesh Kothari, Princeton University
Share this page
Copy URL of this page
link to homepage
Close
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
Close
Search