activity
20022026
most citedHigh probability generalization bounds for uniformly stable algorithms with nearly optimal rate

40 citations · 242 across the 33 of their papers we have counts for

collaborators
Showing 2014Show all

2 papers · 1 filter

cs.LG2014

Lazier Than Lazy Greedy

Baharan Mirzasoleiman, Ashwinkumar Badanidiyuru, Amin Karbasi +2

Is it possible to maximize a monotone submodular function faster than the widely used lazy greedy algorithm (also known as accelerated greedy), both in theory and practice? In this…

cs.LG2014★ 1 cited

Tight Bounds on Approximation and Learning of Self-Bounding Functions

Vitaly Feldman, Pravesh Kothari, Jan Vondrák

We study the complexity of learning and approximation of self-bounding functions over the uniform distribution on the Boolean hypercube . Informally, a function $f:{0,1}^n…