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

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

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

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

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

分类依据与纠错

AI 根据所提供的论文材料归类:摘要聚焦分布式协作学习、隐私与通信,未提供对应所列计量领域细分的直接依据。

反馈分类问题

正在核对关联版本…

代码、数据与补充材料

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

关注这篇论文的作者
Jiawei Zhang
Yuhong Yang
Jie Ding

加性效应辅助学习

研究问题
当不同学习者持有可按公开标识对齐、但变量可能不同的数据时,如何在保密要求和有限通信下改善建模表现?
方法与思路
作者提出两阶段架构:先以考虑隐私的假设检验和粗略数据筛查合作价值,再交换摘要统计量进行迭代训练。
材料陈述的贡献
摘要称,该架构在理论和数值分析中可用有限通信达到集中数据训练的理想表现,并提供合作前的数据价值筛查。
阅读关注点
应核对加性效应的模型设定、筛查检验的有效条件、隐私保护的具体含义,以及达到集中训练表现所需的通信量。
阅读边界
仅据所给 Crossref 摘要,无法判断隐私保证、理想表现的衡量标准及适用条件;不能推断其他版本的变化。

原文摘要

Abstract It is quite popular nowadays for researchers and data analysts holding different datasets to seek assistance from each other to enhance their modelling performance. We consider a scenario where different learners hold datasets with potentially distinct variables, and their observations can be aligned by a nonprivate identifier. Their collaboration faces the following difficulties: first, learners may need to keep data values or even variable names undisclosed due to, e.g. commercial interest or privacy regulations; second, there are restrictions on the number of transmission rounds between them due to e.g. communication costs. To address these challenges, we develop a two-stage assisted learning architecture for an agent, Alice, to seek assistance from another agent, Bob. In the first stage, we propose a privacy-aware hypothesis testing-based screening method for Alice to decide on the usefulness of the data from Bob, in a way that only requires Bob to transmit sketchy data. Once Alice recognizes Bob’s usefulness, Alice and Bob move to the second stage, where they jointly apply a synergistic iterative model training procedure. With limited transmissions of summary statistics, we show that Alice can achieve the oracle performance as if the training were from centralized data, both theoretically and numerically.

笔记与分组
相关领域论文