← Back to all news
arXiv Machine Learning By Liping Tao, Chee Wei Tan

Difference-of-Convex Regularization for Graph Learning by Differentiable Programming

Read the original on arXiv Machine Learning →

arXiv:2608. 12757v1 Announce Type: cross Abstract: Laplacian-regularized minimization is fundamental in signal processing and machine learning, but is limited by the dense and ill-conditioned nature of the graph Laplacian pseudoinverse.

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.

Related stories

arXiv Machine Learning
Sep 24

Graph Learning with Spectral Connectivity Priors for Scarce Data

The paper introduces Spectral Connectivity-Regularized Graph Learning (SCoGL), a method for learning sparse graphs from limited data by incorporating Laplacian spectral priors that promote global connectivity. SCoGL extends the graphical lasso objective with a connectivity prior derived from Laplacian eigenvalues and uses projected gradient descent with Armijo backtracking for optimization. Experiments demonstrate that SCoGL improves graph recovery and enhances downstream tasks such as graph signal denoising when observations are scarce.

By Mingxiao Liu (Tsinghua University, China), Bahar Oveisgharan (York University, Canada), Bingyan Zou (Tsinghua University, China), Gene Cheung (York University, Canada), H. Vicky Zhao (Tsinghua University, China), Feifei Gao (Tsinghua University, China)
efficiency
More like this →
arXiv Machine Learning
Sep 2

Efficient Learning of Balanced Signed Graphs via Sparse Linear Programming

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.

By Haruki Yokota, Hiroshi Higashi, Yuichi Tanaka, Gene Cheung
More like this →