{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,12]],"date-time":"2025-11-12T14:16:22Z","timestamp":1762956982017,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":55,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,14]],"date-time":"2022-08-14T00:00:00Z","timestamp":1660435200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Hong Kong Reseach Grant Council","award":["14200321"],"award-info":[{"award-number":["14200321"]}]},{"DOI":"10.13039\/100010098","name":"Shanghai Association for Science and Technology","doi-asserted-by":"publisher","award":["22YF1402900"],"award-info":[{"award-number":["22YF1402900"]}],"id":[{"id":"10.13039\/100010098","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,14]]},"DOI":"10.1145\/3534678.3539379","type":"proceedings-article","created":{"date-parts":[[2022,8,12]],"date-time":"2022-08-12T19:06:12Z","timestamp":1660331172000},"page":"1031-1041","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":4,"title":["Partial-Quasi-Newton Methods"],"prefix":"10.1145","author":[{"given":"Chengchang","family":"Liu","sequence":"first","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuxian","family":"Bi","sequence":"additional","affiliation":[{"name":"University of Science and Technology of China, Hefei, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Luo","family":"Luo","sequence":"additional","affiliation":[{"name":"Fudan University, Shanghai, China"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"John C.S.","family":"Lui","sequence":"additional","affiliation":[{"name":"The Chinese University of Hong Kong, Hong Kong, China"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,8,14]]},"reference":[{"key":"e_1_3_2_2_1_1","volume-title":"Stochastic variance reduction for variational inequality methods. arXiv preprint arXiv:2102.08352","author":"Alacaoglu Ahmet","year":"2021","unstructured":"Ahmet Alacaoglu and Yura Malitsky. Stochastic variance reduction for variational inequality methods. arXiv preprint arXiv:2102.08352, 2021."},{"key":"e_1_3_2_2_2_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1967-0224273-2"},{"key":"e_1_3_2_2_3_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/6.1.76"},{"key":"e_1_3_2_2_4_1","volume-title":"The convergence of a class of double-rank minimization algorithms: 2. the new algorithm. IMA journal of applied mathematics, 6 (3): 222--231","author":"Broyden Charles G.","year":"1970","unstructured":"Charles G. Broyden. The convergence of a class of double-rank minimization algorithms: 2. the new algorithm. IMA journal of applied mathematics, 6 (3): 222--231, 1970 b."},{"key":"e_1_3_2_2_5_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/12.3.223"},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1961189.1961199"},{"key":"e_1_3_2_2_7_1","volume-title":"NeurIPS","author":"Chavdarova Tatjana","year":"2019","unstructured":"Tatjana Chavdarova, Gauthier Gidel, Francc ois Fleuret, and Simon Lacoste-Julien. Reducing noise in GAN training with variance reduced extragradient. In NeurIPS, 2019."},{"key":"e_1_3_2_2_8_1","volume-title":"NIPS","author":"Cortes Corinna","year":"2003","unstructured":"Corinna Cortes and Mehryar Mohri. Auc optimization vs. error rate minimization. In NIPS, 2003."},{"key":"e_1_3_2_2_9_1","volume-title":"ICLR","author":"Daskalakis Constantinos","year":"2018","unstructured":"Constantinos Daskalakis, Andrew Ilyas, Vasilis Syrgkanis, and Haoyang Zeng. Training GANs with optimism. In ICLR, 2018."},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/0801001"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"publisher","DOI":"10.1090\/S0025-5718-1974-0343581-1"},{"key":"e_1_3_2_2_12_1","volume-title":"NIPS","author":"Erdogdu Murat A","year":"2015","unstructured":"Murat A Erdogdu and Andrea Montanari. Convergence rates of sub-sampled newton methods. NIPS, 2015."},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/6.2.163"},{"key":"e_1_3_2_2_14_1","volume-title":"ICML","author":"Guo Zhishuai","year":"2020","unstructured":"Zhishuai Guo, Mingrui Liu, Zhuoning Yuan, Li Shen, Wei Liu, and Tianbao Yang. Communication-efficient distributed stochastic AUC maximization with deep neural networks. In ICML, 2020."},{"key":"e_1_3_2_2_15_1","first-page":"1","volume-title":"Causation and Prediction Challenge","author":"Guyon Isabelle","year":"2008","unstructured":"Isabelle Guyon, Constantin Aliferis, Greg Cooper, Andr\u00e9 Elisseeff, Jean-Philippe Pellet, Peter Spirtes, and Alexander Statnikov. Design and analysis of the causation and prediction challenge. In Causation and Prediction Challenge, pages 1--33. PMLR, 2008. Dataset available at http:\/\/www.causality.inf.ethz.ch\/data\/SIDO.html."},{"key":"e_1_3_2_2_16_1","doi-asserted-by":"publisher","DOI":"10.1148\/radiology.143.1.7063747"},{"key":"e_1_3_2_2_17_1","volume-title":"Cubic regularized Newton method for saddle point models: a global and local convergence analysis. arXiv preprint arXiv:2008.09919","author":"Huang Kevin","year":"2020","unstructured":"Kevin Huang, Junyu Zhang, and Shuzhong Zhang. Cubic regularized Newton method for saddle point models: a global and local convergence analysis. arXiv preprint arXiv:2008.09919, 2020."},{"key":"e_1_3_2_2_18_1","volume-title":"Non-asymptotic superlinear convergence of standard quasi-Newton methods. arXiv preprint arXiv:2003.13607","author":"Jin Qiujiang","year":"2020","unstructured":"Qiujiang Jin and Aryan Mokhtari. Non-asymptotic superlinear convergence of standard quasi-Newton methods. arXiv preprint arXiv:2003.13607, 2020."},{"key":"e_1_3_2_2_19_1","first-page":"747","article-title":"An extragradient method for finding saddle points and for other problems","volume":"12","author":"Korpelevich G. M.","year":"1976","unstructured":"G. M. Korpelevich. An extragradient method for finding saddle points and for other problems. Matecon, 12: 747--756, 1976.","journal-title":"Matecon"},{"key":"e_1_3_2_2_20_1","volume-title":"SIGKDD","author":"Lim Cong Han","year":"2018","unstructured":"Ching-pei Lee, Cong Han Lim, and Stephen J. Wright. A distributed quasi-newton algorithm for empirical risk minimization with nonsmooth regularization. In SIGKDD, 2018."},{"key":"e_1_3_2_2_21_1","volume-title":"Explicit superlinear convergence rates of Broyden's methods in nonlinear equations. arXiv preprint arXiv:2109.01974","author":"Lin Dachao","year":"2021","unstructured":"Dachao Lin, Haishan Ye, and Zhihua Zhang. Explicit superlinear convergence rates of Broyden's methods in nonlinear equations. arXiv preprint arXiv:2109.01974, 2021 a."},{"key":"e_1_3_2_2_22_1","volume-title":"Explicit convergence rates of greedy and random quasi-Newton methods. arXiv preprint arXiv:2104.08764","author":"Lin Dachao","year":"2021","unstructured":"Dachao Lin, Haishan Ye, and Zhihua Zhang. Explicit convergence rates of greedy and random quasi-Newton methods. arXiv preprint arXiv:2104.08764, 2021 b."},{"key":"e_1_3_2_2_23_1","volume-title":"COLT","author":"Lin Tianyi","year":"2020","unstructured":"Tianyi Lin, Chi Jin, and Michael I. Jordan. Near-optimal algorithms for minimax optimization. In COLT, 2020."},{"key":"e_1_3_2_2_24_1","volume-title":"Quasi-Newton methods for saddle point problems and beyond. arXiv preprint arXiv:2111.02708","author":"Liu Chengchang","year":"2021","unstructured":"Chengchang Liu and Luo Luo. Quasi-Newton methods for saddle point problems and beyond. arXiv preprint arXiv:2111.02708, 2021."},{"key":"e_1_3_2_2_25_1","volume-title":"Stochastic AUC maximization with deep neural networks. arXiv preprint arXiv:1908.10831","author":"Liu Mingrui","year":"2019","unstructured":"Mingrui Liu, Zhuoning Yuan, Yiming Ying, and Tianbao Yang. Stochastic AUC maximization with deep neural networks. arXiv preprint arXiv:1908.10831, 2019."},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1081870.1081950"},{"key":"e_1_3_2_2_27_1","volume-title":"A stochastic proximal point algorithm for saddle-point problems. arXiv preprint arXiv:1909.06946","author":"Luo Luo","year":"2019","unstructured":"Luo Luo, Cheng Chen, Yujun Li, Guangzeng Xie, and Zhihua Zhang. A stochastic proximal point algorithm for saddle-point problems. arXiv preprint arXiv:1909.06946, 2019."},{"key":"e_1_3_2_2_28_1","volume-title":"Near optimal stochastic algorithms for finite-sum unbalanced convex-concave minimax optimization. arXiv preprint arXiv:2106.01761","author":"Luo Luo","year":"2021","unstructured":"Luo Luo, Guangzeng Xie, Tong Zhang, and Zhihua Zhang. Near optimal stochastic algorithms for finite-sum unbalanced convex-concave minimax optimization. arXiv preprint arXiv:2106.01761, 2021."},{"key":"e_1_3_2_2_29_1","volume-title":"AISTATA","author":"Mokhtari Aryan","year":"2020","unstructured":"Aryan Mokhtari, Asuman Ozdaglar, and Sarath Pattathil. A unified analysis of extra-gradient and optimistic gradient methods for saddle point problems: Proximal point approach. In AISTATA, 2020."},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.5555\/2794613.3114269"},{"key":"e_1_3_2_2_31_1","doi-asserted-by":"publisher","DOI":"10.3934\/dcds.2011.31.1383"},{"key":"e_1_3_2_2_32_1","volume-title":"Numerical Optimization","author":"Nocedal Jorge","year":"2006","unstructured":"Jorge Nocedal and Stephen J. Wright. Numerical Optimization. Springer, New York, NY, USA, second edition, 2006."},{"key":"e_1_3_2_2_33_1","volume-title":"Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. arXiv preprint:1808.02901","author":"Ouyang Yuyuan","year":"2018","unstructured":"Yuyuan Ouyang and Yangyang Xu. Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems. arXiv preprint:1808.02901, 2018."},{"key":"e_1_3_2_2_34_1","volume-title":"NIPS","author":"Palaniappan Balamurugan","year":"2016","unstructured":"Balamurugan Palaniappan and Francis Bach. Stochastic variance reduction methods for saddle-point problems. In NIPS, 2016."},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1137\/15M1021106"},{"key":"e_1_3_2_2_36_1","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/1130.003.0016"},{"key":"e_1_3_2_2_37_1","volume-title":"A modification of the arrow-hurwicz method for search of saddle points. Mathematical notes of the Academy of Sciences of the USSR, 28 (5): 845--848","author":"Popov Leonid Denisovich","year":"1980","unstructured":"Leonid Denisovich Popov. A modification of the arrow-hurwicz method for search of saddle points. Mathematical notes of the Academy of Sciences of the USSR, 28 (5): 845--848, 1980."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1093\/imamat\/7.1.21"},{"key":"e_1_3_2_2_39_1","volume-title":"A survey on datasets for fairness-aware machine learning","author":"Quy Tai Le","year":"2021","unstructured":"Tai Le Quy, Arjun Roy, Vasileios Iosifidis, and Eirini Ntoutsi. A survey on datasets for fairness-aware machine learning, 2021."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1137\/0613040"},{"key":"e_1_3_2_2_41_1","series-title":"SIAM journal on control and optimization, 14 (5): 877--898","volume-title":"Monotone operators and the proximal point algorithm","author":"Rockafellar R. Tyrrell","year":"1976","unstructured":"R. Tyrrell Rockafellar. Monotone operators and the proximal point algorithm. SIAM journal on control and optimization, 14 (5): 877--898, 1976."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1137\/20M1320651"},{"key":"e_1_3_2_2_43_1","volume-title":"New results on superlinear convergence of classical quasi-Newton methods. Journal of optimization theory and applications, 188 (3): 744--769","author":"Rodomanov Anton","year":"2021","unstructured":"Anton Rodomanov and Yurii Nesterov. New results on superlinear convergence of classical quasi-Newton methods. Journal of optimization theory and applications, 188 (3): 744--769, 2021 b ."},{"key":"e_1_3_2_2_44_1","first-page":"1","volume-title":"Mathematical Programming","author":"Rodomanov Anton","year":"2021","unstructured":"Anton Rodomanov and Yurii Nesterov. Rates of superlinear convergence for classical quasi-Newton methods. Mathematical Programming, pages 1--32, 2021 c."},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-018-1346-5"},{"key":"e_1_3_2_2_46_1","volume-title":"Conditioning of quasi-Newton methods for function minimization. Mathematics of computation, 24 (111): 647--656","author":"Shanno David F.","year":"1970","unstructured":"David F. Shanno. Conditioning of quasi-Newton methods for function minimization. Mathematics of computation, 24 (111): 647--656, 1970."},{"key":"e_1_3_2_2_47_1","volume-title":"On accelerated methods for saddle-point problems with composite structure. arXiv preprint arXiv:2103.09344","author":"Tominin Vladislav","year":"2021","unstructured":"Vladislav Tominin, Yaroslav Tominin, Ekaterina Borodich, Dmitry Kovalev, Alexander Gasnikov, and Pavel Dvurechensky. On accelerated methods for saddle-point problems with composite structure. arXiv preprint arXiv:2103.09344, 2021."},{"key":"e_1_3_2_2_48_1","doi-asserted-by":"publisher","DOI":"10.1016\/0377-0427(94)00094-H"},{"key":"e_1_3_2_2_49_1","volume-title":"NeurIPS","author":"Wang Yuanhao","year":"2020","unstructured":"Yuanhao Wang and Jian Li. Improved algorithms for convex-concave minimax optimization. In NeurIPS, 2020."},{"key":"e_1_3_2_2_50_1","volume-title":"ICML","author":"Xie Guangzeng","year":"2020","unstructured":"Guangzeng Xie, Luo Luo, Yijiang Lian, and Zhihua Zhang. Lower complexity bounds for finite-sum convex-concave minimax optimization problems. In ICML, 2020."},{"key":"e_1_3_2_2_51_1","volume-title":"NIPS","author":"Xu Peng","year":"2016","unstructured":"Peng Xu, Jiyan Yang, Fred Roosta, Christopher R\u00e9, and Michael W. Mahoney. Sub-sampled Newton methods with non-uniform sampling. NIPS, 2016."},{"key":"e_1_3_2_2_52_1","volume-title":"ICML","author":"Ye Haishan","year":"2017","unstructured":"Haishan Ye, Luo Luo, and Zhihua Zhang. Approximate Newton methods and their local convergence. In ICML, 2017."},{"key":"e_1_3_2_2_53_1","volume-title":"Explicit superlinear convergence rates of the SR1 algorithm. arXiv preprint arXiv:2105.07162","author":"Ye Haishan","year":"2021","unstructured":"Haishan Ye, Dachao Lin, Zhihua Zhang, and Xiangyu Chang. Explicit superlinear convergence rates of the SR1 algorithm. arXiv preprint arXiv:2105.07162, 2021."},{"key":"e_1_3_2_2_54_1","volume-title":"NIPS","author":"Ying Yiming","year":"2016","unstructured":"Yiming Ying, Longyin Wen, and Siwei Lyu. Stochastic online AUC maximization. NIPS, 2016."},{"key":"e_1_3_2_2_55_1","doi-asserted-by":"publisher","DOI":"10.1145\/3278721.3278779"}],"event":{"name":"KDD '22: The 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","sponsor":["SIGMOD ACM Special Interest Group on Management of Data","SIGKDD ACM Special Interest Group on Knowledge Discovery in Data"],"location":"Washington DC USA","acronym":"KDD '22"},"container-title":["Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539379","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3534678.3539379","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:47Z","timestamp":1750186967000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3534678.3539379"}},"subtitle":["Efficient Algorithms for Minimax Optimization Problems with Unbalanced Dimensionality"],"short-title":[],"issued":{"date-parts":[[2022,8,14]]},"references-count":55,"alternative-id":["10.1145\/3534678.3539379","10.1145\/3534678"],"URL":"https:\/\/doi.org\/10.1145\/3534678.3539379","relation":{},"subject":[],"published":{"date-parts":[[2022,8,14]]},"assertion":[{"value":"2022-08-14","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}