Relative expected instantaneous loss bounds
From MaRDI portal
Publication:1604219
DOI10.1006/jcss.2001.1798zbMath1006.68163OpenAlexW2043800867MaRDI QIDQ1604219
Jürgen Forster, Manfred K. Warmuth
Publication date: 4 July 2002
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jcss.2001.1798
Related Items (6)
Fully online classification by regularization ⋮ Bernstein polynomials and learning theory ⋮ Unnamed Item ⋮ Online regularized generalized gradient classification algorithms ⋮ Suboptimality of constrained least squares and improvements via non-linear predictors ⋮ Distribution-free robust linear regression
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Universal sequential coding of single messages
- Predicting \(\{ 0,1\}\)-functions on randomly drawn points
- On weak learning
- Prediction in the worst case
- Minimax redundancy for the class of memoryless sources
- A decision-theoretic extension of stochastic complexity and its applications to learning
- Neural Network Learning
- Relative loss bounds for on-line density estimation with the exponential family of distributions
- Relative loss bounds for multidimensional regression problems
This page was built for publication: Relative expected instantaneous loss bounds