{"id":"https://openalex.org/W7084112537","doi":"https://doi.org/10.1109/infocom55648.2025.11044756","title":"Network Optimization in Dynamic Systems: Fast Adaptation via Zero-Shot Lagrangian Update","display_name":"Network Optimization in Dynamic Systems: Fast Adaptation via Zero-Shot Lagrangian Update","publication_year":2025,"publication_date":"2025-05-19","ids":{"openalex":"https://openalex.org/W7084112537","doi":"https://doi.org/10.1109/infocom55648.2025.11044756"},"language":"en","primary_location":{"id":"doi:10.1109/infocom55648.2025.11044756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"conference-paper","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":null,"display_name":"I-Hong Hou","orcid":null},"institutions":[{"id":"https://openalex.org/I91045830","display_name":"Texas A&M University","ror":"https://ror.org/01f5ytq51","country_code":"US","type":"education","lineage":["https://openalex.org/I91045830"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"I-Hong Hou","raw_affiliation_strings":["Texas A&#x0026;M University College,Dept. of ECE,Station,TX,USA,77843"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Texas A&#x0026;M University College,Dept. of ECE,Station,TX,USA,77843","institution_ids":["https://openalex.org/I91045830"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I91045830"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T11841","display_name":"Nuclear Structure and Function","score":0.14159999787807465,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},"topics":[{"id":"https://openalex.org/T11841","display_name":"Nuclear Structure and Function","score":0.14159999787807465,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T11927","display_name":"Plant Reproductive Biology","score":0.08380000293254852,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}},{"id":"https://openalex.org/T10184","display_name":"Plant Molecular Biology Research","score":0.06599999964237213,"subfield":{"id":"https://openalex.org/subfields/1110","display_name":"Plant Science"},"field":{"id":"https://openalex.org/fields/11","display_name":"Agricultural and Biological Sciences"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/lagrange-multiplier","display_name":"Lagrange multiplier","score":0.6409000158309937},{"id":"https://openalex.org/keywords/adaptation","display_name":"Adaptation (eye)","score":0.5238999724388123},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5209000110626221},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.5156999826431274},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.4302999973297119},{"id":"https://openalex.org/keywords/dual","display_name":"Dual (grammatical number)","score":0.3919000029563904},{"id":"https://openalex.org/keywords/lagrangian-relaxation","display_name":"Lagrangian relaxation","score":0.3686999976634979},{"id":"https://openalex.org/keywords/taylor-series","display_name":"Taylor series","score":0.3598000109195709},{"id":"https://openalex.org/keywords/constrained-optimization","display_name":"Constrained optimization","score":0.3361999988555908}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7228999733924866},{"id":"https://openalex.org/C73684929","wikidata":"https://www.wikidata.org/wiki/Q598870","display_name":"Lagrange multiplier","level":2,"score":0.6409000158309937},{"id":"https://openalex.org/C139807058","wikidata":"https://www.wikidata.org/wiki/Q352374","display_name":"Adaptation (eye)","level":2,"score":0.5238999724388123},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5209000110626221},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5195000171661377},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.5156999826431274},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.4302999973297119},{"id":"https://openalex.org/C2780980858","wikidata":"https://www.wikidata.org/wiki/Q110022","display_name":"Dual (grammatical number)","level":2,"score":0.3919000029563904},{"id":"https://openalex.org/C91765299","wikidata":"https://www.wikidata.org/wiki/Q3424292","display_name":"Lagrangian relaxation","level":2,"score":0.3686999976634979},{"id":"https://openalex.org/C158946198","wikidata":"https://www.wikidata.org/wiki/Q131187","display_name":"Taylor series","level":2,"score":0.3598000109195709},{"id":"https://openalex.org/C55660270","wikidata":"https://www.wikidata.org/wiki/Q5164377","display_name":"Constrained optimization","level":2,"score":0.3361999988555908},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.3224000036716461},{"id":"https://openalex.org/C13540734","wikidata":"https://www.wikidata.org/wiki/Q5318996","display_name":"Dynamic network analysis","level":2,"score":0.3181999921798706},{"id":"https://openalex.org/C203274722","wikidata":"https://www.wikidata.org/wiki/Q7001161","display_name":"Network performance","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.29739999771118164},{"id":"https://openalex.org/C2780378061","wikidata":"https://www.wikidata.org/wiki/Q25351891","display_name":"Service (business)","level":2,"score":0.2955999970436096},{"id":"https://openalex.org/C143724316","wikidata":"https://www.wikidata.org/wiki/Q312468","display_name":"Series (stratigraphy)","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.2702000141143799},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.25769999623298645},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.25760000944137573},{"id":"https://openalex.org/C53469067","wikidata":"https://www.wikidata.org/wiki/Q505735","display_name":"Lagrangian","level":2,"score":0.2572999894618988},{"id":"https://openalex.org/C151406439","wikidata":"https://www.wikidata.org/wiki/Q186588","display_name":"Time series","level":2,"score":0.2506999969482422}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom55648.2025.11044756","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom55648.2025.11044756","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2025 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G5511953126","display_name":null,"funder_award_id":"ECCS-2127721,CCF-2332800","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"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"network":[3,55,107],"optimization":[4,56,108],"in":[5,36,104,125],"dynamic":[6],"systems,":[7],"where":[8],"factors":[9],"such":[10],"as":[11],"user":[12],"composition,":[13],"service":[14],"requirements,":[15],"system":[16,156],"capacity,":[17],"and":[18,24,132],"channel":[19],"conditions":[20],"can":[21,112],"change":[22],"abruptly":[23],"unpredictably.":[25],"Unlike":[26],"existing":[27,116],"studies":[28],"that":[29,44,52,138],"focus":[30],"primarily":[31],"on":[32,59],"optimizing":[33],"long-term":[34],"performance":[35,121],"steady":[37],"states,":[38],"we":[39,68,94],"develop":[40],"online":[41],"learning":[42],"algorithms":[43,57,117],"enable":[45],"rapid":[46],"adaptation":[47],"to":[48,62,100,118],"sudden":[49],"changes.":[50,84,157],"Recognizing":[51],"many":[53],"current":[54],"rely":[58],"dual":[60],"methods":[61],"iteratively":[63],"learn":[64],"optimal":[65],"Lagrange":[66],"multipliers,":[67],"propose":[69],"zero-shot":[70,97,140],"updates":[71,98,111,141],"for":[72],"these":[73],"multipliers":[74],"using":[75],"only":[76],"information":[77],"available":[78],"at":[79],"the":[80],"time":[81],"of":[82,127],"abrupt":[83,102],"By":[85],"combining":[86],"Taylor":[87],"series":[88],"analysis":[89],"with":[90,115],"complementary":[91],"slackness":[92],"conditions,":[93],"theoretically":[95],"derive":[96],"applicable":[99],"various":[101],"changes":[103],"two":[105],"distinct":[106],"problems.":[109],"These":[110],"be":[113],"integrated":[114],"significantly":[119],"improve":[120,143],"during":[122],"transitory":[123,144],"phases":[124],"terms":[126],"total":[128],"utility,":[129],"operational":[130],"cost,":[131],"constraint":[133],"violations.":[134],"Simulation":[135],"results":[136],"demonstrate":[137],"our":[139],"substantially":[142],"performance,":[145],"often":[146],"achieving":[147],"near-optimal":[148],"outcomes":[149],"without":[150],"additional":[151],"learning,":[152],"even":[153],"under":[154],"severe":[155]},"counts_by_year":[],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}
