Online Learning Based on Online DCA and Application to Online Classification
From MaRDI portal
Publication:5131197
DOI10.1162/neco_a_01266zbMath1468.68157OpenAlexW3006977717WikidataQ89758816 ScholiaQ89758816MaRDI QIDQ5131197
Publication date: 2 November 2020
Published in: Neural Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1162/neco_a_01266
Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)
Related Items (5)
Alternating DC algorithm for partial DC programming problems ⋮ Alternating DCA for reduced-rank multitask linear regression with covariance matrix estimation ⋮ Regrets of proximal method of multipliers for online non-convex optimization with long term constraints ⋮ Open issues and recent advances in DC programming and DCA ⋮ DC programming and DCA: thirty years of developments
Uses Software
Cites Work
- DCA based algorithms for feature selection in multi-class support vector machine
- Exponentiated gradient versus gradient descent for linear predictors
- The robustness of the \(p\)-norm algorithms
- A primal-dual perspective of online learning algorithms
- Convex analysis approach to d. c. programming: Theory, algorithms and applications
- DC programming and DCA: thirty years of developments
- The DC (Difference of convex functions) programming and DCA revisited with DC models of real world nonconvex optimization problems
- Group variable selection via \(\ell_{p,0}\) regularization and application to optimal scoring
- Efficient algorithms for online decision problems
- A unified DC programming framework and efficient DCA based approaches for large scale batch reinforcement learning
- Transactions on Computational Collective Intelligence XIII
- 10.1162/15324430260185600
- Online Learning and Online Convex Optimization
- A D.C. Optimization Algorithm for Solving the Trust-Region Subproblem
- Logarithmic Regret Algorithms for Online Convex Optimization
- Sparse Covariance Matrix Estimation by DCA-Based Algorithms
- Prediction by Categorical Features: Generalization Properties and Application to Feature Ranking
- Prediction, Learning, and Games
- Relative loss bounds for on-line density estimation with the exponential family of distributions
- Relative loss bounds for multidimensional regression problems
- The relaxed online maximum margin algorithm
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Online Learning Based on Online DCA and Application to Online Classification
