2 citations · 4 across the 3 of their papers we have counts for
3 papers
stat.ML2022★ 2 cited
Fisher information lower bounds for sampling
Sinho Chewi, Patrik Gerber, Holden Lee +1
We prove two lower bounds for the complexity of non-log-concave sampling within the framework of Balasubramanian et al. (2022), who introduced the use of Fisher information (FI) bo…
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…