Papers
Topics
Authors
Recent
Detailed Answer
Quick Answer
Concise responses based on abstracts only
Detailed Answer
Well-researched responses based on abstracts and relevant paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses
Gemini 2.5 Flash
Gemini 2.5 Flash 28 tok/s
Gemini 2.5 Pro 40 tok/s Pro
GPT-5 Medium 16 tok/s Pro
GPT-5 High 13 tok/s Pro
GPT-4o 103 tok/s Pro
Kimi K2 197 tok/s Pro
GPT OSS 120B 471 tok/s Pro
Claude Sonnet 4 38 tok/s Pro
2000 character limit reached

Joint Signal Recovery and Graph Learning from Incomplete Time-Series (2312.16940v1)

Published 28 Dec 2023 in cs.LG and eess.SP

Abstract: Learning a graph from data is the key to taking advantage of graph signal processing tools. Most of the conventional algorithms for graph learning require complete data statistics, which might not be available in some scenarios. In this work, we aim to learn a graph from incomplete time-series observations. From another viewpoint, we consider the problem of semi-blind recovery of time-varying graph signals where the underlying graph model is unknown. We propose an algorithm based on the method of block successive upperbound minimization (BSUM), for simultaneous inference of the signal and the graph from incomplete data. Simulation results on synthetic and real time-series demonstrate the performance of the proposed method for graph learning and signal recovery.

Definition Search Book Streamline Icon: https://streamlinehq.com
References (23)
  1. “Social Network Analysis with Content and Graphs,” Lincoln Laboratory Journal, vol. 20, no. 1, pp. 61–81, 2013.
  2. “A Comprehensive Survey on Graph Neural Networks,” IEEE Transactions on Neural Networks and Learning Systems, vol. 32, no. 1, pp. 4–24, Jan. 2021, arXiv: 1901.00596.
  3. “On Applications of Graph/Network Theory to Problems in Communication Systems,” ECTI Transactions on Computer and Information Technology (ECTI-CIT), vol. 5, no. 1, pp. 15–21, Jan. 1970.
  4. J. V. de M. Cardoso and D. P. Palomar, “Learning undirected graphs in financial markets,” in 2020 54th Asilomar Conference on Signals, Systems, and Computers, 2020, pp. 741–745.
  5. H. A. Loeliger, “An introduction to factor graphs,” IEEE Signal Processing Magazine, vol. 21, no. 1, pp. 28–41, Jan. 2004.
  6. “Decentralized Bayesian Learning over Graphs,” arXiv:1905.10466 [cs, stat], May 2019.
  7. “Sparse inverse covariance estimation with the graphical lasso,” Biostatistics, vol. 9, no. 3, pp. 432–441, July 2008.
  8. “Graph Learning from Data under Structural and Laplacian Constraints,” IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 6, pp. 825–841, 2017.
  9. “Optimization Algorithms for Graph Laplacian Estimation via ADMM and MM,” IEEE Transactions on Signal Processing, vol. 67, no. 16, pp. 4231–4244, Aug. 2019.
  10. V. Kalofolias, “How to learn a graph from smooth signals,” in Artificial intelligence and statistics. PMLR, 2016, pp. 920–929.
  11. “Spatio-Temporal Signal Recovery Based on Low Rank and Differential Smoothness,” IEEE Transactions on Signal Processing, vol. 66, no. 23, pp. 6281–6296, Dec. 2018.
  12. “Signal Recovery on Graphs: Variation Minimization,” IEEE Transactions on Signal Processing, vol. 63, no. 17, pp. 4609–4624, Sept. 2015.
  13. “Graph Signal Recovery via Primal-Dual Algorithms for Total Variation Minimization,” IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 6, pp. 842–855, Sept. 2017.
  14. “A Unified Framework for Structured Graph Learning via Spectral Constraints,” Journal of Machine Learning Research, vol. 21, no. 22, pp. 1–60, 2020.
  15. “A Unified Convergence Analysis of Block Successive Minimization Methods for Nonsmooth Optimization,” SIAM Journal on Optimization, vol. 23, no. 2, pp. 1126–1153, Jan. 2013.
  16. “Majorization-Minimization Algorithms in Signal Processing, Communications, and Machine Learning,” IEEE Transactions on Signal Processing, vol. 65, no. 3, pp. 794–816, Feb. 2017.
  17. P. Tseng, “Convergence of a Block Coordinate Descent Method for Nondifferentiable Minimization,” Journal of Optimization Theory and Applications, vol. 109, no. 3, pp. 475–494, June 2001.
  18. “Learning Laplacian Matrix in Smooth Graph Signal Representations,” IEEE Transactions on Signal Processing, vol. 64, no. 23, pp. 6160–6173, Dec. 2016.
  19. “Nonconvex Sparse Graph Learning under Laplacian Constrained Graphical Model,” in Advances in Neural Information Processing Systems. 2020, vol. 33, pp. 7101–7113, Curran Associates, Inc.
  20. “Spectral Regularization Algorithms for Learning Large Incomplete Matrices,” Journal of Machine Learning Research, vol. 11, no. 80, pp. 2287–2322, 2010.
  21. “Semi-Blind Inference of Topologies and Dynamical Processes Over Dynamic Graphs,” IEEE Transactions on Signal Processing, vol. 67, no. 9, pp. 2263–2274, May 2019.
  22. “Time-Varying Graph Signal Reconstruction,” IEEE Journal of Selected Topics in Signal Processing, vol. 11, no. 6, pp. 870–883, Sept. 2017.
  23. “Towards stationary time-vertex signal processing,” in 2017 ICASSP, 2017, pp. 3914–3918.
Citations (2)
View on Semantic Scholar
List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

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

User Circle Single Streamline Icon: https://streamlinehq.com Sign Up

Summary

We haven't generated a summary for this paper yet.

Ai Sparkles Streamline Icon: https://streamlinehq.com Summarize Now
Dice Question Streamline Icon: https://streamlinehq.com

Follow-Up Questions

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

Ai Sparkles Streamline Icon: https://streamlinehq.com Generate Now