✦ LIBER ✦

Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization

✍ Scribed by Agarwal, A.; Bartlett, P.L.; Ravikumar, P.; Wainwright, M.J.

Book ID: 114643064
Publisher: IEEE
Year: 2012
Tongue: English
Weight: 401 KB
Volume: 58
Category: Article
ISSN: 0018-9448
DOI: 10.1109/tit.2011.2182178

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A lower bound on the complexity of the c

A lower bound on the complexity of the convex hull problem for simple polyhedra

✍ Andrew Klapper 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 181 KB

Optimal lower bounds on the contribution

Optimal lower bounds on the contribution margin in the case of stochastic order arrival

✍ Hubert Missbauer 📂 Article 📅 2003 🏛 Springer 🌐 German ⚖ 211 KB

An Optimal Lower Bound on the Communicat

An Optimal Lower Bound on the Communication Complexity of Gap-Hamming-Distance

✍ Chakrabarti, Amit; Regev, Oded 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 278 KB

A lower bound on complexity of optimizat

A lower bound on complexity of optimization under the -fold integrated Wiener measure

✍ James M. Calvin 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 240 KB

[Lecture Notes in Computer Science] LATI

[Lecture Notes in Computer Science] LATIN 2006: Theoretical Informatics Volume 3887 || Exponential Lower Bounds on the Space Complexity of OBDD-Based Graph Algorithms

✍ Correa, José R.; Hevia, Alejandro; Kiwi, Marcos 📂 Article 📅 2006 🏛 Springer Berlin Heidelberg 🌐 German ⚖ 478 KB

This Book Constitutes The Refereed Proceedings Of The 7th International Symposium, Latin American Theoretical Informatics, Latin 2006, Held In March 2006. The 66 Revised Full Papers Presented Together With Seven Invited Papers Were Carefully Reviewed And Selected From 224 Submissions. The Papers Pre