arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2109.10937cs.SImath.PRstat.ML
收藏

过采样网络级联的时间尺度估计:理论、算法与实验

Temporal Scale Estimation for Oversampled Network Cascades: Theory, Algorithms, and Experiment

Abram Magner, Carolyn Kaminski, Petko Bogdanov

摘要:

从在线社交网络的研究到病毒式营销,再到流行病学,图表上的传播过程出现在许多应用领域。已经提出了各种离散时间概率模型的传播过程。这些用于下游统计估计和预测问题,通常涉及与过程引起的感染一起传输的消息或其他信息。因此,重要的是要设计级联观测模型,考虑到在任何给定时间导致工艺状态不确定性的现象。我们强调这样一个现象-时间失真-所造成的不一致的速率之间的观察级联过程中,并在该过程本身的操作速度,并认为,未能纠正它的结果在下游统计任务的性能下降。为了解决这些问题,我们制定的自然失真措施方面的时钟估计问题。我们给出了一个时钟估计算法,我们称之为FastClock,运行在线性时间的大小,其输入和可证明的统计准确的广泛的模型参数时,级联是从独立的级联过程中产生的已知参数,当底层图形是Erdens-Rényi。我们进一步给出经验的结果,我们的算法的性能相比,最先进的估计,通过动态规划实现的似然代理最大化为基础的估计。我们发现,在一个广泛的参数制度,我们的算法大大优于动态规划算法的运行时间和精度。

英文摘要:

Spreading processes on graphs arise in a host of application domains, from the study of online social networks to viral marketing to epidemiology. Various discrete-time probabilistic models for spreading processes have been proposed. These are used for downstream statistical estimation and prediction problems, often involving messages or other information that is transmitted along with infections caused by the process. It is thus important to design models of cascade observation that take into account phenomena that lead to uncertainty about the process state at any given time. We highlight one such phenomenon -- temporal distortion -- caused by a misalignment between the rate at which observations of a cascade process are made and the rate at which the process itself operates, and argue that failure to correct for it results in degradation of performance on downstream statistical tasks. To address these issues, we formulate the clock estimation problem in terms of a natural distortion measure. We give a clock estimation algorithm, which we call FastClock, that runs in linear time in the size of its input and is provably statistically accurate for a broad range of model parameters when cascades are generated from the independent cascade process with known parameters and when the underlying graph is Erdős-Rényi. We further give empirical results on the performance of our algorithm in comparison to the state of the art estimator, a likelihood proxy maximization-based estimator implemented via dynamic programming. We find that, in a broad parameter regime, our algorithm substantially outperforms the dynamic programming algorithm in terms of both running time and accuracy.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑