Efficient Learning of Balanced Signed Graphs via Iterative Linear Programming

Signed graphs are equipped with both positive and negative edge weights, encoding pairwise correlations as well as anti-correlations in data. A balanced signed graph has no cycles of odd number of negative edges. Laplacian of a balanced signed graph has eigenvectors that map simply to ones in a similarity-transformed positive graph Laplacian, thus enabling reuse of well-studied spectral filters designed for positive graphs. We propose a fast method to learn a balanced signed graph Laplacian directly from data. Specifically, for each node i, to determine its polarity β<inf xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">i</inf> ∈{−1,1} and edge weights $\left\{ {{w_{i,j}}} \right\}_{j = 1}^N$, we extend a sparse inverse covariance formulation based on linear programming (LP) called CLIME, by adding linear constraints to enforce "consistent" signs of edge weights $\left\{ {{w_{i,j}}} \right\}_{j = 1}^N$ with the polarities of connected nodes—i.e., positive/negative edges connect nodes of same/opposing polarities. For each LP, we adopt projections on convex set (POCS) to determine a suitable CLIME parameter ρ > 0 that guarantees LP feasibility. We solve the resulting LP via an off-the-shelf LP solver. Experiments on synthetic and real-world datasets show that our balanced graph learning method outperforms competing methods and enables the use of spectral filters and graph neural networks designed for positive graphs on balanced signed graphs.