ERC SUBLRN Machine Learning and Optimization Lab

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

Better Rates for Any Adversarial Deterministic MDPs

Ofer Dekel, Elad Hazan (2013). Better Rates for Any Adversarial Deterministic MDPs. The 30th International Conference on Machine Learning (ICML 2013)

Author Elad HazanPosted on 16/01/201307/01/2014Categories Conference Papers

Post navigation

Previous Previous post: A Polylog Pivot Steps Simplex Algorithm for Classification
Next Next post: Playing Non-linear Games with Linear Oracles

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