ERC SUBLRN Machine Learning and Optimization Lab

  • Research
  • Publications
  • People
  • Visitors
  • Directions & Contact
Homepage

Near-Optimal Algorithms for Online Matrix Prediction

Elad Hazan, Satyen Kale, Shai Shalev-Shwartz (2012). Near-Optimal Algorithms for Online Matrix Prediction. The 25th conference on learning theory (COLT 2012)

Author Elad HazanPosted on 31/03/201207/01/2014Categories Conference Papers

Post navigation

Previous Previous post: (weak) Calibration is Computationally Hard
Next Next post: The Multiplicative Weights Update Method: A Meta-Algorithm and Applications

Site Search

Recent Publications

  • Distributed Exploration in Multi-Armed Bandits
  • Almost Optimal Exploration in Multi-Armed Bandits
  • Online Learning for Time Series Prediction
  • Playing Non-linear Games with Linear Oracles
  • Better Rates for Any Adversarial Deterministic MDPs
  • Research
  • Publications
  • People
  • Visitors
  • Directions & Contact
ERC SUBLRN Machine Learning and Optimization Lab Proudly powered by WordPress