Leading strategies in competitive on-line prediction
From MaRDI portal
Publication:950203
DOI10.1016/j.tcs.2008.06.040zbMath1145.62078OpenAlexW2127477275WikidataQ62046717 ScholiaQ62046717MaRDI QIDQ950203
Publication date: 22 October 2008
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2008.06.040
Inference from stochastic processes and prediction (62M20) Applications of functional analysis in probability theory and statistics (46N30)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Calibration-based empirical probability
- Adaptive and self-confident on-line learning algorithms
- Probability, causality and the empirical world: a Bayes-de Finetti-Popper-Borel synthesis
- Zufälligkeit und Wahrscheinlichkeit. Eine algorithmische Begründung der Wahrscheinlichkeitstheorie. (Randomness and probability. An algorithmic foundation of probability theory)
- Probability and Finance
- 10.1162/153244301753683726
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- Merging of Opinions with Increasing Information
- Complexity-based induction systems: Comparisons and convergence theorems
- ON THE QUESTION OF ABSOLUTE CONTINUITY AND SINGULARITY OF PROBABILITY MEASURES
- Asymptotic calibration
- Function Classes That Approximate the Bayes Risk
- Competing with Wild Prediction Rules
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Algorithmic Learning Theory
- Prediction, Learning, and Games
- The definition of random sequences
- Theory of Reproducing Kernels
- Probability theory for the Brier game
- Relative loss bounds for on-line density estimation with the exponential family of distributions
- Relative loss bounds for multidimensional regression problems
