Pith. sign in

REVIEW

Error Bounds for Compositions of Piecewise Affine Approximations

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.15601 v1 pith:O4YOSUMV submitted 2024-02-23 eess.SY cs.SY

Error Bounds for Compositions of Piecewise Affine Approximations

classification eess.SY cs.SY
keywords errorfunctionsapproximationscompositionsaffineapproximatedcomplexitycomputational
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Nonlinear expressions are often approximated by piecewise affine (PWA) functions to simplify analysis or reduce computational costs. To reduce computational complexity, multivariate functions can be represented as compositions of functions with one or two inputs, which can be approximated individually. This paper provides efficient methods to generate PWA approximations of nonlinear functions via functional decomposition. The key contributions focus on intelligent placement of breakpoints for PWA approximations without requiring optimization, and on bounding the error of PWA compositions as a function of the error tolerance for each component of that composition. The proposed methods are used to systematically construct a PWA approximation for a complicated function, either to within a desired error tolerance or to a given level of complexity.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.