{"total":38,"rows":[{"id":"2111.12876","title":"Time-independent Generalization Bounds for SGLD in Non-convex Settings","created":"2021-11-25","cited_by_count":27,"area":null},{"id":"2303.13429","title":"Interacting Particle Langevin Algorithm for Maximum Marginal Likelihood Estimation","created":"2023-03-23","cited_by_count":17,"area":null},{"id":"2301.08039","title":"Kinetic Langevin MCMC Sampling Without Gradient Lipschitz Continuity -- the Strongly Convex Case","created":"2023-01-19","cited_by_count":12,"area":null},{"id":"2311.01046","title":"Time-Independent Information-Theoretic Generalization Bounds for SGLD","created":"2023-11-02","cited_by_count":12,"area":null},{"id":"2105.13937","title":"Polygonal Unadjusted Langevin Algorithms: Creating stable and efficient adaptive algorithms for neural networks","created":"2021-05-28","cited_by_count":11,"area":null},{"id":"2107.08649","title":"Non-asymptotic estimates for TUSLA algorithm for non-convex learning with applications to neural networks with ReLU activation function","created":"2021-07-19","cited_by_count":10,"area":null},{"id":"2406.14292","title":"Proximal Interacting Particle Langevin Algorithms","created":"2024-06-20","cited_by_count":8,"area":null},{"id":"2107.04766","title":"Convergence Analysis of Schr{\\\"o}dinger-F{\\\"o}llmer Sampler without Convexity","created":"2021-07-10","cited_by_count":7,"area":null},{"id":"2206.03792","title":"Utilising the CLT Structure in Stochastic Gradient based Sampling : Improved Analysis and Faster Algorithms","created":"2022-06-08","cited_by_count":7,"area":null},{"id":"2311.09003","title":"Taming under isoperimetry","created":"2023-11-15","cited_by_count":7,"area":null},{"id":"2405.17693","title":"Tamed Langevin sampling under weaker conditions","created":"2024-05-27","cited_by_count":7,"area":null},{"id":"2407.05790","title":"Kinetic Interacting Particle Langevin Monte Carlo","created":"2024-07-08","cited_by_count":7,"area":null},{"id":"2210.13193","title":"Langevin dynamics based algorithm e-TH$\\varepsilon$O POULA for stochastic optimization problems with discontinuous stochastic gradient","created":"2022-10-24","cited_by_count":5,"area":null},{"id":"2507.21449","title":"From Global to Local: A Scalable Benchmark for Local Posterior Sampling","created":"2025-07-29","cited_by_count":5,"area":null},{"id":"2510.12311","title":"Learning Latent Energy-Based Models via Interacting Particle Langevin Dynamics","created":"2025-10-14","cited_by_count":5,"area":null},{"id":"2110.11131","title":"Statistical Finite Elements via Langevin Dynamics","created":"2021-10-21","cited_by_count":4,"area":null},{"id":"2207.09304","title":"A sharp uniform-in-time error estimate for Stochastic Gradient Langevin Dynamics","created":"2022-07-19","cited_by_count":4,"area":null},{"id":"2305.15988","title":"Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms","created":"2023-05-25","cited_by_count":4,"area":null},{"id":"2502.03458","title":"The Performance Of The Unadjusted Langevin Algorithm Without Smoothness Assumptions","created":"2025-02-05","cited_by_count":4,"area":null},{"id":"2510.01944","title":"Uniform-in-time convergence bounds for Persistent Contrastive Divergence algorithms","created":"2025-10-02","cited_by_count":4,"area":null},{"id":"2311.00274","title":"Generalization Bounds for Label Noise Stochastic Gradient Descent","created":"2023-11-01","cited_by_count":3,"area":null},{"id":"2506.04878","title":"kTULA: A Langevin sampling algorithm with improved KL bounds under super-linear log-gradients","created":"2025-06-05","cited_by_count":3,"area":null},{"id":"2509.00941","title":"Regime-Switching Langevin Monte Carlo Algorithms","created":"2025-08-31","cited_by_count":3,"area":null},{"id":"2509.19455","title":"Anchored Langevin Algorithms","created":"2025-09-23","cited_by_count":3,"area":null},{"id":"2201.00409","title":"Global convergence of optimized adaptive importance samplers","created":"2022-01-02","cited_by_count":2,"area":null},{"id":"2205.11970","title":"Weak Convergence of Approximate reflection coupling and its Application to Non-convex Optimization","created":"2022-05-24","cited_by_count":2,"area":null},{"id":"2311.03242","title":"Approximating Langevin Monte Carlo with ResNet-like Neural Network architectures","created":"2023-11-06","cited_by_count":2,"area":null},{"id":"2501.16055","title":"Random Reshuffling for Stochastic Gradient Langevin Dynamics","created":"2025-01-27","cited_by_count":2,"area":null},{"id":"2301.06769","title":"Geometric ergodicity of SGLD via reflection coupling","created":"2023-01-17","cited_by_count":1,"area":null},{"id":"2305.13882","title":"Subsampling Error in Stochastic Gradient Langevin Diffusions","created":"2023-05-23","cited_by_count":1,"area":null},{"id":"2509.12031","title":"Contractive kinetic Langevin samplers beyond global Lipschitz continuity","created":"2025-09-15","cited_by_count":1,"area":null},{"id":"2608.25052","title":"Improved Analysis for Hessian-free High-resolution Monte Carlo Sampling","created":"2026-08-25","cited_by_count":1,"area":null},{"id":"2205.12959","title":"Uniform Generalization Bound on Time and Inverse Temperature for Gradient Descent Algorithm and its Application to Analysis of Simulated Annealing","created":"2022-05-25","cited_by_count":0,"area":null},{"id":"2211.08603","title":"Asynchronous Bayesian Learning over a Network","created":"2022-11-16","cited_by_count":0,"area":null},{"id":"2303.12407","title":"Non-asymptotic analysis of Langevin-type Monte Carlo algorithms","created":"2023-03-22","cited_by_count":0,"area":null},{"id":"2312.02182","title":"Adam-like Algorithm with Smooth Clipping Attains Global Minima: Analysis Based on Ergodicity of Functional SDEs","created":"2023-11-29","cited_by_count":0,"area":null},{"id":"2412.07637","title":"Sampling from Boltzmann densities with physics informed low-rank formats","created":"2024-12-10","cited_by_count":0,"area":null},{"id":"2510.02174","title":"Flatness-Aware Stochastic Gradient Langevin Dynamics","created":"2025-10-02","cited_by_count":0,"area":null}],"next_cursor":null}