Title :
On the hinge-finding algorithm for hingeing hyperplanes
Author :
Pucar, P. ; Sjoberg, J.
Author_Institution :
Saab Aerospace-Gripen, Linkoping, Sweden
fDate :
5/1/1998 12:00:00 AM
Abstract :
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
Keywords :
Newton method; convergence of numerical methods; estimation theory; function approximation; minimisation; piecewise-linear techniques; HH models; Newton algorithm; convergence; estimation algorithm; function approximation; greedy algorithms; hinge-finding algorithm; hinging hyperplanes; local minimum; parameter updating; piecewise-linear model; stepwise updating procedure; sum of squared error criterion; Aerospace materials; Algorithm design and analysis; Convergence; Councils; Fasteners; Function approximation; Greedy algorithms; Neural networks; Piecewise linear techniques; Solids;
Journal_Title :
Information Theory, IEEE Transactions on
