Stability and L2-penalty in Model Averaging
Model averaging has received much attention in the past two decades, which integrates available information by averaging over potential models. Although various model averaging methods have been developed, there are few literatures on the theoretical properties of model averaging from the perspective of stability, and the majority of these methods constrain model weights to a simplex. The aim of this paper is to introduce stability from statistical learning theory into model averaging. Thus, we define the stability, asymptotic empirical risk minimizer, generalization, and consistency of model averaging and study the relationship among them. Our results indicate that stability can ensure that model averaging has good generalization performance and consistency under reasonable conditions, where consistency means model averaging estimator can asymptotically minimize the mean squared prediction error. We also propose a L2-penalty model averaging method without limiting model weights and prove that it has stability and consistency. In order to reduce the impact of tuning parameter selection, we use 10-fold cross-validation to select a candidate set of tuning parameters and perform a weighted average of the estimators of model weights based on estimation errors. The Monte Carlo simulation and an illustrative application demonstrate the usefulness of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Learning TheorymodelMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Phase-Aware Wavelet-Based-Scattering Encoder-Decoder for Dense Predictions
Scattering transforms achieve Lipschitz stability and translation invariance, but dense prediction tasks require preserving spatial structure lost in global averaging. We propose Phase-Aware Scattering Encoder-Decoder, w…
Skin Lesion SegmentationImage DenoisingOn the Provable Suboptimality of Momentum SGD in Nonstationary Stochastic Optimization
In this paper, we provide a comprehensive theoretical analysis of Stochastic Gradient Descent (SGD) and its momentum variants (Polyak Heavy-Ball and Nesterov) for tracking time-varying optima under strong convexity and s…
Stochastic OptimizationA Lyapunov Drift-Plus-Penalty Method Tailored for Reinforcement Learning with Queue Stability
With the proliferation of Internet of Things (IoT) devices, the demand for addressing complex optimization challenges has intensified. The Lyapunov Drift-Plus-Penalty algorithm is a widely adopted approach for ensuring q…
reinforcement-learningReinforcement LearningReinforcement Learning (RL)Stochastic Penalty-Barrier Methods for Constrained Machine Learning
Constrained machine learning enables fairness-aware training, physics-informed neural networks, and integration of symbolic domain knowledge into statistical models. Despite its practical importance, no general method ex…
Partial Exponential Stability Analysis of Slow-fast Systems via Periodic Averaging
This paper presents some new criteria for partial exponential stability of a slow-fast nonlinear system with a fast scalar variable using periodic averaging methods. Unlike classical averaging techniques, we construct an…