Sampling Using Diffusion Processes, from Langevin to Schrödinger

Sampling Using Diffusion Processes, from Langevin to Schrödinger

Channel:
United States Simons Institute for the Theory of Computing
Subscribers:
68,700
Published on ● Video Link: https://www.youtube.com/watch?v=mE2qSOh9wCw


Duration: 1:14:00
2,480 views
58

Maxim Raginsky (University of Illinois at Urbana-Champaign)
https://simons.berkeley.edu/talks/tbd-339
Geometric Methods in Optimization and Sampling Boot Camp



Other Videos By Simons Institute for the Theory of Computing


2021-09-03(Hidden) Symmetries of Computational Problems
2021-09-03PDE on Graphs and Their Continuum Limits
2021-09-03Consensus-Based Interacting Particle Systems and Mean-field PDEs for Optimization and Sampling
2021-09-03Optimal Transport and PDE: Gradient Flows in the Wasserstein Metric (continued)
2021-09-02Optimal Transport and PDE: Gradient Flows in the Wasserstein Metric
2021-09-02Gradient Flows and Optimal Transport in Discrete and Quantum Systems
2021-09-02Computational Optimal Transport
2021-09-02Crash Course on Optimal Transport (continued)
2021-09-01Crash Course on Optimal Transport
2021-09-01An Introduction to Hamiltonian Monte Carlo Method for Sampling
2021-09-01Sampling Using Diffusion Processes, from Langevin to Schrödinger
2021-09-01Sampling Crash Course (continued)
2021-08-31Sampling Crash Course
2021-08-31Geodesic Convexity and Optimization
2021-08-31Optimization on Manifolds
2021-08-31Optimization Crash Course (continued)
2021-08-30Optimization Crash Course
2021-08-28Optimal Iterative Algorithms for Problems With Random Data (continued)
2021-08-28Optimal Iterative Algorithms for Problems With Random Data
2021-08-28Average-Case Complexity Theory (continued)
2021-08-27Average-Case Complexity Theory


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Geometric Methods in Optimization and Sampling Boot Camp
Maxim Raginsky