A Second-Order Perceptron Algorithm
From MaRDI portal
Recommendations
Cited in
(21)- Tracking the best hyperplane with a simple budget perceptron
- A primal-dual perspective of online learning algorithms
- A kernel-based perceptron with dynamic memory
- Multiclass classification with bandit feedback using adaptive regularization
- A lossless online Bayesian classifier
- Scale-invariant unconstrained online learning
- Applications of regularized least squares to pattern classification
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- An upper bound for aggregating algorithm for regression with changing dependencies
- A smooth perceptron algorithm
- Online passive-aggressive active learning
- A second-order Perceptron algorithm
- Exploiting Cluster-Structure to Predict the Labeling of a Graph
- The Forgetron: A Kernel-Based Perceptron on a Budget
- Adaptive regularization of weight vectors
- Learning noisy linear classifiers via adaptive and selective sampling
- Weighted last-step min-max algorithm with improved sub-logarithmic regret
- A generalized online mirror descent with applications to classification and regression
- \(\lambda \)-perceptron: an adaptive classifier for data streams
- Stochastic online optimization for cyber-physical and robotic systems
- Uniform regret bounds over \(\mathbb{R}^d\) for the sequential linear regression problem with the square loss
This page was built for publication: A Second-Order Perceptron Algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5317167)