Sign inGet started
Paper · arXiv

SRRM: Improving Recursive Transport Surrogates in the Small-Discrepancy Regime

Recursive partitioning methods provide computationally efficient surrogates for the Wasserstein distance, yet their statistical behavior and their resolution in the small-discrepancy regime remain insufficiently understood. We study Recursive Rank Matching (RRM) as a representative instance of this class under a population-anchored reference. In this setting, we establish consistency and an explicit convergence rate for the anchored empirical RRM under the quadratic cost. We then identify a dominant mismatch mechanism responsible for the loss of resolution in the small-discrepancy regime. Based on this analysis, we introduce Selective Recursive Rank Matching (SRRM), which suppresses the r...

AuthorsYufei Zhang, Tao Wang, Jingyi Zhang
Primary categorystat.ML
Published19 March 2026
Last updated at source19 March 2026
stat.MLcs.LGstat.AP
Embed this entry
<iframe src="https://silytics.si/embed/item/c3e73be2-0ee9-4a6a-8af4-d416a9d4c963" width="420" height="190" style="border:0" loading="lazy" title="Silytics entry"></iframe>

Free, no tracking. More about feeds and embeds.

Silytics shows public metadata from arXiv and links to the original. Information may be incomplete or out of date. Last refreshed 17 October 2026. Licenses and terms of the original apply to the work itself. Not financial, legal or professional advice.