Current and Future Applications of Sampling Algorithms in Modelling Biochemical Networks

Current and Future Applications of Sampling Algorithms in Modelling Biochemical Networks

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


Duration: 43:16
523 views
14

Ronan Fleming (Leiden University)
https://simons.berkeley.edu/talks/current-and-future-applications-sampling-algorithms-modelling-biochemical-networks
Sampling Algorithms and Geometries on Probability Distributions



Other Videos By Simons Institute for the Theory of Computing


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


Tags:
Simons Institute
theoretical computer science
UC Berkeley
Computer Science
Theory of Computation
Theory of Computing
Sampling Algorithms and Geometries on Probability Distributions
Ronan Fleming