The following pages link to A closer look at adaptive regret (Q2810792):
Displaying 8 items.
- Online aggregation of unbounded losses using shifting experts with confidence (Q669288) (← links)
- Extracting certainty from uncertainty: regret bounded by variation in costs (Q1959595) (← links)
- Aggregating algorithm for prediction of packs (Q2320552) (← links)
- Approachability, regret and calibration: implications and equivalences (Q2438352) (← links)
- A Closer Look at Adaptive Regret (Q3164827) (← links)
- Adaptive Regret Minimization in Bounded-Memory Games (Q3190039) (← links)
- Towards Optimal Algorithms for Prediction with Expert Advice (Q4575616) (← links)
- Tight Lower Bounds for Multiplicative Weights Algorithmic Families (Q5111379) (← links)