18 citations · 75 across the 20 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
math.ST2021★ 1 cited
The query complexity of sampling from strongly log-concave distributions in one dimension
Sinho Chewi, Patrik Gerber, Chen Lu +2
We establish the first tight lower bound of on the query complexity of sampling from the class of strongly log-concave and log-smooth distributions with condition nu…
cs.LG2021★ 1 cited
Rejection sampling from shape-constrained distributions in sublinear time
Sinho Chewi, Patrik Gerber, Chen Lu +2
We consider the task of generating exact samples from a target distribution, known up to normalization, over a finite alphabet. The classical algorithm for this task is rejection s…
cs.LG2021★ 2 cited
Sampling From the Wasserstein Barycenter
Chiheb Daaloul, Thibaut Le Gouic, Jacques Liandrat +1
This work presents an algorithm to sample from the Wasserstein barycenter of absolutely continuous measures. Our method is based on the gradient flow of the multimarginal formulati…