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

广义线性模型中的不情愿交互建模

Reluctant Interaction Modeling in Generalized Linear Models

Hai Lu, Guo Yu

AI总结:

本文提出广义线性模型中无需层级假设的交互建模框架,将不情愿交互选择原则扩展到GLMs,方法易实现且可扩展,并证明其在高维下具有筛选相合性,数值实验显示在显著降低计算成本的同时保持了统计性能。

摘要:

虽然在回归模型中纳入成对交互作用可以更好地近似响应曲面,但拟合这样的交互模型是一个众所周知的难题。特别是,分析当代高维数据集往往会导致超大规模的交互建模问题,其中的挑战在于从数百万甚至数十亿个候选交互中识别出重要的交互。尽管最近提出了若干方法来解决这一挑战,但它们大多是通过(1)假设重要交互之间满足层级假设,和(或)(2)聚焦于带交互的线性模型且误差为(次)高斯的情形来设计的。然而在实践中,这两个构建基础中的任何一个都不一定成立。本文提出了一个广义线性模型(GLMs)中的交互建模框架,该框架不依赖任何层级假设。我们将不情愿交互选择原则非平凡地扩展到GLMs设定中,即在其他条件相同的情况下,主效应优先于交互效应。我们提出的方法易于实现,并且对大规模数据集具有高度可扩展性。理论上,我们证明了它在高维设定下具有筛选相合性。基于模拟数据集和一个真实数据集的数值研究表明,所提出的方法在获得显著计算收益的同时,并未牺牲统计性能。

英文摘要:

While including pairwise interactions in a regression model can better approximate response surface, fitting such an interaction model is a well-known difficult problem. In particular, analyzing contemporary high-dimensional datasets often leads to extremely large-scale interaction modeling problem, where the challenge is posed to identify important interactions among millions or even billions of candidate interactions. While several methods have recently been proposed to tackle this challenge, they are mostly designed by (1) assuming the hierarchy assumption among the important interactions and (or) (2) focusing on the case in linear models with interactions and (sub)Gaussian errors. In practice, however, neither of these two building blocks has to hold. In this paper, we propose an interaction modeling framework in generalized linear models (GLMs) which is free of any assumptions on hierarchy. We develop a non-trivial extension of the reluctance interaction selection principle to the GLMs setting, where a main effect is preferred over an interaction if all else is equal. Our proposed method is easy to implement, and is highly scalable to large-scale datasets. Theoretically, we demonstrate that it possesses screening consistency under high-dimensional setting. Numerical studies on simulated datasets and a real dataset show that the proposed method does not sacrifice statistical performance in the presence of significant computational gain.

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

↑