# A PyTorch Framework for Scalable Non-Crossing Quantile Regression

arXiv: https://arxiv.org/abs/2510.22419 · HTML: https://mlsanity.com/paper/2510.22419/

## Key facts

- No citing papers in the map yet (data through 14 Oct 2026).
- Builds on 1 of its 16 references that are in the map.
- First posted on arXiv 25 Oct 2025.

## Builds on (most cited first, 1 of 1)

- [XGBoost: A Scalable Tree Boosting System](https://mlsanity.com/paper/1603.02754/) (2016)

## Abstract (arXiv)

Quantile regression is fundamental to distributional modeling, yet independent estimation of multiple quantiles frequently produces crossing -- where estimated quantile functions violate monotonicity, implying impossible negative probability densities. While Constrained Joint Quantile Regression (CJQR) elegantly enforces non-crossing by construction, existing formulations via Linear Programming exhibit O((qn)3) complexity, rendering them impractical for large-scale applications. We present the first scalable solution using PyTorch automatic differentiation: CJQR-ALM, combining the Augmented Lagrangian Method with differentiable pinball loss and L-BFGS optimization. Our approach reduces computational complexity to O(n), achieving near-zero crossing rates on datasets exceeding 70,000 observations within minutes. The differentiable formulation naturally extends to neural network architectures for non-linear conditional quantile estimation. Application to Student Growth Percentile calculations demonstrates practical utility for educational assessment, while simulation studies show negligible accuracy cost (RMSE increase ≈ 2.4 points) relative to unconstrained estimation -- a favorable trade-off for applications requiring valid probability statements across finance, healthcare, and engineering.