ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1802.09963
  4. Cited By
Breaking the $1/\sqrt{n}$ Barrier: Faster Rates for Permutation-based
  Models in Polynomial Time

Breaking the 1/n1/\sqrt{n}1/n​ Barrier: Faster Rates for Permutation-based Models in Polynomial Time

27 February 2018
Cheng Mao
A. Pananjady
Martin J. Wainwright
ArXivPDFHTML

Papers citing "Breaking the $1/\sqrt{n}$ Barrier: Faster Rates for Permutation-based Models in Polynomial Time"

1 / 1 papers shown
Title
Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown
  Permutations
Towards Optimal Estimation of Bivariate Isotonic Matrices with Unknown Permutations
Cheng Mao
A. Pananjady
Martin J. Wainwright
18
13
0
25 Jun 2018
1