{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:36:14Z","timestamp":1774946174934,"version":"3.50.1"},"reference-count":25,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"5","license":[{"start":{"date-parts":[[2012,5,1]],"date-time":"2012-05-01T00:00:00Z","timestamp":1335830400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2012,5]]},"DOI":"10.1109\/tit.2011.2182178","type":"journal-article","created":{"date-parts":[[2012,1,31]],"date-time":"2012-01-31T21:53:23Z","timestamp":1328046803000},"page":"3235-3249","source":"Crossref","is-referenced-by-count":110,"title":["Information-Theoretic Lower Bounds on the Oracle Complexity of Stochastic Convex Optimization"],"prefix":"10.1109","volume":"58","author":[{"given":"Alekh","family":"Agarwal","sequence":"first","affiliation":[]},{"given":"Peter L.","family":"Bartlett","sequence":"additional","affiliation":[]},{"given":"Pradeep","family":"Ravikumar","sequence":"additional","affiliation":[]},{"given":"Martin J.","family":"Wainwright","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/BF00532480"},{"key":"ref11","doi-asserted-by":"crossref","first-page":"1564","DOI":"10.1214\/aos\/1017939142","article-title":"Information-theoretic determination of minimax rates of convergence","volume":"27","author":"yang","year":"1999","journal-title":"Ann Statist"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref13","author":"vapnik","year":"1974","journal-title":"Theory of Pattern Recognition"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(89)90002-3"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793259185"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-007-5016-8"},{"key":"ref17","article-title":"Beyond the regret minimization barrier: An optimal algorithm for stochastic strongly-convex optimization","author":"hazan","year":"2010","journal-title":"Proc Ann Conf Learning Theory"},{"key":"ref18","author":"juditsky","year":"2010","journal-title":"Primal-dual subgradient methods for minimizing uniformly convex functions"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611"},{"key":"ref4","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization A Basic Course"},{"key":"ref3","author":"bertsekas","year":"1995","journal-title":"Nonlinear Programming"},{"key":"ref6","author":"nemirovski","year":"2010","journal-title":"Efficient methods in convex programming"},{"key":"ref5","author":"nemirovski","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2154375"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1137\/1123095"},{"key":"ref1","article-title":"The tradeoffs of large scale learning","author":"bottou","year":"2008","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1193342380"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2165799"},{"key":"ref21","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4613-0039-7","author":"matousek","year":"2002","journal-title":"Lectures on Discrete Geometry"},{"key":"ref24","doi-asserted-by":"crossref","DOI":"10.1515\/9781400873173","author":"rockafellar","year":"1970","journal-title":"Convex Analysis"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(02)00231-6"},{"key":"ref25","volume":"1","author":"hiriart-urruty","year":"1993","journal-title":"Convex Analysis and Minimization Algorithms"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6185725\/06142067.pdf?arnumber=6142067","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,27]],"date-time":"2021-12-27T13:25:22Z","timestamp":1640611522000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6142067\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5]]},"references-count":25,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2182178","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5]]}}}