15 citations · 47 across the 10 of their papers we have counts for
1 paper · 2 filters
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…