Scribd Logo
Upload

Welcome to Scribd!

  • Fast Learning of Graph Neural Networks With Guaranteed Generalizability: One-Hidden-Layer Case

    Uploaded by

    Thomas Lee
    11 views1 page
    The document summarizes a paper that provides a theoretical analysis of the generalizability of graph neural networks (GNNs) with one hidden layer. It proposes a learning algorithm using tensor initialization and accelerated gradient descent that converges to the ground-truth GNN model for regression problems and a model close to ground-truth for classification. The algorithm achieves linear convergence faster than vanilla gradient descent. It also explores how GNN sample complexity relates to graph properties and provides experiments validating the analysis and effectiveness of the proposed learning algorithm.

    Original Description:

    icml 3

    Original Title

    Paper-3

    Copyright

    © © All Rights Reserved

    Available Formats

    PDF, TXT or read online from Scribd

    Did you find this document useful?

    Is this content inappropriate?

    Report this Document
    The document summarizes a paper that provides a theoretical analysis of the generalizability of graph neural networks (GNNs) with one hidden layer. It proposes a learning algorithm using tensor initialization and accelerated gradient descent that converges to the ground-truth GNN model for regression problems and a model close to ground-truth for classification. The algorithm achieves linear convergence faster than vanilla gradient descent. It also explores how GNN sample complexity relates to graph properties and provides experiments validating the analysis and effectiveness of the proposed learning algorithm.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    11 views1 page

    Fast Learning of Graph Neural Networks With Guaranteed Generalizability: One-Hidden-Layer Case

    Uploaded by

    Thomas Lee
    The document summarizes a paper that provides a theoretical analysis of the generalizability of graph neural networks (GNNs) with one hidden layer. It proposes a learning algorithm using tensor initialization and accelerated gradient descent that converges to the ground-truth GNN model for regression problems and a model close to ground-truth for classification. The algorithm achieves linear convergence faster than vanilla gradient descent. It also explores how GNN sample complexity relates to graph properties and provides experiments validating the analysis and effectiveness of the proposed learning algorithm.

    Copyright:

    © All Rights Reserved
    Download as PDF, TXT or read online from Scribd
    Flag for inappropriate content
    of 1

    8/19/2020 Paper

    Fast Learning of Graph Neural Networks with Guaranteed Generalizability: One-hidden-layer


    Case
    Part of Proceedings of the International Conference on Machine Learning 119 pre-proceedings (ICML 2020)
    Bibtex » Metadata » Paper » Supplemental »

    Authors
    shuai zhang, Meng Wang, Sijia Liu, Pin-Yu Chen, Jinjun Xiong
    Abstract
    Although graph neural networks (GNNs) have made great progress recently on learning from graph-structured data in practice, their
    theoretical guarantee on generalizability remains elusive in the literature. In this paper, we provide a theoretically-grounded
    generalizability analysis of GNNs with one hidden layer for both regression and binary classification problems. Under the assumption
    that there exists a ground-truth GNN model (with zero generalization error), the objective of GNN learning is to estimate the ground-
    truth GNN parameters from the training data. To achieve this objective, we propose a learning algorithm that is built on tensor
    initialization and accelerated gradient descent. We then show that the proposed learning algorithm converges to the ground-truth GNN
    model for the regression problem, and to a model sufficiently close to the ground-truth for the binary classification problem. Moreover,
    for both cases, the convergence rate of the proposed learning algorithm is proven to be linear and faster than the vanilla gradient
    descent algorithm. We further explore the relationship between the sample complexity of GNNs and their underlying graph properties.
    Lastly, we provide numerical experiments to demonstrate the validity of our analysis and the effectiveness of the proposed learning
    algorithm for GNNs.

    This website is beta: Report an Issue »


    https://proceedings.icml.cc/book/2020/hash/3b3fff6463464959dcd1b68d0320f781 1/1

    You might also like