Information Theoretically Optimal Sample Complexity of Learning Dynamical Directed Acyclic Graphs.
Mishfad Shaikh VeeduDeepjyoti DekaMurti V. SalapakaPublished in: CoRR (2023)
Keyphrases
- learning problems
- sample complexity
- learning algorithm
- learning process
- prior knowledge
- supervised learning
- reinforcement learning
- directed acyclic graph
- active learning
- machine learning
- sample complexity bounds
- random walk
- theoretical analysis
- machine learning algorithms
- learning tasks
- small number
- dynamic programming
- lower bound
- data sets