mlsanityData to 14 Oct 2026

Identifiable Convex-Concave Regression via Sub-gradient Regularised Least Squares

arXiv 2506.18078 ↗First posted 22 Jun 2025stat.ML cs.LG math.STcited by 0

Not on the map. Why?

Abstract (arXiv)

We propose a novel nonparametric regression method that models complex input-output relationships as the sum of convex and concave components. The method-Identifiable Convex-Concave Nonparametric Least Squares (ICCNLS)-decomposes the target function into additive shape-constrained components, each represented via sub-gradient-constrained affine functions. To address the affine ambiguity inherent in convex-concave decompositions, we introduce global statistical orthogonality constraints, ensuring that residuals are uncorrelated with both intercept and input variables. This enforces decomposition identifiability and improves interpretability. We further incorporate L1, L2 and elastic net regularisation on sub-gradients to enhance generalisation and promote structural sparsity. The proposed method is evaluated on synthetic and real-world datasets, including healthcare pricing data, and demonstrates improved predictive accuracy and model simplicity compared to conventional CNLS and difference-of-convex (DC) regression approaches. Our results show that statistical identifiability, when paired with convex-concave structure and sub-gradient regularisation, yields interpretable models suited for forecasting, benchmarking, and policy evaluation.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 4 of its 30 references that are in the map. First posted on arXiv 22 Jun 2025.

Builds on

4 of 30 references.

References · 4

  1. 2021Convex optimizationcited by 2,515
  2. 2015A Computational Framework for Multivariate Convex Regression and its Variantscited by 16
  3. 2020Piecewise Linear Regression via a Difference of Convex Functionscited by 14
  4. 2022Convex Support Vector Regressioncited by 1

Built on by

Not cited yet.