结构化数据的功能透明性:一种博弈论方法
Functional Transparency for Structured Data: a Game-Theoretic Approach
摘要:
我们提供了一种新的方法来训练神经模型,以一种定义明确的功能性方式展现透明度。我们的方法自然地在结构化数据上运行,并在功能上针对选定的(本地)证人家庭定制预测器。估计问题被设置为一个合作的游戏之间的一个不受限制的预测器,如神经网络,和一组证人从所需的透明的家庭。见证者的目标是在局部突出预测器与所选函数族的一致性,而预测器经过训练以最小化突出的差异。我们强调,预测仍然是全球强大的,因为它只鼓励同意当地适应证人。我们分析了所提出的方法的效果,在深度图和序列模型的背景下提供了示例配方,并以经验的方式说明了化学性质预测,时间建模和分子表示学习的想法。
英文摘要:
We provide a new approach to training neural models to exhibit transparency in a well-defined, functional manner. Our approach naturally operates over structured data and tailors the predictor, functionally, towards a chosen family of (local) witnesses. The estimation problem is setup as a co-operative game between an unrestricted predictor such as a neural network, and a set of witnesses chosen from the desired transparent family. The goal of the witnesses is to highlight, locally, how well the predictor conforms to the chosen family of functions, while the predictor is trained to minimize the highlighted discrepancy. We emphasize that the predictor remains globally powerful as it is only encouraged to agree locally with locally adapted witnesses. We analyze the effect of the proposed approach, provide example formulations in the context of deep graph and sequence models, and empirically illustrate the idea in chemical property prediction, temporal modeling, and molecule representation learning.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。