Tractability of batch to sequential conversion

DOI10.1016/J.TCS.2018.04.037zbMATH Open1393.68151OpenAlexW2801682044MaRDI QIDQ2636409FDOQ2636409

Authors: Marcus Hutter 

Publication date: 5 June 2018

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.04.037

Recommendations

• Offline to online conversion
• scientific article; zbMATH DE number 67625
• Sequential Procedures for Aggregating Arbitrary Estimators of a Conditional Mean
• Online learning via sequential complexities
• Optimal sequential probability assignment for individual sequences

zbMATH Keywords

batchpredictiononlineBayescombinatoricsestimationprobabilitytime-consistencyLaplacenormalizationsequentialregrettractableofflineGood-TuringRistad

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Sequential estimation (62L12) Analysis of algorithms and problem complexity (68Q25)

Cites Work

• Title not available (Why is that?)
• THE POPULATION FREQUENCIES OF SPECIES AND THE ESTIMATION OF POPULATION PARAMETERS
• Minimum complexity density estimation
• Computational Complexity
• Asymptotics of Discrete MDL for Online Prediction
• Complexity-based induction systems: Comparisons and convergence theorems
• Universal artificial intelligence. Sequential decisions based on algorithmic probability.
• 10.1162/1532443041827952
• Offline to online conversion
• Indefinitely oscillating martingales
• On Turing's formula for word probabilities

Cited In (1)

• Offline to online conversion

This page was built for publication: Tractability of batch to sequential conversion

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