We analyze algorithms to learn Gaussian Bayesian networks with known structure up to a bounded error in total variation distance.
-
Updated
Jul 27, 2021 - Python
We analyze algorithms to learn Gaussian Bayesian networks with known structure up to a bounded error in total variation distance.
OSRL (Optimal Representation Learning in Multi-Task Bandits) comprises an algorithm that addresses the problem of sample complexity with fixed confidence in Multi-Task Bandit problems. Published at the Thirty-Seventh AAAI Conference on Artificial Intelligence (AAAI23)
Python implementation of algorithms for Best Policy Identification in Markov Decision Processes
Python utilities to compute a lower bound of the expected sample complexity to identify the best arm in a bandit model
Add a description, image, and links to the sample-complexity topic page so that developers can more easily learn about it.
To associate your repository with the sample-complexity topic, visit your repo's landing page and select "manage topics."