Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time

Cheng Mao, Ashwin Pananjady, Martin J. Wainwright. Breaking the $1/\sqrtn$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time. In Sébastien Bubeck, Vianney Perchet, Philippe Rigollet, editors, Conference On Learning Theory, COLT 2018, Stockholm, Sweden, 6-9 July 2018. Volume 75 of Proceedings of Machine Learning Research, pages 2037-2042, PMLR, 2018. [doi]

Abstract

Abstract is missing.