On the hinge-finding algorithm for hinging hyperplanes

作     者：Pucar, P Sjoberg, J 

作者机构：Saab AB Saab Aerosp Gripen S-58188 Linkoping Sweden Chalmers Univ Technol Dept Signals & Syst S-41296 Gothenburg Sweden 

出 版 物：《IEEE TRANSACTIONS ON INFORMATION THEORY》 (IEEE Trans. Inf. Theory)

年 卷 期：1998年第44卷第3期

页      面：1310-1319页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0701[理学-数学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

基　　金：Swedish Research Council for Engineering Science TFR 

主　　题：hinging hyperplanes nonlinear function approximation numerical minimization 

摘      要：This correspondence concerns the estimation algorithm for hinging hyperplane (HH) models, a piecewise-linear model for approximating functions of several variables, suggested in Breiman [1], 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 [1], a stepwise updating procedure is proposed where only a subset of the parameters are changed in each step. This connects closely to some recently suggested greedy algorithms and these greedy algorithms are discussed and compared to a simultaneous updating of all parameters.