Suboptimal measures of predictive complexity for absolute loss function
From MaRDI portal
Recommendations
Cites work
- A game of prediction with expert advice
- An introduction to Kolmogorov complexity and its applications. 2nd ed
- Complexity Approximation Principle
- How to use expert advice
- scientific article; zbMATH DE number 3291134 (Why is no real title available?)
- 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)- Loss functions, complexities, and the Legendre transformation.
- Most sequences are stochastic
- Extremal relations between additive loss functions and the Kolmogorov complexity
- Mixability and the existence of weak complexities
- Predictive complexity and generalized entropy rate of stationary ergodic processes
- The weight of competence under a realistic loss function
- On the absence of predictive complexity for some games
- Complexity of simple nonlogarithmic loss functions
- Extended stochastic complexity and minimax relative loss analysis
- A criterion for the existence of predictive complexity for binary games
- Worst-case bounds for the logarithmic loss of predictors
- Constructing perfect steganographic systems
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)