Aggregating Algorithm for a Space of Analytic Functions

DOI10.1007/978-3-540-87987-9_20zbMATH Open1156.68525OpenAlexW1516867868MaRDI QIDQ3529922FDOQ3529922

Authors: Mikhail Dashevskiy 

Publication date: 14 October 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-87987-9_20

Recommendations

• Learning Theory
• How to better use expert advice
• Prediction with Expert Advice under Discounted Loss
• The weak aggregating algorithm and weak mixability
• How to use expert advice

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Prediction, Learning, and Games
• Title not available (Why is that?)
• Logarithmic regret algorithms for online convex optimization
• Adaptive and self-confident on-line learning algorithms
• Competitive On-line Statistics
• Relative loss bounds for on-line density estimation with the exponential family of distributions
• Theory and Applications of Models of Computation
• Algorithmic Learning Theory
• Leading Strategies in Competitive On-Line Prediction

Cited In (3)

• Learning Theory
• An upper bound for aggregating algorithm for regression with changing dependencies
• Analysis on Aggregation Function Spaces

This page was built for publication: Aggregating Algorithm for a Space of Analytic Functions

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