ERC SUBLRN Machine Learning and Optimization Lab

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

Approximating Semidefinite Programs in Sublinear Time

Dan Garber, Elab Hazan (2011). Approximating Semidefinite Programs in Sublinear Time. Advances in Neural Information Processing Systems (NIPS) 24 2011

Author Elad HazanPosted on 12/12/201107/01/2014Categories Conference Papers

Post navigation

Previous Previous post: Universal MMSE Filtering With Logarithmic Adaptive Regret
Next Next post: Beating SGD: Learning SVMs in Sublinear Time

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