14 citations · 23 across the 10 of their papers we have counts for
Showing 2026Show all
3 papers · 1 filter
cs.DS2026
Complexity of Non-Log-Concave Sampling in Fisher Information
Sinho Chewi, Andre Wibisono
We study the query complexity of obtaining a relative Fisher information guarantee for sampling from a log-smooth non-log-concave distribution; this is a sampling analog of finding…
cs.GT2026
When and Why is Optimistic Multiplicative Weights Slow? The Geometry of Energy Dissipation
John Lazarsfeld, Anas Barakat, Georgios Piliouras +2
This paper studies the convergence of the Optimistic Multiplicative Weights Update algorithm (OMWU) in two player zero-sum games. Recent works have identified instances on which th…
cs.DS2026
The Geometry of Efficient Nonconvex Sampling
Santosh S. Vempala, Andre Wibisono
We present an efficient algorithm for uniformly sampling from an arbitrary compact body from a warm start under isoperimetry and a natural volume…