Learning to learn graph topologies

Learning a graph topology to reveal the underlying relationship between data entities plays an important role in various machine learning and data analysis tasks. Under the assumption that structured data vary smoothly over a graph, the problem can be formulated as a regularised convex optimisation...

Full description

Bibliographic Details
Main Authors: Pu, X, Cao, T, Zhang, X, Dong, X, Chen, S
Format: Conference item
Language:English
Published: Neural Information Processing Systems Foundation 2021
_version_ 1797110919998734336
author Pu, X
Cao, T
Zhang, X
Dong, X
Chen, S
author_facet Pu, X
Cao, T
Zhang, X
Dong, X
Chen, S
author_sort Pu, X
collection OXFORD
description Learning a graph topology to reveal the underlying relationship between data entities plays an important role in various machine learning and data analysis tasks. Under the assumption that structured data vary smoothly over a graph, the problem can be formulated as a regularised convex optimisation over a positive semidefinite cone and solved by iterative algorithms. Classic methods require an explicit convex function to reflect generic topological priors, e.g. the ℓ1 penalty for enforcing sparsity, which limits the flexibility and expressiveness in learning rich topological structures. We propose to learn a mapping from node data to the graph structure based on the idea of learning to optimise (L2O). Specifically, our model first unrolls an iterative primal-dual splitting algorithm into a neural network. The key structural proximal projection is replaced with a variational autoencoder that refines the estimated graph with enhanced topological properties. The model is trained in an end-to-end fashion with pairs of node data and graph samples. Experiments on both synthetic and real-world data demonstrate that our model is more efficient than classic iterative algorithms in learning a graph with specific topological properties.
first_indexed 2024-03-07T08:01:30Z
format Conference item
id oxford-uuid:0e5dcc5a-7e69-4713-abda-4735668408ce
institution University of Oxford
language English
last_indexed 2024-03-07T08:01:30Z
publishDate 2021
publisher Neural Information Processing Systems Foundation
record_format dspace
spelling oxford-uuid:0e5dcc5a-7e69-4713-abda-4735668408ce2023-10-11T11:49:52ZLearning to learn graph topologiesConference itemhttp://purl.org/coar/resource_type/c_5794uuid:0e5dcc5a-7e69-4713-abda-4735668408ceEnglishSymplectic ElementsNeural Information Processing Systems Foundation2021Pu, XCao, TZhang, XDong, XChen, SLearning a graph topology to reveal the underlying relationship between data entities plays an important role in various machine learning and data analysis tasks. Under the assumption that structured data vary smoothly over a graph, the problem can be formulated as a regularised convex optimisation over a positive semidefinite cone and solved by iterative algorithms. Classic methods require an explicit convex function to reflect generic topological priors, e.g. the ℓ1 penalty for enforcing sparsity, which limits the flexibility and expressiveness in learning rich topological structures. We propose to learn a mapping from node data to the graph structure based on the idea of learning to optimise (L2O). Specifically, our model first unrolls an iterative primal-dual splitting algorithm into a neural network. The key structural proximal projection is replaced with a variational autoencoder that refines the estimated graph with enhanced topological properties. The model is trained in an end-to-end fashion with pairs of node data and graph samples. Experiments on both synthetic and real-world data demonstrate that our model is more efficient than classic iterative algorithms in learning a graph with specific topological properties.
spellingShingle Pu, X
Cao, T
Zhang, X
Dong, X
Chen, S
Learning to learn graph topologies
title Learning to learn graph topologies
title_full Learning to learn graph topologies
title_fullStr Learning to learn graph topologies
title_full_unstemmed Learning to learn graph topologies
title_short Learning to learn graph topologies
title_sort learning to learn graph topologies
work_keys_str_mv AT pux learningtolearngraphtopologies
AT caot learningtolearngraphtopologies
AT zhangx learningtolearngraphtopologies
AT dongx learningtolearngraphtopologies
AT chens learningtolearngraphtopologies