{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,26]],"date-time":"2025-08-26T06:56:59Z","timestamp":1756191419647,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"funder":[{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["HR00112190135"],"award-info":[{"award-number":["HR00112190135"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3358724","type":"journal-article","created":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T18:31:08Z","timestamp":1706207468000},"page":"17102-17113","source":"Crossref","is-referenced-by-count":6,"title":["Teaching Networks to Solve Optimization Problems"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0772-3928","authenticated-orcid":false,"given":"Xinran","family":"Liu","sequence":"first","affiliation":[{"name":"Department of Computer Science, Vanderbilt University, Nashville, TN, USA"}]},{"given":"Yuzhe","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Vanderbilt University, Nashville, TN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-4116-0920","authenticated-orcid":false,"given":"Ali","family":"Abbasi","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Vanderbilt University, Nashville, TN, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0178-7883","authenticated-orcid":false,"given":"Meiyi","family":"Li","sequence":"additional","affiliation":[{"name":"Department of Civil Architectural and Environmental Engineering, University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0425-5302","authenticated-orcid":false,"given":"Javad","family":"Mohammadi","sequence":"additional","affiliation":[{"name":"Department of Civil Architectural and Environmental Engineering, University of Texas at Austin, Austin, TX, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8495-5362","authenticated-orcid":false,"given":"Soheil","family":"Kolouri","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Vanderbilt University, Nashville, TN, USA"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1007\/978-3-642-25566-3_40"},{"key":"ref2","article-title":"Algorithms for hyper-parameter optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"24","author":"Bergstra"},{"key":"ref3","article-title":"Practical Bayesian optimization of machine learning algorithms","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"25","author":"Snoek"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1162\/089976600300015187"},{"key":"ref5","first-page":"2113","article-title":"Gradient-based hyperparameter optimization through reversible learning","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Maclaurin"},{"key":"ref6","first-page":"11058","article-title":"Meta-learning hyperparameter performance prediction with neural processes","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wei"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.5555\/3104322.3104374"},{"key":"ref8","article-title":"Learning to optimize","author":"Li","year":"2016","journal-title":"arXiv:1606.01885"},{"key":"ref9","first-page":"3981","article-title":"Learning to learn by gradient descent by gradient descent","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Andrychowicz"},{"key":"ref10","first-page":"3751","article-title":"Learned optimizers that scale and generalize","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Wichrowska"},{"key":"ref11","first-page":"748","article-title":"Learning to learn without gradient descent by gradient descent","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chen"},{"key":"ref12","article-title":"Learning to optimize: A primer and a benchmark","author":"Chen","year":"2021","journal-title":"arXiv:2103.12828"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1109\/TMI.2019.2897538"},{"key":"ref14","article-title":"DeepOPF: A feasibility-optimized deep neural network approach for AC optimal power flow problems","author":"Pan","year":"2020","journal-title":"arXiv:2007.01002"},{"key":"ref15","article-title":"Parameter prediction for unseen deep architectures","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Knyazev"},{"issue":"1","key":"ref16","first-page":"1","article-title":"Geometric approximation via coresets","volume":"52","author":"Agarwal","year":"2005","journal-title":"Combinat. Comput. Geometry"},{"key":"ref17","article-title":"Wasserstein measure coresets","author":"Claici","year":"2018","journal-title":"arXiv:1805.07412"},{"key":"ref18","first-page":"685","article-title":"Fast computation of Wasserstein barycenters","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cuturi"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.3390\/en16176379"},{"key":"ref20","first-page":"1","article-title":"Empowering distributed solutions in renewable energy systems and grid optimization","author":"Mohammadi","year":"2023","journal-title":"Distributed Machine Learning and Optimization: Distributed Machine Learning and Optimization: Theory and Applications"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1109\/MSCPES58582.2023.10123430"},{"key":"ref22","first-page":"3394","article-title":"Deep sets","volume-title":"Proc. 31st Int. Conf. Neural Inf. Process. Syst.","author":"Zaheer"},{"key":"ref23","first-page":"3744","article-title":"Set transformer: A framework for attention-based permutation-invariant neural networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Lee"},{"key":"ref24","first-page":"1","article-title":"Pooling by sliced-Wasserstein embedding","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Naderializadeh"},{"key":"ref25","article-title":"SLOSH: Set locality sensitive hashing via sliced-Wasserstein embeddings","author":"Lu","year":"2021","journal-title":"arXiv:2112.05872"},{"volume-title":"The Mnist Database of Handwritten Digits","year":"1998","author":"LeCun","key":"ref26"},{"issue":"78","key":"ref27","first-page":"1","article-title":"POT: Python optimal transport","volume":"22","author":"Flamary","year":"2021","journal-title":"J. Mach. Learn. Res."},{"key":"ref28","article-title":"Generalized sliced Wasserstein distances","author":"Kolouri","year":"2019","journal-title":"arXiv:1902.00434"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.24251\/HICSS.2017.386"},{"issue":"83","key":"ref30","first-page":"1","article-title":"CVXPY: A Python-embedded modeling language for convex optimization","volume":"17","author":"Diamond","year":"2016","journal-title":"J. Mach. Learn. Res."},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.23919\/ECC.2013.6669541"},{"volume-title":"The CVXOPT Linear and Quadratic Cone Program Solvers","year":"2010","author":"Vandenberghe","key":"ref32"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1007\/s12532-020-00179-2"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1109\/TPWRS.2010.2051168"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1038\/s41467-020-17866-2"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1038\/s42256-022-00452-0"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1109\/TPAMI.2021.3057446"},{"volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Saha","article-title":"Gradient projection memory for continual learning","key":"ref38"},{"key":"ref39","article-title":"Sparsity and heterogeneous dropout for continual learning in the null space of neural activations","author":"Abbasi","year":"2022","journal-title":"arXiv:2203.06514"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1007\/s11263-012-0566-z"},{"volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Kolouri","article-title":"Wasserstein embedding for graph learning","key":"ref41"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/10380310\/10414092.pdf?arnumber=10414092","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,6]],"date-time":"2024-02-06T22:16:37Z","timestamp":1707257797000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10414092\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3358724","relation":{},"ISSN":["2169-3536"],"issn-type":[{"type":"electronic","value":"2169-3536"}],"subject":[],"published":{"date-parts":[[2024]]}}}