High-confidence predictions under adversarial uncertainty

DOI10.1145/2090236.2090237zbMath1347.68362arXiv1101.4446OpenAlexW2145952175MaRDI QIDQ5890924

Andrew Drucker

Publication date: 7 October 2016

Published in: Proceedings of the 3rd Innovations in Theoretical Computer Science Conference (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1101.4446

zbMATH Keywords

binary sequencesignorant forecasting

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Randomized algorithms (68W20) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87)

Related Items (1)

Chasing Ghosts: Competing with Stateful Policies

Cites Work

• Unnamed Item
• The reproducible properties of correct forecasts
• The dimensions of individual strings and sequences
• Effective Strong Dimension in Algorithmic Information and Computational Complexity
• The Complexity of Forecast Testing
• The Well-Calibrated Bayesian
• Asymptotic calibration
• Dimension in Complexity Classes
• Universal prediction
• THE FRACTIONAL DIMENSION OF A SET DEFINED BY DECIMAL PROPERTIES

This page was built for publication: High-confidence predictions under adversarial uncertainty