✦ LIBER ✦

Logarithmic regret algorithms for online convex optimization

✍ Scribed by Elad Hazan; Amit Agarwal; Satyen Kale

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Preemptive Online Scheduling: Optimal Al

✍ Tomáš Ebenlendr; Wojciech Jawor; Jiří Sgall 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 425 KB

Optimal algorithms for integrating conve

✍ I.A. Glinkin 📂 Article 📅 1983 🏛 Elsevier Science ⚖ 393 KB

An optimal online algorithm for halfplan

✍ Jigang Wu; Yongchang Ji; Guoliang Chen 📂 Article 📅 2000 🏛 Springer 🌐 English ⚖ 335 KB

Optimal semi-online algorithm for schedu

✍ Xiao Min; Jing Liu; Yuqing Wang 📂 Article 📅 2010 🏛 Springer US 🌐 English ⚖ 358 KB

Generalized proximal point algorithm for

✍ D. Medhi; C. D. Ha 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 533 KB

Convex Optimization Algorithms for Coope

✍ Ming-Yong LIU; Wen-Bai LI; Xuan PEI 📂 Article 📅 2010 🏛 Elsevier ⚖ 434 KB