论文检索

基于最近邻的效用最大化二元预测及信用评分应用AI 解读

We propose nonparametric k-nearest neighbor prediction rules under the framework of utility-maximizing binary prediction with possibly many predictors. One of these prediction rules, with an attempt to “break” the curse of dimensionality, is constructed based on the predictors selected by variable selection methods. We establish that allowing for the data-dependent selection of parameter k, these prediction rules are utility consistent under regularity assumptions. Such…

用于预测组合的 Bregman 模型平均AI 解读

We propose a unified model averaging (MA) approach for a broad class of forecasting targets. This approach is established by minimizing an asymptotic risk based on the expected Bregman divergence of a combined forecast, relative to the optimal forecast of the forecasting target, under local(-to-zero) asymptotics. It can be flexibly applied to develop effective MA methods across various forecasting contexts, including but not limited to univariate and multivariate mean…

效用最大化二元预测中的模型选择AI 解读

The maximum utility estimation proposed by Elliott and Lieli (2013) can be viewed as cost-sensitive binary classification; thus, its in-sample overfitting issue is similar to that of perceptron learning. A utility-maximizing prediction rule (UMPR) is constructed to alleviate the in-sample overfitting of the maximum utility estimation. We establish non-asymptotic upper bounds on the difference between the maximal expected utility and the generalized expected utility of the…