4 citations · 4 across the 2 of their papers we have counts for
2 papers
cs.LG2021
A Fast Algorithm for PAC Combinatorial Pure Exploration
Noa Ben-David, Sivan Sabato
We consider the problem of Combinatorial Pure Exploration (CPE), which deals with finding a combinatorial set or arms with a high reward, when the rewards of individual arms are un…
cs.LG2021★ 4 cited
Active Structure Learning of Bayesian Networks in an Observational Setting
Noa Ben-David, Sivan Sabato
We study active structure learning of Bayesian networks in an observational setting, in which there are external limitations on the number of variable values that can be observed f…