Conference · 2024
Information theoretically optimal sample complexity of learning dynamical directed acyclic graphs.
Mishfad Shaikh Veedu, Deepjyoti Deka, and Murti Salapaka.
International Conference on Artificial Intelligence and Statistics
Abstract
Abstract not yet added for this entry.
BibTeX
@inproceedings{veedu-2024-information-theoretically-optimal-sample-complexity-of-learn,
title = {Information theoretically optimal sample complexity of learning dynamical directed acyclic graphs.},
author = {Mishfad Shaikh Veedu and Deepjyoti Deka and Murti Salapaka.},
booktitle = {International Conference on Artificial Intelligence and Statistics},
year = {2024}
}