Algorithmic Stability and Generalization Performance

2001

Citations in the corpus

• On the Error of Random Fourier Features (2015, neutral): “If we want h (cid:48) ( x ) → h ( x ) at least as fast as h ( x ) ’s convergence rate of O (1 / √ n ) (Bousquet and Elisseeff 2001), ignoring the log-arithmic terms, we thus need D to be linear in n , matching the conclusion of Rahimi and Recht (2008a).”