On the Hinge Finding Algorithm for Hinging Hyperplanes
1996 (English)In: IEEE Transactions on Information Theory, ISSN 0018-9448, Vol. 32, no 6Article in journal (Refereed) Published
This correspondence concerns the estimation algorithm for hinging hyperplane (HH) models, a piecewise-linear model for approximating functions of several variables, suggested in Breiman (1993). The estimation algorithm is analyzed and it is shown that it is a special case of a Newton algorithm applied to a sum of squared error criterion. This insight is then used to suggest possible improvements of the algorithm so that convergence to a local minimum can be guaranteed. In addition, the way of updating the parameters in the HH model is discussed. In Breiman, a stepwise updating procedure is proposed where only a subset of the parameters are changed in each step. This connects closely to some previously suggested greedy algorithms and these greedy algorithms are discussed and compared to a simultaneous updating of all parameters.
Place, publisher, year, edition, pages
1996. Vol. 32, no 6
Nonlinear function approximation, Hyperplanes, Numerical methods
IdentifiersURN: urn:nbn:se:liu:diva-56361DOI: 10.1109/18.669422OAI: oai:DiVA.org:liu-56361DiVA: diva2:318586