arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2506.09286cs.LGcs.AIstat.APstat.ME
收藏

基于回答集编程的神经影像因果图恢复

Causal Graph Recovery in Neuroimaging through Answer Set Programming

Georgia Institute of Technology(佐治亚理工学院);Georgia State University(佐治亚州立大学);Center for Translational Research in Neuroimaging and Data Science (TReNDS)(神经影像与数据科学转化研究中心);University of California San Diego(加州大学圣地亚哥分校)

Mohammadsajad Abavisani, Kseniya Solovyeva, David Danks, Vince Calhoun, Sergey Plis

AI总结:

针对子采样时间序列因果图恢复难题,提出基于回答集编程的方法,纳入子采样影响并结合图论剪枝,在模拟和脑连接数据上取得SOTA,叠加现有方法可平均提升F1分数12%且鲁棒性更强。

摘要:

从时间序列数据中学习图形因果结构面临重大挑战,尤其是当测量频率与系统的因果时间尺度不匹配时。由于子采样(即未在整个时间过程中观测到系统的所有可能状态)导致的信息丢失,通常会产生一组等可能性的潜在因果图。本研究通过在因果图推导中纳入子采样的影响来应对这一挑战,从而获得更准确、更符合直觉的结果。我们采用约束优化方法,具体为回答集编程(answer set programming, ASP)来寻找最优答案集。ASP不仅能识别最可能的潜在图,还能提供一个可能图的等价类供专家选择。此外,使用ASP使我们能够利用图论进一步剪枝可能的解集,生成更小、更准确的答案集,且速度显著快于传统方法。我们在模拟数据和实证脑结构连接数据上验证了所提方法,并在这些实验中证明了其优于现有方法的性能。我们进一步展示了该方法如何作为元方法叠加在现有方法之上,使F1分数平均提升12%。此外,我们在从子采样时间序列数据重建因果图的精确率和召回率方面取得了当前最优结果。最后,我们的方法在真实模拟中对不同程度的子采样表现出鲁棒性,而其他方法在子采样率更高时性能会下降。

英文摘要:

Learning graphical causal structures from time series data presents significant challenges, especially when the measurement frequency does not match the causal timescale of the system. This often leads to a set of equally possible underlying causal graphs due to information loss from sub-sampling (i.e., not observing all possible states of the system throughout time). Our research addresses this challenge by incorporating the effects of sub-sampling in the derivation of causal graphs, resulting in more accurate and intuitive outcomes. We use a constraint optimization approach, specifically answer set programming (ASP), to find the optimal set of answers. ASP not only identifies the most probable underlying graph, but also provides an equivalence class of possible graphs for expert selection. In addition, using ASP allows us to leverage graph theory to further prune the set of possible solutions, yielding a smaller, more accurate answer set significantly faster than traditional approaches. We validate our approach on both simulated data and empirical structural brain connectivity, and demonstrate its superiority over established methods in these experiments. We further show how our method can be used as a meta-approach on top of established methods to obtain, on average, 12% improvement in F1 score. In addition, we achieved state of the art results in terms of precision and recall of reconstructing causal graph from sub-sampled time series data. Finally, our method shows robustness to varying degrees of sub-sampling on realistic simulations, whereas other methods perform worse for higher rates of sub-sampling.

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

↑