Sampling Matrices From Harish-Chandra-Itzykson-Zuber Densities

Channel:

Subscribers:

68,700

Published on December 1, 2021 7:54:38 AM ● Video Link: https://www.youtube.com/watch?v=dn9KC7rZX_E

Duration: 49:35

270 views

Other Videos By Simons Institute for the Theory of Computing

2021-12-03	Optimization On Tensor Network Varieties
2021-12-02	On The Polyhedral Geometry Of Pivot Rules
2021-12-02	Matrix Multiplication, And The Asymptotic Spectrum Of Tensors
2021-12-02	The Kronecker Coefficients Of The Symmetric Group In Complexity And Combinatorics
2021-12-02	Two Tensor Optimization Problems From Quantum Information
2021-12-01	Complexity Of Computing Complex Zeros Of Structured Polynomial Systems
2021-12-01	Groups And Symmetries In Statistical Models
2021-12-01	A Productization Property/Trick For H-Stable(And Hopefully Strongly Log-Concave) Polynomials
2021-12-01	Panel on Making Predictions in a Quantum World \| Quantum Colloquium
2021-12-01	Making Predictions in a Quantum World \| Quantum Colloquium
2021-12-01	Sampling Matrices From Harish-Chandra-Itzykson-Zuber Densities
2021-11-30	Continuous Maximum Entropy Distributions
2021-11-30	Foundations of Computing: Tal Rabin \| Polylogues
2021-11-30	Constrained Optimization On Riemannian Manifolds
2021-11-30	Near Optimal Sample Complexity For Matrix And Tensor Normal Models Via Geodesic Convexity
2021-11-30	Computing The Nc-Rank Via Discrete Convex Optimization On Cat(0) Spaces
2021-11-29	Norm Minimization, Invariant Theory, And Quantum Tomography
2021-11-19	Discussion: Structure and RL
2021-11-17	Panel on Verifiable Quantum Advantage \| Quantum Colloquium
2021-11-17	Interactive Protocols for Classically-Verifiable Quantum Advantage with an Ion-Trap Quantum Computer
2021-11-11	On the Cryptographic Hardness of Learning Single Periodic Neurons

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Optimization Under Symmetry

Colin McSwiggen