{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,20]],"date-time":"2026-06-20T02:00:54Z","timestamp":1781920854436,"version":"3.54.5"},"reference-count":47,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,5,2]],"date-time":"2022-05-02T00:00:00Z","timestamp":1651449600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,5,2]]},"DOI":"10.1109\/infocom48880.2022.9796715","type":"proceedings-article","created":{"date-parts":[[2022,6,20]],"date-time":"2022-06-20T21:18:49Z","timestamp":1655759929000},"page":"930-939","source":"Crossref","is-referenced-by-count":7,"title":["Learning for Robust Combinatorial Optimization: Algorithm and Application"],"prefix":"10.1109","author":[{"given":"Zhihui","family":"Shao","sequence":"first","affiliation":[{"name":"UC Riverside"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Jianyi","family":"Yang","sequence":"additional","affiliation":[{"name":"UC Riverside"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cong","family":"Shen","sequence":"additional","affiliation":[{"name":"University of Virginia"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shaolei","family":"Ren","sequence":"additional","affiliation":[{"name":"UC Riverside"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1145\/2046684.2046692"},{"key":"ref33","article-title":"Training GANs with optimism","author":"daskalakis","year":"2017"},{"key":"ref32","article-title":"K-beam minimax: Efficient optimization for deep adversarial learning","author":"hamm","year":"2018","journal-title":"ICML"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9522-7"},{"key":"ref30","article-title":"Robust submodular maximization: A non-uniform partitioning approach","author":"bogunovic","year":"2017"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1320-2"},{"key":"ref36","article-title":"Generative adversarial nets","author":"goodfellow","year":"2014","journal-title":"NIPS"},{"key":"ref35","article-title":"On solving minimax optimization locally: A follow-the-ridge approach","author":"wang","year":"2020","journal-title":"ICLRE"},{"key":"ref34","article-title":"Ode analysis of stochastic gradient methods with optimism and anchoring for minimax problems and GANs","author":"ryu","year":"2019"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2020.3004964"},{"key":"ref40","author":"sutton","year":"2018","journal-title":"Reinforcement Learning An Introduction"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1142\/S0218001496000438"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/rnc.4590010404"},{"key":"ref13","article-title":"Neural combinatorial optimization with reinforcement learning","author":"bello","year":"2017","journal-title":"ICLR Workshop"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2020.07.063"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i04.5723"},{"key":"ref16","doi-asserted-by":"crossref","DOI":"10.1609\/aaai.v30i1.10080","article-title":"Learning to branch in mixed integer programming","author":"khalil","year":"2016","journal-title":"Proceedings of the AAAI Conference on Artificial Intelligence"},{"key":"ref17","article-title":"Learning combinatorial optimization algorithms over graphs","author":"dai","year":"2017","journal-title":"NIPS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737649"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/TNET.2020.2979966"},{"key":"ref28","article-title":"Pointer networks","author":"vinyals","year":"2015","journal-title":"NIPS"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-58598-3_6"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24488-9"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2019.2957482"},{"key":"ref6","article-title":"Learning to optimize","author":"li","year":"2017","journal-title":"ICLRE"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-93031-2_12"},{"key":"ref5","article-title":"Learning to optimize: A primer and a benchmark","author":"chen","year":"2021"},{"key":"ref8","author":"papadimitriou","year":"1998","journal-title":"Combinatorial Optimization Algorithms and Complexity"},{"key":"ref7","article-title":"Learning to learn by gradient descent by gradient descent","author":"andrychowicz","year":"2016","journal-title":"NIPS"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2018.2866382"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JIOT.2016.2579198"},{"key":"ref1","article-title":"Learned optimizers that scale and generalize","author":"wichrowska","year":"2017","journal-title":"ICML"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICFEC.2017.16"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/3341302.3342080"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1287\/opre.22.3.562"},{"key":"ref22","article-title":"Learning a minimax optimizer: A pilot study","author":"shen","year":"2021","journal-title":"ICLRE"},{"key":"ref47","article-title":"Adam: A method for stochastic optimization","author":"kingma","year":"2014"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/3307772.3328314"},{"key":"ref42","article-title":"Security challenges in vehicular cloud computing","author":"yan","year":"2012","journal-title":"IEEE Transactions on Intelligent Transportation Systems"},{"key":"ref24","article-title":"Learning to learn without gradient descent by gradient descent","author":"chen","year":"2017","journal-title":"ICML"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511804441"},{"key":"ref23","article-title":"Training stronger baselines for learning to optimize","author":"chen","year":"2020","journal-title":"NeurIPS"},{"key":"ref44","article-title":"Global positioning system (gps) standard positioning service (sps) performance standard","year":"2020"},{"key":"ref26","article-title":"Learning to defense by learning to attack","author":"jiang","year":"2021","journal-title":"AISTATS"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2019.8737654"},{"key":"ref25","article-title":"Learning to optimize in swarms","author":"cao","year":"2019","journal-title":"NeurIPS"}],"event":{"name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","location":"London, United Kingdom","start":{"date-parts":[[2022,5,2]]},"end":{"date-parts":[[2022,5,5]]}},"container-title":["IEEE INFOCOM 2022 - IEEE Conference on Computer Communications"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9796607\/9796652\/09796715.pdf?arnumber=9796715","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,27]],"date-time":"2024-09-27T08:03:02Z","timestamp":1727424182000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9796715\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,5,2]]},"references-count":47,"URL":"https:\/\/doi.org\/10.1109\/infocom48880.2022.9796715","relation":{},"subject":[],"published":{"date-parts":[[2022,5,2]]}}}