arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1907.08414stat.MEstat.CO
收藏

不情愿交互建模

Reluctant Interaction Modeling

Guo Yu, Jacob Bien, Ryan Tibshirani

摘要:

在回归模型的预测因子之间包括成对交互可以产生更好的预测模型。然而,要在生物学和其他领域的典型数据集上拟合这种交互模型,通常需要解决具有数十亿交互的巨大变量选择问题。这些问题的规模要求计算成本低(在时间和内存方面)但仍具有良好的统计特性的方法。受这些大规模问题的影响,我们采用了一个非常简单的指导原则:如果所有其他因素都相同,那么应该优先考虑主效应而不是交互作用。这种对互动的“不情愿”,虽然让人想起了互动的等级原则,但限制性要小得多。我们设计了一个计算效率高的方法建立在这个原则,并提供理论结果表明有利的统计特性。实证结果表明,在不牺牲统计特性的情况下,显着的计算改进。例如,所提出的方法可以在单个CPU上在7小时内解决具有5倍交叉验证的100亿次交互的问题。

英文摘要:

Including pairwise interactions between the predictors of a regression model can produce better predicting models. However, to fit such interaction models on typical data sets in biology and other fields can often require solving enormous variable selection problems with billions of interactions. The scale of such problems demands methods that are computationally cheap (both in time and memory) yet still have sound statistical properties. Motivated by these large-scale problem sizes, we adopt a very simple guiding principle: One should prefer main effects over interactions if all else is equal. This "reluctance" to interactions, while reminiscent of the hierarchy principle for interactions, is much less restrictive. We design a computationally efficient method built upon this principle and provide theoretical results indicating favorable statistical properties. Empirical results show dramatic computational improvement without sacrificing statistical properties. For example, the proposed method can solve a problem with 10 billion interactions with 5-fold cross-validation in under 7 hours on a single CPU.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑