Source Theme

Recent Progress on Scaling Algorithms and Applications

Algorithmic Aspects of Brascamp-Lieb Inequalities, via operator scaling.

Operator Scaling via Geodesically Convex Optimization, Invariant Theory and Polynomial Identity Testing

Rank Bounds for Design Matrices with Block Entries and Geometric Applications

Alternating minimization, scaling algorithms, and the null-cone problem from invariant theory

Barriers for Rank Methods in Arithmetic Complexity

Locally Testable and Locally Correctable Codes Approaching the Gilbert-Varshamov Bound

Much Faster Algorithms for Matrix Scaling

Subexponential Size Hitting Sets for Bounded Depth Multilinear Formulas