Near-Optimal Algorithms for Online Matrix Prediction

DOI10.1137/120895731zbMath1370.68253arXiv1204.0136OpenAlexW1773217197MaRDI QIDQ5737809

Elad Hazan, Satyen Kale, Shai Shalev-Shwartz

Publication date: 30 May 2017

Published in: SIAM Journal on Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1204.0136

zbMATH Keywords

online learningmatrix multiplicative weightsmatrix prediction

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Online algorithms; streaming algorithms (68W27)

Related Items (3)

Online learning for min-max discrete problems ⋮ Near-Optimal Algorithms for Online Matrix Prediction ⋮ Learning Hurdles for Sleeping Experts

Cites Work

• Regret bounds for sleeping experts and bandits
• Efficient algorithms for online decision problems
• Exact matrix completion via convex optimization
• Learning hurdles for sleeping experts
• The best constants in the Khintchine inequality
• Efficient Transductive Online Learning via Randomized Rounding
• Prediction, Learning, and Games
• Understanding Machine Learning
• Near-Optimal Algorithms for Online Matrix Prediction
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Near-Optimal Algorithms for Online Matrix Prediction