mlsanityData to 14 Oct 2026

Permuted and Unlinked Monotone Regression in ℝd: an approach based on mixture modeling and optimal transport

arXiv 2201.03528 ↗First posted 10 Jan 2022math.ST cs.LG stat.MLcited by 4

Not on the map. Why?

Abstract (arXiv)

Suppose that we have a regression problem with response variable Y in ℝd and predictor X in ℝd, for d ≥ 1. In permuted or unlinked regression we have access to separate unordered data on X and Y, as opposed to data on (X,Y)-pairs in usual regression. So far in the literature the case d=1 has received attention, see e.g., the recent papers by Rigollet and Weed [Information & Inference, 8, 619--717] and Balabdaoui et al. [J. Mach. Learn. Res., 22(172), 1--60]. In this paper, we consider the general multivariate setting with d ≥ 1. We show that the notion of cyclical monotonicity of the regression function is sufficient for identification and estimation in the permuted/unlinked regression model. We study permutation recovery in the permuted regression setting and develop a computationally efficient and easy-to-use algorithm for denoising based on the Kiefer-Wolfowitz [Ann. Math. Statist., 27, 887--906] nonparametric maximum likelihood estimator and techniques from the theory of optimal transport. We provide explicit upper bounds on the associated mean squared denoising error for Gaussian noise. As in previous work on the case d = 1, the permuted/unlinked setting involves slow (logarithmic) rates of convergence rooting in the underlying deconvolution problem. Numerical studies corroborate our theoretical analysis and show that the proposed approach performs at least on par with the methods in the aforementioned prior work in the case d = 1 while achieving substantial reductions in terms of computational complexity.

Key facts. Cited by 4 papers in the map (data through 14 Oct 2026). Builds on 22 of its 72 references that are in the map. First posted on arXiv 10 Jan 2022.

Builds on

22 of 72 references.

References · 22

  1. 2021Convex optimizationcited by 2,515
  2. 2019Differentiable Ranks and Sorting using Optimal Transportcited by 113
  3. 2018Unsupervised Alignment of Embeddings with Wasserstein Procrustescited by 97
  4. 2020Faster Wasserstein Distance Estimation with the Sinkhorn Divergencecited by 73
  5. 2021Plugin Estimation of Smooth Optimal Transport Mapscited by 68
  6. 2021Rates of Estimation of Optimal Transport Maps using Plug-in Estimators via Barycentric Projectionscited by 53
  7. 2017On the nonparametric maximum likelihood estimator for Gaussian location mixture densities with application to Gaussian denoisingcited by 19
  8. 2019Regularity as Regularization: Smooth and Strongly Convex Brenier Potentials in Optimal Transportcited by 19
  9. 2017Linear Regression with Sparsely Permuted Datacited by 18
  10. 2017Linear regression without correspondencecited by 16
  11. 2013Minimax rates in permutation estimation for feature matchingcited by 13
  12. 2018Uncoupled isotonic regression via minimum Wasserstein deconvolutioncited by 12
10 more
  1. 2019A Two-Stage Approach to Multivariate Linear Regression with Sparsely Mismatched Datacited by 12
  2. 2017Denoising Linear Models with Permuted Datacited by 11
  3. 2017Linear Regression with Shuffled Labelscited by 11
  4. 2016Optimal Rates of Statistical Seriationcited by 10
  5. 2019Optimal Permutation Recovery in Permuted Monotone Matrix Modelcited by 10
  6. 2019A Pseudo-Likelihood Approach to Linear Regression with Partially Shuffled Datacited by 8
  7. 2018Spherical Regression under Mismatch Corruption with Application to Automated Knowledge Translationcited by 7
  8. 2016Learning relationships between data obtained independentlycited by 6
  9. 2018An algebraic-geometric approach for linear regression without correspondencescited by 3
  10. 2020Unlinked monotone regressioncited by 3

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 2; 2024: 0; 2025: 1; 2026: 1.

4 papers.