Out-of-sample extension of graph adjacency spectral embedding

02/17/2018
by   Keith Levin, et al.
0

Many popular dimensionality reduction procedures have out-of-sample extensions, which allow a practitioner to apply a learned embedding to observations not seen in the initial training sample. In this work, we consider the problem of obtaining an out-of-sample extension for the adjacency spectral embedding, a procedure for embedding the vertices of a graph into Euclidean space. We present two different approaches to this problem, one based on a least-squares objective and the other based on a maximum-likelihood formulation. We show that if the graph of interest is drawn according to a certain latent position model called a random dot product graph, then both of these out-of-sample extensions estimate the true latent position of the out-of-sample vertex with the same error rate. Further, we prove a central limit theorem for the least-squares-based extension, showing that the estimate is asymptotically normal about the truth in the large-graph limit.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
09/29/2019

Limit theorems for out-of-sample extensions of the adjacency and Laplacian spectral embeddings

Graph embeddings, a class of dimensionality reduction techniques designe...
research
05/21/2013

Out-of-sample Extension for Latent Position Graphs

We consider the problem of vertex classification for graphs constructed ...
research
05/31/2013

A central limit theorem for scaled eigenvectors of random dot product graphs

We prove a central limit theorem for the components of the largest eigen...
research
07/20/2020

The multilayer random dot product graph

We present an extension of the latent position network model known as th...
research
12/08/2021

Consistency of Spectral Seriation

Consider a random graph G of size N constructed according to a graphon w...
research
08/01/2020

The Importance of Being Correlated: Implications of Dependence in Joint Spectral Inference across Multiple Networks

Spectral inference on multiple networks is a rapidly-developing subfield...
research
10/10/2019

Efficient Estimation for Random Dot Product Graphs via a One-step Procedure

We propose a one-step procedure to efficiently estimate the latent posit...

Please sign up or login with your details

Forgot password? Click here to reset