scientific article; zbMATH DE number 1301979
From MaRDI portal
Publication:4247216
Recommendations
Cited in
(11)- Predicting a binary sequence almost as well as the optimal biased coin
- On prediction of individual sequences
- Prediction in the worst case
- The fundamental nature of the log loss function
- Asymptotic minimax regret for data compression, gambling, and prediction
- scientific article; zbMATH DE number 7014218 (Why is no real title available?)
- scientific article; zbMATH DE number 1453026 (Why is no real title available?)
- Worst-case bounds for the logarithmic loss of predictors
- Minimax rates for conditional density estimation via empirical entropy
- A tight excess risk bound via a unified PAC-Bayesian-Rademacher-Shtarkov-MDL complexity
- Sensor networks: from dependence analysis via matroid bases to online synthesis
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 Q4247216)