English

Piecewise Linear Regression via a Difference of Convex Functions

Machine Learning 2020-11-17 v3 Machine Learning

Abstract

We present a new piecewise linear regression methodology that utilizes fitting a difference of convex functions (DC functions) to the data. These are functions ff that may be represented as the difference ϕ1ϕ2\phi_1 - \phi_2 for a choice of convex functions ϕ1,ϕ2\phi_1, \phi_2. The method proceeds by estimating piecewise-liner convex functions, in a manner similar to max-affine regression, whose difference approximates the data. The choice of the function is regularised by a new seminorm over the class of DC functions that controls the \ell_\infty Lipschitz constant of the estimate. The resulting methodology can be efficiently implemented via Quadratic programming even in high dimensions, and is shown to have close to minimax statistical risk. We empirically validate the method, showing it to be practically implementable, and to have comparable performance to existing regression/classification methods on real-world datasets.

Keywords

Cite

@article{arxiv.2007.02422,
  title  = {Piecewise Linear Regression via a Difference of Convex Functions},
  author = {Ali Siahkamari and Aditya Gangrade and Brian Kulis and Venkatesh Saligrama},
  journal= {arXiv preprint arXiv:2007.02422},
  year   = {2020}
}

Comments

Published in International Conference on Machine Learning (ICML2020) Proceedings

R2 v1 2026-06-23T16:52:06.277Z