The Langevin Algorithm in the Non Smooth Log-Concave Case

Channel:

Subscribers:

68,700

Published on October 22, 2020 6:07:20 PM ● Video Link: https://www.youtube.com/watch?v=xN7g8yAuKVA

Category:

Vlog

Duration: 59:44

601 views

Other Videos By Simons Institute for the Theory of Computing

2020-10-26	Pure Exploration Problems
2020-10-26	Selfish Robustness and Equilibria in Multi-Player Bandits
2020-10-26	Multi-Task Optimal Experiment Design
2020-10-26	Online Multiserver Convex Chasing and Optimization
2020-10-23	Lower Estimates of Marginal Density
2020-10-23	Graph Matching in Correlated Random Graphs via Small Subgraph Statistics
2020-10-23	The (Non-)Concentration of the Chromatic Number
2020-10-23	Log Concavity and Concentration of Measure on the Discrete Hypercube
2020-10-22	Sharp Poincare and log-Sobolev Inequalities for the Switch Chain on Regular Bipartite Graphs
2020-10-22	Rates of Normal Approximation for Typical Weighted Sums
2020-10-22	The Langevin Algorithm in the Non Smooth Log-Concave Case
2020-10-22	Moments of the Distance Between Independent Random Vectors
2020-10-21	Sharp Thresholds for Random Subspaces, and Applications
2020-10-21	Gaussian Regularization of the Pseudospectrum and Numerical Linear Algebra
2020-10-21	Reducing Isotropy to KLS, A Faster Sampling Algorithm
2020-10-21	Random Concave Functions on an Equilateral Lattice with Periodic Hessians
2020-10-20	Recent Advances in Algorithmic Heavy-Tailed Statistics
2020-10-20	An Improved Lower Bound for Sparse Reconstruction from Subsampled Hadamard Matrices
2020-10-20	On Some Brunn-Minkowski Inequalities for Probability Measures Under Symmetry
2020-10-20	Poincaré Inequalities and Convergence to Equilibrium with Variable Curvature Bounds
2020-10-20	Sharp Isoperimetric Inequalities for Affine Quermassintegrals

Tags:

Simons Institute

theoretical computer science

UC Berkeley

Computer Science

Theory of Computation

Theory of Computing

Concentration of Measure Phenomena

Joseph Lehec