过度拟合
计算机科学
背景(考古学)
约束(计算机辅助设计)
选择(遗传算法)
整数规划
人工智能
线性规划
收缩率
整数(计算机科学)
机器学习
大数据
选型
算法
数据挖掘
模式识别(心理学)
数学
人工神经网络
几何学
古生物学
生物
程序设计语言
作者
Rahul Mazumder,Peter Radchenko,Antoine Dedieu
出处
期刊:Operations Research
[Institute for Operations Research and the Management Sciences]
日期:2023-01-01
卷期号:71 (1): 129-147
被引量:36
标识
DOI:10.1287/opre.2022.2276
摘要
Learning Compact High-Dimensional Models in Noisy Environments Building compact, interpretable statistical models where the output depends upon a small number of input features is a well-known problem in modern analytics applications. A fundamental tool used in this context is the prominent best subset selection (BSS) procedure, which seeks to obtain the best linear fit to data subject to a constraint on the number of nonzero features. Whereas the BSS procedure works exceptionally well in some regimes, it performs pretty poorly in out-of-sample predictive performance when the underlying data are noisy, which is quite common in practice. In this paper, we explore this relatively less-understood overfitting behavior of BSS in low-signal noisy environments and propose alternatives that appear to mitigate such shortcomings. We study the theoretical statistical properties of our proposed regularized BSS procedure and show promising computational results on various data sets, using tools from integer programming and first-order methods.
科研通智能强力驱动
Strongly Powered by AbleSci AI