Copertina

When Langevin Monte Carlo Meets Randomization: New Sampling Algorithms with Non-asymptotic Error Bounds beyond Log-Concavity and Gradient Lipschitzness

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Wang, Xiaojie, Yang, Bin
Natura:	Preprint
Pubblicazione:	2025
Soggetti:	Machine Learning Numerical Analysis
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

Accelerating Langevin Monte Carlo via Efficient Stochastic Runge--Kutta Methods beyond Log-Concavity
di: Yang, Bin, et al.
Pubblicazione: (2026)

Constrained Ensemble Langevin Monte Carlo
di: Ding, Zhiyan, et al.
Pubblicazione: (2021)

Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms
di: Lau, Tim Tsz-Kit, et al.
Pubblicazione: (2023)

Contractive kinetic Langevin samplers beyond global Lipschitz continuity
di: Lytras, Iosif, et al.
Pubblicazione: (2025)

Convergence of Kinetic Langevin Monte Carlo on Lie groups
di: Kong, Lingkai, et al.
Pubblicazione: (2024)

Kinetic Langevin Splitting Schemes for Constrained Sampling
di: Chada, Neil K., et al.
Pubblicazione: (2026)

The Sample Complexity of Learning Lipschitz Operators with respect to Gaussian Measures
di: Adcock, Ben, et al.
Pubblicazione: (2024)

Analysis of kinetic Langevin Monte Carlo under the stochastic exponential Euler discretization from underdamped all the way to overdamped
di: Kim, Kyurae, et al.
Pubblicazione: (2025)

Nonlinear Assimilation via Score-based Sequential Langevin Sampling
di: Ding, Zhao, et al.
Pubblicazione: (2024)

Sampling via Stochastic Interpolants by Langevin-based Velocity and Initialization Estimation in Flow ODEs
di: Duan, Chenguang, et al.
Pubblicazione: (2026)

Transport Quasi-Monte Carlo
di: Liu, Sifan
Pubblicazione: (2024)

Unbiased Kinetic Langevin Monte Carlo with Inexact Gradients
di: Chada, Neil K., et al.
Pubblicazione: (2023)

Multi-Level Monte Carlo Training of Neural Operators
di: Rowbottom, James, et al.
Pubblicazione: (2025)

Low Stein Discrepancy via Message-Passing Monte Carlo
di: Kirk, Nathan, et al.
Pubblicazione: (2025)

Adaptive Error-Bounded Hierarchical Matrices for Efficient Neural Network Compression
di: Mango, John, et al.
Pubblicazione: (2024)

Non-asymptotic convergence analysis of the stochastic gradient Hamiltonian Monte Carlo algorithm with discontinuous stochastic gradient with applications to training of ReLU neural networks
di: Liang, Luxu, et al.
Pubblicazione: (2024)

Tensor Decomposition Meets RKHS: Efficient Algorithms for Smooth and Misaligned Data
di: Larsen, Brett W., et al.
Pubblicazione: (2024)

Concatenated Matrix SVD: Compression Bounds, Incremental Approximation, and Error-Constrained Clustering
di: Shamrai, Maksym
Pubblicazione: (2026)

Adaptive Lipschitz-Free Conditional Gradient Methods for Stochastic Composite Nonconvex Optimization
di: Yuan, Ganzhao
Pubblicazione: (2026)

Accelerating Natural Gradient Descent for PINNs with Randomized Numerical Linear Algebra
di: Bioli, Ivan, et al.
Pubblicazione: (2025)

Lower Bounds for the Convergence of Tensor Power Iteration on Random Overcomplete Models
di: Wu, Yuchen, et al.
Pubblicazione: (2022)

Convex-Geometric Error Bounds for Positive-Weight Kernel Quadrature
di: Hayakawa, Satoshi
Pubblicazione: (2026)

Algorithmic warm starts for Hamiltonian Monte Carlo
di: Zhang, Matthew S., et al.
Pubblicazione: (2026)

Second Order Ensemble Langevin Method for Sampling and Inverse Problems
di: Liu, Ziming, et al.
Pubblicazione: (2022)

Sampling and estimation on manifolds using the Langevin diffusion
di: Bharath, Karthik, et al.
Pubblicazione: (2023)

Gradient Flows for Sampling: Mean-Field Models, Gaussian Approximations and Affine Invariance
di: Chen, Yifan, et al.
Pubblicazione: (2023)

Random Reshuffling for Stochastic Gradient Langevin Dynamics
di: Shaw, Luke, et al.
Pubblicazione: (2025)

Lipschitz-Guided Design of Interpolation Schedules in Generative Models
di: Chen, Yifan, et al.
Pubblicazione: (2025)

Operator Learning of Lipschitz Operators: An Information-Theoretic Perspective
di: Lanthaler, Samuel
Pubblicazione: (2024)

Message-Passing Monte Carlo: Generating low-discrepancy point sets via Graph Neural Networks
di: Rusch, T. Konstantin, et al.
Pubblicazione: (2024)

Solving the Offline and Online Min-Max Problem of Non-smooth Submodular-Concave Functions: A Zeroth-Order Approach
di: Farzin, Amir Ali, et al.
Pubblicazione: (2026)

Data-Efficient Kernel Methods for Learning Differential Equations and Their Solution Operators: Algorithms and Error Analysis
di: Jalalian, Yasamin, et al.
Pubblicazione: (2025)

The Poisson Midpoint Method for Langevin Dynamics: Provably Efficient Discretization for Diffusion Models
di: Kandasamy, Saravanan, et al.
Pubblicazione: (2024)

Accelerating Legacy Numerical Solvers by Non-intrusive Gradient-based Meta-solving
di: Arisaka, Sohei, et al.
Pubblicazione: (2024)

Monte Carlo Neural PDE Solver for Learning PDEs via Probabilistic Representation
di: Zhang, Rui, et al.
Pubblicazione: (2023)

Accelerating Multilevel Markov Chain Monte Carlo Using Machine Learning Models
di: Reddy, Sohail, et al.
Pubblicazione: (2024)

Random Neural Network Expressivity for Non-Linear Partial Differential Equations
di: Mehmood, Muhammed Ali, et al.
Pubblicazione: (2026)

Monte Carlo-Type Neural Operator for Differential Equations
di: Choutri, Salah Eddine, et al.
Pubblicazione: (2025)

Sampling from Bayesian Neural Network Posteriors with Symmetric Minibatch Splitting Langevin Dynamics
di: Paulin, Daniel, et al.
Pubblicazione: (2024)

DRM Revisited: A Complete Error Analysis
di: Jiao, Yuling, et al.
Pubblicazione: (2024)