Estimating statistical models within sensor networks requires distributed algorithms, in which both data and computation are distributed across the nodes of the network. We propose a general approach for distributed learning based on combining local estimators defined by pseudo-likelihood components, encompassing a number of combination methods, and provide both theoretical and experimental analysis. We show that simple linear combination or max-voting methods, when combined with second-order information, are statistically competitive with more advanced and costly joint optimization. Our algorithms have many attractive properties including low communication and computational cost and "any-time" behavior.
Harvard University(哈佛大学);Institute for Interdisciplinary Information Sciences, Tsinghua University(清华大学交叉信息研究院);School of Mathematics and Statistics, Fuzhou University(福州大学数学与统计学院);Microsoft Research(微软研究院)
German Research Center for AI (DFKI)(德国人工智能研究中心);Centre for Cognitive Science(认知科学中心);Technical University of Darmstadt(达姆施塔特工业大学);Bosch Center for Artificial Intelligence(博世人工智能中心)
Pseudo-likelihood produces associative memories able to generalize, even for asymmetric couplings
Physics Department, Sapienza University of Rome(罗马大学物理系);Institute of Nanotechnology, National Research Council of Italy, CNR-NANOTEC, Rome Unit(意大利国家研究委员会纳米技术研究所,CNR-NANOTEC,罗马分部)
Due to the intractable partition function, the exact likelihood function for a Markov random field (MRF), in many situations, can only be approximated. Major approximation approaches include pseudolikelihood and Laplace approximation. In this paper, we propose a novel way of approximating the likelihood function through first approximating the marginal likelihood functions of individual parameters and then reconstructing the joint likelihood function from these marginal likelihood functions. For approximating the marginal likelihood functions, we derive a particular likelihood function from a …
StepMix: A Python Package for Pseudo-Likelihood Estimation of Generalized Mixture Models with External Variables
Université de Montréal(蒙特利尔大学);Mila - Quebec AI Institute(米拉-魁北克人工智能研究所);Massachusetts Institute of Technology(麻省理工学院);Leiden University(莱顿大学);Institut universitaire en santé mentale de Montréal(蒙特利尔大学精神卫生大学研究所)
本文介绍开源 Python 包 StepMix,它在统一 EM 框架下实现带协变量与远端结局的广义混合模型的一步、两步及偏差校正三步伪似然估计,并兼容 scikit-learn 与 R。
Can tumor location on pre-treatment MRI predict likelihood of pseudo-progression versus tumor recurrence in Glioblastoma? A feasibility study
Case Western Reserve University(凯斯西储大学);Cleveland Clinic(克利夫兰诊所)
胶质母细胞瘤(GBM)管理中的一个重大挑战是在常规治疗后的常规成像中识别肿瘤复发的假进展(PsP),这是一种良性辐射诱导效应。先前的研究已经将肿瘤叶的存在和偏侧性与GBM结果联系起来,表明GBM中的疾病病因和进展可能受到肿瘤位置的影响。因此,在这项可行性研究中,我们试图研究以下问题:初治MRI上的肿瘤位置是否可以提供有关患者发生假性进展与肿瘤复发可能性的早期线索?在这项研究中,分析了74例治疗前胶质母细胞瘤MRI扫描,其中PsP(33例)和肿瘤复发(41例)。首先,Gd-T1 w MRI增强病灶和T2 w/FLAIR病灶周围高信号由专家分割,然后配准到脑图谱。使用来自两种表型的患者,我们通过量化增强病变和病变周围高信号的发生频率,通过对整个人群的体素强度进行平均来构建两个图谱。然后进行差异参与分析,以计算各图谱之间的体素显着差异(p值<0.05)。最后将统计学上显著的聚类映射到结构图谱中,以提供其位置的解剖定位。我们的研究结果表明,肿瘤复发的患者表现出突出的顶叶的初始肿瘤,而PsP患者表现出多灶性分布的初始肿瘤在额叶和颞叶,颞叶和壳核。这些初步结果表明,治疗前病变向大脑某些解剖区域的偏侧化可以提供有关评估MRI扫描上肿瘤复发发生假性进展的可能性的早期线索。