Monge-Kantorovich Ranks: Theory and Applications
- Monge–Kantorovich ranks are transport-based statistical ranks that map multivariate data onto a spherical uniform reference, establishing a center-outward ordering.
- They decompose the transport image into a radial component (rank) and an angular component (sign), linking multivariate rank concepts to traditional univariate ranks.
- The framework supports distribution-free inference and robust nonparametric tests, with efficient computation using optimal assignment algorithms like the Hungarian method.
Monge–Kantorovich ranks are transport-based statistical ranks obtained by mapping a distribution of interest onto a fixed reference measure and then reading the image point in the reference space as a center-outward coordinate. In the multivariate setting, the leading construction uses the spherical uniform distribution on the closed unit ball as reference, so that the transported image decomposes into a radial component, interpreted as rank, and an angular component, interpreted as sign. This framework was introduced for multivariate depth, quantiles, ranks, and signs through optimal transport, and was later recast in a geometric center-outward form with stronger inferential guarantees and without moment assumptions (Chernozhukov et al., 2014, Barrio et al., 2018).
1. Transport-theoretic definition
Let be the distribution of , absolutely continuous with respect to Lebesgue measure. The center-outward reference is the spherical uniform distribution on the closed unit ball, denoted , where . This reference is the product of a uniform radius on and a uniform direction on the unit sphere , independent of each other (Barrio et al., 2018).
McCann’s theorem ensures that there exists a convex potential on such that the gradient
0
pushes 1 forward to 2, so 3. Writing 4 for the Legendre transform of 5,
6
the reverse map is
7
and it pushes 8 forward to the spherical uniform: 9 Moreover, 0 for all 1, and under mild regularity the gradients are almost-everywhere inverses: 2 (Barrio et al., 2018).
In the quadratic-cost Monge–Kantorovich problem, if 3 has finite second moment then 4 coincides 5-a.s. with the 6-optimal Brenier map, and its graph is cyclically monotone. Equivalently,
7
for any cycle 8 with 9 (Barrio et al., 2018).
2. Ranks, signs, depth, and univariate reduction
For an observation 0, the rank and sign are defined from the transport image 1. The radial component
2
is the center-outward analog of a univariate rank, interpreted as the probability content of the smallest center-outward quantile region containing 3. The angular component
4
with 5 if 6, is the multivariate sign. Under 7, 8, 9 is uniform on 0, and 1 and 2 are independent (Barrio et al., 2018).
The earlier Monge–Kantorovich formulation expresses the same idea in terms of a reverse transport 3 from the distribution 4 to a reference distribution 5. When 6 is the spherical uniform 7 on the unit ball, the MK rank of 8 is the vector 9, its scalar radial rank is
0
and the MK sign is
1
The corresponding center-outward ordering is
2
A fundamental benchmark is the reduction to 3. In the center-outward formulation,
4
so
5
and the sign becomes 6, recovering traditional ranks and signs (Barrio et al., 2018). In the MK depth formulation, the univariate rank map is 7, and the resulting MK depth equals Tukey halfspace depth: 8 (Chernozhukov et al., 2014).
The depth interpretation is central in the original formulation. For spherical reference 9, the MK 0-quantile contour is
1
the MK depth region is
2
and the MK depth of 3 is Tukey halfspace depth evaluated at 4. In 5, and for spherical or elliptical families after affine standardization, MK depth coincides with halfspace depth; for more general distributions, MK contours can account for non convex features of the distribution of interest (Chernozhukov et al., 2014).
3. Empirical construction and computation
For a sample of size 6, the empirical center-outward map is built on a regular grid in 7. One factors
8
with 9 radii, 0 directions, and 1 copies of the origin. The grid consists of radii
2
directions 3, 4, forming an “as uniform as possible” set on 5, and 6 copies of 7. The empirical target is the discrete uniform on this augmented shell-and-sphere grid (Barrio et al., 2018).
Observed points 8 are assigned to grid points 9 by solving the quadratic-cost assignment problem
0
where the minimum runs over bijections from the sample to the grid, or equivalently over permutations 1 minimizing
2
The solution is cyclically monotone. The paper lists two computational routes: the Hungarian algorithm with complexity 3, and auction algorithms with complexity 4 with a parameter 5, together with the instruction to verify optimality and, if needed, decrease 6 (Barrio et al., 2018).
The assignment defines the empirical map 7, hence empirical ranks and signs
8
with 9 if 0. If 1, ties occur at the origin; the paper notes that a small random jitter on a tiny inner sphere breaks ties and restores injectivity (Barrio et al., 2018).
The computational study reported implementations handling 2 up to 3 in 4. After assignment, a smooth extension is computed via convex analysis and a projected gradient method; the smoothing parameter is obtained in 5 via Karp’s minimum mean cycle algorithm (Barrio et al., 2018). In the earlier MK formulation, the discrete–discrete case likewise reduces to optimal assignment, while smooth–smooth settings are connected to convex-potential solvers such as Benamou–Brenier’s fluid-mechanics algorithm (Chernozhukov et al., 2014).
4. Distribution-freeness, ancillarity, and semiparametric use
A defining statistical property is finite-sample distribution-freeness. Under absolutely continuous 6, the vector
7
is uniformly distributed over all permutations of the grid points, with repeats for the 8 origins. Consequently, empirical ranks 9 and signs 00 are strictly distribution-free (Barrio et al., 2018).
The same construction yields an ancillarity statement. The order statistic, understood as the sample viewed as an unordered set, is minimal sufficient and complete for the nonparametric model, while 01 is independent of it by Basu’s theorem. The 02-field generated by
03
is described as essentially maximal ancillary: it carries all information about parameters of interest orthogonal to the nuisance density. In the paper, this is the finite-sample analog of semiparametric efficiency preservation, and invariance under data-driven order-preserving transformations is identified as the multivariate counterpart of univariate monotone-invariance in the sense of Hallin–Werker, although the full multivariate invariance theory is left for further development (Barrio et al., 2018).
These properties motivate rank-based procedures. The paper explicitly states that center-outward ranks and signs enable the construction of valid distribution-free tests, including multi-sample, regression, and independence procedures, and support semiparametric procedures that preserve efficiency. In elliptical models, center-outward ranks coincide with Mahalanobis ranks; their consistency extends to general absolutely continuous 04, which yields procedures robust beyond ellipticity (Barrio et al., 2018).
The earlier MK depth framework emphasizes a related point from the reference-measure side: if 05, then the MK rank 06 is distributed according to the reference 07, and in the spherical case 08. That distribution-free pushforward property is the basis for rank and sign constructions adapted to general multivariate distributions rather than restricted spherical families (Chernozhukov et al., 2014).
5. Smooth extension, Glivenko–Cantelli theory, and quantile geometry
The empirical map 09 is initially defined only at observed points. At those points, a discrete Glivenko–Cantelli result holds: if 10 are i.i.d. with 11 in a broad class including convex supports and locally bounded densities, then
12
As a consequence, empirical ranks and signs consistently estimate their population counterparts, and empirical quantile contours consistently reconstruct the population contours at the observed points (Barrio et al., 2018).
To obtain a map on all of 13, the paper constructs a convex piecewise-linear potential
14
with suitable weights 15 such that 16 for all 17. Smoothness is then introduced via the Moreau–Yosida regularization
18
and one sets 19. For sufficiently small 20, 21, cyclical monotonicity is preserved, and the range remains within the unit ball (Barrio et al., 2018).
The resulting extension is Lipschitz with constant 22. The largest admissible smoothing parameter is
23
which is computed via Karp’s minimum mean cycle algorithm in 24. Choosing 25 yields the smoothest extension with Lipschitz constant 26, and the bound is stated to be sharp within this construction; in 27, it attains the minimal possible Lipschitz constant (Barrio et al., 2018).
This produces a continuous empirical map 28 with uniform convergence
29
Population quantile regions and contours are defined by
30
31
Under mild regularity, these regions are closed, connected, and strictly nested; contours are continuous hypersurfaces of Hausdorff dimension 32. The median set is
33
a compact convex set of Lebesgue measure zero, and a point for 34 under the stated regularity (Barrio et al., 2018).
6. Scope of the term and later extensions
The expression “Monge–Kantorovich ranks” is used in several related but non-identical senses. In multivariate statistics, it denotes the transport-based ranks and signs associated with the map from 35 to a reference measure on the unit ball, together with the associated depth and quantile structures (Chernozhukov et al., 2014, Barrio et al., 2018). The 2018 center-outward treatment explicitly contrasts its geometric construction with the Monge–Kantorovich approach of Chernozhukov et al. (2017): the geometric center-outward approach adopts McCann’s geometric existence and a spherical uniform target, avoids moment restrictions, and builds empirical maps with smooth cyclically monotone extensions (Barrio et al., 2018).
A distinct use appears in the optimal-transport duality literature on infinite-dimensional spaces. In “On the Role of Cylindrical Functions in Kantorovich duality,” the term “Monge-Kantorovich ranks” is not used explicitly. There, “rank” refers instead to the finite rank of linear projections 36 and 37 defining cylindrical functions in the Kantorovich dual problem; increasing rank yields a consistent finite-dimensional approximation scheme for infinite-dimensional optimal transport (Zaal, 2015). A potential source of confusion is therefore terminological rather than conceptual: the “rank” in that setting is the dimension of a projection, not a statistical rank assigned to observations.
Another extension arises in one-dimensional differentiable sorting. “Differentiable Ranks and Sorting using Optimal Transport” formulates sorting as an OT problem on 38 between an input measure and a presorted target grid. The optimal coupling defines generalized K-ranks, K-CDFs, K-sorts, and K-quantiles, and entropic regularization yields differentiable S-ranks and S-sorts via Sinkhorn scaling. In that work, the construction is explicitly one-dimensional and algorithmic, aimed at differentiable learning pipelines rather than multivariate center-outward inference (Cuturi et al., 2019).
A further extension concerns image data. “Monge-Kantorovich quantiles and ranks for image data” first embeds images into a tangent space using linear optimal transport, then applies MK quantiles and ranks in a Log-PCA latent space with spherical-uniform reference on the unit ball. The paper defines an MK rank function 39, inner and outer depths for images, and uses the framework for descriptive analysis, outlier detection, and statistical testing (Thurin, 4 Mar 2025). This suggests that the center-outward OT paradigm is not confined to 40 point clouds, but can be transferred to structured objects once a suitable transport-linearized representation is available.