mlsanityData to 7 Oct 2026

Fast Nonlinear Vector Quantile Regression

arXiv 2205.14977 ↗First posted 30 May 2022stat.CO cs.LG stat.MLcited by 11

Not on the map. Why?

Abstract (arXiv)

Quantile regression (QR) is a powerful tool for estimating one or more conditional quantiles of a target variable Y given explanatory features boldsymbolX. A limitation of QR is that it is only defined for scalar target variables, due to the formulation of its objective function, and since the notion of quantiles has no standard definition for multivariate distributions. Recently, vector quantile regression (VQR) was proposed as an extension of QR for vector-valued target variables, thanks to a meaningful generalization of the notion of quantiles to multivariate distributions via optimal transport. Despite its elegance, VQR is arguably not applicable in practice due to several limitations: (i) it assumes a linear model for the quantiles of the target boldsymbolY given the features boldsymbolX; (ii) its exact formulation is intractable even for modestly-sized problems in terms of target dimensions, number of regressed quantile levels, or number of features, and its relaxed dual formulation may violate the monotonicity of the estimated quantiles; (iii) no fast or scalable solvers for VQR currently exist. In this work we fully address these limitations, namely: (i) We extend VQR to the non-linear case, showing substantial improvement over linear VQR; (ii) We propose vector monotone rearrangement, a method which ensures the quantile functions estimated by VQR are monotone functions; (iii) We provide fast, GPU-accelerated solvers for linear and nonlinear VQR which maintain a fixed memory footprint, and demonstrate that they scale to millions of samples and thousands of quantile levels; (iv) We release an optimized python package of our solvers as to widespread the use of VQR in real-world applications.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 14 of its 41 references that are in the map. First posted on arXiv 30 May 2022.

Builds on

14 of 41 references.

References · 14

  1. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  2. 2018Computational Optimal Transportcited by 765
  3. 2013Stochastic First- and Zeroth-order Methods for Nonconvex Stochastic Programmingcited by 716
  4. 2016CVXPY: A Python-Embedded Modeling Language for Convex Optimizationcited by 633
  5. 2019Conformalized Quantile Regressioncited by 620
  6. 2019PyOD: A Python Toolbox for Scalable Outlier Detectioncited by 221
  7. 2016Stochastic Optimization for Large-scale Optimal Transportcited by 188
  8. 2020Kernel Operations on the GPU, with Autodiff, without Memory Overflowscited by 101
  9. 2021Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmarkcited by 95
  10. 2021Conformal Prediction using Conditional Histogramscited by 77
  11. 2021Calibrated Multiple-Output Quantile Regression with Representation Learningcited by 49
  12. 2022Deep Non-Crossing Quantiles through the Partial Derivativecited by 12
2 more
  1. 2019Lecture Notes: Optimization for Machine Learningcited by 8
  2. 2020Causal inference for multiple continuous exposures via the multivariate generalized propensity scorecited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2022: 1; 2023: 3; 2024: 0; 2025: 6; 2026: 1.

11 papers.