A Fast Algorithm for PAC Combinatorial Pure Exploration

1 code implementation • 8 Dec 2021 • Noa Ben-David, Sivan Sabato

We provide sample complexity guarantees for our algorithm, and demonstrate in experiments its usefulness on large problems, whereas previous algorithms are impractical to run on problems of even a few dozen arms.

Active Structure Learning of Bayesian Networks in an Observational Setting

1 code implementation • 25 Mar 2021 • Noa Ben-David, Sivan Sabato

We show that for a class of distributions that we term stable, a sample complexity reduction of up to a factor of $\widetilde{\Omega}(d^3)$ can be obtained, where $d$ is the number of network variables.

Active Learning