Optimal Transport With Stopping Times and the Stefan Problem

Channel:

Subscribers:

68,700

Published on October 28, 2021 4:48:01 AM ● Video Link: https://www.youtube.com/watch?v=w0LgeDpxb5o

Duration: 44:56

551 views

Other Videos By Simons Institute for the Theory of Computing

2021-10-29	Extending the JKO Scheme Beyond Wasserstein-2 Gradient Flows
2021-10-29	Sampling From Wasserstein Barycenter
2021-10-29	Consensus Based Sampling
2021-10-29	Continuous Time Stochastic Gradient Descent and Flat Minimum Selection
2021-10-29	Mean-Field Theory of Two-Layers Neural Networks: Dimension Free Bounds and Example
2021-10-28	Archetypal Analysis
2021-10-28	Linearised Optimal Transport Distances
2021-10-28	Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)
2021-10-28	Global Well Posedness of Master Equations Mean Field Games
2021-10-27	The Singular Set in the Stefan Problem
2021-10-27	Optimal Transport With Stopping Times and the Stefan Problem
2021-10-27	Foundations of Computing: Donald Knuth \| Polylogues
2021-10-27	Uniform Convergence Rates for Lipschitz Learning Down to Graph Connectivity
2021-10-27	Hessian Informed Mirror Descent With Application in Gradient Flows
2021-10-27	Optimal Transport for Learning Chaotic Dynamics via Invariant Measures
2021-10-27	Panel on Bosonic Error Correction Codes \| Quantum Colloquium
2021-10-27	An Error-Corrected Logical Quantum Bit Encoded in Grid States of a Superconducting Cavity
2021-10-27	Sampling via Birth-Death Dynamics
2021-10-26	Dissipative Evolution of Probability Measures
2021-10-26	An Optimal Transport Problem With Bulk/Interface Interactions
2021-10-26	A Duality Approach for Entropic-Regularized Optimal Transport: ...

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Dynamics and Discretization: PDEs Sampling and Optimization

Inwon Kim