activity
20132023
most citedAn Analysis of the t-SNE Algorithm for Data Visualization

87 citations · 305 across the 39 of their papers we have counts for

collaborators
Showing 2013Show all

2 papers · 1 filter

cs.LG2013★ 22 cited

Representation, Approximation and Learning of Submodular Functions Using Low-rank Decision Trees

Vitaly Feldman, Pravesh Kothari, Jan Vondrak

We study the complexity of approximate representation and learning of submodular functions over the uniform distribution on the Boolean hypercube . Our main result is th…

cs.LG2013★ 5 cited

Learning Coverage Functions and Private Release of Marginals

Vitaly Feldman, Pravesh Kothari

We study the problem of approximating and learning coverage functions. A function is a coverage function, if there exists a universe wit…