{"id":"https://openalex.org/W2155192981","doi":"https://doi.org/10.1109/tit.2011.2154375","title":"Information-Based Complexity, Feedback and Dynamics in Convex Programming","display_name":"Information-Based Complexity, Feedback and Dynamics in Convex Programming","publication_year":2011,"publication_date":"2011-05-13","ids":{"openalex":"https://openalex.org/W2155192981","doi":"https://doi.org/10.1109/tit.2011.2154375","mag":"2155192981"},"language":"en","primary_location":{"id":"doi:10.1109/tit.2011.2154375","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2154375","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044844161","display_name":"Maxim Raginsky","orcid":"https://orcid.org/0000-0002-5586-9219"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Maxim Raginsky","raw_affiliation_strings":["Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076656836","display_name":"Alexander Rakhlin","orcid":"https://orcid.org/0000-0003-1359-8534"},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Rakhlin","raw_affiliation_strings":["Department of Statistics, Wharton School of Business, University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"Department of Statistics, Wharton School of Business, University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5044844161"],"corresponding_institution_ids":["https://openalex.org/I170897317"],"apc_list":null,"apc_paid":null,"fwci":8.7702,"has_fulltext":false,"cited_by_count":72,"citation_normalized_percentile":{"value":0.97715203,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"57","issue":"10","first_page":"7036","last_page":"7056"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9991999864578247,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/oracle","display_name":"Oracle","score":0.7362055778503418},{"id":"https://openalex.org/keywords/minimax","display_name":"Minimax","score":0.7258040904998779},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.6078993678092957},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5981907248497009},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5732603669166565},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.5460200905799866},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4745282232761383},{"id":"https://openalex.org/keywords/generality","display_name":"Generality","score":0.43105506896972656},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.40855926275253296},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3038865327835083},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2743208110332489}],"concepts":[{"id":"https://openalex.org/C55166926","wikidata":"https://www.wikidata.org/wiki/Q2892946","display_name":"Oracle","level":2,"score":0.7362055778503418},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.7258040904998779},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.6078993678092957},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5981907248497009},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5732603669166565},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.5460200905799866},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4745282232761383},{"id":"https://openalex.org/C2780767217","wikidata":"https://www.wikidata.org/wiki/Q5532421","display_name":"Generality","level":2,"score":0.43105506896972656},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40855926275253296},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3038865327835083},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2743208110332489},{"id":"https://openalex.org/C542102704","wikidata":"https://www.wikidata.org/wiki/Q183257","display_name":"Psychotherapist","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C115903868","wikidata":"https://www.wikidata.org/wiki/Q80993","display_name":"Software engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/tit.2011.2154375","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tit.2011.2154375","pdf_url":null,"source":{"id":"https://openalex.org/S4502562","display_name":"IEEE Transactions on Information Theory","issn_l":"0018-9448","issn":["0018-9448","1557-9654"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE Transactions on Information Theory","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16","score":0.7099999785423279}],"awards":[{"id":"https://openalex.org/G1423005404","display_name":"CIF: Small: Distributed Online Decision-Making in Large-Scale Networks","funder_award_id":"1017564","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2962813698","display_name":null,"funder_award_id":"CCF-1017564","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4447687137","display_name":"CAREER: Statistical and Computational Complexities of Modern Learning Problems","funder_award_id":"0954737","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G6671297155","display_name":null,"funder_award_id":"CAREER","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320314997","display_name":"Strong","ror":"https://ror.org/041vyzr56"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":39,"referenced_works":["https://openalex.org/W413527737","https://openalex.org/W1495491089","https://openalex.org/W1496462336","https://openalex.org/W1503425191","https://openalex.org/W1505043854","https://openalex.org/W1505731132","https://openalex.org/W1511694993","https://openalex.org/W1524622012","https://openalex.org/W1538452572","https://openalex.org/W1564947197","https://openalex.org/W1965313644","https://openalex.org/W1992208280","https://openalex.org/W2017170340","https://openalex.org/W2025410634","https://openalex.org/W2039110673","https://openalex.org/W2043919728","https://openalex.org/W2086161653","https://openalex.org/W2096840748","https://openalex.org/W2098740202","https://openalex.org/W2101210333","https://openalex.org/W2106447856","https://openalex.org/W2115305054","https://openalex.org/W2122678453","https://openalex.org/W2124541940","https://openalex.org/W2142092335","https://openalex.org/W2143891888","https://openalex.org/W2144578442","https://openalex.org/W2144792840","https://openalex.org/W2156675727","https://openalex.org/W2418833220","https://openalex.org/W2478708596","https://openalex.org/W2551284144","https://openalex.org/W2569481888","https://openalex.org/W2963912441","https://openalex.org/W3103871524","https://openalex.org/W4210736171","https://openalex.org/W4292027056","https://openalex.org/W4298031531","https://openalex.org/W6629743318"],"related_works":["https://openalex.org/W2074145420","https://openalex.org/W2756132392","https://openalex.org/W3035814349","https://openalex.org/W4285101096","https://openalex.org/W4320477335","https://openalex.org/W2518949622","https://openalex.org/W2084892497","https://openalex.org/W4382725876","https://openalex.org/W2115614142","https://openalex.org/W2275184629"],"abstract_inverted_index":{"We":[0,54],"study":[1],"the":[2,10,17,31,36,65,75,83,91,94,103,115,120,127,145,167,172,177,181,185,188,206,210,224],"intrinsic":[3],"limitations":[4],"of":[5,12,20,85,96,117,129,147,169,187,213,227],"sequential":[6,133],"convex":[7],"optimization":[8,86,134,163,178],"through":[9],"lens":[11],"feedback":[13],"information":[14,29,73,148],"theory.":[15],"In":[16,158],"oracle":[18,26,92],"model":[19],"optimization,":[21,216],"an":[22,25],"algorithm":[23,66,135,179],"queries":[24,51],"for":[27,59,199],"noisy":[28],"about":[30,74],"unknown":[32],"objective":[33],"function":[34,43,61],"and":[35,93,220],"goal":[37],"is":[38,123,152],"to":[39,62,70,102,109,154,194,223],"(approximately)":[40],"minimize":[41],"every":[42],"in":[44,57,78,106,126,139,156,215],"a":[45,60,132,140,200],"given":[46],"class":[47],"using":[48],"as":[49,52,176],"few":[50],"possible.":[53],"show":[55,161],"that,":[56,124],"order":[58],"be":[63,68],"optimized,":[64],"must":[67],"able":[69],"accumulate":[71],"enough":[72],"objective.":[76],"This,":[77],"turn,":[79],"puts":[80],"limits":[81],"on":[82,90,114],"speed":[84],"under":[87],"specific":[88],"assumptions":[89],"type":[95],"feedback.":[97],"Our":[98],"techniques":[99],"are":[100],"akin":[101],"ones":[104],"used":[105],"statistical":[107],"literature":[108],"obtain":[110],"minimax":[111],"lower":[112,197],"bounds":[113,198],"risks":[116],"estimation":[118],"procedures;":[119],"notable":[121],"difference":[122],"unlike":[125],"case":[128],"i.i.d.":[130],"data,":[131],"can":[136],"gather":[137],"observations":[138],"controlled":[141],"manner,":[142],"so":[143],"that":[144,162],"amount":[146],"at":[149],"each":[150],"step":[151],"allowed":[153],"change":[155],"time.":[157],"particular,":[159],"we":[160,190],"algorithms":[164],"often":[165],"obey":[166],"law":[168],"diminishing":[170],"returns:":[171],"signal-to-noise":[173],"ratio":[174],"drops":[175],"approaches":[180],"optimum.":[182],"To":[183],"underscore":[184],"generality":[186],"tools,":[189],"use":[191],"our":[192],"approach":[193],"derive":[195],"fundamental":[196],"certain":[201],"active":[202,221],"learning":[203,222],"problem.":[204],"Overall,":[205],"present":[207],"work":[208],"connects":[209],"intuitive":[211],"notions":[212],"\u201cinformation\u201d":[214],"experimental":[217],"design,":[218],"estimation,":[219],"quantitative":[225],"notion":[226],"Shannon":[228],"information.":[229]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":6},{"year":2021,"cited_by_count":7},{"year":2020,"cited_by_count":5},{"year":2019,"cited_by_count":7},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":8},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":5},{"year":2014,"cited_by_count":9},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}