In a communication network, point-to-point traffic volumes over time are critical for designing protocols that route information efficiently and for maintaining security, whether at the scale of an internet service provider or within a corporation. While technically feasible, the direct measurement of point-to-point traffic imposes a heavy burden on network performance and is typically not implemented. Instead, indirect aggregate traffic volumes are routinely collected. We consider the problem of estimating point-to-point traffic volumes, x_t, from aggregate traffic volumes, y_t, given information about the network routing protocol encoded in a matrix A. This estimation task can be reformulated as finding the solutions to a sequence of ill-posed linear inverse problems, y_t = A x_t, since the number of origin-destination routes of interest is higher than the number of aggregate measurements available.
Here, we introduce a novel multilevel state-space model of aggregate traffic volumes with realistic features. We implement a naive strategy for estimating unobserved point-to-point traffic volumes from indirect measurements of aggregate traffic, based on particle filtering. We then develop a more efficient two-stage inference strategy that relies on model-based regularization: a simple model is used to calibrate regularization parameters that lead to efficient and scalable inference in the multilevel state-space model. We apply our methods to corporate and academic networks, where we show that the proposed inference strategy outperforms existing approaches and scales to larger networks. We also design a simulation study to explore the factors that influence the performance. Our results suggest that model-based regularization may be an efficient strategy for inference in other complex multilevel models.
Estimating marginal treatment effects from observational studies and indirect treatment comparisons: When are standardization-based methods preferable to those based on propensity score weighting?
On estimating the size of overcoverage with the latent class model. A critique of the paper "Population Size Estimation Using Multiple Incomplete Lists with Overcoverage" by di Cecco, di Zio, Filipponi and Rocchetti (2018, JOS 34 557-572)
A Bayesian Multiscale Integrated Abundance Model for Estimating Latent Opioid Misuse Prevalence from Spatially Misaligned Data
Wake Forest University(维克森林大学);Wake Forest University School of Medicine(维克森林大学医学院);Yale School of Public Health(耶鲁公共卫生学院);Gillings School of Public Health, University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校吉林斯公共卫生学院);Rollins School of Public Health, Emory University(埃默里大学罗林斯公共卫生学院)
Identifying and Estimating Causal Direct Effects Under Unmeasured Confounding
McGill University(麦吉尔大学);Research Institute of the McGill University Health Centre(麦吉尔大学健康中心研究所);Harvard T.H. Chan School of Public Health(哈佛大学陈曾熙公共卫生学院);University of North Carolina at Chapel Hill(北卡罗来纳大学教堂山分校);Fred Hutchinson Cancer Center(弗雷德·哈钦森癌症中心);University of California, Berkeley(加州大学伯克利分校)
Estimating Fisher Information Matrix in Latent Variable Models based on the Score Function
费舍尔信息矩阵(Fisher information matrix)是统计学中的一个关键量,因为它需要例如用于评估参数估计的渐近精度、用于计算统计检验中的检验统计量或渐近分布、用于评估后模型选择推断结果或试验设计中的最优性标准。然而,它的精确计算往往不是微不足道的。特别是在许多潜变量模型中,由于存在不可观测变量,它是复杂的。因此,在这种情况下,通常考虑观察到的λ来估计λ。已经提出了几种方法来近似观察到的不稳定性时,它不能被评估分析。其中最常用的方法是蒙特卡罗方法或迭代算法来自缺失信息的原则。所有这些方法都需要计算完整数据对数似然的二阶导数,从计算的角度来看,这导致了一些缺点。本文提出了一种新的方法来估计潜变量模型中的风险。我们的方法的优点是,只有一阶导数的对数似然是必要的,相反,其他方法的基础上所观察到的平均值。实际上,我们考虑分数的协方差阵的经验估计。我们证明了这种费舍尔信息矩阵的估计是无偏的,一致的和渐近高斯的。此外,我们强调,这两个估计是不是比其他的渐近协方差阵。当所提出的估计不能直接解析地估计时,我们提出了一种计算它的随机逼近估计算法,该算法将该估计作为参数估计的副产品。我们强调,所提出的算法只需要计算完整的数据对数似然相对于参数的一阶导数。我们证明了估计算法是一致的,渐近高斯迭代次数趋于无穷大时。我们评估有限的样本量属性的估计和观察到的估计通过模拟研究线性混合效应模型和混…
Generalized Independent Noise Condition for Estimating Causal Structure with Latent Variables
Beijing Technology and Business University(北京工商大学);University of California San Diego(加利福尼亚大学圣迭戈分校);Guangdong University of Technology(广东工业大学);Mohamed bin Zayed University of Artificial Intelligence(穆罕默德·本·扎耶德人工智能大学);Carnegie Mellon University(卡内基梅隆大学)
Estimating Graph Dimension with Cross-validated Eigenvalues
Department of Statistics, University of Wisconsin–Madison(统计学系,威斯康星大学麦迪逊分校);Department of Mathematics, University of Wisconsin–Madison(数学系,威斯康星大学麦迪逊分校)