Bounded kernel-based online learning
From MaRDI portal
Recommendations
- Online Learning with Kernels
- Online multiple kernel learning: algorithms and mistake bounds
- Large scale online kernel learning
- Online learning with (multiple) kernels: a review
- Simple randomized algorithms for online learning with kernels
- Limited Stochastic Meta-Descent for Kernel-Based Online Learning
- Multi kernel learning with online-batch optimization
- Decentralized Online Learning With Kernels
Cited in
(17)- Tracking the best hyperplane with a simple budget perceptron
- A kernel-based perceptron with dynamic memory
- Dynamical memory control based on projection technique for online regression
- Training a multilayer network with low-memory kernel-and-range projection
- A fast SVD-hidden-nodes based extreme learning machine for large-scale data analytics
- Worst-case regret analysis of computationally budgeted online kernel selection
- Improving kernel online learning with a snapshot memory
- scientific article; zbMATH DE number 5811685 (Why is no real title available?)
- The Forgetron: A Kernel-Based Perceptron on a Budget
- Real-time model learning using incremental sparse spectrum Gaussian process regression
- Approximation vector machines for large-scale online learning
- Tracking the Best Hyperplane with a Simple Budget Perceptron
- A Second-Order Perceptron Algorithm
- scientific article; zbMATH DE number 2243402 (Why is no real title available?)
- Theory and Applications of Models of Computation
- An online two-stage classification based on projections
- Simple randomized algorithms for online learning with kernels
This page was built for publication: Bounded kernel-based online learning
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2880990)
