Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler

13 February 2023

Papers citing "Algorithmic Aspects of the Log-Laplace Transform and a Non-Euclidean Proximal Sampler"

11 / 11 papers shown

Title
Localization Schemes: A Framework for Proving Mixing Bounds for Markov Chains Yuansi Chen Ronen Eldan 20 79 0 08 Mar 2022
Private Convex Optimization via Exponential Mechanism Sivakanth Gopi Y. Lee Daogao Liu 100 54 0 01 Mar 2022
Improved analysis for a proximal algorithm for sampling Yongxin Chen Sinho Chewi Adil Salim Andre Wibisono 68 57 0 13 Feb 2022
The entropic barrier is $n$ -self-concordant Sinho Chewi MDE 24 12 0 21 Dec 2021
A Proximal Algorithm for Sampling from Non-smooth Potentials Jiaming Liang Yongxin Chen 75 26 0 09 Oct 2021
Non-Euclidean Differentially Private Stochastic Convex Optimization: Optimal Rates in Linear Time Raef Bassily Cristóbal Guzmán Anupama Nandi 81 67 0 01 Mar 2021
Optimal dimension dependence of the Metropolis-Adjusted Langevin Algorithm Sinho Chewi Chen Lu Kwangjun Ahn Xiang Cheng Thibaut Le Gouic Philippe Rigollet 46 66 0 23 Dec 2020
Efficient constrained sampling via the mirror-Langevin algorithm Kwangjun Ahn Sinho Chewi 45 54 0 30 Oct 2020
Logsmooth Gradient Concentration and Tighter Runtimes for Metropolized Hamiltonian Monte Carlo Y. Lee Ruoqi Shen Kevin Tian 45 37 0 10 Feb 2020
Optimal Convergence Rate of Hamiltonian Monte Carlo for Strongly Logconcave Distributions Zongchen Chen Santosh Vempala 46 65 0 07 May 2019
Optimal rates for zero-order convex optimization: the power of two function evaluations John C. Duchi Michael I. Jordan Martin J. Wainwright Andre Wibisono 62 480 0 07 Dec 2013