arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2302.03157stat.MEmath.OCstat.ML
收藏

聚类与纵向数据分层建模的无分布混合整数优化方法

A distribution-free mixed-integer optimization approach to hierarchical modelling of clustered and longitudinal data

Madhav Sankaranarayanan, Intekhab Hossain, Tom Chen

AI总结:

本文提出一种基于混合整数优化的聚类感知回归方法,在LMM模型中选择聚类并评估新数据点的聚类效应,显著提升了稀疏解的预测能力和模型鲁棒性。

摘要:

混合整数优化(MIO)算法的最新进展与硬件增强相结合,使得解决MIO问题的速度大幅提升。这些策略已被用于最优子集选择,特别是在给定n个观测值的线性回归中,从p个特征中选择k个特征。本文将该方法扩展至聚类感知回归,在具有每个聚类n_k个观测值的线性混合效应(LMM)模型中,选择K个聚类中的λ个。通过对多个合成和真实数据集的全面测试,我们展示了该方法能在几分钟内高效解决问题。数值实验还表明,在生成具有高预测能力的稀疏解方面,MIO方法优于基于高斯分布和拉普拉斯分布的LMM。传统LMM通常假设聚类效应与个体特征无关,而我们提出了一种创新算法来评估新数据点的聚类效应,从而增强了模型的鲁棒性和精度。该方法在学生评分和蛋白质表达中的应用进一步证明了其推断和预测的有效性。

英文摘要:

Recent advancements in Mixed Integer Optimization (MIO) algorithms, paired with hardware enhancements, have led to significant speedups in resolving MIO problems. These strategies have been utilized for optimal subset selection, specifically for choosing $k$ features out of $p$ in linear regression given $n$ observations. In this paper, we broaden this method to facilitate cluster-aware regression, where selection aims to choose $λ$ out of $K$ clusters in a linear mixed effects (LMM) model with $n_k$ observations for each cluster. Through comprehensive testing on a multitude of synthetic and real datasets, we exhibit that our method efficiently solves problems within minutes. Through numerical experiments, we also show that the MIO approach outperforms both Gaussian- and Laplace-distributed LMMs in terms of generating sparse solutions with high predictive power. Traditional LMMs typically assume that clustering effects are independent of individual features. However, we introduce an innovative algorithm that evaluates cluster effects for new data points, thereby increasing the robustness and precision of this model. The inferential and predictive efficacy of this approach is further illustrated through its application in student scoring and protein expression.

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

↑