PulseAugur
中
实时 07:57:16
English(EN) On Minimal Observation Time for Recovering Latent Hawkes Networks

新理论定义了从事件数据映射潜在网络的最小时间

研究人员确定了从基于事件的数据中准确重建潜在网络结构所需的最小观测时间。对于具有稀疏、弱相互作用的'd'个实体霍克斯过程,与log(d)成比例的观测时间既是充分的也是必要的。该研究提出了一种涉及数据筛选和最小二乘精化的两阶段估计方法来确定上限,并采用Fano不等式和Jacod的Girsanov公式来确定下限。 AI

影响 为理解复杂系统动力学提供了理论基础,可能影响分析基于事件数据的AI模型。

排序理由 学术论文,详细介绍了网络推断的理论结果。[lever_c_demoted from research: ic=1 ai=0.7]

在 arXiv cs.LG 阅读 →

AI 生成摘要 · Google Gemini · 来自 1 个来源。 我们如何撰写摘要 →

新理论定义了从事件数据映射潜在网络的最小时间

本文如何被排名

Signal score
18 / 100
Composite score across the factors below. Higher = stronger signal that this story matters right now.
Newsworthiness bucket
Tool
学术论文,详细介绍了网络推断的理论结果。[lever_c_demoted from research: ic=1 ai=0.7]
Source corroboration
Single-source cluster
Only one publisher covered this so far. Single-source stories can still rank when the publisher is high-authority, but they lack cross-source corroboration.
Topics
paper, other
Editorial topic classification. Feeds into how the story surfaces on /topic/<slug> hub pages and into the per-entity coverage mix.
AI-industry relevance
High
Clearly on-topic for AI-industry coverage.
Story freshness
Breaking (< 6h)
Fresh story with cross-source coverage still developing. Ranking may shift as more sources report.

完整方法见我们的编辑标准。

报道来源 [1]

  1. arXiv cs.LG TIER_1 English(EN) · Jonas Linkerh\"agner, Michele Bortolasi, Lorenzo Baldassari, Maarten V. de Hoop, Ivan Dokmani\'c ·

    关于恢复潜在霍克斯网络的最短观测时间

    arXiv:2605.08400v2 Announce Type: replace-cross Abstract: Dynamics of interacting systems in engineering, society, and nature often evolve over latent networks that govern which entities can interact. We study the problem of inferring these networks from event-based observations,…