Algorithmic Learning Theory
From MaRDI portal
Publication:5395057
DOI10.1007/11564089zbMath1168.68502OpenAlexW4300614359MaRDI QIDQ5395057
Ilia Nouretdinov, Akimichi Takemura, Vladimir Vovk, Glenn R. Shafer
Publication date: 1 November 2006
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/11564089
Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05)
Related Items (10)
On Calibration Error of Randomized Forecasting Algorithms ⋮ Failure of calibration is typical ⋮ Approachability, regret and calibration: implications and equivalences ⋮ Aggregating Algorithm for a Space of Analytic Functions ⋮ Non-asymptotic calibration and resolution ⋮ Leading strategies in competitive on-line prediction ⋮ Implications of contrarian and one-sided strategies for the fair-coin game ⋮ A betting interpretation for probabilities and Dempster-Shafer degrees of belief ⋮ On a simple strategy weakly forcing the strong law of large numbers in the bounded forecasting game ⋮ Prediction with Expert Evaluators’ Advice
This page was built for publication: Algorithmic Learning Theory
