Relative loss bounds for multidimensional regression problems
From MaRDI portal
Publication:5959950
DOI10.1023/A:1017938623079zbMath0998.68097MaRDI QIDQ5959950
Manfred K. Warmuth, Jyrki Kivinen
Publication date: 11 April 2002
Published in: Machine Learning (Search for Journal in Brave)
Related Items (13)
Forward-backward splitting with Bregman distances ⋮ Online variance minimization ⋮ Recursive aggregation of estimators by the mirror descent algorithm with averaging ⋮ Online Learning Based on Online DCA and Application to Online Classification ⋮ Analysis of two gradient-based algorithms for on-line regression ⋮ A generalized online mirror descent with applications to classification and regression ⋮ Leading strategies in competitive on-line prediction ⋮ Unnamed Item ⋮ A new convex objective function for the supervised learning of single-layer neural networks ⋮ 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
This page was built for publication: Relative loss bounds for multidimensional regression problems
