用PyTorch实现可扩展的非交叉分位数回归，解决大模型下分位线交叉问题。
A PyTorch Framework for Scalable Non-Crossing Quantile Regression
- 基于增强拉格朗日法与可微pinball损失，结合L-BFGS优化。
- 计算复杂度降至O(n)，7万+数据量下分钟级完成，交叉率近乎为零。
- 适用于教育评估、金融医疗等需合法概率分布的场景。
分位数回归是分布建模的基础，但独立估计多个分位数常导致分位线交叉——违反单调性，产生不可能的负概率密度。现有通过线性规划实现的约束联合分位数回归（CJQR）虽能保证非交叉，但复杂度高达O((qn)^3)，难以用于大规模应用。本文提出首个基于PyTorch自动微分的可扩展方案：CJQR-ALM，融合增强拉格朗日法、可微pinball损失与L-BFGS优化，将复杂度降至O(n)。在超7万样本数据集上，分钟内完成计算，交叉率接近零。该方法天然支持神经网络架构，实现非线性条件分位数估计。应用于学生学业增长百分位计算，验证其实际价值；模拟研究表明，相比无约束估计，均方根误差仅增加约2.4点，为需合法概率陈述的应用（如金融、医疗、工程）提供了高性价比解决方案。
原文摘要 · Abstract (English)
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: \textbf{CJQR-ALM}, combining the \textbf{Augmented Lagrangian Method} with \textbf{differentiable pinball loss} and \textbf{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 $\approx 2.4$ points) relative to unconstrained estimation -- a favorable trade-off for applications requiring valid probability statements across finance, healthcare, and engineering.
Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品；中文卡片由大模型生成，请以原文为准。