Optimal Online Prediction in Adversarial Environments
暂无分享,去创建一个
In many prediction problems, including those that arise in computer security and computational finance, the process generating the data is best modelled as an adversary with whom the predictor competes. Even decision problems that are not inherently adversarial can be usefully modeled in this way, since the assumptions are sufficiently weak that effective prediction strategies for adversarial settings are very widely applicable.
[1] Peter L. Bartlett,et al. Adaptive Online Gradient Descent , 2007, NIPS.
[2] P. Bartlett,et al. Optimal strategies and minimax lower bounds for online convex games [Technical Report No. UCB/EECS-2008-19] , 2008 .
[3] Peter L. Bartlett,et al. A Stochastic View of Optimal Regret through Minimax Duality , 2009, COLT.