Generalised entropies and asymptotic complexities of languages

DOI10.1016/j.ic.2014.01.001zbMath1360.68527OpenAlexW1991301648WikidataQ62046662 ScholiaQ62046662MaRDI QIDQ2252524

Michael V. Vyugin, Yuri Kalnishkan, Vladimir Vovk

Publication date: 18 July 2014

Published in: Information and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ic.2014.01.001

Mathematics Subject Classification ID

Computational learning theory (68Q32) Measures of information, entropy (94A17)

Related Items (2)

UNIVERSAL CODING AND PREDICTION ON ERGODIC RANDOM POINTS ⋮ Predictive Complexity for Games with Finite Outcome Spaces

Cites Work

• The weak aggregating algorithm and weak mixability
• Fractal dimension and logarithmic loss unpredictability.
• Loss functions, complexities, and the Legendre transformation.
• Prediction and dimension
• Noiseless coding of combinatorial sources, Hausdorff dimension, and Kolmogorov complexity
• Game theory, maximum entropy, minimum discrepancy and robust Bayesian decision theory
• How many strings are easy to predict?
• Probability Inequalities for Sums of Bounded Random Variables
• Generalised Entropy and Asymptotic Complexities of Languages
• Prediction, Learning, and Games
• An introduction to Kolmogorov complexity and its applications
• General linear relations between different types of predictive complexity
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Generalised entropies and asymptotic complexities of languages