Papers
Topics
Authors
Recent
Search
2000 character limit reached

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

Published 3 Apr 2024 in eess.SP and cs.LG | (2404.02621v1)

Abstract: 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 resulting complexity and nonconvexity of the resulting 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.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (38)
  1. A. Buciulea and A. G. Marques, “Graph learning from Gaussian and stationary graph signals,” in IEEE Intl. Conf. Acoust., Speech and Signal Process. (ICASSP), 2023, pp. 1–5.
  2. E. D. Kolaczyk, Statistical Analysis of Network Data: Methods and Models, Springer, New York, NY, 2009.
  3. O. Sporns, Discovering the Human Connectome, MIT Press, Boston, MA, 2012.
  4. “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Process. Mag., vol. 30, no. 3, pp. 83–98, May 2013.
  5. “Graph signal processing: Overview, challenges, and applications,” Proc. IEEE, vol. 106, no. 5, pp. 808–828, 2018.
  6. “Algorithms for learning graphs in financial markets,” arXiv preprint arXiv:2012.15410, 2020.
  7. “Connecting the dots: Identifying network structure via graph signal processing,” IEEE Signal Process. Mag., vol. 36, no. 3, pp. 16–43, 2019.
  8. “Graph topology inference based on sparsifying transform learning,” IEEE Trans. Signal Process., vol. 67, no. 7, pp. 1712–1727, 2019.
  9. N. Meinshausen and P. Buhlmann, “High-dimensional graphs and variable selection with the lasso,” Ann. Statist., vol. 34, pp. 1436–1462, 2006.
  10. “Multi-kernel based nonlinear models for connectivity identification of brain networks,” in IEEE Intl. Conf. Acoust., Speech and Signal Process. (ICASSP), Shanghai, China, Mar. 20-25, 2016.
  11. J. Mei and J.M.F. Moura, “Signal processing on graphs: Estimating the structure of a graph,” in IEEE Intl. Conf. Acoust., Speech and Signal Process. (ICASSP), 2015, pp. 5495–5499.
  12. “Graph learning from data under Laplacian and structural constraints,” IEEE J. Sel. Topics Signal Process., vol. 11, no. 6, pp. 825–841, 2017.
  13. “Network topology inference from spectral templates,” IEEE Trans. Signal Info. Process. Networks, vol. 3, no. 3, pp. 467–483, Sep. 2017.
  14. “Latent variable graphical model selection via convex optimization,” Ann. of Statist., vol. 40, no. 4, pp. 1935–1967, 2012.
  15. “Graphical models and dynamic latent factors for modeling functional brain connectivity,” in 2019 IEEE Data Science Wrksp. (DSW). IEEE, 2019, pp. 57–63.
  16. “Learning graphs from smooth and graph-stationary signals with hidden variables,” IEEE Trans. Signal Process., vol. 8, pp. 273–287, 2022.
  17. “The joint graphical lasso for inverse covariance estimation across multiple classes,” J. of the Roy. Statistical Soc.: Ser. B (Statistical Methodology), vol. 76, no. 2, pp. 373–397, 2014.
  18. “Joint inference of multiple graphs from matrix polynomials,” J. of Machine Learning Research (JMLR), vol. 23, no. 1, pp. 3302–3336, 2022.
  19. “Stationary graph processes and spectral estimation,” IEEE Trans. Signal Process., vol. 65, no. 22, pp. 5911–5926, 2017.
  20. A. Sandryhaila and J.M.F. Moura, “Discrete signal processing on graphs,” IEEE Trans. Signal Process., vol. 61, no. 7, pp. 1644–1656, Apr. 2013.
  21. N. Perraudin and P. Vandergheynst, “Stationary signal processing on graphs,” IEEE Trans. Signal Process., vol. 65, no. 13, pp. 3462–3477, 2017.
  22. B. Girault, “Stationary graph signals using an isometric graph translation,” in European Signal Process. Conf. (EUSIPCO), Aug 2015, pp. 1516–1520.
  23. “Sparse inverse covariance estimation with the graphical lasso,” Biostatistics, vol. 9, no. 3, pp. 432–441, 2008.
  24. “Learning graphs from data: A signal representation perspective,” IEEE Signal Process. Mag., vol. 36, no. 3, pp. 44–63, 2019.
  25. S. Segarra M. Sevilla, A. G. Marques, “Estimation of partially known gaussian graphical models with score-based structural priors,” in 27th Intl. Conf. Artificial Intelligence and Statistics (AISTATS), 2024.
  26. H. Zou and T. Hastie, “Regularization and variable selection via the elastic net,” J. of the Roy. Statistical Soc.: Ser. B (Statistical Methodology), vol. 67, no. 2, pp. 301–320, 2005.
  27. R. Tibshirani, “Regression shrinkage and selection via the lasso,” J. of the Roy. Statistical Soc.: Ser. B (Statistical Methodology), vol. 58, no. 1, pp. 267–288, 1996.
  28. “Enhancing sparsity by reweighted ℓ1subscriptℓ1\ell_{1}roman_ℓ start_POSTSUBSCRIPT 1 end_POSTSUBSCRIPT minimization,” J. of Fourier Anal. and Appl., vol. 14, no. 5-6, pp. 877–905, 2008.
  29. “Majorization-minimization algorithms in signal processing, communications, and machine learning,” IEEE Trans. on Signal Processing, vol. 65, no. 3, pp. 794–816, 2017.
  30. “A method for finding projections onto the intersection of convex sets in Hilbert spaces,” in Advances in order restricted statistical inference, pp. 28–47. Springer, 1986.
  31. “A majorized ADMM with indefinite proximal terms for linearly constrained convex composite optimization,” SIAM J. on Optimization, vol. 26, no. 2, pp. 922–950, 2016.
  32. “Distributed optimization and statistical learning via the alternating direction method of multipliers,” Foundations and Trends® in Machine learning, vol. 3, no. 1, pp. 1–122, 2011.
  33. “Learning bipartite graphs: Heavy tails and multiple components,” Adv. in Neural Inf. Process. Syst., vol. 35, pp. 14044–14057, 2022.
  34. “Sparse structural equation modeling for inference of gene regulatory networks exploiting genetic perturbations,” PLoS, Computational Biology, June 2013.
  35. M. Grant and S. Boyd, “CVX: Matlab software for disciplined convex programming, version 2.1,” https://cvxr.com/cvx, Mar. 2014.
  36. “Learning undirected graphs in financial markets,” in Asilomar Conf. Signals, Systems, and Computers, 2020, pp. 741–745.
  37. L. Condat, “Fast projection onto the simplex and the 𝒍𝟏subscript𝒍1\boldsymbol{l}_{\mathbf{1}}bold_italic_l start_POSTSUBSCRIPT bold_1 end_POSTSUBSCRIPT ball,” Mathematical Programming, vol. 158, no. 1-2, pp. 575–585, 2016.
  38. Y. Xu and W. Yin, “A block coordinate descent method for regularized multiconvex optimization with applications to nonnegative tensor factorization and completion,” SIAM J. on imaging sciences, vol. 6, no. 3, pp. 1758–1789, 2013.
Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Sign Up to Generate

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Generate Now

Continue Learning

We haven't generated follow-up questions for this paper yet.

Generate Now

Collections

Sign up for free to add this paper to one or more collections.

Sign Up