Relative loss bounds for multidimensional regression problems
From MaRDI portal
Recommendations
- Analysis of two gradient-based algorithms for on-line regression
- Adaptive and self-confident on-line learning algorithms
- scientific article; zbMATH DE number 1390070
- Relative loss bounds for on-line density estimation with the exponential family of distributions
- Relative expected instantaneous loss bounds
Cited in
(16)- A primal-dual perspective of online learning algorithms
- Logarithmic regret algorithms for online convex optimization
- Adaptive and self-confident on-line learning algorithms
- Relative expected instantaneous loss bounds
- Analysis of two gradient-based algorithms for on-line regression
- Forward-backward splitting with Bregman distances
- Recursive aggregation of estimators by the mirror descent algorithm with averaging
- Online variance minimization
- scientific article; zbMATH DE number 1390070 (Why is no real title available?)
- A generalized online mirror descent with applications to classification and regression
- scientific article; zbMATH DE number 7626715 (Why is no real title available?)
- On Loss Functions and Regret Bounds for Multi-Category Classification
- Online learning based on online DCA and application to online classification
- Large-scale parametric survival analysis
- Leading strategies in competitive on-line prediction
- A new convex objective function for the supervised learning of single-layer neural networks
This page was built for publication: Relative loss bounds for multidimensional regression problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5959950)
