Concerning Iterative Graph Normalization and Maximum Weight Independent Sets

by   Laurent Guigues, et al.

We consider a very simple dynamical system on weighted graphs which we call Iterative Graph Normalization (IGN) and a variant in which we apply a non-linear activation function to the weights after each normalization. We show that the indicator vectors of the Maximal Independent Sets of the graph are the only binary fixed points of IGN, that they are attractive under simple conditions on the activation function and we characterize their basins of attraction. We enumerate a number of other fixed points and we prove repulsivity for some classes. Based on extensive experiments and different theoretical arguments we conjecture that IGN always converges and converges to a binary solution for non-linear activations. If our conjectures are correct, IGN would thus be a differentiable approximation algorithm for the Maximum Weight Independent Set problem (MWIS), a central NP-hard optimization problem with numerous applications. IGN is closely related to a greedy approximation algorithm of MWIS by Kako et al. which has a proven approximation ratio. Experimental results show that IGN provides solutions of very similar quality. In the context of the Assignment Problem, IGN corresponds to an iterative matrix normalization scheme which is closely related to the Sinkhorn-Knopp algorithm except that it projects to a permutation matrix instead of a doubly stochastic matrix. We relate our scheme to the Softassign algorithm and provide comparative results. As Graph Normalization is differentiable, its iterations can be embedded into a machine learning framework and used to train end-to-end any model which includes a graphical optimization step which can be cast as a maximum weight independent set problem. This includes problems such as graph and hypergraph matching, sequence alignment, clustering, ranking, etc. with applications in multiple domains.



There are no comments yet.


page 21


An Improved Approximation Algorithm for the Maximum Weight Independent Set Problem in d-Claw Free Graphs

In this paper, we consider the task of computing an independent set of m...

A simple approximation algorithm for the graph burning problem

The graph burning problem is an NP-Hard optimization problem that may be...

Approximation algorithm for the Multicovering Problem

Let H=(V,E) be a hypergraph with maximum edge size ℓ and maximum degree ...

An algorithmic weakening of the Erdős-Hajnal conjecture

We study the approximability of the Maximum Independent Set (MIS) proble...

On an Annihilation Number Conjecture

Let α(G) denote the cardinality of a maximum independent set, while μ(G)...

A New Dynamic Algorithm for Densest Subhypergraphs

Computing a dense subgraph is a fundamental problem in graph mining, wit...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.