Papers
Topics
Authors
Recent
Search
2000 character limit reached

Locally Stationary Graph Processes

Published 4 Sep 2023 in stat.ML and cs.LG | (2309.01657v2)

Abstract: Stationary graph process models are commonly used in the analysis and inference of data sets collected on irregular network topologies. While most of the existing methods represent graph signals with a single stationary process model that is globally valid on the entire graph, in many practical problems, the characteristics of the process may be subject to local variations in different regions of the graph. In this work, we propose a locally stationary graph process (LSGP) model that aims to extend the classical concept of local stationarity to irregular graph domains. We characterize local stationarity by expressing the overall process as the combination of a set of component processes such that the extent to which the process adheres to each component varies smoothly over the graph. We propose an algorithm for computing LSGP models from realizations of the process, and also study the approximation of LSGPs locally with WSS processes. Experiments on signal interpolation problems show that the proposed process model provides accurate signal representations competitive with the state of the art.

Authors (2)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (53)
  1. B. Girault, “Stationary graph signals using an isometric graph translation,” in 23rd European Signal Processing Conference (EUSIPCO), 2015, pp. 1516–1520.
  2. A. G. Marques, S. Segarra, G. Leus, and A. Ribeiro, “Stationary graph processes and spectral estimation,” IEEE Transactions on Signal Processing, vol. 65, no. 22, pp. 5911–5926, 2017.
  3. N. Perraudin and P. Vandergheynst, “Stationary signal processing on graphs,” IEEE Transactions on Signal Processing, vol. 65, no. 13, pp. 3462–3477, July 2017.
  4. A. Loukas and N. Perraudin, “Stationary time-vertex signal processing,” EURASIP Journal on Advances in Signal Processing, vol. 2019, no. 1, p. 36, 2019.
  5. R. A. Silverman, “Locally stationary random processes,” IRE Transactions on Information Theory, vol. 3, pp. 182–187, 1957.
  6. R. Dahlhaus, “Locally stationary processes,” Handbook of Statistics, vol. 30, pp. 351–413, 2012.
  7. A. Hasanzadeh, X. Liu, N. Duffield, and K. R. Narayanan, “Piecewise stationary modeling of random processes over graphs with an application to traffic prediction,” IEEE Int. Conf. Big Data, pp. 3779–3788, 2019.
  8. B. Scalzo, L. Stanković, M. Daković, A. G. Constantinides, and D. P. Mandic, “A class of doubly stochastic shift operators for random graph signals and their boundedness,” Neural Networks, vol. 158, pp. 83–88, 2023.
  9. B. Girault, S. S. Narayanan, and A. Ortega, “Towards a definition of local stationarity for graph signals,” IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 4139–4143, 2017.
  10. ——, “Local stationarity of graph signals: insights and experiments,” SPIE, p. 60, 2017.
  11. D. I. Shuman, S. K. Narang, P. Frossard, A. Ortega, and P. Vandergheynst, “The emerging field of signal processing on graphs: Extending high-dimensional data analysis to networks and other irregular domains,” IEEE Signal Processing Magazine, vol. 30, 10 2012.
  12. A. Sandryhaila and J. M. F. Moura, “Discrete signal processing on graphs: Graph filters,” in 2013 IEEE International Conference on Acoustics, Speech and Signal Processing, May 2013, pp. 6163–6166.
  13. Y. Tanaka, Y. C. Eldar, A. Ortega, and G. Cheung, “Sampling signals on graphs: From theory to applications,” IEEE Signal Processing Magazine, vol. 37, no. 6, pp. 14–30, Nov 2020.
  14. B. Girault, P. Gonçalves, and E. Fleury, “Translation on graphs: An isometric shift operator,” IEEE Signal Processing Letters, vol. 22, no. 12, pp. 2416–2420, Dec 2015.
  15. D. I. Shuman, B. Ricaud, and P. Vandergheynst, “Vertex-frequency analysis on graphs,” Applied and Computational Harmonic Analysis, vol. 40, no. 2, pp. 260–291, 2016.
  16. J. Liu, E. Isufi, and G. Leus, “Filter design for autoregressive moving average graph filters,” IEEE Transactions on Signal and Information Processing over Networks, vol. 5, no. 1, pp. 47–60, March 2019.
  17. E. Isufi, A. Loukas, N. Perraudin, and G. Leus, “Forecasting time series with varma recursions on graphs,” IEEE Transactions on Signal Processing, vol. 67, no. 18, pp. 4870–4885, 2019.
  18. J. Mei and J. M. F. Moura, “Signal processing on graphs: Causal modeling of unstructured data,” IEEE Transactions on Signal Processing, vol. 65, no. 8, pp. 2077–2092, 2017.
  19. F. Hua, R. Nassif, C. Richard, H. Wang, and A. H. Sayed, “Decentralized clustering for node-variant graph filtering with graph diffusion LMS,” in Asilomar Conf. Sig. Sys. Computers, 2018, pp. 1418–1422.
  20. F. Gama, B. G. Anderson, and S. Sojoudi, “Node-variant graph filters in graph neural networks,” in IEEE Data Science and Learning Workshop, 2022, pp. 1–6.
  21. S. Segarra, A. G. Marques, and A. Ribeiro, “Distributed implementation of linear network operators using graph filters,” Allerton Conference on Communication, Control, and Computing, pp. 1406–1413, 2016.
  22. A. Serrano, B. Girault, and A. Ortega, “Graph variogram: A novel tool to measure spatial stationarity,” in IEEE Global Conference on Signal and Information Processing, 2018, pp. 753–757.
  23. L. Stanković, D. Mandic, M. Daković, B. Scalzo, M. Brajović, E. Sejdić, and A. G. Constantinides, “Vertex-frequency graph signal processing: A comprehensive review,” Digital Sig. Proc., vol. 107, p. 102802, 2020.
  24. P. Wahlberg and M. Hansson, “Kernels and multiple windows for estimation of the wigner-ville spectrum of gaussian locally stationary processes,” IEEE Trans. Sig. Proc., vol. 55, no. 1, pp. 73–84, Jan 2007.
  25. S. Mallat, G. Papanicolaou, and Z. Zhang, “Adaptive covariance estimation of locally stationary processes,” The Annals of Statistics, vol. 26, no. 1, pp. 1–47, 1998.
  26. M. Hansson and J. Sandberg, “Multiple windows for estimation of locally stationary transients in the electroencephalogram,” in IEEE Conf. Engineering in Medicine and Biology, Jan 2005, pp. 7293–7296.
  27. R. Dahlhaus, “Fitting time series models to nonstationary processes,” The Annals of Statistics, vol. 25, pp. 1–37, 2 1997.
  28. D. Donoho, S. Mallat, and R. von Sachs, “Estimating covariances of locally stationary processes: consistency of best basis methods,” in Proc. 3rd Int. Symp. Time-Freq. and Time-Scale Analysis, 1996, pp. 337–340.
  29. F. Roueff and R. V. Sachs, “Time-frequency analysis of locally stationary hawkes processes,” Bernoulli, vol. 25, no. 2, pp. 1355–1385, 2019.
  30. J. Pitton, “Adapting multitaper spectrograms to local frequency modulation,” in Proc. IEEE Workshop Statistical Signal and Array Processing, Aug 2000, pp. 108–112.
  31. W. Palma and R. Olea, “An efficient estimator for locally stationary gaussian long-memory processes,” The Annals of Statistics, vol. 38, no. 5, pp. 2958–2997, 2010.
  32. A. Jung, A. O. Hero, III, A. C. Mara, S. Jahromi, A. Heimowitz, and Y. C. Eldar, “Semi-supervised learning in network-structured data via total variation minimization,” IEEE Transactions on Signal Processing, vol. 67, no. 24, pp. 6256–6269, 2019.
  33. M. Nagahama, K. Yamada, Y. Tanaka, S. H. Chan, and Y. C. Eldar, “Graph signal restoration using nested deep algorithm unrolling,” IEEE Transactions on Signal Processing, vol. 70, pp. 3296–3311, 2022.
  34. Z. Wu, S. Pan, F. Chen, G. Long, C. Zhang, and P. S. Yu, “A Comprehensive Survey on Graph Neural Networks,” IEEE Transactions on Neural Networks Learn. Syst., vol. 32, no. 1, pp. 4–24, 2021.
  35. A. Vaswani, N. Shazeer, N. Parmar, J. Uszkoreit, L. Jones, A. N. Gomez, Ł. Kaiser, and I. Polosukhin, “Attention is all you need,” Advances in neural information processing systems, vol. 30, 2017.
  36. P. Veličković, G. Cucurull, A. Casanova, A. Romero, P. Liò, and Y. Bengio, “Graph Attention Networks,” in International Conference on Learning Representations, 2018.
  37. S. Brody, U. Alon, and E. Yahav, “How attentive are graph attention networks?” in International Conference on Learning Representations, 2022.
  38. A. Canbolat and E. Vural, “Estimation of locally stationary graph processes from incomplete realizations,” in IEEE Int. Workshop on Machine Learning for Signal Processing, 2022.
  39. K. Toh, R. H. Tütüncü, and M. Todd, “Inexact primal-dual path-following algorithms for a special class of convex quadratic sdp and related problems,” Pacific Journal of Optimization, vol. 3, 04 2006.
  40. L. Yang, D. Sun, and K.-C. Toh, “SDPNAL+: a majorized semismooth Newton-CG augmented Lagrangian method for semidefinite programming with nonnegative constraints,” Mathematical Programming Computation, vol. 7, no. 3, pp. 331–366, 2015.
  41. A. Yurtsever, J. A. Tropp, O. Fercoq, M. Udell, and V. Cevher, “Scalable semidefinite programming,” SIAM Journal on Mathematics of Data Science, vol. 3, no. 1, pp. 171–200, 2021.
  42. X. Li, D. Sun, and K.-C. Toh, “QSDPNAL: A two-phase augmented Lagrangian method for convex quadratic semidefinite programming,” Mathematical Programming Computation, vol. 10, pp. 703–743, 2018.
  43. C.-C. Ni, Y.-Y. Lin, F. Luo, and J. Gao, “Community detection on networks with Ricci flow,” Sci. Reports, vol. 9, no. 1, p. 9984, 2019.
  44. K. Lounici, “High-dimensional covariance matrix estimation with missing observations,” Bernoulli, vol. 20, no. 3, pp. 1029 – 1058, 2014.
  45. “Covid-19 coronavirus pandemic data.” [Online]. Available: https://www.worldometers.info/coronavirus/
  46. “Eurostat: An official website of the european union.” [Online]. Available: https://ec.europa.eu/eurostat
  47. A. Arguez, I. Durre, S. Applequist, R. S. Vose, M. F. Squires, X. Yin, R. R. Heim, and T. W. Owen, “Noaa’s 1981-2010 U.S. climate normals: An overview,” Bulletin of the American Meteorological Society, vol. 93, no. 11, pp. 1687 – 1697, 2012.
  48. E. Dong, H. Du, and L. Gardner, “An interactive web-based dashboard to track COVID-19 in real time,” The Lancet infectious diseases, vol. 20, no. 5, pp. 533–534, 2020.
  49. E. T. Guneyi, B. Yaldiz, A. Canbolat, and E. Vural, “Learning graph ARMA processes from time-vertex spectra,” IEEE Transactions on Signal Processing, vol. 72, pp. 47–56, 2024.
  50. G. P. H. Styan, “Hadamard products and multivariate statistical analysis,” Linear Algebra and its Applications, vol. 6, pp. 217–240, 1973.
  51. K.-C. Toh, M. Todd, and R. Z, “Sdpt3—a matlab software package for semidefinite programming, version 2.1,” Optimization Methods & Software, vol. 11, 10 1999.
  52. D. K. Hammond, P. Vandergheynst, and R. Gribonval, “Wavelets on graphs via spectral graph theory,” Applied and Computational Harmonic Analysis, vol. 30, no. 2, pp. 129–150, 2011.
  53. D. Thanou, X. Dong, D. Kressner, and P. Frossard, “Learning heat diffusion graphs,” IEEE Transactions on Signal and Information Processing over Networks, vol. 3, no. 3, pp. 484–499, 2017.
Citations (1)
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

Tweets

Sign up for free to view the 1 tweet with 0 likes about this paper.

Sign Up for Free