Search Results for author:
Found 7 papers, 1 papers with code
Private and Communication-Efficient Algorithms for Entropy Estimation
For a joint distribution over many variables whose conditional independence is given by a tree, we describe algorithms for estimating Shannon entropy that require a number of samples that is linear in the number of variables, compared to the quadratic sample complexity of prior work.
Private and Non-private Uniformity Testing for Ranking Data
We study the problem of uniformity testing for statistical data that consists of rankings over $m$ items where the alternative class is restricted to Mallows models with single parameter.
Identity testing for Mallows model
In this paper, we devise identity tests for ranking data that is generated from Mallows model both in the \emph{asymptotic} and \emph{non-asymptotic} settings.
Optimal Learning of Mallows Block Model
The main result of the paper is a tight sample complexity bound for learning Mallows and Generalized Mallows Model.
A no-regret generalization of hierarchical softmax to extreme multi-label classification
Extreme multi-label classification (XMLC) is a problem of tagging an instance with a small subset of relevant labels chosen from an extremely large pool of possible labels.
Online F-Measure Optimization
In this paper, we study the problem of F-measure maximization in the setting of online learning.
Online Rank Elicitation for Plackett-Luce: A Dueling Bandits Approach
We study the problem of online rank elicitation, assuming that rankings of a set of alternatives obey the Plackett-Luce distribution.
