Papers › An efficient algorithm for graph Laplacian optimization based on effective resistances
An efficient algorithm for graph Laplacian optimization based on effective resistances
Eduardo Pavez, Antonio Ortega
The archive published only this paper's code-link row. Authors, date and abstract are from arXiv's metadata (CC0), read from the Kaggle arXiv metadata snapshot of 2026-09-12 where its title matched the archive's; the title is the archive's.
In graph signal processing, data samples are associated to vertices on a graph, while edge weights represent similarities between those samples. We propose a convex optimization problem to learn sparse well connected graphs from data. We prove that each edge weight in our solution is upper bounded by the inverse of the distance between data features of the corresponding nodes. We also show that the effective resistance distance between nodes is upper bounded by the distance between nodal data features. Thus, our proposed method learns a sparse well connected graph that encodes geometric properties of the data. We also propose a coordinate minimization algorithm that, at each iteration, updates an edge weight using exact minimization. The algorithm has a simple and low complexity implementation based on closed form expressions.
Code
Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.
Code Syntology ran Syntology
Not run by Syntology. Nothing on this page verifies that the listed code works.
Results from the paper archive 2025-07-28
No leaderboard rows for this paper in the archive.
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections