arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2211.01689stat.MLcs.LG
收藏

有限图空间上的迷向高斯过程

Isotropic Gaussian Processes on Finite Spaces of Graphs

ETH Zürich(苏黎世联邦理工学院);IBM Research Zürich(IBM苏黎世研究院)

Viacheslav Borovitskiy, Mohammad Reza Karimi, Vignesh Ram Somnath, Andreas Krause

摘要:

我们提出了一个原则性的方法来定义高斯过程先验的各种集的无权图:有向或无向,有或无回路。我们赋予这些集的每一个几何结构,诱导的概念,密切和对称性,通过把它们变成一个适当的元顶点集。在此基础上,我们描述了一类先验,尊重这种结构,类似于欧几里得各向同性过程,如平方指数或Matérn。我们提出了一种有效的计算技术,表面上难以处理的问题,评估这些先验的内核,使这种高斯过程中常用的工具箱和下游应用程序。我们进一步考虑未加权图的等价类集,并定义相应版本的先验。我们证明了一个硬度的结果,表明在这种情况下,准确的内核计算不能有效地进行。然而,我们提出了一个简单的蒙特卡罗近似处理中等规模的情况下。受化学应用的启发,我们说明了所提出的技术在一个真正的分子性质预测任务的小数据制度。

英文摘要:

We propose a principled way to define Gaussian process priors on various sets of unweighted graphs: directed or undirected, with or without loops. We endow each of these sets with a geometric structure, inducing the notions of closeness and symmetries, by turning them into a vertex set of an appropriate metagraph. Building on this, we describe the class of priors that respect this structure and are analogous to the Euclidean isotropic processes, like squared exponential or Matérn. We propose an efficient computational technique for the ostensibly intractable problem of evaluating these priors' kernels, making such Gaussian processes usable within the usual toolboxes and downstream applications. We go further to consider sets of equivalence classes of unweighted graphs and define the appropriate versions of priors thereon. We prove a hardness result, showing that in this case, exact kernel computation cannot be performed efficiently. However, we propose a simple Monte Carlo approximation for handling moderately sized cases. Inspired by applications in chemistry, we illustrate the proposed techniques on a real molecular property prediction task in the small data regime.

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

↑