scientific article; zbMATH DE number 2089356

MaRDI QIDQ3046697zbMATH OpenFDO

Authors Michael V. Vyugin, Vladimir V. V'yugin

Publication date 12 August 2004

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2375/23750090.htm

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Predictive complexity and information
• On complexity of easy predictable sequences
• Predictability, complexity, and learning
• scientific article; zbMATH DE number 2080658
• General linear relations between different types of predictive complexity

Cited in

(17)

• Prediction, retrodiction, and the amount of information stored in the present
• Predictive complexity and information
• Quantifying predictability through information theory: small sample estimation in a non-Gaussian framework
• Suboptimal measures of predictive complexity for absolute loss function
• On complexity of easy predictable sequences
• How many strings are easy to predict?
• Predictability, complexity, and learning
• Asymmetry of the Kolmogorov complexity of online predicting odd and even bits
• Predictive complexity and generalized entropy rate of stationary ergodic processes
• Simulation complexity
• scientific article; zbMATH DE number 2080658 (Why is no real title available?)
• scientific article; zbMATH DE number 1834031 (Why is no real title available?)
• Predictability: An Information-Theoretic Perspective
• scientific article; zbMATH DE number 1453049 (Why is no real title available?)
• How many strings are easy to predict?
• General linear relations between different types of predictive complexity
• Predictive information and explorative behavior of autonomous robots

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3046697)