Demystifying graph coarsening

In the graph world, data come in big sizes. This should be a cause for excitement: more data means more opportunities to derive insights and richer training sets for supervised learning algorithms.

In practice however, big graphs cause disdain to most. The reason is that the graph size -measured w.r.t. the number of nodes N and edges M– determines the computational complexity of graph algorithms. Even the fastest algorithms struggle to deal with graphs consisting of tens or hundreds of thousands of nodes.

This computational challenge arises noticeably when it comes to applying machine learning on graph-structured data:

  • Unsupervised learning tasks, such as clustering and non-linear dimensionality reduction, feature a super-linear complexity—typically between O(N^2) and O(N^3).

Suppose for instance that we need to visualize a 100k node graph. If we try to embed the nodes in a 3D space using Laplacian eigenmaps then we will likely have to wait hours to inspect the result. This algorithm is thus an impractical choice for large-scale dimensionality reduction, irrespective of its ability to yield good embeddings.

  • Supervised and semi-supervised learning tasks are usually solved with the help of localized aggregation primitives. These primitives are typically quite efficient and they can be used with any graph that fits a computer’s memory. Nevertheless, when the aggregation needs to be used repeatedly, the waiting times start to compound.

Graph convolution is a good example of this phenomenon. Training a graph convolutional neural network (GCN) involves using convolution again and again (every convolutional layer entails F_{in} \times F_{out} \times B convolutions, where F_{in}, F_{out} are the number of input and output features respectively, whereas B is the batch size). For this reason, using GCN on large graphs can be a test of one’s patience.

The coarsening solution

So what can we do about it?

A common idea of approximation algorithms is that, instead of solving the original problem, solve a coarse problem of reduced size at a lower cost; then lift (and possibly refine) the solution.

For graphs this amounts to coarsening:


The above example shows how the number of nodes of a Barabasi-Albert graph G (left) can be progressively reduced until a sufficiently small coarse graph G_c is obtained (right). Graph G_c will be a good substitute if it preserves the “global structure” of G and only lacks in “details”.

This approach has three benefits:

  • Speed: Coarsening is usually very fast (O(M) operations)
  • Interpretability: Coarse variables have a meaning (in contrast to random projections).
  • Simplicity: We can use the same algorithm to process G_c as G.

The mystery

It will be of little surprise that graph coarsening is well-known, both by the algorithmic and machine learning communities.

Whether the purpose is to partition and visualize billion-node graphs [Wang et al. 2014], to generate multi-scale representations of graph-structured data [Shuman et al. 2015], to solve large linear systems involving Laplacian matrices [Livne and Bandt 2012], or to do pooling in GCN [Defferrard et al. 2017, Simonovsky and Komodakis 2017], a large number of works use coarsening. (These references are of course only representative.)

Being so widely known, one would expect a concrete understanding of what information coarsening destroys and, moreover, how this loss affects learning algorithms.

Unfortunately, to-date no such theory exists.

The coarsening algorithms currently in-use are heuristics—they have been found out to work well experimentally, but there is neither any concrete understanding of how they affect learning algorithms nor any conclusive evidence that they cannot be improved.

when coarsening goes wrong

The example above shows how coarsening even few vertices may deform the graph structure. This is an issue for GCNs, that commonly aim to reduce the number of vertices by a factor of 2 at each layer. Here, the leftmost graph, consisting of 16 vertices, is progressively coarsened to 13 vertices using edge contractions.

A spectral perspective

In the paper “Spectrally approximating large graphs with smaller graphs” which will appear in this year’s ICML, we asked the following question:

How does coarsening affect the spectrum of a graph?

By spectrum, I mean the principal eigenvalues and eigenvectors of the graph Laplacian.

Why spectrum? There are a two primary reasons why I decided to approach graph coarsening using spectral graph theory:

  1. The spectrum plays a fundamental role in modern graph theory. Graph theorists love to quantify the global properties of graphs through the spectrum of a graph. For instance, the spectrum can be used to capture the community structure of a graph, the presence of hubs and bridges, and the susceptibility of a network to epidemics, among others.
  2. Numerous learning algorithms use it (c.f., clustering, embedding, multi-scale representation). A case in point, graph convolution carries along an elegant spectral interpretation (see this post). Knowing how far is the spectrum of G_c to that of G effectively means that we understand to what extend we may coarsen a graph without significantly affecting the learning algorithms that use it.

Understanding how changing a graph (in this case by coarsening) affects its spectrum is a difficult problem. The few results that are known concern the eigenvalues and are quite pessimistic [Chung 1997; Chen et al. 2004].

New insights

In a nutshell, we discovered that to guarantee spectrum approximation it is sufficient to check whether a simple property holds.

The restricted spectral similarity (RSS) property asserts that the Laplacian matrices of G and G_c behave similarly (up to the RSS constants) with respect to an appropriate set of vectors.

Interestingly, the smaller the RSS constants are, the better the approximation!

This finding has intriguing consequences:

  • Since the RSS property is relatively simple to verify, one can use it to derive approximation guarantees for current heuristics. In the aforementioned paper, we discuss how (a randomized variant of) the well-known heavy-edge matching heuristic finds meaning as a relaxation of the RSS constant minimization problem.
  • For the particular case of spectral clustering, our results imply that coarse eigenvectors can be used to derive good quality assignments even without refinement—this phenomenon has been experimentally observed [Karypis and Kumar 1998], but until now lacked formal justification.

What’s next?

The RSS property opens up new ways, not only to understand coarsening, but also to optimize its operation.

In a follow up post, I will attempt to answer a question I have been thinking a lot about:

How should a graph be coarsened so that its spectrum is preserved?

Though admittedly, this might take a while 🙂


Leave a Reply

Fill in your details below or click an icon to log in: Logo

You are commenting using your account. Log Out /  Change )

Google+ photo

You are commenting using your Google+ account. Log Out /  Change )

Twitter picture

You are commenting using your Twitter account. Log Out /  Change )

Facebook photo

You are commenting using your Facebook account. Log Out /  Change )


Connecting to %s