A non-asymptotic approach for model selection via penalization in high-dimensional mixture of experts models
arXiv:2104.02640 · doi:10.1214/22-EJS2057
Abstract
Mixture of experts (MoE) are a popular class of statistical and machine learning models that have gained attention over the years due to their flexibility and efficiency. In this work, we consider Gaussian-gated localized MoE (GLoME) and block-diagonal covariance localized MoE (BLoME) regression models to present nonlinear relationships in heterogeneous data with potential hidden graph-structured interactions between high-dimensional predictors. These models pose difficult statistical estimation and model selection questions, both from a computational and theoretical perspective. This paper is devoted to the study of the problem of model selection among a collection of GLoME or BLoME models characterized by the number of mixture components, the complexity of Gaussian mean experts, and the hidden block-diagonal structures of the covariance matrices, in a penalized maximum likelihood estimation framework. In particular, we establish non-asymptotic risk bounds that take the form of weak oracle inequalities, provided that lower bounds for the penalties hold. The good empirical behavior of our models is then demonstrated on synthetic and real datasets.
arXiv commentTo appear, Electronic Journal of Statistics, 2022
References in corpus (7)
- Approximation by finite mixtures of continuous density functions that vanish at infinity
- High-Dimensional Regression with Gaussian Mixtures and Partially-Latent Response Variables
- Approximation of conditional densities by smooth mixtures of regressions
- Minimal penalties and the slope heuristics: a survey
- Conditional Density Estimation by Penalized Likelihood Model Selection and Applications
- Convergence Rates for Gaussian Mixtures of Experts
- Prediction regions through Inverse Regression