EUVIMEDEUVIMED entdecken
Open Access · CC BY 4.0

Polynomial Graphical Lasso: Learning Edges From Gaussian Graph-Stationary Signals

Andrei Buciulea, Jiaxi Ying, Antonio G. Marques, Daniel P. Palomar

IEEE Transactions on Signal Processing · 2025 · 73 · 1153-1167

DOI: 10.1109/tsp.2025.3544376 ↗

Kurz gefasst

Fachartikel in der Zeitschrift IEEE Transactions on Signal Processing, 2025. Verfasst von Andrei Buciulea und 3 weiteren Autor:innen. Die Arbeit wurde bisher 8-mal zitiert (Crossref) und nennt 42 Literaturangaben. Der Volltext ist frei zugänglich (Open Access, CC BY 4.0). Gefördert von: Spanish AEI, Autonomous Community of Madrid within the ELLIS Unit Madrid framework, URJC/CAM, Hong Kong GRF research.

AbstractBibliografische AngabenZitierenVerwandte Studien

Abstract (Originalsprache)

This paper introduces Polynomial Graphical Lasso (PGL), a new approach to learning graph structures from nodal signals. Our key contribution lies in modeling the signals as Gaussian and stationary on the graph, enabling the development of a graph learning formulation that combines the strengths of graphical lasso with a more encompassing model. Specifically, we assume that the precision matrix can take any polynomial form of the sought graph, allowing for increased flexibility in modeling nodal relationships. Given the inherent complexity and nonconvexity of the optimization problem, we (i) propose a low-complexity algorithm that alternates between estimating the graph and precision matrices, and (ii) characterize its convergence. We evaluate the performance of PGL through comprehensive numerical simulations using both synthetic and real data, demonstrating its superiority over several alternatives. Overall, this approach presents a significant advancement in graph learning and holds promise for various applications in graph-aware signal analysis and beyond.

Förderung

  • Spanish AEI
  • Autonomous Community of Madrid within the ELLIS Unit Madrid framework, URJC/CAM
  • Hong Kong GRF research
  • Hong Kong RGC Postdoctoral Fellowship Scheme of Project

Zitieren

APA

Buciulea, A., Ying, J., Marques, A. G., & Palomar, D. P. (2025). Polynomial Graphical Lasso: Learning Edges From Gaussian Graph-Stationary Signals. IEEE Transactions on Signal Processing, 73, 1153-1167. https://doi.org/10.1109/tsp.2025.3544376

Vancouver

Buciulea A, Ying J, Marques AG, Palomar DP. Polynomial Graphical Lasso: Learning Edges From Gaussian Graph-Stationary Signals. IEEE Transactions on Signal Processing. 2025;73:1153-1167. doi:10.1109/tsp.2025.3544376

BibTeX
@article{Buciulea2025,
  author = {Buciulea, Andrei and Ying, Jiaxi and Marques, Antonio G. and Palomar, Daniel P.},
  title = {Polynomial Graphical Lasso: Learning Edges From Gaussian Graph-Stationary Signals},
  journal = {IEEE Transactions on Signal Processing},
  year = {2025},
  volume = {73},
  pages = {1153--1167},
  doi = {10.1109/tsp.2025.3544376}
}
Kostenlos starten →