{"id":"https://openalex.org/W4319996469","doi":"https://doi.org/10.1109/tnet.2022.3222404","title":"Lazy Lagrangians for Optimistic Learning With Budget Constraints","display_name":"Lazy Lagrangians for Optimistic Learning With Budget Constraints","publication_year":2023,"publication_date":"2023-01-18","ids":{"openalex":"https://openalex.org/W4319996469","doi":"https://doi.org/10.1109/tnet.2022.3222404"},"language":"en","primary_location":{"id":"doi:10.1109/tnet.2022.3222404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2022.3222404","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"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/ACM Transactions on Networking","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://repository.tudelft.nl/file/File_319cf218-9316-40ad-a4f9-0ac2d3080057","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5058955919","display_name":"Daron Anderson","orcid":"https://orcid.org/0000-0003-1675-7764"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Daron Anderson","raw_affiliation_strings":["School of Computer Science and Statistics, Trinity College Dublin (TCD), Dublin 2, Ireland"],"raw_orcid":"https://orcid.org/0000-0003-1675-7764","affiliations":[{"raw_affiliation_string":"School of Computer Science and Statistics, Trinity College Dublin (TCD), Dublin 2, Ireland","institution_ids":["https://openalex.org/I205274468"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044138533","display_name":"George Iosifidis","orcid":"https://orcid.org/0000-0003-1001-2323"},"institutions":[{"id":"https://openalex.org/I98358874","display_name":"Delft University of Technology","ror":"https://ror.org/02e2c7k09","country_code":"NL","type":"education","lineage":["https://openalex.org/I98358874"]}],"countries":["NL"],"is_corresponding":false,"raw_author_name":"George Iosifidis","raw_affiliation_strings":["Department of Software Technology, Delft University of Technology (TU Delft), Delft, The Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-1001-2323","affiliations":[{"raw_affiliation_string":"Department of Software Technology, Delft University of Technology (TU Delft), Delft, The Netherlands","institution_ids":["https://openalex.org/I98358874"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086446911","display_name":"Douglas J. Leith","orcid":"https://orcid.org/0000-0003-4056-4014"},"institutions":[{"id":"https://openalex.org/I205274468","display_name":"Trinity College Dublin","ror":"https://ror.org/02tyrky19","country_code":"IE","type":"education","lineage":["https://openalex.org/I205274468"]}],"countries":["IE"],"is_corresponding":false,"raw_author_name":"Douglas J. Leith","raw_affiliation_strings":["School of Computer Science and Statistics, Trinity College Dublin (TCD), Dublin 2, Ireland"],"raw_orcid":"https://orcid.org/0000-0003-4056-4014","affiliations":[{"raw_affiliation_string":"School of Computer Science and Statistics, Trinity College Dublin (TCD), Dublin 2, Ireland","institution_ids":["https://openalex.org/I205274468"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.7777,"has_fulltext":true,"cited_by_count":8,"citation_normalized_percentile":{"value":0.84852105,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"31","issue":"5","first_page":"1935","last_page":"1949"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9998999834060669,"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/T10462","display_name":"Reinforcement Learning in Robotics","score":0.9952999949455261,"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.994700014591217,"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/notation","display_name":"Notation","score":0.5582794547080994},{"id":"https://openalex.org/keywords/constraint","display_name":"Constraint (computer-aided design)","score":0.4333495497703552},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.42653828859329224},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.397659033536911},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38719579577445984},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3527679443359375},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3458654284477234},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.10033583641052246}],"concepts":[{"id":"https://openalex.org/C45357846","wikidata":"https://www.wikidata.org/wiki/Q2001982","display_name":"Notation","level":2,"score":0.5582794547080994},{"id":"https://openalex.org/C2776036281","wikidata":"https://www.wikidata.org/wiki/Q48769818","display_name":"Constraint (computer-aided design)","level":2,"score":0.4333495497703552},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.42653828859329224},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.397659033536911},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38719579577445984},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3527679443359375},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3458654284477234},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.10033583641052246},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/tnet.2022.3222404","is_oa":false,"landing_page_url":"https://doi.org/10.1109/tnet.2022.3222404","pdf_url":null,"source":{"id":"https://openalex.org/S62238642","display_name":"IEEE/ACM Transactions on Networking","issn_l":"1063-6692","issn":["1063-6692","1558-2566"],"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/ACM Transactions on Networking","raw_type":"journal-article"},{"id":"pmh:oai:tudelft.nl:uuid:e343b1be-344f-4de5-b3c0-a8f6140f02c7","is_oa":true,"landing_page_url":"http://resolver.tudelft.nl/uuid:e343b1be-344f-4de5-b3c0-a8f6140f02c7","pdf_url":"https://repository.tudelft.nl/file/File_319cf218-9316-40ad-a4f9-0ac2d3080057","source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"}],"best_oa_location":{"id":"pmh:oai:tudelft.nl:uuid:e343b1be-344f-4de5-b3c0-a8f6140f02c7","is_oa":true,"landing_page_url":"http://resolver.tudelft.nl/uuid:e343b1be-344f-4de5-b3c0-a8f6140f02c7","pdf_url":"https://repository.tudelft.nl/file/File_319cf218-9316-40ad-a4f9-0ac2d3080057","source":{"id":"https://openalex.org/S4306400906","display_name":"Research Repository (Delft University of Technology)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I98358874","host_organization_name":"Delft University of Technology","host_organization_lineage":["https://openalex.org/I98358874"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"journal article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2406092791","display_name":"Network intelligence for aDAptive and sElf-Learning MObile Networks","funder_award_id":"101017109","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G5171908817","display_name":null,"funder_award_id":"101017109 DAEMON","funder_id":"https://openalex.org/F4320320300","funder_display_name":"European Commission"},{"id":"https://openalex.org/G6445168105","display_name":null,"funder_award_id":"16/IA/4610","funder_id":"https://openalex.org/F4320320847","funder_display_name":"Science Foundation Ireland"}],"funders":[{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"},{"id":"https://openalex.org/F4320320847","display_name":"Science Foundation Ireland","ror":"https://ror.org/0271asj38"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4319996469.pdf","grobid_xml":"https://content.openalex.org/works/W4319996469.grobid-xml"},"referenced_works_count":64,"referenced_works":["https://openalex.org/W1520045492","https://openalex.org/W1570963478","https://openalex.org/W2012731843","https://openalex.org/W2055639053","https://openalex.org/W2078303776","https://openalex.org/W2095762034","https://openalex.org/W2143343660","https://openalex.org/W2148825261","https://openalex.org/W2158893758","https://openalex.org/W2161551046","https://openalex.org/W2168281471","https://openalex.org/W2352999452","https://openalex.org/W2415016509","https://openalex.org/W2592542720","https://openalex.org/W2728468721","https://openalex.org/W2786176077","https://openalex.org/W2883517662","https://openalex.org/W2891784792","https://openalex.org/W2902440224","https://openalex.org/W2918173924","https://openalex.org/W2946061571","https://openalex.org/W2951825612","https://openalex.org/W2962941768","https://openalex.org/W2963070834","https://openalex.org/W2963195786","https://openalex.org/W2964252810","https://openalex.org/W2964323557","https://openalex.org/W2971977212","https://openalex.org/W2981871664","https://openalex.org/W2986547560","https://openalex.org/W2990467641","https://openalex.org/W3005611113","https://openalex.org/W3008594870","https://openalex.org/W3011023724","https://openalex.org/W3034654422","https://openalex.org/W3037845322","https://openalex.org/W3096329823","https://openalex.org/W3138786499","https://openalex.org/W3159465427","https://openalex.org/W3181114927","https://openalex.org/W3201795538","https://openalex.org/W4205841652","https://openalex.org/W4287645813","https://openalex.org/W4297972233","https://openalex.org/W4301852635","https://openalex.org/W6631271631","https://openalex.org/W6674228005","https://openalex.org/W6681110014","https://openalex.org/W6681723013","https://openalex.org/W6687723142","https://openalex.org/W6694693775","https://openalex.org/W6705697407","https://openalex.org/W6734292001","https://openalex.org/W6740009893","https://openalex.org/W6743491589","https://openalex.org/W6743932947","https://openalex.org/W6748041235","https://openalex.org/W6748172441","https://openalex.org/W6763034095","https://openalex.org/W6773909279","https://openalex.org/W6774584401","https://openalex.org/W6780581633","https://openalex.org/W6784342585","https://openalex.org/W6791845114"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051487156","https://openalex.org/W2504004674","https://openalex.org/W1987679298","https://openalex.org/W2073681303","https://openalex.org/W2963177394","https://openalex.org/W4313359513","https://openalex.org/W2498744856","https://openalex.org/W4390482104","https://openalex.org/W322408318"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,14,19,93,112,123,138,143,147],"general":[3],"problem":[4],"of":[5,16,30,141,149],"online":[6],"convex":[7],"optimization":[8],"with":[9,46,92],"time-varying":[10],"budget":[11],"constraints":[12],"in":[13,27],"presence":[15],"predictions":[17,94],"for":[18,106,116],"next":[20],"cost":[21,144],"and":[22,61,86,121],"constraint":[23,69],"functions,":[24],"that":[25,72,90],"arises":[26],"a":[28,43],"plethora":[29],"network":[31],"resource":[32],"management":[33],"problems.":[34],"A":[35],"novel":[36],"saddle-point":[37],"algorithm":[38,51],"is":[39],"designed":[40],"by":[41],"combining":[42],"Follow-The-Regularized-Leader":[44],"iteration":[45],"prediction-adaptive":[47],"dynamic":[48],"steps.":[49],"The":[50],"achieves":[52],"<inline-formula":[53,62,77,98],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[54,63,78,99],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">":[55,64,79,100],"<tex-math":[56,65,80,101],"notation=\"LaTeX\">$\\mathcal":[57,66,102],"O(T^{(3-\\beta)/4})$":[58],"</tex-math></inline-formula>":[59,68,84,104],"regret":[60,105],"O(T^{(1+\\beta)/2})$":[67],"violation":[70],"bounds":[71],"are":[73],"tunable":[74],"via":[75],"parameter":[76],"notation=\"LaTeX\">$\\beta":[81],"\\!\\in":[82],"\\![1/2,1$":[83],")":[85],"have":[87],"constant":[88],"factors":[89],"shrink":[91],"quality,":[95],"achieving":[96],"eventually":[97],"O(1)$":[103],"perfect":[107],"predictions.":[108],"Our":[109],"work":[110],"extends":[111],"seminal":[113],"FTRL":[114],"framework":[115],"this":[117],"new":[118],"OCO":[119],"setting":[120],"outperforms":[122],"respective":[124],"state-of-the-art":[125],"greedy-based":[126],"solutions":[127],"which":[128],"naturally":[129],"cannot":[130],"benefit":[131],"from":[132],"predictions,":[133,142],"without":[134],"imposing":[135],"conditions":[136],"on":[137],"(unknown)":[139],"quality":[140],"functions":[145],"or":[146],"geometry":[148],"constraints,":[150],"beyond":[151],"convexity.":[152]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":6},{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}