scientific article; zbMATH DE number 1966614

MaRDI QIDQ4420748zbMATH OpenFDO

Authors Yuri Kalnishkan, Michael V. Vyugin

Publication date 18 August 2003

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

Mathematics Subject Classification ID

Computational learning theory (68Q32) Learning and adaptive systems in artificial intelligence (68T05) Applications of game theory (91A80)

Recommendations

• Suboptimal measures of predictive complexity for absolute loss function
• Predictive Complexity for Games with Finite Outcome Spaces
• Algorithmic Learning Theory
• scientific article; zbMATH DE number 2089357
• On complexity of easy predictable sequences

Cited in

(5)

• Suboptimal measures of predictive complexity for absolute loss function
• Predictive Complexity for Games with Finite Outcome Spaces
• scientific article; zbMATH DE number 2089357 (Why is no real title available?)
• Algorithmic Learning Theory
• The weak aggregating algorithm and weak mixability

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 Q4420748)