Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming
Read the original on arXiv Machine Learning →The paper introduces an efficient method for learning balanced signed graph Laplacians directly from data. By extending the CLIME sparse inverse covariance estimation framework, it formulates a linear programming problem for each Laplacian column with sign constraints that enforce positive edges between nodes of the same polarity and negative edges otherwise. The authors develop a tailored ADMM-based sparse LP solver, prove convergence properties, and demonstrate through experiments that the learned balanced graphs outperform existing methods and allow the reuse of spectral filtering tools, wavelets, and graph neural networks designed for positive graphs.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.