Experiments show that the proposed SCoGL variants improve graph recovery and enhance downstream tasks such as graph signal denoising when signal observations are scarce.
Abstract
Learning a sparse graph from scarce data is practically important but challenging. Motivated by the desirable combination of local sparsity and strong global connectivity exhibited by expander-like graphs, we propose spectral connectivity-regularized graph learning (SCoGL), a framework that incorporates a family of Laplacian spectral priors to explicitly promote global connectivity. Specifically, SCoGL augments a combinatorial-Laplacian-constrained graphical lasso (GLASSO) objective over a target adjacency matrix $\mathbf{W}$ with a general connectivity prior computed from Laplacian eigenvalues. We derive gradients for several representative connectivity priors and develop a projected gradient descent (PGD) algorithm with Armijo backtracking to efficiently optimize $\mathbf{W}$. Experiments show that the proposed SCoGL variants improve graph recovery and enhance downstream tasks such as graph signal denoising when signal observations are scarce.
Structured Connection Graph Learning (SCGL), a block-coordinate algorithm that combines closed-form updates, manifold projections, and spectral constraints, and converges to stationary points of the resulting nonconvex problem, is developed.
Leonardo Di Nino, Gabriele D’Acunto, Sergio Barbarossa et al.· 0 citations
Inferring network topology from noisy node observations is a central problem in graph signal processing. In this paper, we consider Laplacian-constrained graph estimation for Gaussian Markov random fields, focusing on the underdetermined regime in which the number of samples is smaller than the number of graph nodes. E...
Christoffer Kjellson, C. Altafini, Emma Tegling· IEEE Signal Processing Lette...· 0 citations
We propose a method for restoring noisy and incomplete multivariate signals by learning multifold graphs. Spatial relationships among channels can be utilized to recover missing values and suppress noise. However, these relationships can vary across frequency components and observation windows while retaining common co...
A novel interpretation of sfGOT through the lens of the Hilbert-Schmidt Independence Criterion is provided, showing that minimizing the sfGOT distance between two graphs is equivalent to maximizing statistical dependence between the spectral embedding of their nodes.
The Nonnegative and Concomitant (NoCo) DAG estimator is proposed, which jointly recovers the weighted graph structure and the exogenous noise variances in the linear structural equation model for the observations and develops a method of multipliers'algorithm that accommodates both homoscedastic and heteroscedastic noi...
Madeline Navarro, Gonzalo Mateos, Samuel Rey· 1 citation
VisAdj is a new framework for topology-aware adjacency prediction that introduces an attention-sparse neighbor sampler to adaptively select a high-recall set of candidate node pairs and performs joint edge inference using a line-graph transformer that treats candidate edges as tokens and explicitly models dependencies...
Jia-Hao Xie, Guangmo Tong· 0 citations
Related blog posts
MIT News · Artificial Intelligence· news.mit.eduNov 17, 2026
By studying the computational foundations of language learning, Associate Professor Jacob Andreas builds intelligent systems that can communicate effectively with humans.
Microsoft Research Blog· microsoft.comNov 16, 2026
AI coding agents are increasingly help developers fix bugs and build features largely on their own, but every interaction with their models consumes tokens. In each session, an agent sends instructions, tool descriptions, and session history to its model. Most efforts to reduce this cost focus on individual tasks. Yet developers return to the same […] The post TokenEconomizer: Learning from Experience to Make AI Coding Agents More Efficient appeared first on Microsoft Research.
MIT News · Artificial Intelligence· news.mit.eduNov 13, 2026