Fisher information lower bounds for sampling
From MaRDI portal
Cites work
- Analysis and geometry of Markov diffusion operators
- Black-Box Complexity of Local Minimization
- Convergence of score-based generative modeling for general data distributions
- Convex optimization: algorithms and complexity
- Elements of Information Theory
- Estimating normalizing constants for log-concave distributions: algorithms and lower bounds
- High-dimensional Bayesian inference via the unadjusted Langevin algorithm
- High-dimensional probability. An introduction with applications in data science
- scientific article; zbMATH DE number 1975218 (Why is no real title available?)
- Is there an analog of Nesterov acceleration for gradient-based MCMC?
- Isoperimetric and analytic inequalities for log-concave probability measures
- Lectures on convex optimization
- Lineare Algebra. (Linear algebra).
- Lower bounds for finding stationary points I
- Lower bounds for finding stationary points II: first-order methods
- Metastability and low lying spectra in reversible Markov chains
- Metastability in reversible diffusion processes. I: Sharp asymptotics for capacities and exit times
- Metastability in reversible diffusion processes. II: Precise asymptotics for small eigenvalues
- Nonasymptotic bounds for sampling algorithms without log-concavity
- Nonasymptotic convergence analysis for the unadjusted Langevin algorithm
- Oracle lower bounds for stochastic gradient sampling algorithms
- The Variational Formulation of the Fokker--Planck Equation
- Transportation-information inequalities for Markov processes
This page was built for publication: Fisher information lower bounds for sampling
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022761)
