Tag
This paper proposes algorithms for sequential prediction under a lying oracle in stochastic and adversarial settings, proving logarithmic regret bounds for the cost function capturing prediction complexity.