Search Results for author:
Found 7 papers, 1 papers with code
Strategyproofing Peer Assessment via Partitioning: The Price in Terms of Evaluators' Expertise
Finally, we evaluate the methods on a dataset from conference peer review.
Outlier-Robust Clustering of Non-Spherical Mixtures
Concretely, our algorithm takes input an $\epsilon$-corrupted sample from a $k$-GMM and whp in $d^{\text{poly}(k/\eta)}$ time, outputs an approximate clustering that misclassifies at most $k^{O(k)}(\epsilon+\eta)$ fraction of the points whenever every pair of mixture components are separated by $1-\exp(-\text{poly}(k/\eta)^k)$ in total variation (TV) distance.
Provable Submodular Minimization using Wolfe's Algorithm
In 1976, Wolfe proposed an algorithm to find the minimum Euclidean norm point in a polytope, and in 1980, Fujishige showed how Wolfe's algorithm can be used for SFM.
Agnostic Learning of Disjunctions on Symmetric Distributions
This directly gives an agnostic learning algorithm for disjunctions on symmetric distributions that runs in time $n^{O( \log{(1/\epsilon)})}$.
Tight Bounds on $\ell_1$ Approximation and Learning of Self-Bounding Functions
Previous techniques considered stronger $\ell_2$ approximation and proved nearly tight bounds of $\Theta(1/\epsilon^{2})$ on the degree and $2^{\Theta(1/\epsilon^2)}$ on the number of variables.
Learning Coverage Functions and Private Release of Marginals
As an application of our learning results, we give simple differentially-private algorithms for releasing monotone conjunction counting queries with low average error.
Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees
We show that these structural results can be exploited to give an attribute-efficient PAC learning algorithm for submodular functions running in time $\tilde{O}(n^2) \cdot 2^{O(1/\epsilon^{4})}$.
