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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要研究生物基因图估计与公平学习,未涉及经济网络行为或处理干扰,所列细分证据不足。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Xingcai Zhou
Zinan Xu
Bei Jiang
Linglong Kong

公平性感知的高斯图回归及脑共表达QTL研究应用

研究问题
在脑肿瘤基因共表达研究中,如何估计遗传变异对个体基因网络的关联,同时兼顾群体间图差异、公平性和统计推断?
方法与思路
作者定义成对图差异风险,结合跨任务与任务内稀疏惩罚及公平正则化,设计多任务学习、投影去偏推断和非光滑多目标优化。
材料陈述的贡献
摘要称建立非渐近收敛率、去偏估计量渐近正态性及算法Pareto最优性,并以模拟和脑共表达QTL数据展示公平性与有效性。
阅读关注点
应核对公平风险的定义及群体划分、稀疏与公平目标的权衡、依赖条件,以及去偏推断和Pareto最优性各自针对的对象。
阅读边界
仅据所给OpenAlex摘要版本,不能推断后续刊本变化。摘要中的公平性依赖其特定指标,不能推广为消除所有偏差或证明遗传因果作用。

原文摘要

Glioblastoma multiforme (GBM) is a highly aggressive brain cancer with largely ineffective treatment. It is imperative to explore more effective therapies, such as gene-based treatments. For co-expression QTL studies of GBM, we develop fairness-aware Gaussian graphical regression models (Fair RegGGMs), which can determine how genetic variants modulate subject-level gene networks, and recover both population-level and subject-level gene graphs, while ensuring that the developed learning and inference neither propagate biases nor amplify disparities. We introduce pairwise graph disparity risk to quantify fairness and propose fairness-aware multi-task learning (Fair-MTL) via a cross-task group sparsity penalty, within-task element-wise sparsity penalty, and pairwise fairness regularization. We also develop a projected Fair-SAGE debiasing method for statistical inference. In Fair-MTL, we strive for a balance among group-/element-wise sparsity of graphical network structures, fairness across different subgroups, and statistical effectiveness of RegGGMs. For the ultrahigh-dimensional overparameterized models, an efficient nonsmooth fair multi-objective optimization algorithm (Fair-MOO) is developed. Both Fair-MOO and the projected Fair-SAGE dramatically reduce computational costs. Under a general dependence structure, the nonasymptotic l2 convergence rate of Fair-MTL, asymptotic normality of Fair-SAGE debiased estimator, and Pareto optimality of Fair-MOO algorithm are established. The simulation study and brain co-expression QTL analysis confirm the fairness and effectiveness of our Fair RegGGMs and provide valuable insights for the gene graph of GBM.

笔记与分组