Copertina

Fast Conditional Mixing of MCMC Algorithms for Non-log-concave Distributions

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Cheng, Xiang, Wang, Bohan, Zhang, Jingzhao, Zhu, Yusong
Natura:	Preprint
Pubblicazione:	2023
Soggetti:	Machine Learning Probability
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Efficient Sampling on Riemannian Manifolds via Langevin MCMC
di: Cheng, Xiang, et al.
Pubblicazione: (2024)

Sampling non-log-concave densities via Hessian-free high-resolution dynamics
di: Wang, Xiaoyu, et al.
Pubblicazione: (2026)

Entropy contraction of the Gibbs sampler under log-concavity
di: Ascolani, Filippo, et al.
Pubblicazione: (2024)

Improved sampling algorithms and functional inequalities for non-log-concave distributions
di: He, Yuchen, et al.
Pubblicazione: (2025)

On diffusion-based generative models and their error bounds: The log-concave case with full convergence estimates
di: Bruno, Stefano, et al.
Pubblicazione: (2023)

High-accuracy log-concave sampling with stochastic queries
di: Chen, Fan, et al.
Pubblicazione: (2026)

Convergence of coordinate ascent variational inference for log-concave measures via optimal transport
di: Arnese, Manuel, et al.
Pubblicazione: (2024)

Convergence of Dirichlet Forms for MCMC Optimal Scaling with Dependent Target Distributions on Large Graphs
di: Ning, Ning
Pubblicazione: (2022)

Convergence rate of random scan Coordinate Ascent Variational Inference under log-concavity
di: Lavenant, Hugo, et al.
Pubblicazione: (2024)

Non-Reversible Langevin Algorithms for Constrained Sampling
di: Du, Hengrong, et al.
Pubblicazione: (2025)

Anchored Langevin Algorithms
di: Gurbuzbalaban, Mert, et al.
Pubblicazione: (2025)

Fooling Algorithms in Non-Stationary Bandits using Belief Inertia
di: Mendelson, Gal, et al.
Pubblicazione: (2025)

Regime-Switching Langevin Monte Carlo Algorithms
di: Wang, Xiaoyu, et al.
Pubblicazione: (2025)

Non-Asymptotic Convergence of Stochastic Iterative Algorithms: A Lyapunov Framework
di: Chen, Zaiwei, et al.
Pubblicazione: (2026)

Algorithms and Scientific Software for Quasi-Monte Carlo, Fast Gaussian Process Regression, and Scientific Machine Learning
di: Sorokin, Aleksei G.
Pubblicazione: (2025)

Concentration of the Langevin Algorithm's Stationary Distribution
di: Altschuler, Jason M., et al.
Pubblicazione: (2022)

Mixed Noise and Posterior Estimation with Conditional DeepGEM
di: Hagemann, Paul, et al.
Pubblicazione: (2024)

High-Order Langevin Monte Carlo Algorithms
di: Dang, Thanh, et al.
Pubblicazione: (2025)

An example of a non-log-concave distribution where the difference has a log-concave density
di: Wang, Min
Pubblicazione: (2025)

From stability of Langevin diffusion to convergence of proximal MCMC for non-log-concave sampling
di: Renaud, Marien, et al.
Pubblicazione: (2025)

Sparse random hypergraphs: Non-backtracking spectra and community detection
di: Stephan, Ludovic, et al.
Pubblicazione: (2022)

Mixing of the No-U-Turn Sampler and the Geometry of Gaussian Concentration
di: Bou-Rabee, Nawaf, et al.
Pubblicazione: (2024)

Optimal sequential tests yield log-optimal e-processes
di: Ram, Ashwin, et al.
Pubblicazione: (2026)

On Universality of Non-Separable Approximate Message Passing Algorithms
di: Lovig, Max, et al.
Pubblicazione: (2025)

kTULA: A Langevin sampling algorithm with improved KL bounds under super-linear log-gradients
di: Lytras, Iosif, et al.
Pubblicazione: (2025)

Degeneracy is OK: Logarithmic Regret for Network Revenue Management with Indiscrete Distributions
di: Jiang, Jiashuo, et al.
Pubblicazione: (2022)

Concentration inequalities for log-concave sequences
di: Marsiglietti, Arnaud, et al.
Pubblicazione: (2022)

How Out-of-Distribution Detection Learning Theory Enhances Transformer: Learnability and Reliability
di: Zhou, Yijin, et al.
Pubblicazione: (2024)

Scalable Machine Learning Algorithms using Path Signatures
di: Tóth, Csaba
Pubblicazione: (2025)

Theoretical guarantees for neural control variates in MCMC
di: Belomestny, Denis, et al.
Pubblicazione: (2023)

Throughput-Optimal Scheduling Algorithms for LLM Inference and AI Agents
di: Dai, J. G., et al.
Pubblicazione: (2025)

On measures strongly log-concave on a subspace
di: Bizeul, Pierre
Pubblicazione: (2022)

Suboptimal Performance of the Bayes Optimal Algorithm in Frequentist Best Arm Identification
di: Komiyama, Junpei
Pubblicazione: (2022)

Inequalities for Optimization of Classification Algorithms: A Perspective Motivated by Diagnostic Testing
di: Patrone, Paul N., et al.
Pubblicazione: (2025)

Accelerating Constrained Sampling: A Large Deviations Approach
di: Wang, Yingli, et al.
Pubblicazione: (2025)

Random ReLU Neural Networks as Non-Gaussian Processes
di: Parhi, Rahul, et al.
Pubblicazione: (2024)

A Theoretical Comparison of No-U-Turn Sampler Variants: Necessary and Sufficient Convergence Conditions and Mixing Time Analysis under Gaussian Targets
di: Gruffaz, Samuel, et al.
Pubblicazione: (2026)

A Unifying Perspective on Non-Stationary Kernels for Deeper Gaussian Processes
di: Noack, Marcus M., et al.
Pubblicazione: (2023)

Sharper Perturbed-Kullback-Leibler Exponential Tail Bounds for Beta and Dirichlet Distributions
di: Perrault, Pierre
Pubblicazione: (2025)

Deep Learning for Markov Chains: Lyapunov Functions, Poisson's Equation, and Stationary Distributions
di: Qu, Yanlin, et al.
Pubblicazione: (2025)