Suboptimal measures of predictive complexity for absolute loss function
From MaRDI portal
Recommendations
Cites work
- scientific article; zbMATH DE number 1010621 (Why is no real title available?)
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- A game of prediction with expert advice
- Complexity Approximation Principle
- How to use expert advice
- Present Position and Potential Developments: Some Personal Views: Statistical Theory: The Prequential Approach
- Stochastic complexity and modeling
- THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
- The weighted majority algorithm
Cited in
(12)- Most sequences are stochastic
- Complexity of simple nonlogarithmic loss functions
- Predictive complexity and generalized entropy rate of stationary ergodic processes
- Constructing perfect steganographic systems
- Loss functions, complexities, and the Legendre transformation.
- Algorithmic Learning Theory
- Extremal relations between additive loss functions and the Kolmogorov complexity
- Worst-case bounds for the logarithmic loss of predictors
- scientific article; zbMATH DE number 2089357 (Why is no real title available?)
- scientific article; zbMATH DE number 1966614 (Why is no real title available?)
- scientific article; zbMATH DE number 1453026 (Why is no real title available?)
- The weight of competence under a realistic loss function
This page was built for publication: Suboptimal measures of predictive complexity for absolute loss function
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1854535)