Piecewise Polynomial Regression of Tame Functions via Integer Programming
Bareilles, Gilles, Aspman, Johannes, Nemecek, Jiri, Marecek, Jakub
–arXiv.org Artificial Intelligence
We consider approximating so-called tame functions, a class of nonsmooth, nonconvex functions, with piecewise polynomial functions. Tame functions appear in a wide range of applications: functions encountered in the training of deep neural networks with all common activations, value functions of mixed-integer programs, or wave functions of small molecules. We bound the quality of approximation of a tame function by a piecewise polynomial function with a given number of segments on any full-dimensional cube. We also present the first ever mixed-integer programming formulation of piecewise polynomial regression. Together, these can be used to estimate tame functions. We demonstrate promising computational results.
arXiv.org Artificial Intelligence
Feb-5-2024