Random Coordinate Descent and Langevin Monte Carlo

Channel:

Subscribers:

68,700

Published on September 29, 2021 11:43:51 AM ● Video Link: https://www.youtube.com/watch?v=TaXvdb7HCas

Duration: 40:00

645 views

Other Videos By Simons Institute for the Theory of Computing

2021-10-01	High-Order Langevin Diffusion Yields an Accelerated MCMC Algorithm
2021-10-01	Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling
2021-10-01	Quantitative Convergence Analysis of Hypocoercive Sampling Dynamics
2021-09-30	Sampling Convex Bodies: A Status Report
2021-09-30	Kernel Stein Discrepancy Descent
2021-09-30	A Mean-Field Theory of Lazy Training in Two-Layer Neural Nets: ...
2021-09-30	A Blob Method for Diffusion and Applications to Sampling and Two Layer Neural Networks
2021-09-29	A Geometric and Analytical Perspective on Adversarial Learning Problems
2021-09-29	Blackwell Institute Students \| Polylogues
2021-09-29	Current and Future Applications of Sampling Algorithms in Modelling Biochemical Networks
2021-09-29	Random Coordinate Descent and Langevin Monte Carlo
2021-09-29	Algorithms for Sampling Convex Bodies
2021-09-29	Structured Logconcave Sampling with a Restricted Gaussian Oracle
2021-09-29	Primal--Dual Optimization and Application to Sampling
2021-09-29	Non-Equilibrium Sampling
2021-09-28	On Langevin Monte Carlo for Log-Concave Densities
2021-09-28	Lower Bounds on Metropolized Sampling Methods for Well-Conditioned Distributions
2021-09-28	Improved Dimension Dependence for the Metropolis-Adjusted Langevin...
2021-09-28	Faster Polytope Rounding, Sampling, and Volume Computation via a Sub-Linear Ball Walk
2021-09-28	The Mirror Langevin Algorithm Converges with Vanishing Bias
2021-09-27	How Many Clusters - An Algorithmic Answer

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Sampling Algorithms and Geometries on Probability Distributions

Qin Li