跳到正文
← 返回论文列表与筛选
阅读说明

本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。

DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。

引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。

关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究一般混合模型的效应选择,簇结构本身不足以确定其属于面板数据计量方法。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

正在核对对应版本的资源…

关注这篇论文的作者
Francis K. C. Hui
Samuel Müller
A. H. Welsh

利用正则化 PQL 联合选择混合模型效应

研究问题
广义线性混合模型的边际似然难以计算时,如何高效地联合选择固定效应与随机效应,并建立选择一致性?
方法与思路
作者将惩罚拟似然估计与稀疏惩罚结合,对随机效应使用组惩罚以整体剔除,并提出选择单一调参参数的信息准则。
材料陈述的贡献
摘要称,当簇规模随簇数量增长时,方法及其信息准则具有选择一致性;模拟还展示小簇情形下的选择与计算表现。
阅读关注点
应核对簇规模增长条件、组惩罚构造和信息准则的理论要求,并区分小簇模拟表现与选择一致性定理的适用情形。
阅读边界
仅据版本未注明的 OpenAlex 索引摘要;完整正则条件与模拟数值未说明,不能将一致性结论直接推广到固定簇规模。

原文摘要

The application of generalized linear mixed models presents some major challenges for both estimation, due to the intractable marginal likelihood, and model selection, as we usually want to jointly select over both fixed and random effects. We propose to overcome these challenges by combining penalized quasi-likelihood (PQL) estimation with sparsity inducing penalties on the fixed and random coefficients. The resulting approach, referred to as regularized PQL, is a computationally efficient method for performing joint selection in mixed models. A key aspect of regularized PQL involves the use of a group based penalty for the random effects: sparsity is induced such that all the coefficients for a random effect are shrunk to zero simultaneously, which in turn leads to the random effect being removed from the model. Despite being a quasi-likelihood approach, we show that regularized PQL is selection consistent, that is, it asymptotically selects the true set of fixed and random effects, in the setting where the cluster size grows with the number of clusters. Furthermore, we propose an information criterion for choosing the single tuning parameter and show that it facilitates selection consistency. Simulations demonstrate regularized PQL outperforms several currently employed methods for joint selection even if the cluster size is small compared to the number of clusters, while also offering dramatic reductions in computation time. Supplementary materials for this article are available online.

笔记与分组
相关领域论文