{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T01:52:30Z","timestamp":1740102750584,"version":"3.37.3"},"reference-count":29,"publisher":"IEEE","license":[{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2024,4,14]],"date-time":"2024-04-14T00:00:00Z","timestamp":1713052800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024,4,14]]},"DOI":"10.1109\/icassp48485.2024.10447666","type":"proceedings-article","created":{"date-parts":[[2024,3,18]],"date-time":"2024-03-18T18:56:31Z","timestamp":1710788191000},"page":"9426-9430","source":"Crossref","is-referenced-by-count":0,"title":["A Method for Bilevel Optimization with Convex Lower-Level Problem"],"prefix":"10.1109","author":[{"given":"Han","family":"Shen","sequence":"first","affiliation":[{"name":"Rensselaer Polytechnic Institute,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Santiago","family":"Paternain","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gaowen","family":"Liu","sequence":"additional","affiliation":[{"name":"Cisco Systems,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramana","family":"Kompella","sequence":"additional","affiliation":[{"name":"Cisco Systems,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tianyi","family":"Chen","sequence":"additional","affiliation":[{"name":"Rensselaer Polytechnic Institute,United States"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"article-title":"Gradient-based hyperparameter optimization through reversible learning","volume-title":"Proc. of International Conference on Machine Learning","author":"Maclaurin","key":"ref1"},{"article-title":"Bilevel programming for hyperparameter optimization and meta-learning","volume-title":"Proc. of International Conference on Machine Learning","author":"Franceschi","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP39728.2021.9414206"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9746612"},{"article-title":"Model-agnostic meta-learning for fast adaptation of deep networks","volume-title":"Proc. of International Conference on Machine Learning","author":"Finn","key":"ref5"},{"article-title":"Adversarially trained actor critic for offline reinforcement learning","volume-title":"Proc. of International Conference on Machine Learning","author":"Cheng","key":"ref6"},{"article-title":"Learning to defend by learning to attack","volume-title":"Proc. of International Conference on Artificial Intelligence and Statistics","author":"Jiang","key":"ref7"},{"article-title":"Hyperparameter optimization with approximate gradient","volume-title":"Proc. of International Conference on Machine Learning","author":"Pedregosa","key":"ref8"},{"article-title":"Approximation methods for bilevel programming","year":"2018","author":"Ghadimi","key":"ref9"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1137\/20m1387341"},{"article-title":"Tighter analysis of alternating stochastic gradient method for stochastic nested problems","volume-title":"Proc. of Advances in Neural Information Processing Systems","author":"Chen","key":"ref11"},{"article-title":"A single-timescale analysis for stochastic approximation with multiple coupled sequences","volume-title":"Proc. of Advances in Neural Information Processing Systems","author":"Shen","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2550609"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1137\/16M105592X"},{"article-title":"On the iteration complexity of hypergradient computation","volume-title":"Proc. of International Conference on Machine Learning","author":"Grazzi","key":"ref15"},{"article-title":"A generic first-order algorithmic framework for bi-level programming beyond lower-level singleton","volume-title":"Proc. of International Conference on Machine Learning","author":"Liu","key":"ref16"},{"article-title":"Bilevel learning of l1 regularizers with closed-form gradients (blorc)","volume-title":"Proc. of IEEE International Conference on Acoustics, Speech and Signal Processing","author":"Ghosh","key":"ref17"},{"article-title":"Provably faster algorithms for bilevel optimization and applications to meta-learning","volume-title":"Proc. of International Conference on Machine Learning","author":"Ji","key":"ref18"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP43922.2022.9747013"},{"article-title":"Forward and reverse gradient-based hyperparameter optimization","volume-title":"Proc. of International Conference on Machine Learning","author":"Franceschi","key":"ref20"},{"article-title":"On first-order meta-learning algorithms","year":"2018","author":"Nichol","key":"ref21"},{"article-title":"Towards gradient based bilevel optimization with non-convex followers and beyond","volume-title":"Proc. of Advances in Neural Information Processing Systems","author":"Liu","key":"ref22"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01888-3"},{"article-title":"Value function based difference-of-convex algorithm for bilevel hyperparameter selection problems","volume-title":"Proc. of International Conference on Machine Learning","author":"Gao","key":"ref24"},{"key":"ref25","first-page":"10305","article-title":"A conditional gradient-based method for simple bilevel optimization with convex lower-level problem","volume-title":"Proc. of International Conference on Artificial Intelligence and Statistics","author":"Jiang"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-014-0846-1"},{"article-title":"On first-order meta-learning algorithms","volume-title":"Proc. of International Workshop on Artificial Intelligence and Statistics","author":"Smola","key":"ref27"},{"issue":"1","key":"ref28","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1080\/02331939508844060","article-title":"Optimality conditions for bilevel programming problems","volume":"33","author":"Jane","year":"1995","journal-title":"Optimization"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1137\/16M1059011"}],"event":{"name":"ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)","start":{"date-parts":[[2024,4,14]]},"location":"Seoul, Korea, Republic of","end":{"date-parts":[[2024,4,19]]}},"container-title":["ICASSP 2024 - 2024 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10445798\/10445803\/10447666.pdf?arnumber=10447666","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,2]],"date-time":"2024-08-02T04:30:36Z","timestamp":1722573036000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10447666\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,4,14]]},"references-count":29,"URL":"https:\/\/doi.org\/10.1109\/icassp48485.2024.10447666","relation":{},"subject":[],"published":{"date-parts":[[2024,4,14]]}}}