Tracking the best hyperplane with a simple budget perceptron
DOI10.1007/s10994-007-5003-0zbMath1470.68090DBLPjournals/ml/CavallantiCG07OpenAlexW1973678258WikidataQ59538581 ScholiaQ59538581MaRDI QIDQ1009215
Nicolò Cesa-Bianchi, Giovanni Cavallanti, Claudio Gentile
Publication date: 31 March 2009
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-007-5003-0
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Pattern recognition, speech recognition (68T10) Randomized algorithms (68W20) Online algorithms; streaming algorithms (68W27)
Related Items (11)
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- The robustness of the \(p\)-norm algorithms
- Tracking the best disjunction
- Tracking the best expert
- The weighted majority algorithm
- Large margin classification using the perceptron algorithm
- 10.1162/153244301753683726
- 10.1162/15324430260185600
- The Perceptron: A Model for Brain Functioning. I
- The Forgetron: A Kernel-Based Perceptron on a Budget
- Learning Theory and Kernel Machines
- A Second-Order Perceptron Algorithm
- Online Learning with Kernels
- General convergence results for linear discriminant updates
- The relaxed online maximum margin algorithm
This page was built for publication: Tracking the best hyperplane with a simple budget perceptron