{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,27]],"date-time":"2026-03-27T08:23:52Z","timestamp":1774599832409,"version":"3.50.1"},"reference-count":34,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"10","license":[{"start":{"date-parts":[[2011,10,1]],"date-time":"2011-10-01T00:00:00Z","timestamp":1317427200000},"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":[[2011,10]]},"DOI":"10.1109\/tit.2011.2154375","type":"journal-article","created":{"date-parts":[[2011,5,13]],"date-time":"2011-05-13T18:11:12Z","timestamp":1305310272000},"page":"7036-7056","source":"Crossref","is-referenced-by-count":36,"title":["Information-Based Complexity, Feedback and Dynamics in Convex Programming"],"prefix":"10.1109","volume":"57","author":[{"given":"Maxim","family":"Raginsky","sequence":"first","affiliation":[]},{"given":"Alexander","family":"Rakhlin","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2010.5513381"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1079120131"},{"key":"ref31","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-0711-5","author":"devroye","year":"1996","journal-title":"A Probabilistic Theory of Pattern Recognition"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2110791"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511803161"},{"key":"ref10","author":"agarwal","year":"2010","journal-title":"Information-Theoretic Lower Bounds on the Oracle Complexity of Convex Optimization"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-56468-0"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1142\/4247"},{"key":"ref13","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-4015-8","author":"kallenberg","year":"2002","journal-title":"Foundations of Modern Probability"},{"key":"ref14","author":"gray","year":"1991","journal-title":"Entropy and Information Theory"},{"key":"ref15","author":"traub","year":"1988","journal-title":"Information-Based Complexity"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511600814"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/0330046"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/BF02613654"},{"key":"ref19","author":"fedorov","year":"1972","journal-title":"Theory of Optimal Experiments"},{"key":"ref28","article-title":"How powerful can any regression learning procedure be?","author":"yang","year":"2007","journal-title":"Proc 11th Int Conf Artif Intell Statist"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ALLERTON.2009.5394945"},{"key":"ref27","first-page":"314","article-title":"Convergence and optimality of implementable adaptation algorithms (informational approach)","volume":"20","author":"vil'k","year":"1985","journal-title":"Problems Inf Transm"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1137\/070704277"},{"key":"ref6","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":"ref29","author":"nowak","year":"2009","journal-title":"The Geometry of Generalized Binary Search"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-26771-9_4"},{"key":"ref7","doi-asserted-by":"crossref","DOI":"10.1007\/b13794","author":"tsybakov","year":"2009","journal-title":"Introduction to Nonparametric Estimation"},{"key":"ref2","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4419-8853-9","author":"nesterov","year":"2004","journal-title":"Introductory Lectures on Convex Optimization"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182178"},{"key":"ref1","author":"nemirovski","year":"1983","journal-title":"Problem Complexity and Method Efficiency in Optimization"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1162\/neco.1992.4.4.590"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2008.920189"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1162\/0899766053723032"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1070\/IM1980v015n03ABEH001255"},{"key":"ref23","first-page":"223","article-title":"An interval estimation problem for controlled observations","volume":"10","author":"burnashev","year":"1974","journal-title":"Probl Inf Transm"},{"key":"ref26","author":"cover","year":"2006","journal-title":"Elements of Information Theory"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/18.335943"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/18\/6034704\/05766746.pdf?arnumber=5766746","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:54:23Z","timestamp":1642006463000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5766746\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,10]]},"references-count":34,"journal-issue":{"issue":"10"},"URL":"https:\/\/doi.org\/10.1109\/tit.2011.2154375","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,10]]}}}