• Click on the titles of individual talks for abstract, slides and archived video.

All events take place in the Calvin Lab Auditorium.

–
Coffee and Check-In
–
Opening Remarks
–
Analysis and Design of Optimization Algorithms via Integral Quadratic Constraints
Benjamin Recht (UC Berkeley)
–
Break
–
Adventures in Linear Algebra++ and Unsupervised Learning
Sanjeev Arora (Princeton University)
–
Lunch
–
Learning Overcomplete Latent Variable Models through Tensor Power Method
Rong Ge, Microsoft Research
–
Break
–
Robust PCA via Non-convex Methods: Provable Bounds
Animashree Anandkumar, UC Irvine
–
Break
–
Convex Relaxations for Recovering Simultaneously Structured Objects
Maryam Fazel, University of Washington
–
Reception
–
Coffee and Check-In
–
The Edge of Tractability: Unique Games vs Sum of Squares
David Steurer (Cornell University)
–
Break
–
Recovering Hidden Sparsity via Sum of Squares
Jon Kelner (Massachusetts Institute of Technology)
–
Lunch
–
A Polynomial Time Algorithm for Lossy Population Recovery
Ankur Moitra, Massachusetts Institute of Technology
–
Break
–
Serialrank: Spectral Ranking using Seriation
Alexandre d'Aspremont, CNRS - École Normale Superieure Paris
–
Break
–
Relative Entropy Relaxations for Signomial Optimization
Venkat Chandrasekaran, California Institute of Technology
–
Coffee and Check-In
–
Robust Sketching for Large-Scale Multi-Instance Conic Optimization
Laurent El Ghaoui, UC Berkeley
–
Break
–
Spectrahedra and their Shadows
Bernd Sturmfels (UC Berkeley)
–
Lunch
–
Spectral Bounds and SDP Hierarchies for Geometric Packing Problems
Frank Vallentin, University of Cologne
–
Break
–
Positive Semidefinite Rank
Rekha Thomas, University of Washington
–
Break
–
An SDP-based Algorithmic Cheeger Inequality for Vertex Expansion
Santosh Vempala (Georgia Institute of Technology)
–
Coffee and Check-In
–
Tensor Decompositions: Uniqueness and Smoothed Analysis
Moses Charikar (Stanford University)
–
Break
–
Convex Optimization and Quantum Information
Aram Harrow (Massachusetts Institute of Technology)
–
Lunch
–
Noncommutative Polynomial Optimization under Dimension Constraints
Miguel Navascués Cobo, Universitat Autònoma de Barcelona
–
Break
–
Faster SDP Hierarchy Solvers for Local Rounding Algorithms
Ali Sinop (Institute for Advanced Study, Princeton)
–
Break
–
Convergence of SDP Hierarchies Using Kernel Based Methods: Moment Matrices
Stephanie Wehner, National University of Singapore
–
Coffee and Check-In
–
Controlling Eigenvalues (at least in theory)
Adam Marcus, Yale University
–
Break
–
Efficient First-Order Methods for Linear (and Semidefinite and Hyperbolic) Programming
James Renegar, Cornell University
–
Lunch
–
Primal-Dual Symmetric Interior-Point Methods: From SDP to Hyperbolic Cone Programming and Beyond
Levent Tunçel, University of Waterloo
–
Break
–
Effectivity Issues and Results for Hilbert's 17th Problem
Marie-Françoise Roy, Universite de Rennes
–
Break
–
Open Problem Session