Improved learning algorithms for mixture of experts in multiclass classification

• Published in: Neural networks Vol. 12; no. 9; pp. 1229 - 1252
• Main Authors: Chen, K., Xu, L., Chi, H.
• Format: Journal Article
• Language: English
• Published: Oxford Elsevier Ltd 01.11.1999; Elsevier Science
• Subjects: Applied sciences; Artificial intelligence; BFGS algorithm; Computer science; control theory; systems; Connectionism. Neural networks; Exact sciences and technology; Expectation-Maximization (EM) algorithm; Generalized Bernoulli density; Iterative reweighted least squares (IRLS) algorithm; Learning and adaptive systems; Mixture of experts; Multiclass classification; Multinomial density; Newton-Raphson method; Expectation-Maximization (EM) algorithm; Mixture of experts; Iterative reweighted least squares (IRLS) algorithm; Generalized Bernoulli density; BFGS algorithm; Multinomial density; Newton–Raphson method; Multiclass classification; Maximization; Bernoulli scheme; Expert system; Classification; Theoretical study; Mixture theory; Multinomial distribution; Expectation; Learning algorithm; Newton Raphson method
• ISSN: 0893-6080; 1879-2782; 1879-2782
• DOI: 10.1016/S0893-6080(99)00043-X

Mixture of experts (ME) is a modular neural network architecture for supervised learning. A double-loop Expectation-Maximization (EM) algorithm has been introduced to the ME architecture for adjusting the parameters and the iteratively reweighted least squares (IRLS) algorithm is used to perform maximization in the inner loop [Jordan, M.I., Jacobs, R.A. (1994). Hierarchical mixture of experts and the EM algorithm, Neural Computation, 6(2), 181–214]. However, it is reported in literature that the IRLS algorithm is of instability and the ME architecture trained by the EM algorithm, where IRLS algorithm is used in the inner loop, often produces the poor performance in multiclass classification. In this paper, the reason of this instability is explored. We find out that due to an implicitly imposed incorrect assumption on parameter independence in multiclass classification, an incomplete Hessian matrix is used in that IRLS algorithm. Based on this finding, we apply the Newton–Raphson method to the inner loop of the EM algorithm in the case of multiclass classification, where the exact Hessian matrix is adopted. To tackle the expensive computation of the Hessian matrix and its inverse, we propose an approximation to the Newton–Raphson algorithm based on a so-called generalized Bernoulli density. The Newton–Raphson algorithm and its approximation have been applied to synthetic data, benchmark, and real-world multiclass classification tasks. For comparison, the IRLS algorithm and a quasi-Newton algorithm called BFGS have also been applied to the same tasks. Simulation results have shown that the use of the proposed learning algorithms avoids the instability problem and makes the ME architecture produce good performance in multiclass classification. In particular, our approximation algorithm leads to fast learning. In addition, the limitation of our approximation algorithm is also empirically investigated in this paper.