Learning Identifiable Gaussian Bayesian Networks in Polynomial Time and Sample Complexity.
Asish GhoshalJean HonorioPublished in: CoRR (2017)
Keyphrases
- sample complexity
- learning problems
- bayesian networks
- learning algorithm
- supervised learning
- learning process
- special case
- linear threshold
- sample complexity bounds
- upper bound
- active learning
- worst case
- theoretical analysis
- learning tasks
- pac learning model
- concept learning
- pac model
- exact learning
- unsupervised learning
- generalization error
- machine learning algorithms
- computational complexity
- reinforcement learning
- training data
- decision trees