Track papers across labs, topics, and trends.
Search papers, labs, and topics across Lattice.
Affiliation:
2
0
2
Hit-and-Run's convergence complexity is improved to nearly quadratic in dimension, reshaping our understanding of its efficiency in sampling from convex bodies.
Mixing time for Dikin walks can be reduced to $d^{2.25}$ iterations, challenging previous assumptions and opening new avenues for efficient sampling from polytopes.