All talks are in Pacific Time.

–
Coffee and Check-In
–
Opening Remarks
–
Norm Minimization, Invariant Theory, And Quantum Tomography
Cole Franks (MIT)
–
Break
–
Computing The Nc-Rank Via Discrete Convex Optimization On Cat(0) Spaces
Hiroshi Hirai (University of Tokyo)
–
Lunch
–
Near Optimal Sample Complexity For Matrix And Tensor Normal Models Via Geodesic Convexity
Akshay Ramachandran (University of Amsterdam)
–
Break
–
Constrained Optimization On Riemannian Manifolds
Melanie Weber (Oxford, Mathematical Institute)
–
Reception
–
Coffee and Check-In
–
Continuous Maximum Entropy Distributions
Jonathan Leake (Weierstrass Institute Berlin)
–
Break
–
Sampling Matrices From Harish-Chandra-Itzykson-Zuber Densities
Colin McSwiggen (Courant Institute, New York University)
–
Lunch
–
A Productization Property/Trick For H-Stable(And Hopefully Strongly Log-Concave) Polynomials
Leonid Gurvits (City College of New York)
–
Break
–
Groups And Symmetries In Statistical Models
Anna Seigal (Harvard University)
–
Coffee and Check-In
–
Complexity Of Computing Complex Zeros Of Structured Polynomial Systems
Peter Buergisser (TU Berlin)
–
Break
–
Two Tensor Optimization Problems From Quantum Information
Matthias Christandl (University of Copenhagen)
–
Lunch
–
The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics
Greta Panova (University of Southern California)
–
Break
–
Matrix Multiplication, And The Asymptotic Spectrum Of Tensors
Avi Wigderson (Institute for Advanced Study, Princeton)
–
Coffee and Check-In
–
On The Polyhedral Geometry Of Pivot Rules
Raman Sanyal (Goethe University Frankfurt)
–
Break
–
Optimization On Tensor Network Varieties
Fulvio Gesmundo (Max Planck Institute for Mathematics in the Sciences)
–
Lunch
–
Symmetry Adapted Gram Spectrahedra
Serkan Hosten (San Francisco State University)
–
Coffee and Check-In
–
Equivariant RL
Max Welling (University of Amsterdam)
–
Break
–
Equivariant Machine Learning Structured Like Classical Physics
Soledad Villar (Johns Hopkins)