A primal-dual perspective of online learning algorithms
From MaRDI portal
Recommendations
Cites work
- 10.1162/15324430260185600
- A Second-Order Perceptron Algorithm
- Competitive On-line Statistics
- Convex Analysis
- Exponentiated gradient versus gradient descent for linear predictors
- General convergence results for linear discriminant updates
- scientific article; zbMATH DE number 5957338 (Why is no real title available?)
- scientific article; zbMATH DE number 3128728 (Why is no real title available?)
- scientific article; zbMATH DE number 1382772 (Why is no real title available?)
- scientific article; zbMATH DE number 2107836 (Why is no real title available?)
- scientific article; zbMATH DE number 3296905 (Why is no real title available?)
- On the Generalization Ability of On-Line Learning Algorithms
- Online Learning with Kernels
- Relative loss bounds for multidimensional regression problems
- Relative loss bounds for on-line density estimation with the exponential family of distributions
- The Forgetron: A Kernel-Based Perceptron on a Budget
- The relaxed online maximum margin algorithm
- The robustness of the \(p\)-norm algorithms
Cited in
(27)- Competitive online algorithms for resource allocation over the positive semidefinite cone
- Robust \(H_\infty\) control for nonlinear uncertain switched descriptor systems with time delay and nonlinear input: a sliding mode approach
- Online multiple kernel classification
- Dynamical memory control based on projection technique for online regression
- On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms
- Regrets of proximal method of multipliers for online non-convex optimization with long term constraints
- Parameter learning algorithm for the online data acknowledgment problem
- Linear coupling: an ultimate unification of gradient and mirror descent
- A generalized online mirror descent with applications to classification and regression
- scientific article; zbMATH DE number 7626715 (Why is no real title available?)
- Online learning based on online DCA and application to online classification
- Foundations of online structure theory. II: The operator approach
- Online Learning Meets Optimization in the Dual
- Online learning with (multiple) kernels: a review
- Online Pairwise Learning Algorithms
- Primal Dual Gives Almost Optimal Energy Efficient Online Algorithms
- On the dual formulation of regularized linear systems with convex risks
- Adaptive echo state network with a recursive inverse-free weight update algorithm
- Open issues and recent advances in DC programming and DCA
- Stochastic online optimization for cyber-physical and robotic systems
- Optimal and efficient algorithms for decentralized online convex optimization
- Comparing ad-hoc and MIP-based algorithms for the online facility location problem
- Label ranking through nonparametric regression
- Forecasting the cost of drought events in France by super learning from a short time series of many slightly dependent data
- Efficient projection-free online convex optimization using stochastic gradients
- Online alternating direction method of multipliers for online composite optimization
- Feature-aware regularization for sparse online learning
This page was built for publication: A primal-dual perspective of online learning algorithms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1009218)
