Competing with wild prediction rules

DOI10.1007/s10994-007-5021-yzbMath1470.68193OpenAlexW2163684670WikidataQ62046723 ScholiaQ62046723MaRDI QIDQ1009222

Vladimir Vovk

Publication date: 31 March 2009

Published in: Machine Learning (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10994-007-5021-y

zbMATH Keywords

Banach function spacecompetitive online predictionsquare loss regression

Mathematics Subject Classification ID

Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Exponentiated gradient versus gradient descent for linear predictors
• On the uniform convexity of \(L^p\) and \(l^p\)
• The modulus of convexity in normed linear spaces
• Clarkson's inequalities, Besov spaces and Triebel-Sobolev spaces
• Adaptive and self-confident on-line learning algorithms
• 10.1162/153244302760185252
• Leading Strategies in Competitive On-Line Prediction
• On the moduli of convexity and smoothness
• Clarkson and Random Clarkson Inequalities forLr(X)
• On Moduli of Convexity in Banach Spaces
• Competing with Wild Prediction Rules
• Convex Analysis
• ON IMBEDDING, CONTINUATION AND APPROXIMATION THEOREMS FOR DIFFERENTIABLE FUNCTIONS OF SEVERAL VARIABLES
• Theory of Reproducing Kernels
• Theory and Applications of Models of Computation

This page was built for publication: Competing with wild prediction rules