Privacy-Preserving Transfer Learning for Community Detection using Locally Distributed Multiple Networks
本地分布式多网络社区检测的隐私保护迁移学习AI 解读 ↓
本页整理公开书目信息,不生成学术质量评分。AI 解读根据题名及所注明的摘要或原文片段生成,未完成全文核验,可能有误;具体假设、证明与结论请核对原文。摘要保留来源文本,未经模型改写。
DOI 首次登记不等于接收或发表日期。部分更正、评论等条目没有独立摘要;缺少可靠材料时保留待补状态。
引用量采用 OpenAlex 单条关联记录,不合计多个记录;关联记录可能包含正式发表版本,不等于此版本单独引用。缺失不视为零,引用指标不代表论文质量。
关注作者按书目中的完整姓名匹配,同名和姓名变体需人工辨别。相关论文先按共享细分方向和具体方法排列,再参考通用方法与发表日期。
AI 根据所提供的论文材料归类:摘要直接研究多网络的社区结构及社区检测,支持网络方向分类,但未讨论经济行为或因果干扰。
本地分布式多网络社区检测的隐私保护迁移学习AI 解读 ↓
正在核对关联版本…
正在核对对应版本的资源…
Modern applications increasingly involve highly sensitive network data, where raw edges cannot be shared due to privacy constraints. We propose \texttt{TransNet}, a new spectral clustering-based transfer learning framework that improves community detection on a \emph{target network} by leveraging heterogeneous, locally stored, and privacy-preserved auxiliary \emph{source networks}. Our focus is the \textit{local differential privacy} regime, in which each local data provider perturbs edges via \textit{randomized response} before release, requiring no trusted third party. \texttt{TransNet} aggregates source eigenspaces through a novel adaptive weighting scheme that accounts for both privacy and heterogeneity, and then regularizes the weighted source eigenspace with the target eigenspace to optimally balance the two. Theoretically, we establish an error-bound-oracle property: the estimation error for the aggregated eigenspace depends only on \textit{informative sources}, ensuring robustness when some sources are highly heterogeneous or heavily privatized. We further show that the error bound of \texttt{TransNet} is no greater than that of estimators using only the target network or only (weighted) sources. Empirically, \texttt{TransNet} delivers strong gains across a range of privacy levels and heterogeneity patterns. For completeness, we also present \texttt{TransNetX}, an extension based on Gaussian perturbation of projection matrices under the assumption that trusted local data curators are available.
双重高维线性混合模型下异质图模型的推断
Inferring the structure of population-level functional connectivity networks from multi-subject functional magnetic resonance imaging data is essential for understanding the connectivity patterns underlying cognitive and behavioral functions. Graphical models provide a formal statistical framework for inferring the graph structure. However, the multi-level nature of functional magnetic resonance imaging data---where each level corresponds, for instance, to a…
小噪声下维度发散的网络随机微分方程推断
We consider inference for network stochastic differential equations in a small-noise, high-dimensional regime, where the diffusion coefficient vanishes with $\ep\to0$ while the network size and parameter dimension may diverge. We develop a minimum-distance estimation framework based on a deterministic measurement model that may omit nuisance terms in the drift, and derive a non-asymptotic error bound decomposing the estimation error into stochastic fluctuation, nuisance…
基于大语言模型文本测量的再犯预测、同伴效应估计与预测辅助推断
We provide a new framework for estimating peer effects when outcomes are multivariate behavioral measures derived from written text using an LLM and the network formation is endogenous. We obtain LLM embeddings and zero shot classification of more than 200,000 written exchanges among residents of low-security correctional facilities. We find that LLM embeddings improve out-of-sample recidivism prediction by up to 30% over pre-entry covariates alone using LASSO and LoRA…
通过惩罚成对加速失效时间模型选择传染病传播变量
In infectious disease transmission, regression and variable selection for time-to-event outcomes are complicated by transmission-induced dependence that violates standard independence assumptions. Pairwise survival analysis addresses this dependence by modeling contact intervals in ordered pairs, defined as the time from the onset of infectiousness in the pair's first individual to their first infectious contact with the second individual. We propose a penalized pairwise…
核心—边缘网络的惩罚最大似然推断
Likelihood-based network models are often fitted under links' independence and low-order constraints, while empirical networks frequently exhibit systematic higher-order structures such as triangles and wedges, characterizing the observed clustering patterns. Real-world core-periphery networks such as the interbank market or the air transportation system represent key examples, with cores displaying complex and nonlinear features. We formalize Penalized Likelihood with…
指数随机图模型的经验贝叶斯弹性网计算
Exponential random graph models (ERGMs) describe dependence among network ties, but inference becomes difficult when the likelihood is intractable and candidate network statistics are strongly correlated. We introduce BERGM Elastic Net, an adaptive empirical-Bayes approach that combines lasso shrinkage with ridge stabilization in a Bayesian ERGM. A latent-variable formulation supports approximate exchange sampling, while empirical-Bayes updates adapt the amount of…