113 citations · 241 across the 31 of their papers we have counts for
Showing 2021Show all
3 papers · 1 filter
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…
cs.LG2021
A Constant Approximation Algorithm for Sequential Random-Order No-Substitution k-Median Clustering
Tom Hess, Michal Moshkovitz, Sivan Sabato
We study k-median clustering under the sequential no-substitution setting. In this setting, a data stream is sequentially observed, and some of the points are selected by the algor…