Search Results for author: Nicholas Harvey

Found 3 papers, 0 papers with code

Improved Algorithms for Online Submodular Maximization via First-order Regret Bounds

no code implementations NeurIPS 2020 Nicholas Harvey, Christopher Liaw, Tasuku Soma

- For monotone submodular maximization subject to a matroid, we give an efficient algorithm which achieves a (1 − c/e − ε)-regret of O(√kT ln(n/k)) where n is the size of the ground set, k is the rank of the matroid, ε > 0 is a constant, and c is the average curvature.

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes

no code implementations NeurIPS 2018 Hassan Ashtiani, Shai Ben-David, Nicholas Harvey, Christopher Liaw, Abbas Mehrabian, Yaniv Plan

We prove that ϴ(k d^2 / ε^2) samples are necessary and sufficient for learning a mixture of k Gaussians in R^d, up to error ε in total variation distance.

Matroids Hitting Sets and Unsupervised Dependency Grammar Induction

no code implementations24 May 2017 Nicholas Harvey, Vahab Mirrokni, David Karger, Virginia Savova, Leonid Peshkin

This paper formulates a novel problem on graphs: find the minimal subset of edges in a fully connected graph, such that the resulting graph contains all spanning trees for a set of specifed sub-graphs.

Dependency Grammar Induction

Cannot find the paper you are looking for? You can Submit a new open access paper.