Regularized Maximum Likelihood Estimation and Feature Selection in Mixtures-of-Experts Models
원문 초록
Mixture of Experts (MoE) are successful models for modeling heterogeneous data in many statistical learning problems including regression, clustering and classification. Generally fitted by maximum likelihood estimation via the well-known EM algorithm, their application to high-dimensional problems is still therefore challenging. We consider the problem of fitting and feature selection in MoE models, and propose a regularized maximum likelihood estimation approach that encourages sparse solutions for heterogeneous regression data models with potentially high-dimensional predictors. Unlike state-of-the art regularized MLE for MoE, the proposed modelings do not require an approximate of the penalty function. We develop two hybrid EM algorithms: an Expectation-Majorization-Maximization (EM/MM) algorithm, and an EM algorithm with coordinate ascent algorithm. The proposed algorithms allow to automatically obtaining sparse solutions without thresholding, and avoid matrix inversion by allowing univariate parameter updates. An experimental study shows the good performance of the algorithms in terms of recovering the actual sparse solutions, parameter estimation, and clustering of heterogeneous regression data.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Deep sparse multi-task learning for feature selection in Alzheimer’s disease diagnosis
An Interpretable Adaptive Multiscale Attention Deep Neural Network for Tabular Data
Prediction of Chronic Kidney Disease - A Machine Learning Perspective
Single-Document Summarization Using Sentence Embeddings and K-Means Clustering
Fast Adaptive K-Means Subspace Clustering for High-Dimensional Data
Face alignment by explicit shape regression
토론
이 논문과 연결된 포럼 글이 아직 없습니다.