Extremal relations between additive loss functions and the Kolmogorov complexity
From MaRDI portal
Publication:2388461
Recommendations
- Extended stochastic complexity and minimax relative loss analysis
- Complexity of simple nonlogarithmic loss functions
- Non-linear inequalities between predictive and Kolmogorov complexities
- Suboptimal measures of predictive complexity for absolute loss function
- Loss functions, complexities, and the Legendre transformation
- An additivity theorem for plain Kolmogorov complexity
- Extracting Kolmogorov Complexity with Applications to Dimension Zero-One Laws
- Extracting Kolmogorov complexity with applications to dimension zero-one laws
- Computational complexity of loss networks
- ON THE ASYMPTOTIC EQUIVALENCE OF HELLINGER DISTANCE AND KULLBACK-LEIBLER LOSS
Cited in
(2)
This page was built for publication: Extremal relations between additive loss functions and the Kolmogorov complexity
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2388461)