Error bounds for functional approximation and estimation using mixtures of experts
From MaRDI portal
Recommendations
- A universal approximation theorem for mixture-of-experts models
- Approximations of conditional probability density functions in Lebesgue spaces via mixture of experts models
- 10.1162/1532443041424300
- Structural, Syntactic, and Statistical Pattern Recognition
- On convergence rates of mixtures of polynomial experts
- Error bounds for asymptotic expansions of scale mixtures of distributions
- Risk bounds for mixture density estimation
Cited in
(14)- Hierarchical mixtures-of-experts for exponential family regression models: Approximation and maximum likelihood estimation
- Approximations of conditional probability density functions in Lebesgue spaces via mixture of experts models
- On-line learning of a mixture-of-experts neural network
- An asymptotic analysis of some expert fusion methods
- On convergence rates of mixtures of polynomial experts
- Bias/Variance Analyses of Mixtures-of-Experts Architectures
- From elementary martingale calculus to rigorous properties of mixtures of experts
- Otimização na formação de agrupamentos em problemas de composição de especialistas
- Learning Theory
- Mixture of experts architectures for neural networks as a special case of conditional expectation formula.
- A universal approximation theorem for mixture-of-experts models
- Structural, Syntactic, and Statistical Pattern Recognition
- Uniform consistency in nonparametric mixture models
- Approximation of conditional densities by smooth mixtures of regressions
This page was built for publication: Error bounds for functional approximation and estimation using mixtures of experts
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4400320)
