Search Results for author:
Found 2 papers, 1 papers with code
Online probabilistic label trees
We introduce online probabilistic label trees (OPLTs), an algorithm that trains a label tree classifier in a fully online manner without any prior knowledge about the number of training instances, their features and labels.
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case
Under the more challenging weak linear separability condition, we design an efficient algorithm with a mistake bound of $\min (2^{\widetilde{O}(K \log^2 (1/\gamma))}, 2^{\widetilde{O}(\sqrt{1/\gamma} \log K)})$.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
