Sparseness vs Estimating Conditional Probabilities: Some Asymptotic Results
暂无分享,去创建一个
[1] J. Lamperti. ON CONVERGENCE OF STOCHASTIC PROCESSES , 1962 .
[2] 丸山 徹. Convex Analysisの二,三の進展について , 1977 .
[3] Peter L. Bartlett,et al. Learning in Neural Networks: Theoretical Foundations , 1999 .
[4] Peter L. Bartlett,et al. Neural Network Learning - Theoretical Foundations , 1999 .
[5] Tong Zhang,et al. Covering Number Bounds of Certain Regularized Linear Function Classes , 2002, J. Mach. Learn. Res..
[6] Grace Wahba,et al. Soft and hard classification by reproducing kernel Hilbert space methods , 2002, Proceedings of the National Academy of Sciences of the United States of America.
[7] Ingo Steinwart,et al. Sparseness of Support Vector Machines , 2003, J. Mach. Learn. Res..
[8] Michael I. Jordan,et al. Large Margin Classifiers: Convex Loss, Low Noise, and Convergence Rates , 2003, NIPS.
[9] Ingo Steinwart,et al. Sparseness of Support Vector Machines---Some Asymptotically Sharp Bounds , 2003, NIPS.
[10] Tong Zhang. Statistical behavior and consistency of classification methods based on convex risk minimization , 2003 .
[11] G. Lugosi,et al. On the Bayes-risk consistency of regularized boosting methods , 2003 .
[12] Ingo Steinwart,et al. Consistency of support vector machines and other regularized kernel classifiers , 2005, IEEE Transactions on Information Theory.