232 citations · 575 across the 6 of their papers we have counts for
1 paper · 2 filters
Gilles Blanchard, François Fleuret
We establish a generic theoretical tool to construct probabilistic bounds for algorithms where the output is a subset of objects from an initial pool of candidates (or more general…