52 citations · 52 across the 2 of their papers we have counts for
Showing cs.LGShow all
2 papers · 1 filter
cs.LG2008
Stability Bound for Stationary Phi-mixing and Beta-mixing Processes
Mehryar Mohri, Afshin Rostamizadeh
Most generalization bounds in learning theory are based on some measure of the complexity of the hypothesis class used, independently of any algorithm. In contrast, the notion of a…
cs.LG2007★ 52 cited
An efficient reduction of ranking to classification
Nir Ailon, Mehryar Mohri
This paper describes an efficient reduction of the learning problem of ranking to binary classification. The reduction guarantees an average pairwise misranking regret of at most t…