Dimension Reduction via Colour Refinement

Colour refinement is a basic algorithmic routine for graph isomorphism testing, appearing as a subroutine in almost all practical isomorphism solvers. It partitions the vertices of a graph into "colour classes" in such a way that all vertices in the same colour class have the same number of neighbours in every colour class. Tinhofer (Disc. App. Math., 1991), Ramana, Scheinerman, and Ullman (Disc. Math., 1994) and Godsil (Lin. Alg. and its App., 1997) established a tight correspondence between colour refinement and fractional isomorphisms of graphs, which are solutions to the LP relaxation of a natural ILP formulation of graph isomorphism. We introduce a version of colour refinement for matrices and extend existing quasilinear algorithms for computing the colour classes. Then we generalise the correspondence between colour refinement and fractional automorphisms and develop a theory of fractional automorphisms and isomorphisms of matrices. We apply our results to reduce the dimensions of systems of linear equations and linear programs. Specifically, we show that any given LP L can efficiently be transformed into a (potentially) smaller LP L' whose number of variables and constraints is the number of colour classes of the colour refinement algorithm, applied to a matrix associated with the LP. The transformation is such that we can easily (by a linear mapping) map both feasible and optimal solutions back and forth between the two LPs. We demonstrate empirically that colour refinement can indeed greatly reduce the cost of solving linear programs.

[1]  Matthew Richardson,et al.  Markov logic networks , 2006, Machine Learning.

[2]  John E. Hopcroft,et al.  An n log n algorithm for minimizing states in a finite automaton , 1971 .

[3]  Gottfried Tinhofer,et al.  A note on compact graphs , 1991, Discret. Appl. Math..

[4]  Jean-François Puget,et al.  Automatic Detection of Variable and Value Symmetries , 2005, CP.

[5]  Kristian Kersting,et al.  Lifted Linear Programming , 2012, AISTATS.

[6]  Richard S. Sutton,et al.  Reinforcement Learning: An Introduction , 1998, IEEE Trans. Neural Networks.

[7]  M. Pfetsch,et al.  Detecting Orbitopal Symmetries , 2009 .

[8]  Edward R. Scheinerman,et al.  Fractional isomorphism of graphs , 1994, Discret. Math..

[9]  Paul S. Bonsma,et al.  Tight Lower and Upper Bounds for the Complexity of Canonical Colour Refinement , 2013, Theory of Computing Systems.

[10]  Michael Joswig,et al.  Algorithms for highly symmetric linear and integer programs , 2010, Mathematical Programming.

[11]  Chris Godsil,et al.  Compact graphs and equitable partitions , 1997 .

[12]  Pedro M. Domingos,et al.  Lifted First-Order Belief Propagation , 2008, AAAI.

[13]  Albert Atserias,et al.  Sherali-Adams Relaxations and Indistinguishability in Counting Logics , 2013, SIAM J. Comput..

[14]  Maxime Crochemore,et al.  Partitioning a Graph in O(|A| log2 |V|) , 1982, Theoretical Computer Science.

[15]  P. Parrilo,et al.  Symmetry groups, semidefinite programs, and sums of squares , 2002, math/0211450.

[16]  Robert E. Tarjan,et al.  Three Partition Refinement Algorithms , 1987, SIAM J. Comput..

[17]  Kristian Kersting,et al.  Counting Belief Propagation , 2009, UAI.

[18]  Kristian Kersting,et al.  Exploiting symmetries for scaling loopy belief propagation and relational training , 2013, Machine Learning.

[19]  Stephen P. Boyd,et al.  Fastest Mixing Markov Chain on a Graph , 2004, SIAM Rev..

[20]  Hung Hai Bui,et al.  Automorphism Groups of Graphical Models and Lifted Variational Inference , 2012, UAI.

[21]  Leslie Pack Kaelbling,et al.  On the Complexity of Solving Markov Decision Problems , 1995, UAI.

[22]  Igor L. Markov,et al.  Graph Symmetry Detection and Canonical Labeling: Differences and Synergies , 2012, Turing-100.

[23]  Leo Liberti,et al.  Reformulations in mathematical programming: automatic symmetry detection and exploitation , 2010, Mathematical Programming.

[24]  Roman Garnett,et al.  Power Iterated Color Refinement , 2014, AAAI.

[25]  François Margot,et al.  Symmetry in Integer Linear Programming , 2010, 50 Years of Integer Programming.

[26]  Richard Bödi,et al.  Symmetries of linear programs , 2011 .

[27]  Mathieu Dutour Sikiric,et al.  Polyhedral representation conversion up to symmetries , 2007, ArXiv.

[28]  Tommi S. Jaakkola,et al.  Fixing Max-Product: Convergent Message Passing Algorithms for MAP LP-Relaxations , 2007, NIPS.