Efficient methods for online multiclass logistic regression
From MaRDI portal
Cites work
- A decision-theoretic generalization of on-line learning and an application to boosting
- A game of prediction with expert advice
- Composite convex minimization involving self-concordant-like cost functions
- Logarithmic regret algorithms for online convex optimization
- On the Generalization Ability of On-Line Learning Algorithms
- Self-concordant analysis for logistic regression
This page was built for publication: Efficient methods for online multiclass logistic regression
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028789)