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. 2110.01827
  4. Cited By
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

5 October 2021
Y. Freund
Yi-An Ma
Tong Zhang
ArXivPDFHTML

Papers citing "When is the Convergence Time of Langevin Algorithms Dimension Independent? A Composite Optimization Viewpoint"

15 / 15 papers shown
Title
An Improved Analysis of Langevin Algorithms with Prior Diffusion for
  Non-Log-Concave Sampling
An Improved Analysis of Langevin Algorithms with Prior Diffusion for Non-Log-Concave Sampling
Xunpeng Huang
Hanze Dong
Difan Zou
Tong Zhang
19
0
0
10 Mar 2024
Initialization Matters: Privacy-Utility Analysis of Overparameterized
  Neural Networks
Initialization Matters: Privacy-Utility Analysis of Overparameterized Neural Networks
Jiayuan Ye
Zhenyu Zhu
Fanghui Liu
Reza Shokri
V. Cevher
32
12
0
31 Oct 2023
Statistical guarantees for stochastic Metropolis-Hastings
Statistical guarantees for stochastic Metropolis-Hastings
S. Bieringer
Gregor Kasieczka
Maximilian F. Steffen
Mathias Trabs
28
1
0
13 Oct 2023
CORE: Common Random Reconstruction for Distributed Optimization with
  Provable Low Communication Complexity
CORE: Common Random Reconstruction for Distributed Optimization with Provable Low Communication Complexity
Pengyun Yue
Hanzheng Zhao
Cong Fang
Di He
Liwei Wang
Zhouchen Lin
Song-Chun Zhu
32
1
0
23 Sep 2023
Reverse Diffusion Monte Carlo
Reverse Diffusion Monte Carlo
Xunpeng Huang
Hanze Dong
Yi Hao
Yi-An Ma
Tong Zhang
DiffM
29
24
0
05 Jul 2023
On the Convergence of Black-Box Variational Inference
On the Convergence of Black-Box Variational Inference
Kyurae Kim
Jisu Oh
Kaiwen Wu
Yi-An Ma
J. Gardner
BDL
40
15
0
24 May 2023
A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm
  under Smoothness and Isoperimetry
A Simple Proof of the Mixing of Metropolis-Adjusted Langevin Algorithm under Smoothness and Isoperimetry
Yuansi Chen
Khashayar Gatmiry
11
6
0
08 Apr 2023
Statistical and Computational Trade-offs in Variational Inference: A
  Case Study in Inferential Model Selection
Statistical and Computational Trade-offs in Variational Inference: A Case Study in Inferential Model Selection
Kush S. Bhatia
Nikki Lijing Kuang
Yi-An Ma
Yixin Wang
11
6
0
22 Jul 2022
Dimension Independent Generalization of DP-SGD for Overparameterized
  Smooth Convex Optimization
Dimension Independent Generalization of DP-SGD for Overparameterized Smooth Convex Optimization
Yi-An Ma
T. V. Marinov
Tong Zhang
17
8
0
03 Jun 2022
A Proximal Algorithm for Sampling from Non-convex Potentials
Jiaming Liang
Yongxin Chen
28
4
0
20 May 2022
A Proximal Algorithm for Sampling
A Proximal Algorithm for Sampling
Jiaming Liang
Yongxin Chen
9
17
0
28 Feb 2022
A Proximal Algorithm for Sampling from Non-smooth Potentials
A Proximal Algorithm for Sampling from Non-smooth Potentials
Jiaming Liang
Yongxin Chen
34
26
0
09 Oct 2021
Coupling and Convergence for Hamiltonian Monte Carlo
Coupling and Convergence for Hamiltonian Monte Carlo
Nawaf Bou-Rabee
A. Eberle
Raphael Zimmer
77
136
0
01 May 2018
A simpler approach to obtaining an O(1/t) convergence rate for the
  projected stochastic subgradient method
A simpler approach to obtaining an O(1/t) convergence rate for the projected stochastic subgradient method
Simon Lacoste-Julien
Mark W. Schmidt
Francis R. Bach
121
259
0
10 Dec 2012
Stochastic Gradient Descent for Non-smooth Optimization: Convergence
  Results and Optimal Averaging Schemes
Stochastic Gradient Descent for Non-smooth Optimization: Convergence Results and Optimal Averaging Schemes
Ohad Shamir
Tong Zhang
99
570
0
08 Dec 2012
1