MAEA2 / survey

0 stars 0 forks source link

Breaking the \$1/\textbackslashsqrt\{n\}\$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time #53

Open MAEA2 opened 5 years ago

MAEA2 commented 5 years ago

@ARTICLE{2018arXiv180209963M, author = {{Mao}, Cheng and {Pananjady}, Ashwin and {Wainwright}, Martin J.}, title = "{Breaking the \$1/\textbackslashsqrt{n}\$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time}", journal = {arXiv e-prints}, keywords = {Statistics - Machine Learning, Computer Science - Information Theory, Computer Science - Machine Learning, Mathematics - Statistics Theory}, year = 2018, month = Feb, eid = {arXiv:1802.09963}, pages = {arXiv:1802.09963}, archivePrefix = {arXiv}, eprint = {1802.09963}, primaryClass = {stat.ML}, adsurl = {https://ui.adsabs.harvard.edu/\#abs/2018arXiv180209963M}, adsnote = {Provided by the SAO/NASA Astrophysics Data System} }