Optimal Stragies and Minimax Lower Bounds for Online Convex Games

Jacob Abernethy, Peter L. Bartlett, Alexander Rakhlin, Ambuj Tewari. Optimal Stragies and Minimax Lower Bounds for Online Convex Games. In Rocco A. Servedio, Tong Zhang, editors, 21st Annual Conference on Learning Theory - COLT 2008, Helsinki, Finland, July 9-12, 2008. pages 415-424, Omnipress, 2008. [doi]

@inproceedings{AbernethyBRT08,
  title = {Optimal Stragies and Minimax Lower Bounds for Online Convex Games},
  author = {Jacob Abernethy and Peter L. Bartlett and Alexander Rakhlin and Ambuj Tewari},
  year = {2008},
  url = {http://colt2008.cs.helsinki.fi/papers/111-Abernethy},
  researchr = {https://researchr.org/publication/AbernethyBRT08},
  cites = {0},
  citedby = {0},
  pages = {415-424},
  booktitle = {21st Annual Conference on Learning Theory - COLT 2008, Helsinki, Finland, July 9-12, 2008},
  editor = {Rocco A. Servedio and Tong Zhang},
  publisher = {Omnipress},
}