{"id":"https://openalex.org/W1995594966","doi":"https://doi.org/10.1109/cdc.2012.6425811","title":"On the convergence of joint schemes for online computation and supervised learning","display_name":"On the convergence of joint schemes for online computation and supervised learning","publication_year":2012,"publication_date":"2012-12-01","ids":{"openalex":"https://openalex.org/W1995594966","doi":"https://doi.org/10.1109/cdc.2012.6425811","mag":"1995594966"},"language":"en","primary_location":{"id":"doi:10.1109/cdc.2012.6425811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6425811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-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/A5100712102","display_name":"Hao Jiang","orcid":"https://orcid.org/0000-0001-5891-6044"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Hao Jiang","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, IL, USA","Department of Industrial and Enterprise Systems Engineering at the University of Illinois, Urbana 61801, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering at the University of Illinois, Urbana 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5047034022","display_name":"Uday V. Shanbhag","orcid":"https://orcid.org/0000-0001-5869-9561"},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Uday V. Shanbhag","raw_affiliation_strings":["Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, IL, USA","Department of Industrial and Enterprise Systems Engineering at the University of Illinois, Urbana 61801, USA"],"affiliations":[{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Department of Industrial and Enterprise Systems Engineering at the University of Illinois, Urbana 61801, USA","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5100712102"],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":0.3999,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.65725217,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"4462","last_page":"4467"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9929999709129333,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T10328","display_name":"Supply Chain and Inventory Management","score":0.9927999973297119,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9891999959945679,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/parameterized-complexity","display_name":"Parameterized complexity","score":0.5726107358932495},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5359125733375549},{"id":"https://openalex.org/keywords/convex-optimization","display_name":"Convex optimization","score":0.5213747620582581},{"id":"https://openalex.org/keywords/iterated-function","display_name":"Iterated function","score":0.5101037621498108},{"id":"https://openalex.org/keywords/monotone-polygon","display_name":"Monotone polygon","score":0.4877112805843353},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4828117787837982},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4613859951496124},{"id":"https://openalex.org/keywords/variational-inequality","display_name":"Variational inequality","score":0.46114760637283325},{"id":"https://openalex.org/keywords/convex-function","display_name":"Convex function","score":0.44751593470573425},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.44705361127853394},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.4209912419319153},{"id":"https://openalex.org/keywords/regular-polygon","display_name":"Regular polygon","score":0.2623332738876343},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.23236969113349915}],"concepts":[{"id":"https://openalex.org/C165464430","wikidata":"https://www.wikidata.org/wiki/Q1570441","display_name":"Parameterized complexity","level":2,"score":0.5726107358932495},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5359125733375549},{"id":"https://openalex.org/C157972887","wikidata":"https://www.wikidata.org/wiki/Q463359","display_name":"Convex optimization","level":3,"score":0.5213747620582581},{"id":"https://openalex.org/C140479938","wikidata":"https://www.wikidata.org/wiki/Q5254619","display_name":"Iterated function","level":2,"score":0.5101037621498108},{"id":"https://openalex.org/C2834757","wikidata":"https://www.wikidata.org/wiki/Q4925424","display_name":"Monotone polygon","level":2,"score":0.4877112805843353},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4828117787837982},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4613859951496124},{"id":"https://openalex.org/C161999928","wikidata":"https://www.wikidata.org/wiki/Q4556320","display_name":"Variational inequality","level":2,"score":0.46114760637283325},{"id":"https://openalex.org/C145446738","wikidata":"https://www.wikidata.org/wiki/Q319913","display_name":"Convex function","level":3,"score":0.44751593470573425},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44705361127853394},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.4209912419319153},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.2623332738876343},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.23236969113349915},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C50522688","wikidata":"https://www.wikidata.org/wiki/Q189833","display_name":"Economic growth","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/cdc.2012.6425811","is_oa":false,"landing_page_url":"https://doi.org/10.1109/cdc.2012.6425811","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 IEEE 51st IEEE Conference on Decision and Control (CDC)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Reduced inequalities","score":0.44999998807907104,"id":"https://metadata.un.org/sdg/10"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W291003596","https://openalex.org/W1543439990","https://openalex.org/W1583497301","https://openalex.org/W1968143987","https://openalex.org/W1976535313","https://openalex.org/W2061586045","https://openalex.org/W2103641595","https://openalex.org/W2105284341","https://openalex.org/W2798566347","https://openalex.org/W4301791716","https://openalex.org/W6632783874","https://openalex.org/W6724904386"],"related_works":["https://openalex.org/W2051058708","https://openalex.org/W154868527","https://openalex.org/W1494268238","https://openalex.org/W1983207144","https://openalex.org/W2490706771","https://openalex.org/W2480116122","https://openalex.org/W1976468483","https://openalex.org/W2085771669","https://openalex.org/W2952183507","https://openalex.org/W2383497899"],"abstract_inverted_index":{"Traditionally,":[0],"the":[1,28,32,96,124,154,187],"field":[2],"of":[3,11,34,45,49,66,90,98,109,127,131,189],"deterministic":[4],"optimization":[5,111,194],"has":[6],"been":[7],"devoted":[8],"to":[9,38,172,179,192,202],"minimization":[10],"functions":[12],"f(x;":[13,82],"\u03b8*)":[14,83],"whose":[15],"parameters,":[16],"denoted":[17,133],"by":[18,134,149],"\u03b8*,":[19,132],"are":[20,147,170],"known":[21],"with":[22],"certainty.":[23],"Supervised":[24],"learning":[25,50,69,85],"theory":[26],"on":[27],"other":[29],"hand":[30],"considers":[31],"question":[33],"employing":[35],"training":[36],"data":[37],"seek":[39],"a":[40,43,63,88,107,128],"function":[41,130],"from":[42,186],"set":[44,89],"possible":[46],"functions.":[47],"Instances":[48],"algorithms":[51],"include":[52],"regression":[53],"schemes":[54,144,169],"and":[55,68,113,196],"support":[56],"vector":[57],"machines,":[58],"amongst":[59],"others.":[60],"We":[61],"consider":[62,95],"hybrid":[64],"problem":[65,158],"computation":[67],"that":[70,175],"arises":[71],"in":[72,80,151,177],"online":[73],"settings,":[74],"where":[75,153],"one":[76],"may":[77,159],"be":[78,160,203],"interested":[79],"optimizing":[81],"while":[84],"\u03b8*":[86,120],"through":[87,123],"observations.":[91],"More":[92],"generally,":[93],"we":[94],"solution":[97],"parameterized":[99],"monotone":[100,163],"variational":[101,156],"inequality":[102,157],"problems,":[103],"which":[104],"can":[105],"capture":[106],"range":[108],"convex":[110,114,193],"problems":[112,195],"Nash":[115],"games.":[116],"The":[117,167],"unknown":[118],"parameter":[119],"is":[121,200],"learned":[122],"noisy":[125],"observations":[126,146],"linear":[129],"l(x;":[135],"\u03b8*).":[136],"This":[137],"paper":[138],"provides":[139],"convergence":[140],"statements":[141],"for":[142],"joint":[143],"when":[145],"corrupted":[148],"noise":[150],"regimes":[152],"associated":[155],"either":[161],"strongly":[162],"or":[164],"merely":[165],"monotone.":[166],"proposed":[168],"shown":[171,201],"produce":[173],"iterates":[174],"converge":[176],"mean":[178],"their":[180],"true":[181],"counterparts.":[182],"Numerical":[183],"results":[184],"derived":[185],"application":[188],"these":[190],"techniques":[191],"nonlinear":[197],"Nash-Cournot":[198],"games":[199],"promising.":[204]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}