ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2202.13975
  4. Cited By
A Proximal Algorithm for Sampling

A Proximal Algorithm for Sampling

28 February 2022
Jiaming Liang
Yongxin Chen
ArXivPDFHTML

Papers citing "A Proximal Algorithm for Sampling"

16 / 16 papers shown
Title
Entropy-Guided Sampling of Flat Modes in Discrete Spaces
Entropy-Guided Sampling of Flat Modes in Discrete Spaces
Pinaki Mohanty
Riddhiman Bhattacharya
Ruqi Zhang
146
0
0
05 May 2025
Mixing Time of the Proximal Sampler in Relative Fisher Information via Strong Data Processing Inequality
Andre Wibisono
53
1
0
08 Feb 2025
Efficient Statistics With Unknown Truncation, Polynomial Time
  Algorithms, Beyond Gaussians
Efficient Statistics With Unknown Truncation, Polynomial Time Algorithms, Beyond Gaussians
Jane H. Lee
Anay Mehrotra
Manolis Zampetakis
25
1
0
02 Oct 2024
Proximal Oracles for Optimization and Sampling
Proximal Oracles for Optimization and Sampling
Jiaming Liang
Yongxin Chen
36
3
0
02 Apr 2024
Zeroth-Order Sampling Methods for Non-Log-Concave Distributions:
  Alleviating Metastability by Denoising Diffusion
Zeroth-Order Sampling Methods for Non-Log-Concave Distributions: Alleviating Metastability by Denoising Diffusion
Ye He
Kevin Rojas
Molei Tao
DiffM
38
8
0
27 Feb 2024
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of
  Diffusion Models in High-Dimensional Graphical Models
Deep Networks as Denoising Algorithms: Sample-Efficient Learning of Diffusion Models in High-Dimensional Graphical Models
Song Mei
Yuchen Wu
DiffM
31
26
0
20 Sep 2023
Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo
  Algorithms
Non-Log-Concave and Nonsmooth Sampling via Langevin Monte Carlo Algorithms
Tim Tsz-Kit Lau
Han Liu
T. Pock
39
4
0
25 May 2023
The probability flow ODE is provably fast
The probability flow ODE is provably fast
Sitan Chen
Sinho Chewi
Holden Lee
Yuanzhi Li
Jianfeng Lu
Adil Salim
DiffM
33
84
0
19 May 2023
Faster high-accuracy log-concave sampling via algorithmic warm starts
Faster high-accuracy log-concave sampling via algorithmic warm starts
Jason M. Altschuler
Sinho Chewi
21
34
0
20 Feb 2023
Improved dimension dependence of a proximal algorithm for sampling
Improved dimension dependence of a proximal algorithm for sampling
JiaoJiao Fan
Bo Yuan
Yongxin Chen
27
24
0
20 Feb 2023
Nesterov smoothing for sampling without smoothness
Nesterov smoothing for sampling without smoothness
JiaoJiao Fan
Bo Yuan
Jiaming Liang
Yongxin Chen
37
2
0
15 Aug 2022
A Proximal Algorithm for Sampling from Non-convex Potentials
Jiaming Liang
Yongxin Chen
33
4
0
20 May 2022
Improved analysis for a proximal algorithm for sampling
Improved analysis for a proximal algorithm for sampling
Yongxin Chen
Sinho Chewi
Adil Salim
Andre Wibisono
19
54
0
13 Feb 2022
When is the Convergence Time of Langevin Algorithms Dimension
  Independent? A Composite Optimization Viewpoint
When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpoint
Y. Freund
Yi Ma
Tong Zhang
37
16
0
05 Oct 2021
Unadjusted Langevin algorithm for non-convex weakly smooth potentials
Unadjusted Langevin algorithm for non-convex weakly smooth potentials
D. Nguyen
Xin Dang
Yixin Chen
40
14
0
16 Jan 2021
MCMC using Hamiltonian dynamics
MCMC using Hamiltonian dynamics
Radford M. Neal
185
3,266
0
09 Jun 2012
1