ResearchTrend.AI
Query lower bounds for log-concave sampling

Query lower bounds for log-concave sampling

Sinho Chewi
Jaume de Dios Pont
Jerry Li
Chen Lu
Shyam Narayanan
ArXivPDFHTML

Papers citing "Query lower bounds for log-concave sampling"

6 / 6 papers shown
Title
On a Class of Gibbs Sampling over Networks
On a Class of Gibbs Sampling over Networks
Bo Yuan
JiaoJiao Fan
Jiaming Liang
Andre Wibisono
Yongxin Chen
49
6
0
23 Jun 2023
Krylov Methods are (nearly) Optimal for Low-Rank Approximation
Krylov Methods are (nearly) Optimal for Low-Rank Approximation
Ainesh Bakshi
Shyam Narayanan
23
6
0
06 Apr 2023
Fisher information lower bounds for sampling
Fisher information lower bounds for sampling
Sinho Chewi
P. Gerber
Holden Lee
Chen Lu
43
15
0
05 Oct 2022
Private Convex Optimization via Exponential Mechanism
Private Convex Optimization via Exponential Mechanism
Sivakanth Gopi
Y. Lee
Daogao Liu
79
52
0
01 Mar 2022
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling
Minimax Mixing Time of the Metropolis-Adjusted Langevin Algorithm for Log-Concave Sampling
Keru Wu
S. Schmidler
Yuansi Chen
39
50
0
27 Sep 2021
The Mirror Langevin Algorithm Converges with Vanishing Bias
The Mirror Langevin Algorithm Converges with Vanishing Bias
Ruilin Li
Molei Tao
Santosh Vempala
Andre Wibisono
41
35
0
24 Sep 2021