The weak aggregating algorithm and weak mixability

DOI10.1016/j.jcss.2007.08.003zbMath1157.68058OpenAlexW2059590802MaRDI QIDQ959895

Yuri Kalnishkan, Michael V. Vyugin

Publication date: 12 December 2008

Published in: Journal of Computer and System Sciences (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jcss.2007.08.003

zbMATH Keywords

prediction with expert adviceon-line learninggeneral loss functionspredicting individual sequences

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (12)

Dynamic cyber risk estimation with competitive quantile autoregression ⋮ Distribution-free solutions to the extended multi-period newsboy problem ⋮ Universal portfolio selection strategy by aggregating online expert advice ⋮ Online ordering policies for a two-product, multi-period stationary newsvendor problem ⋮ Online ordering rules for the multi-period newsvendor problem with quantity discounts ⋮ Weak aggregating algorithm for the distribution-free perishable inventory problem ⋮ Competitive strategies for two-product, multi-period stationary newsvendor problem with budget constraint ⋮ Generalised entropies and asymptotic complexities of languages ⋮ Probability-free solutions to the non-stationary newsvendor problem ⋮ Predictive Complexity for Games with Finite Outcome Spaces ⋮ A two-product, multi-period nonstationary newsvendor problem with budget constraint ⋮ Aggregating expert advice strategy for online portfolio selection with side information

Cites Work

• A game of prediction with expert advice
• How to use expert advice
• Sequential prediction of individual sequences under general loss functions
• Prediction, Learning, and Games
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The weak aggregating algorithm and weak mixability