arXiv:2509.09482cs.DBcs.LG2025-09被引 1

用数据库视图解释关系型深度学习模型的预测依据。

Database Views as Explanations for Relational Deep Learning

  • 通过视图定义提取影响预测的关键数据片段。
  • 在多种任务上验证了解释效率与质量优于基线方法。
  • 支持细粒度控制,适合需要可解释性的数据库应用。

近年来,针对关系型数据库的深度学习模型取得显著进展,包括基于异构图神经网络(hetero-GNNs)和异构图变压器的架构。这些模型将数据库记录与关联(如外键引用)转化为复杂的数值表达式,涉及大量可学习参数,导致难以用人类可理解的方式解释模型如何利用数据做出预测。本文提出一种新框架,以数据库视图为解释手段,突出对预测贡献最大的数据部分。通过借鉴Nash、Segoufin和Vianu(2010)提出的确定性概念,构建全局反演解释。该框架可调节确定性与简洁性之间的权衡,并支持不同粒度的视图定义,如整列、表间外键、相关元组组等。我们在hetero-GNN场景下实现该框架,提出基于可学习掩码的模型特定方法。对比模型无关的启发式基线,本方法在多数情况下更高效且解释质量更高。在RelBench数据集上跨多个领域和记录级任务的广泛实验表明,该解释具有实用性且生成高效。

原文摘要 · Abstract (English)

In recent years, there has been significant progress in the development of deep learning models over relational databases, including architectures based on heterogeneous graph neural networks (hetero-GNNs) and heterogeneous graph transformers. In effect, such architectures state how the database records and links (e.g., foreign-key references) translate into a large, complex numerical expression, involving numerous learnable parameters. This complexity makes it hard to explain, in human-understandable terms, how a model uses the available data to arrive at a given prediction. We present a novel framework for explaining machine-learning models over relational databases, where explanations are view definitions that highlight focused parts of the database that mostly contribute to the model's prediction. We establish such global abductive explanations by adapting the classic notion of determinacy by Nash, Segoufin, and Vianu (2010). In addition to tuning the tradeoff between determinacy and conciseness, the framework allows controlling the level of granularity by adopting different fragments of view definitions, such as ones highlighting whole columns, foreign keys between tables, relevant groups of tuples, and so on. We investigate the realization of the framework in the case of hetero-GNNs, and develop a model-specific approach via the notion of learnable masks. For comparison, we propose model-agnostic heuristic baselines and show that our approach is both more efficient and achieves better explanation quality in most cases. Our extensive empirical evaluation on the RelBench collection across diverse domains and record-level tasks demonstrates both the usefulness of our explanations and the efficiency of their generation.

可解释性数据库图神经网络

Thank you to arXiv for use of its open access interoperability. PaperDance 不是 arXiv 官方产品;中文卡片由大模型生成,请以原文为准。