arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2202.12348cs.LGcs.AIstat.ML
收藏

图的贝叶斯深度学习

Bayesian Deep Learning for Graphs

University of Pisa(比萨大学)

Federico Errica

摘要:

结构化数据的自适应处理是机器学习中的一个长期研究课题,其研究如何自动学习从结构化输入到各种性质的输出的映射。近年来,人们对图形的自适应处理越来越感兴趣,这导致了不同的基于神经网络的方法的发展。在这篇论文中,我们采取了不同的路线,开发了一个用于图学习的贝叶斯深度学习框架。本文首先回顾了该领域中大多数方法的原理,然后研究了图分类的可重复性问题。然后,我们继续通过以增量方式构建我们的深度架构,将图的深度学习的基本思想与贝叶斯世界联系起来。这个框架允许我们考虑具有离散和连续边缘特征的图,产生足够丰富的无监督嵌入,以达到几个分类任务的最新水平。我们的方法也服从贝叶斯非参数扩展,自动化几乎所有模型的超参数的选择。两个真实世界的应用程序展示了深度学习对图形的有效性。第一个问题是用监督神经模型预测分子模拟的信息理论量。之后,我们利用我们的贝叶斯模型来解决恶意软件分类任务,同时对过程内代码混淆技术具有鲁棒性。最后,我们试图将神经和贝叶斯世界中最好的融合在一起。由此产生的混合模型是能够预测多峰分布的输入图的条件下,随之而来的能力,建模的随机性和不确定性比大多数作品。总的来说,我们的目标是为图的深度学习的研究领域提供贝叶斯视角。

英文摘要:

The adaptive processing of structured data is a long-standing research topic in machine learning that investigates how to automatically learn a mapping from a structured input to outputs of various nature. Recently, there has been an increasing interest in the adaptive processing of graphs, which led to the development of different neural network-based methodologies. In this thesis, we take a different route and develop a Bayesian Deep Learning framework for graph learning. The dissertation begins with a review of the principles over which most of the methods in the field are built, followed by a study on graph classification reproducibility issues. We then proceed to bridge the basic ideas of deep learning for graphs with the Bayesian world, by building our deep architectures in an incremental fashion. This framework allows us to consider graphs with discrete and continuous edge features, producing unsupervised embeddings rich enough to reach the state of the art on several classification tasks. Our approach is also amenable to a Bayesian nonparametric extension that automatizes the choice of almost all model's hyper-parameters. Two real-world applications demonstrate the efficacy of deep learning for graphs. The first concerns the prediction of information-theoretic quantities for molecular simulations with supervised neural models. After that, we exploit our Bayesian models to solve a malware-classification task while being robust to intra-procedural code obfuscation techniques. We conclude the dissertation with an attempt to blend the best of the neural and Bayesian worlds together. The resulting hybrid model is able to predict multimodal distributions conditioned on input graphs, with the consequent ability to model stochasticity and uncertainty better than most works. Overall, we aim to provide a Bayesian perspective into the articulated research field of deep learning for graphs.

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

↑