Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs

Mishfad Shaikh Veedu, Deepjyoti Deka, Murti V. Salapaka. Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs. In Sanjoy Dasgupta, Stephan Mandt, Yingzhen Li, editors, International Conference on Artificial Intelligence and Statistics, 2-4 May 2024, Palau de Congressos, Valencia, Spain. Volume 238 of Proceedings of Machine Learning Research, pages 4636-4644, PMLR, 2024. [doi]

Abstract

Abstract is missing.