Sufficient Conditions for Uniform Stability of Regularization Algorithms
暂无分享,去创建一个
[1] N. Aronszajn. Theory of Reproducing Kernels. , 1950 .
[2] H. Piaggio. Mathematical Analysis , 1955, Nature.
[3] T. Apostol. Mathematical Analysis , 1957 .
[4] G. Wahba. Spline models for observational data , 1990 .
[5] Tomaso A. Poggio,et al. Regularization Theory and Neural Networks Architectures , 1995, Neural Computation.
[6] Vladimir Vapnik,et al. Statistical learning theory , 1998 .
[7] Tomaso A. Poggio,et al. Regularization Networks and Support Vector Machines , 2000, Adv. Comput. Math..
[8] André Elisseeff,et al. Stability and Generalization , 2002, J. Mach. Learn. Res..
[9] Eric R. Ziegel,et al. The Elements of Statistical Learning , 2003, Technometrics.
[10] T. Poggio,et al. General conditions for predictivity in learning theory , 2004, Nature.
[11] H. Zou,et al. Regularization and variable selection via the elastic net , 2005 .
[12] Sayan Mukherjee,et al. Learning theory: stability is sufficient for generalization and necessary and sufficient for consistency of empirical risk minimization , 2006, Adv. Comput. Math..
[13] Shie Mannor,et al. Sparse Algorithms Are Not Stable: A No-Free-Lunch Theorem , 2008, IEEE Transactions on Pattern Analysis and Machine Intelligence.
[14] Lorenzo Rosasco,et al. Elastic-net regularization in learning theory , 2008, J. Complex..