5 citations · 9 across the 5 of their papers we have counts for
5 papers
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…
Gaussian discrepancy: a probabilistic relaxation of vector balancing
Sinho Chewi, Patrik Gerber, Philippe Rigollet +1
We introduce a novel relaxation of combinatorial discrepancy called Gaussian discrepancy, whereby binary signings are replaced with correlated standard Gaussian random variables. T…
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…
Averaging on the Bures-Wasserstein manifold: dimension-free convergence of gradient descent
Jason M. Altschuler, Sinho Chewi, Patrik Gerber +1
We study first-order optimization algorithms for computing the barycenter of Gaussian distributions with respect to the optimal transport metric. Although the objective is geodesic…
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…