Mallows-type model averaging: Non-asymptotic analysis and all-subset combination
Jingfu Peng

TL;DR
This paper develops a non-asymptotic analysis of Mallows-type model averaging, introducing a new dimension-adaptive criterion for optimal all-subset combination, and demonstrates improved risk bounds and practical effectiveness.
Contribution
It provides the first non-asymptotic oracle inequalities for Mallows-type model averaging and proposes a novel dimension-adaptive criterion for optimal all-subset model combination.
Findings
Oracle inequalities with faster excess risk bounds.
Existence of a fundamental limit for all-subset MA risk.
Numerical experiments confirm theoretical advantages.
Abstract
Model averaging (MA) and ensembling play a crucial role in statistical and machine learning practice. When multiple candidate models are considered, MA techniques can be used to weight and combine them, often resulting in improved predictive accuracy and better estimation stability compared to model selection (MS) methods. In this paper, we address two challenges in combining least squares estimators from both theoretical and practical perspectives. We first establish several oracle inequalities for least squares MA via minimizing a Mallows' criterion under an arbitrary candidate model set. Compared to existing studies, these oracle inequalities yield faster excess risk and directly imply the asymptotic optimality of the resulting MA estimators under milder conditions. Moreover, we consider candidate model construction and investigate the problem of optimal all-subset combination…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsStochastic processes and financial applications · Risk and Portfolio Optimization · Financial Risk and Volatility Modeling
