no code implementations • NeurIPS 2019 • Dylan J. Foster, Spencer Greenberg, Satyen Kale, Haipeng Luo, Mehryar Mohri, Karthik Sridharan
Our main result is a generalization bound for data-dependent hypothesis sets expressed in terms of a notion of hypothesis set stability and a notion of Rademacher complexity for data-dependent hypothesis sets that we introduce.
no code implementations • 22 Oct 2013 • Corinna Cortes, Spencer Greenberg, Mehryar Mohri
We present an extensive analysis of relative deviation bounds, including detailed proofs of two-sided inequalities and their implications.
no code implementations • 6 Jun 2013 • Spencer Greenberg, Mehryar Mohri
We give the proof of a tight lower bound on the probability that a binomial random variable exceeds its expected value.