Pages that link to "Item:Q5959950"
From MaRDI portal
The following pages link to Relative loss bounds for multidimensional regression problems (Q5959950):
Displaying 13 items.
- Online variance minimization (Q420931) (← links)
- A generalized online mirror descent with applications to classification and regression (Q493737) (← links)
- Leading strategies in competitive on-line prediction (Q950203) (← links)
- A new convex objective function for the supervised learning of single-layer neural networks (Q962791) (← links)
- A primal-dual perspective of online learning algorithms (Q1009218) (← links)
- Logarithmic regret algorithms for online convex optimization (Q1009221) (← links)
- Adaptive and self-confident on-line learning algorithms (Q1604218) (← links)
- Relative expected instantaneous loss bounds (Q1604219) (← links)
- Analysis of two gradient-based algorithms for on-line regression (Q1970199) (← links)
- Forward-backward splitting with Bregman distances (Q2405497) (← links)
- Recursive aggregation of estimators by the mirror descent algorithm with averaging (Q2432961) (← links)
- (Q5053185) (← links)
- Online Learning Based on Online DCA and Application to Online Classification (Q5131197) (← links)
