Unregularized online learning algorithms with general loss functions
- 1 March 2017
- journal article
- Published by Elsevier in Applied and Computational Harmonic Analysis
- Vol. 42 (2) , 224-244
Abstract
No abstract availableAll Related Versions
Funding Information
- Research Grants Council of Hong Kong (CityU 104012)
- National Natural Science Foundation of China (11461161006)
This publication has 16 references indexed in Scilit:
- Consistency analysis of an empirical minimum error entropy algorithmApplied and Computational Harmonic Analysis, 2016
- Regularization schemes for minimum error entropy principleAnalysis and Applications, 2015
- Online Learning as Stochastic Approximation of Regularization Paths: Optimality and Almost-Sure ConvergenceIEEE Transactions on Information Theory, 2014
- Ranking and Empirical Minimization of U-statisticsThe Annals of Statistics, 2008
- Convexity, Classification, and Risk BoundsJournal of the American Statistical Association, 2006
- Online Learning AlgorithmsFoundations of Computational Mathematics, 2005
- Model Selection for Regularized Least-Squares Algorithm in Learning TheoryFoundations of Computational Mathematics, 2004
- On the Generalization Ability of On-Line Learning AlgorithmsIEEE Transactions on Information Theory, 2004
- Some comparisons for Gaussian processesProceedings of the American Mathematical Society, 2000
- Theory of reproducing kernelsTransactions of the American Mathematical Society, 1950