{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,20]],"date-time":"2026-04-20T21:30:08Z","timestamp":1776720608981,"version":"3.51.2"},"publisher-location":"New York, NY, USA","reference-count":45,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,10,3]],"date-time":"2022-10-03T00:00:00Z","timestamp":1664755200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF grants CAREER","award":["CNS-2110259, CNS-2112471, CNS-2102233, CCF-2110252."],"award-info":[{"award-number":["CNS-2110259, CNS-2112471, CNS-2102233, CCF-2110252."]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,10,3]]},"DOI":"10.1145\/3492866.3549721","type":"proceedings-article","created":{"date-parts":[[2022,9,21]],"date-time":"2022-09-21T16:34:33Z","timestamp":1663778073000},"page":"61-70","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["INTERACT"],"prefix":"10.1145","author":[{"given":"Zhuqing","family":"Liu","sequence":"first","affiliation":[{"name":"The Ohio State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xin","family":"Zhang","sequence":"additional","affiliation":[{"name":"Iowa State University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Prashant","family":"Khanduri","sequence":"additional","affiliation":[{"name":"The Ohio State University and University of Minnesota"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Songtao","family":"Lu","sequence":"additional","affiliation":[{"name":"IBM Thomas J. Watson Research Center"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jia","family":"Liu","sequence":"additional","affiliation":[{"name":"The Ohio State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,10,3]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Fuzzy goal programming algorithm for solving decentralized bi-level multi-objective programming problems. Fuzzy sets and systems 160, 18","author":"Baky I. A.","year":"2009","unstructured":"Baky, I. A. Fuzzy goal programming algorithm for solving decentralized bi-level multi-objective programming problems. Fuzzy sets and systems 160, 18 (2009), 2701--2713."},{"key":"e_1_3_2_2_2_1","first-page":"1","article-title":"Achieving controllability of electric loads","volume":"99","author":"Callaway D. S.","year":"2010","unstructured":"Callaway, D. S., and Hiskens, I. A. Achieving controllability of electric loads. Proceedings of the IEEE 99, 1 (2010), 184--199.","journal-title":"Proceedings of the IEEE"},{"key":"e_1_3_2_2_3_1","volume-title":"A single-timescale stochastic bilevel optimization method. arXiv preprint arXiv:2102.04671","author":"Chen T.","year":"2021","unstructured":"Chen, T., Sun, Y., and Yin, W. A single-timescale stochastic bilevel optimization method. arXiv preprint arXiv:2102.04671 (2021)."},{"key":"e_1_3_2_2_4_1","volume-title":"Tighter analysis of alternating stochastic gradient method for stochastic nested problems. arXiv preprint arXiv:2106.13781","author":"Chen T.","year":"2021","unstructured":"Chen, T., Sun, Y., and Yin, W. Tighter analysis of alternating stochastic gradient method for stochastic nested problems. arXiv preprint arXiv:2106.13781 (2021)."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1137\/18M1230542"},{"key":"e_1_3_2_2_6_1","volume-title":"Approximation methods for bilevel programming. arXiv preprint arXiv:1802.02246","author":"Ghadimi S.","year":"2018","unstructured":"Ghadimi, S., and Wang, M. Approximation methods for bilevel programming. arXiv preprint arXiv:1802.02246 (2018)."},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ifacol.2017.08.1217"},{"key":"e_1_3_2_2_8_1","volume-title":"Randomized stochastic variance-reduced methods for stochastic bilevel optimization. arXiv e-prints","author":"Guo Z.","year":"2021","unstructured":"Guo, Z., and Yang, T. Randomized stochastic variance-reduced methods for stochastic bilevel optimization. arXiv e-prints (2021), arXiv-2105."},{"key":"e_1_3_2_2_9_1","volume-title":"A two-timescale framework for bilevel optimization: Complexity analysis and application to actor-critic. arXiv preprint arXiv:2007.05170","author":"Hong M.","year":"2020","unstructured":"Hong, M., Wai, H.-T., Wang, Z., and Yang, Z. A two-timescale framework for bilevel optimization: Complexity analysis and application to actor-critic. arXiv preprint arXiv:2007.05170 (2020)."},{"key":"e_1_3_2_2_10_1","first-page":"4882","volume-title":"International Conference on Machine Learning","author":"Ji K.","year":"2021","unstructured":"Ji, K., Yang, J., and Liang, Y. Bilevel optimization: Convergence analysis and enhanced design. In International Conference on Machine Learning (2021), PMLR, pp. 4882--4892."},{"key":"e_1_3_2_2_11_1","first-page":"30","article-title":"Collaborative deep learning in fixed topology networks","author":"Jiang Z.","year":"2017","unstructured":"Jiang, Z., Balu, A., Hegde, C., and Sarkar, S. Collaborative deep learning in fixed topology networks. Advances in Neural Information Processing Systems 30 (2017).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2018.8430883"},{"key":"e_1_3_2_2_13_1","volume-title":"A momentum-assisted single-timescale stochastic approximation algorithm for bilevel optimization","author":"Khanduri P.","year":"2021","unstructured":"Khanduri, P., Zeng, S., Hong, M., Wai, H.-T., Wang, Z., and Yang, Z. A momentum-assisted single-timescale stochastic approximation algorithm for bilevel optimization, 2021."},{"key":"e_1_3_2_2_14_1","first-page":"34","article-title":"A near-optimal algorithm for stochastic bilevel optimization via double-momentum","author":"Khanduri P.","year":"2021","unstructured":"Khanduri, P., Zeng, S., Hong, M., Wai, H.-T., Wang, Z., and Yang, Z. A near-optimal algorithm for stochastic bilevel optimization via double-momentum. Advances in Neural Information Processing Systems 34 (2021).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1177\/0278364913495721"},{"key":"e_1_3_2_2_16_1","unstructured":"Krizhevsky A. Hinton G. et al. Learning multiple layers of features from tiny images."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1080\/10556780802102586"},{"key":"e_1_3_2_2_18_1","volume-title":"Mnist handwritten digit database. Available: http:\/\/yann.lecun.com\/exdb\/mnist","author":"LeCun Y.","year":"1998","unstructured":"LeCun, Y., Cortes, C., and Burges, C. Mnist handwritten digit database. Available: http:\/\/yann.lecun.com\/exdb\/mnist (1998)."},{"key":"e_1_3_2_2_19_1","volume-title":"Stochastic auc maximization with deep neural networks. arXiv preprint arXiv:1908.10831","author":"Liu M.","year":"2019","unstructured":"Liu, M., Yuan, Z., Ying, Y., and Yang, T. Stochastic auc maximization with deep neural networks. arXiv preprint arXiv:1908.10831 (2019)."},{"key":"e_1_3_2_2_20_1","volume-title":"Proceedings of Advances in Neural Information Processing Systems","volume":"33","author":"Liu M.","year":"2020","unstructured":"Liu, M., Zhang, W., Mroueh, Y., Cui, X., Ross, J., Yang, T., and Das, P. A decentralized parallel algorithm for training generative adversarial nets. In Proceedings of Advances in Neural Information Processing Systems (2020), vol. 33."},{"key":"e_1_3_2_2_21_1","volume-title":"A decentralized proximal point-type method for saddle point problems. arXiv preprint arXiv:1910.14380","author":"Liu W.","year":"2019","unstructured":"Liu, W., Mokhtari, A., Ozdaglar, A., Pattathil, S., Shen, Z., and Zheng, N. A decentralized proximal point-type method for saddle point problems. arXiv preprint arXiv:1910.14380 (2019)."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICMEW53276.2021.9455948"},{"key":"e_1_3_2_2_23_1","unstructured":"Liu Z. Zhang X. Khanduri P. Lu S. and Liu J. INTERACT: achieving low sample and communication complexities in decentralized bilevel learning over networks. https:\/\/kevinliu-osu.github.io\/publications\/INTERACT_TR.pdf."},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1109\/DSW.2019.8755807"},{"key":"e_1_3_2_2_25_1","volume-title":"Self-tuning networks: Bilevel optimization of hyperparameters using structured best-response functions. arXiv preprint arXiv:1903.03088","author":"MacKay M.","year":"2019","unstructured":"MacKay, M., Vicol, P., Lorraine, J., Duvenaud, D., and Grosse, R. Self-tuning networks: Bilevel optimization of hyperparameters using structured best-response functions. arXiv preprint arXiv:1903.03088 (2019)."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/CDC.2015.7403075"},{"key":"e_1_3_2_2_27_1","first-page":"347","volume-title":"Asian Conference on Machine Learning","author":"Mehra A.","year":"2021","unstructured":"Mehra, A., and Hamm, J. Penalty method for inversion-free deep bilevel optimization. In Asian Conference on Machine Learning (2021), PMLR, pp. 347--362."},{"key":"e_1_3_2_2_28_1","volume-title":"Bilevel programming algorithms for machine learning model selection","author":"Moore G. M.","year":"2010","unstructured":"Moore, G. M. Bilevel programming algorithms for machine learning model selection. Rensselaer Polytechnic Institute, 2010."},{"key":"e_1_3_2_2_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2008.2009515"},{"key":"e_1_3_2_2_30_1","first-page":"245","article-title":"On lp-hyperparameter learning via bilevel nonsmooth optimization","volume":"22","author":"Okuno T.","year":"2021","unstructured":"Okuno, T., Takeda, A., Kawana, A., and Watanabe, M. On lp-hyperparameter learning via bilevel nonsmooth optimization. Journal of Machine Learning Research 22, 245 (2021), 1--47.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_3_2_2_31_1","volume-title":"Tadam: Task dependent adaptive metric for improved few-shot learning. Advances in neural information processing systems 31","author":"Oreshkin B.","year":"2018","unstructured":"Oreshkin, B., Rodr\u00edguez L\u00f3pez, P., and Lacoste, A. Tadam: Task dependent adaptive metric for improved few-shot learning. Advances in neural information processing systems 31 (2018)."},{"key":"e_1_3_2_2_32_1","first-page":"737","volume-title":"International conference on machine learning","author":"Pedregosa F.","year":"2016","unstructured":"Pedregosa, F. Hyperparameter optimization with approximate gradient. In International conference on machine learning (2016), PMLR, pp. 737--746."},{"key":"e_1_3_2_2_33_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10846-017-0468-y"},{"key":"e_1_3_2_2_34_1","first-page":"34","article-title":"Stochastic optimization of areas under precision-recall curves with provable convergence","author":"Qi Q.","year":"2021","unstructured":"Qi, Q., Luo, Y., Xu, Z., Ji, S., and Yang, T. Stochastic optimization of areas under precision-recall curves with provable convergence. Advances in Neural Information Processing Systems 34 (2021).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_35_1","volume-title":"Meta-learning with implicit gradients. Advances in neural information processing systems 32","author":"Rajeswaran A.","year":"2019","unstructured":"Rajeswaran, A., Finn, C., Kakade, S. M., and Levine, S. Meta-learning with implicit gradients. Advances in neural information processing systems 32 (2019)."},{"key":"e_1_3_2_2_36_1","unstructured":"Ravi S. and Larochelle H. Optimization as a model for few-shot learning."},{"key":"e_1_3_2_2_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICOIN.2012.6164447"},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.amc.2004.10.063"},{"key":"e_1_3_2_2_39_1","first-page":"9217","volume-title":"Proceedings of International Conference on Machine Learning","author":"Sun H.","year":"2020","unstructured":"Sun, H., Lu, S., and Hong, M. Improving the sample and communication complexity for decentralized non-convex optimization: Joint gradient estimation and tracking. In Proceedings of International Conference on Machine Learning (2020), PMLR, pp. 9217--9228."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1007\/s40815-015-0036-1"},{"key":"e_1_3_2_2_41_1","first-page":"34","article-title":"Provably faster algorithms for bilevel optimization","author":"Yang J.","year":"2021","unstructured":"Yang, J., Ji, K., and Liang, Y. Provably faster algorithms for bilevel optimization. Advances in Neural Information Processing Systems 34 (2021).","journal-title":"Advances in Neural Information Processing Systems"},{"key":"e_1_3_2_2_42_1","volume-title":"-T. Docom-sgt: Doubly compressed momentum-assisted stochastic gradient tracking algorithm for communication efficient decentralized learning. arXiv preprint arXiv:2202.00255","author":"Yau C.-Y.","year":"2022","unstructured":"Yau, C.-Y., and Wai, H.-T. Docom-sgt: Doubly compressed momentum-assisted stochastic gradient tracking algorithm for communication efficient decentralized learning. arXiv preprint arXiv:2202.00255 (2022)."},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v34i05.6226"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/3466772.3467056"},{"key":"e_1_3_2_2_45_1","first-page":"34","article-title":"Taming communication and sample complexities in decentralized policy evaluation for cooperative multi-agent reinforcement learning","author":"Zhang X.","year":"2021","unstructured":"Zhang, X., Liu, Z., Liu, J., Zhu, Z., and Lu, S. Taming communication and sample complexities in decentralized policy evaluation for cooperative multi-agent reinforcement learning. Advances in Neural Information Processing Systems 34 (2021).","journal-title":"Advances in Neural Information Processing Systems"}],"event":{"name":"MobiHoc '22: The Twenty-third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing","location":"Seoul Republic of Korea","acronym":"MobiHoc '22","sponsor":["SIGMOBILE ACM Special Interest Group on Mobility of Systems, Users, Data and Computing"]},"container-title":["Proceedings of the Twenty-Third International Symposium on Theory, Algorithmic Foundations, and Protocol Design for Mobile Networks and Mobile Computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3492866.3549721","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3492866.3549721","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T20:48:27Z","timestamp":1750193307000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3492866.3549721"}},"subtitle":["achieving low sample and communication complexities in decentralized bilevel learning over networks"],"short-title":[],"issued":{"date-parts":[[2022,10,3]]},"references-count":45,"alternative-id":["10.1145\/3492866.3549721","10.1145\/3492866"],"URL":"https:\/\/doi.org\/10.1145\/3492866.3549721","relation":{},"subject":[],"published":{"date-parts":[[2022,10,3]]},"assertion":[{"value":"2022-10-03","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}