Graph neural networks / Fernando Gama.

Format:

Book

Thesis/Dissertation

Author/Creator:

Gama, Fernando, author.

Contributor:

University of Pennsylvania. Department of Electrical and Systems Engineering, degree granting institution.

Language:

English

Subjects (All):

Artificial intelligence.

Electrical engineering.

Computer science.

Electrical and systems engineering--Penn dissertations.

Penn dissertations--Electrical and systems engineering.

Local Subjects:

Artificial intelligence.

Electrical engineering.

Computer science.

Electrical and systems engineering--Penn dissertations.

Penn dissertations--Electrical and systems engineering.

Genre:

Academic theses.

Physical Description:

1 online resource (145 pages)

Contained In:

Dissertations Abstracts International 82-04B.

Place of Publication:

[Philadelphia, Pennsylvania] : University of Pennsylvania ; Ann Arbor : ProQuest Dissertations & Theses, 2020.

Language Note:

English

System Details:

Mode of access: World Wide Web.

text file

Summary:

The theme of this dissertation is machine learning on graph data. Graphs are generic models of signal structure that play a crucial role in tackling problems in a diverse array of fields, including smart grids, sensor networks, and robot swarms. Thus, developing machine learning models that can successfully learn from graph data is a promising area of research with high potential impact. This dissertation focuses particularly on the topic of graph neural networks (GNNs) as the main machine learning model for successfully addressing problems involving graph data. GNNs are nonlinear representation maps that exploit the underlying graph structure to improve learning and achieve better performance. One of the key properties of GNNs is that they are local and distributed mathematical models, making them particularly relevant for problems involving physical networks. The overarching objective of this dissertation is to characterize the representation space of GNNs. This entails several research directions. First, we define a mathematical framework that provides the general tools and lays the groundwork for the analysis and design of concrete GNN models. Second, we derive fundamental properties and theoretical insights that serve as a foundation for understanding the success observed when employing GNNs in practical problems involving graph data. Third, we explore new application domains that are naturally suited for the use of GNNs based on the properties that these exhibit.We leverage graph signal processing (GSP) and its key concepts of graph filtering and graph frequency domain to provide a general mathematical framework for characterizing GNNs. We derive the properties of permutation equivariance and stability to perturbations of the graph support and use these to explain the improved performance of GNNs over linear graph filers. We also show how these two properties help explain the scalability and transferability of GNNs. We explore the use of GNNs in learning decentralized controllers and showcase their success in the problem of flocking.

Notes:

Source: Dissertations Abstracts International, Volume: 82-04, Section: B.

Advisors: Ribeiro, Alejandro; Committee members: Hamed Hassani; Jelena Kovacevic; Gonzalo Mateos.

Department: Electrical and Systems Engineering.

Ph.D. University of Pennsylvania 2020.

Local Notes:

School code: 0175

ISBN:

9798672165530

Access Restriction:

Restricted for use by site license.

This item must not be sold to any third party vendors.