Sampling from Log-Concave Distributions with Infinity-Distance Guarantees Oren Mangoubi Worcester Polytechnic Institute Nisheeth K. Vishnoi Y ale University

Neural Information Processing Systems 

This approach also allows us to obtain an improvement on the dimension d in the running time for the problem of sampling from a log-concave distribution on polytopes K with infinity distance Á, by plugging in TV -distance running time bounds for the Dikin Walk Markov chain.