Improving kernel online learning with a snapshot memory
From MaRDI portal
Publication:2673322
Recommendations
- Online Learning with Kernels
- Large scale online kernel learning
- Online learning with (multiple) kernels: a review
- Multi kernel learning with online-batch optimization
- Bounded kernel-based online learning
- Online multiple kernel learning: algorithms and mistake bounds
- Simple randomized algorithms for online learning with kernels
- A linear recurrent kernel online learning algorithm with sparse updates
- Fast kernel classifiers with online and active learning
Cites work
- 10.1162/1532443041827925
- A proximal stochastic gradient method with progressive variance reduction
- Beyond the regret minimization barrier: optimal algorithms for stochastic strongly-convex optimization
- Bounded kernel-based online learning
- Breaking the curse of kernelization: budgeted stochastic gradient descent for large-scale SVM training
- scientific article; zbMATH DE number 5957338 (Why is no real title available?)
- Large margin classification using the perceptron algorithm
- Large scale online kernel learning
- Lectures on Fourier Integrals. (AM-42)
- Logarithmic regret algorithms for online convex optimization
- Minimizing finite sums with the stochastic average gradient
- Online Learning with Kernels
- Pegasos: primal estimated sub-gradient solver for SVM
- Stochastic dual coordinate ascent methods for regularized loss minimization
- The Forgetron: A Kernel-Based Perceptron on a Budget
- Tracking the best hyperplane with a simple budget perceptron
- Understanding machine learning. From theory to algorithms
This page was built for publication: Improving kernel online learning with a snapshot memory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2673322)
