Combining initial segments of lists
From MaRDI portal
Recommendations
Cites work
- 10.1162/153244303321897654
- 10.1162/1532443041424328
- A decision-theoretic generalization of on-line learning and an application to boosting
- A game of prediction with expert advice
- Adaptive disk spin-down for mobile computers
- Adaptive online prediction by following the perturbed leader
- An Algorithm for the Machine Calculation of Complex Fourier Series
- Combinatorial bandits
- Combining initial segments of lists
- Efficient Tracking of Large Classes of Experts
- Efficient algorithms for online decision problems
- Follow the leader if you can, hedge if you must
- How to use expert advice
- Improved second-order bounds for prediction with expert advice
- Learning permutations with exponential weights
- Necklaces, Convolutions, and X + Y
- On-line sequential bin packing
- Randomized online PCA algorithms with regret bounds that are logarithmic in the dimension
- The weighted majority algorithm
- Tracking the best expert
This page was built for publication: Combining initial segments of lists
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q391737)