3 citations · 5 across the 4 of their papers we have counts for
4 papers
Online probabilistic label trees
Kalina Jasinska-Kobus, Marek Wydmuch, Devanathan Thiruvenkatachari +1
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 tra…
Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case
Alina Beygelzimer, Dávid Pál, Balázs Szörényi +3
We study the problem of efficient online multiclass linear classification with bandit feedback, where all examples belong to one of classes and lie in the -dimensional Eucli…
Near-optimal approximation algorithm for simultaneous Max-Cut
Amey Bhangale, Subhash Khot, Swastik Kopparty +2
In the simultaneous Max-Cut problem, we are given weighted graphs on the same set of vertices, and the goal is to find a cut of the vertex set so that the minimum, over the…
An Improved Dictatorship Test with Perfect Completeness
Amey Bhangale, Subhash Khot, Devanathan Thiruvenkatachari
A Boolean function is called a dictator if it depends on exactly one variable i.e for some . In this wor…