Learning additive models online with fast evaluating kernels

DOI10.1007/3-540-44581-1_29MaRDI QIDQ3148819zbMATH OpenFDO

Authors Mark Herbster

Publication date 22 September 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2111/21110444, https://discovery.ucl.ac.uk/id/eprint/135665/

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Online multiple kernel learning: algorithms and mistake bounds
• Online multiple kernel classification
• Online Regularized Classification Algorithms
• On the Generalization Ability of On-Line Learning Algorithms
• Simple randomized algorithms for online learning with kernels

Cited in

(10)

• Isolation kernel: the X factor in efficient and effective large scale online kernel learning
• Worst-case regret analysis of computationally budgeted online kernel selection
• Kernelization of matrix updates, when and how?
• Online Regression Competitive with Changing Predictors
• Exploiting Cluster-Structure to Predict the Labeling of a Graph
• Approximation vector machines for large-scale online learning
• Kernelization of matrix updates, when and how?
• Online multiple kernel learning: algorithms and mistake bounds
• Algorithmic Learning Theory
• Simple randomized algorithms for online learning with kernels

This page was built for publication: Learning additive models online with fast evaluating kernels

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3148819)