On Sequences with Non-learnable Subsequences

DOI10.1007/978-3-540-79709-8_31MaRDI QIDQ3503648zbMATH OpenOpenAlexFDO

Authors Vladimir V. V'yugin

Publication date 5 June 2008

Published in Computer Science – Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-79709-8_31

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Non-stochastic infinite and finite sequences
• High-confidence predictions under adversarial uncertainty
• Universal forecasting algorithms
• On universal algorithms for adaptive forecasting
• Asymptotic calibration

Cites work

• Any Inspection is Manipulable
• Asymptotic calibration
• Calibration with Many Checking Rules
• Calibration-based empirical probability
• scientific article; zbMATH DE number 3291134 (Why is no real title available?)
• Learning Theory
• Non-stochastic infinite and finite sequences
• Self-Calibrating Priors Do Not Exist
• THE COMPLEXITY OF FINITE OBJECTS AND THE DEVELOPMENT OF THE CONCEPTS OF INFORMATION AND RANDOMNESS BY MEANS OF THE THEORY OF ALGORITHMS
• The Well-Calibrated Bayesian

Cited in

(9)

• On calibration error of randomized forecasting algorithms
• Non-stochastic infinite and finite sequences
• The complexity of learning SUBSEQ(A)
• On Calibration Error of Randomized Forecasting Algorithms
• scientific article; zbMATH DE number 1984563 (Why is no real title available?)
• Degrees of randomized computability
• Calibration with Many Checking Rules
• Kolmogorov complexity in the USSR (1975--1982): isolation and its end
• On universal algorithms for adaptive forecasting

This page was built for publication: On Sequences with Non-learnable Subsequences

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