3 citations · 15 across the 20 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2019★ 3 cited
On the computational complexity of the probabilistic label tree algorithms
Robert Busa-Fekete, Krzysztof Dembczynski, Alexander Golovnev +4
Label tree-based algorithms are widely used to tackle multi-class and multi-label problems with a large number of labels. We focus on a particular subclass of these algorithms that…
cs.LG2019★ 2 cited
The information-theoretic value of unlabeled data in semi-supervised learning
Alexander Golovnev, Dávid Pál, Balázs Szörényi
We quantify the separation between the numbers of labeled examples required to learn in two settings: Settings with and without the knowledge of the distribution of the unlabeled d…