The last-step minimax algorithm

DOI10.1007/3-540-40992-0_21MaRDI QIDQ4473253zbMATH OpenFDO

Authors Eiji Takimoto, Manfred K. Warmuth

Publication date 4 August 2004

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

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

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Relative loss bounds for on-line density estimation with the exponential family of distributions
• Weighted last-step min-max algorithm with improved sub-logarithmic regret
• Weighted last-step min-max algorithm with improved sub-logarithmic regret
• How to better use expert advice
• On-line maximum likelihood prediction with respect to general loss functions

Cited in

(6)

• A predictive approach to measuring the strength of statistical evidence for single and multiple comparisons
• Weighted last-step min-max algorithm with improved sub-logarithmic regret
• Weighted last-step min-max algorithm with improved sub-logarithmic regret
• Minimum description length revisited
• scientific article; zbMATH DE number 7625184 (Why is no real title available?)
• On-Line Estimation with the Multivariate Gaussian Distribution

This page was built for publication: The last-step minimax algorithm

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