Skip to content
conftrace_

langevin algorithm

24 papers

Papers

Mixing Times and Privacy Analysis for the Projected Langevin Algorithm under a Modulus of Continuity JMLR 2025 Customized Style Transfer using Discrete Sampling EMNLP 2024 Fast parallel sampling under isoperimetry COLT 2024 Gradual Domain Adaptation via Gradient Flow ICLR 2024 Plug-and-Play Posterior Sampling under Mismatched Measurement and Prior Models ICLR 2024 Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks JMLR 2024 Stochastic Approximation with Biased MCMC for Expectation Maximization AISTATS 2024 Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler COLT 2023 Concentration analysis of multivariate elliptic diffusions JMLR 2023 Convergence of Stein Variational Gradient Descent under a Weaker Smoothness Condition AISTATS 2023 Efficient Training of Energy-Based Models Using Jarzynski Equality NeurIPS 2023 Resolving the Mixing Time of the Langevin Algorithm to its Stationary Distribution for Log-Concave Sampling COLT 2023 Constrained Langevin Algorithms with L-mixing External Random Variables NeurIPS 2022 Score-Guided Intermediate Level Optimization: Fast Langevin Mixing for Inverse Problems ICML 2022 When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpoint JMLR 2022 Implicit Langevin Algorithms for Sampling From Log-concave Densities JMLR 2021 Particle Dual Averaging: Optimization of Mean Field Neural Network with Global Convergence Rate Analysis NeurIPS 2021 Projected Stochastic Gradient Langevin Algorithms for Constrained Sampling and Non-Convex Learning COLT 2021 Primal Dual Interpretation of the Proximal Stochastic Gradient Langevin Algorithm NeurIPS 2020 Stochastic Approximate Gradient Descent via the Langevin Algorithm AAAI 2020 Log-concave sampling: Metropolis-Hastings algorithms are fast JMLR 2019 Rapid Convergence of the Unadjusted Langevin Algorithm: Isoperimetry Suffices NeurIPS 2019 Stochastic Proximal Langevin Algorithm: Potential Splitting and Nonasymptotic Rates NeurIPS 2019 Local Optimality and Generalization Guarantees for the Langevin Algorithm via Empirical Metastability COLT 2018