Tracking the best hyperplane with a simple budget perceptron
From MaRDI portal
(Redirected from Publication:1009215)
Recommendations
Cites work
- scientific article; zbMATH DE number 1332320 (Why is no real title available?)
- scientific article; zbMATH DE number 1950576 (Why is no real title available?)
- 10.1162/15324430260185600
- A Second-Order Perceptron Algorithm
- General convergence results for linear discriminant updates
- Large margin classification using the perceptron algorithm
- Learning probabilistic linear-threshold classifiers via selective sampling.
- Online Learning with Kernels
- The Forgetron: A Kernel-Based Perceptron on a Budget
- The Perceptron: A Model for Brain Functioning. I
- The relaxed online maximum margin algorithm
- The robustness of the \(p\)-norm algorithms
- The weighted majority algorithm
- Tracking the best disjunction
- Tracking the best expert
- Tracking the best linear predictor
Cited in
(14)- Kernel affine projection algorithms
- Online Regression Competitive with Changing Predictors
- Approximation vector machines for large-scale online learning
- Online learning with (multiple) kernels: a review
- Tracking the Best Hyperplane with a Simple Budget Perceptron
- Online transfer learning
- Real-time model learning using incremental sparse spectrum Gaussian process regression
- Simple randomized algorithms for online learning with kernels
- One-pass online learning: a local approach
- Improving kernel online learning with a snapshot memory
- Isolation kernel: the X factor in efficient and effective large scale online kernel learning
- Online multiple kernel classification
- Adaptive supervised learning on data streams in reproducing kernel Hilbert spaces with data sparsity constraint
- \(\lambda \)-perceptron: an adaptive classifier for data streams
This page was built for publication: Tracking the best hyperplane with a simple budget perceptron
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009215)