Anchor-MoE: A Mean-Anchored Mixture of Experts For Probabilistic Regression
On the map: Mixture-of-experts → MoE theory and gating functions
Abstract (arXiv)
Regression under uncertainty is fundamental across science and engineering. We present an Anchored Mixture of Experts (Anchor-MoE), a model that handles both probabilistic and point regression. For simplicity, we use a tuned gradient-boosting model to furnish the anchor mean; however, any off-the-shelf point regressor can serve as the anchor. The anchor prediction is projected into a latent space, where a learnable metric-window kernel scores locality and a soft router dispatches each sample to a small set of mixture-density-network experts; the experts produce a heteroscedastic correction and predictive variance. We train by minimizing negative log-likelihood, and on a disjoint calibration split fit a post-hoc linear map on predicted means to improve point accuracy. On the theory side, assuming a H"older smooth regression function of order~α and fixed Lipschitz partition-of-unity weights with bounded overlap, we show that Anchor-MoE attains the minimax-optimal L2 risk rate O!big(N-2α/(2α+d)big). In addition, the CRPS test generalization gap scales as widetildeO!Big(√(log(Mh)+P+K)/NBig); it is logarithmic in Mh and scales as the square root in P and K. Under bounded-overlap routing, K can be replaced by k, and any dependence on a latent dimension is absorbed into P. Under uniformly bounded means and variances, an analogous widetildeO!big(√(log(Mh)+P+K)/Nbig) scaling holds for the test NLL up to constants. Empirically, across standard UCI regressions, Anchor-MoE consistently matches or surpasses the strong NGBoost baseline in RMSE and NLL; on several datasets it achieves new state-of-the-art probabilistic regression results on our benchmark suite. Code is available at https://github.com/BaozhuoSU/ProbabilisticRegression.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in MoE theory and gating functions, one of 12 directions in Mixture-of-experts. Builds on 10 of its 19 references that are in the map. First posted on arXiv 22 Aug 2025.
Builds on
10 of 19 references.
References · 10
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,448
- 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
- 2017What Uncertainties Do We Need in Bayesian Deep Learning for Computer Vision?cited by 2,352
- 2015Probabilistic Backpropagation for Scalable Learning of Bayesian Neural Networkscited by 295
- 2017Concrete Dropoutcited by 227
- 2019NGBoost: Natural Gradient Boosting for Probabilistic Predictioncited by 94
- 2020Semi-Structured Distributional Regression -- Extending Structured Additive Models by Arbitrary Deep Neural Networks and Data Modalitiescited by 24
- 2021Deconditional Downscaling with Gaussian Processescited by 24
- 2021Multivariate Probabilistic Regression with Natural Gradient Boostingcited by 5
- 2024Ensembles of Probabilistic Regression Treescited by 1
Built on by
Not cited yet.
Similar, not cited
Close in wording, no citation either way
- 2024Generalization Error Analysis for Sparse Mixture-of-Experts: A Preliminary Study
- 2025Mixture of Many Zero-Compute Experts: A High-Rate Quantization Theory Perspective
- 2025Elastic MoE: Unlocking the Inference-Time Scalability of Mixture-of-Experts
- 2026Smoothing the Top-k Exposure Boundary for Sparse Mixture-of-Experts
- 2019Regularized Estimation and Feature Selection in Mixtures of Generalized Linear Experts
- 2025Mixture of Experts Provably Detect and Learn the Latent Cluster Structure in Gradient-Based Learning
- 2026Prediction-powered Inference by Mixture of Experts
- 2024Beyond Parameter Count: Implicit Bias in Soft Mixture of Experts