Abstract
We give degree of approximation results for decision regions which are defined by polynomial and neural network parametrizations. The volume of the misclassified region is used to measure the approximation error, and results for the degree of L1 approximation of functions are used. For polynomial parametrizations, we show that the degree of approximation is at least 1, whereas for neural network parametrizations we prove the slightly weaker result that the degree of approximation is at least r, where r can be any number in the open interval (0,1).
Original language | English |
---|---|
Pages (from-to) | 903-907 |
Number of pages | 5 |
Journal | IEEE Transactions on Information Theory |
Volume | 43 |
Issue number | 3 |
DOIs | |
Publication status | Published - 1997 |