{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T00:31:07Z","timestamp":1767141067093,"version":"build-2238731810"},"reference-count":63,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T00:00:00Z","timestamp":1695427200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T00:00:00Z","timestamp":1695427200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"funder":[{"DOI":"10.13039\/100006192","name":"Advanced Scientific Computing Research","doi-asserted-by":"publisher","award":["FWP CC064CCAA"],"award-info":[{"award-number":["FWP CC064CCAA"]}],"id":[{"id":"10.13039\/100006192","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Comput Optim Appl"],"published-print":{"date-parts":[[2024,3]]},"DOI":"10.1007\/s10589-023-00528-6","type":"journal-article","created":{"date-parts":[[2023,9,23]],"date-time":"2023-09-23T02:01:36Z","timestamp":1695434496000},"page":"397-437","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Stochastic projective splitting"],"prefix":"10.1007","volume":"87","author":[{"given":"Patrick R.","family":"Johnstone","sequence":"first","affiliation":[]},{"given":"Jonathan","family":"Eckstein","sequence":"additional","affiliation":[]},{"given":"Thomas","family":"Flynn","sequence":"additional","affiliation":[]},{"given":"Shinjae","family":"Yoo","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,9,23]]},"reference":[{"key":"528_CR1","doi-asserted-by":"crossref","unstructured":"Alacaoglu, A., Malitsky, Y., Cevher, V.: Forward-reflected-backward method with variance reduction. Comput. Optim. Appl. (2021)","DOI":"10.1007\/s10589-021-00305-3"},{"issue":"4","key":"528_CR2","doi-asserted-by":"publisher","first-page":"2076","DOI":"10.1137\/130950616","volume":"24","author":"A Alotaibi","year":"2014","unstructured":"Alotaibi, A., Combettes, P.L., Shahzad, N.: Solving coupled composite monotone inclusions by successive Fej\u00e9r approximations of their Kuhn\u2013Tucker set. SIAM J. Optim. 24(4), 2076\u20132095 (2014)","journal-title":"SIAM J. Optim."},{"issue":"1","key":"528_CR3","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1038\/ncomms5308","volume":"5","author":"P Baldi","year":"2014","unstructured":"Baldi, P., Sadowski, P., Whiteson, D.: Searching for exotic particles in high-energy physics with deep learning. Nat. Commun. 5(1), 1\u20139 (2014)","journal-title":"Nat. Commun."},{"key":"528_CR4","unstructured":"Balduzzi, D., Racaniere, S., Martens, J., Foerster, J., Tuyls, K., Graepel, T.: The mechanics of $$n$$-player differentiable games. In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a080, pp. 354\u2013363. PMLR (2018)"},{"key":"528_CR5","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-48311-5","volume-title":"Convex Analysis and Monotone Operator Theory in Hilbert Spaces","author":"HH Bauschke","year":"2017","unstructured":"Bauschke, H.H., Combettes, P.L.: Convex Analysis and Monotone Operator Theory in Hilbert Spaces, 2nd edn. Springer, Berlin (2017)","edition":"2"},{"issue":"2","key":"528_CR6","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1287\/stsy.2019.0064","volume":"11","author":"RI Bo\u0163","year":"2021","unstructured":"Bo\u0163, R.I., Mertikopoulos, P., Staudigl, M., Vuong, P.T.: Minibatch forward-backward-forward methods for solving stochastic variational inequalities. Stoch. Syst. 11(2), 112\u2013139 (2021)","journal-title":"Stoch. Syst."},{"key":"528_CR7","unstructured":"B\u00f6hm, A., Sedlmayer, M., Csetnek, E.R., Bo\u0163, R.I.: Two steps at a time\u2014taking GAN training in stride with Tseng\u2019s method. arXiv preprint arXiv:2006.09033 (2020)"},{"key":"528_CR8","doi-asserted-by":"crossref","unstructured":"Bottou, L.: Large-scale machine learning with stochastic gradient descent. In: Proceedings of COMPSTAT\u20192010: 19th International Conference on Computational Statistics, pp. 177\u2013186. Springer, Berlin (2010)","DOI":"10.1007\/978-3-7908-2604-3_16"},{"issue":"2","key":"528_CR9","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1137\/16M1080173","volume":"60","author":"L Bottou","year":"2018","unstructured":"Bottou, L., Curtis, F.E., Nocedal, J.: Optimization methods for large-scale machine learning. SIAM Rev. 60(2), 223\u2013311 (2018)","journal-title":"SIAM Rev."},{"issue":"4","key":"528_CR10","doi-asserted-by":"publisher","first-page":"1230","DOI":"10.1137\/10081602X","volume":"21","author":"LM Brice\u00f1o-Arias","year":"2011","unstructured":"Brice\u00f1o-Arias, L.M., Combettes, P.L.: A monotone+skew splitting model for composite monotone inclusions in duality. SIAM J. Optim. 21(4), 1230\u20131250 (2011)","journal-title":"SIAM J. Optim."},{"issue":"3\u20134","key":"528_CR11","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1561\/2200000050","volume":"8","author":"S Bubeck","year":"2015","unstructured":"Bubeck, S.: Convex optimization: algorithms and complexity. Found. Trends Mach. Learn. 8(3\u20134), 231\u2013357 (2015)","journal-title":"Found. Trends Mach. Learn."},{"key":"528_CR12","unstructured":"Celis, L.E., Keswani, V.: Improved adversarial learning for fair classification. arXiv preprint arXiv:1901.10443 (2019)"},{"key":"528_CR13","doi-asserted-by":"crossref","unstructured":"Chang, C.C., Lin, C.J.: LIBSVM: A library for support vector machines. ACM Trans. Intell. Syst. Technol. 2, 27:1\u201327:27 (2011). Software available at http:\/\/www.csie.ntu.edu.tw\/~cjlin\/libsvm","DOI":"10.1145\/1961189.1961199"},{"key":"528_CR14","unstructured":"Chavdarova, T., Pagliardini, M., Stich, S.U., Fleuret, F., Jaggi, M.: Taming GANs with lookahead-minmax. In: International Conference on Learning Representations (2021). https:\/\/openreview.net\/forum?id=ZW0yXJyNmoG"},{"issue":"1\u20132","key":"528_CR15","doi-asserted-by":"publisher","first-page":"645","DOI":"10.1007\/s10107-016-1044-0","volume":"168","author":"PL Combettes","year":"2018","unstructured":"Combettes, P.L., Eckstein, J.: Asynchronous block-iterative primal-dual decomposition methods for monotone inclusions. Math. Program. 168(1\u20132), 645\u2013672 (2018)","journal-title":"Math. Program."},{"key":"528_CR16","doi-asserted-by":"crossref","unstructured":"Combettes, P.L., Pesquet, J.C.: Proximal splitting methods in signal processing. In: Bauschke, H., Burachik, R., Combettes, P., Elser, V., Luke, D., Wolkowicz, H. (eds.) Fixed-Point Algorithms for Inverse Problems in Science and Engineering, pp. 185\u2013212. Springer, Berlin (2011)","DOI":"10.1007\/978-1-4419-9569-8_10"},{"issue":"2","key":"528_CR17","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/s11228-011-0191-y","volume":"20","author":"PL Combettes","year":"2012","unstructured":"Combettes, P.L., Pesquet, J.C.: Primal-dual splitting algorithm for solving inclusions with mixtures of composite, Lipschitzian, and parallel-sum type monotone operators. Set-Valued Var. Anal. 20(2), 307\u2013330 (2012)","journal-title":"Set-Valued Var. Anal."},{"issue":"2","key":"528_CR18","doi-asserted-by":"publisher","first-page":"1221","DOI":"10.1137\/140971233","volume":"25","author":"PL Combettes","year":"2015","unstructured":"Combettes, P.L., Pesquet, J.C.: Stochastic quasi-Fej\u00e9r block-coordinate fixed point iterations with random sweeping. SIAM J. Optim. 25(2), 1221\u20131248 (2015)","journal-title":"SIAM J. Optim."},{"key":"528_CR19","unstructured":"Daskalakis, C., Ilyas, A., Syrgkanis, V., Zeng, H.: Training GANs with optimism. In: International Conference on Learning Representations (2018). https:\/\/openreview.net\/forum?id=SJJySbbAZ"},{"issue":"4","key":"528_CR20","doi-asserted-by":"publisher","first-page":"829","DOI":"10.1007\/s11228-017-0421-z","volume":"25","author":"D Davis","year":"2017","unstructured":"Davis, D., Yin, W.: A three-operator splitting scheme and its optimization applications. Set-Valued Var. Anal. 25(4), 829\u2013858 (2017)","journal-title":"Set-Valued Var. Anal."},{"key":"528_CR21","unstructured":"Diakonikolas, J.: Halpern iteration for near-optimal and parameter-free monotone inclusion and strong solutions to variational inequalities. In: Conference on Learning Theory, pp. 1428\u20131451. PMLR (2020)"},{"key":"528_CR22","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"issue":"1","key":"528_CR23","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1007\/s10957-017-1074-7","volume":"173","author":"J Eckstein","year":"2017","unstructured":"Eckstein, J.: A simplified form of block-iterative operator splitting and an asynchronous algorithm resembling the multi-block alternating direction method of multipliers. J. Optim. Theory Appl. 173(1), 155\u2013182 (2017)","journal-title":"J. Optim. Theory Appl."},{"issue":"1","key":"528_CR24","first-page":"173","volume":"111","author":"J Eckstein","year":"2008","unstructured":"Eckstein, J., Svaiter, B.F.: A family of projective splitting methods for the sum of two maximal monotone operators. Math. Program. 111(1), 173\u2013199 (2008)","journal-title":"Math. Program."},{"issue":"2","key":"528_CR25","doi-asserted-by":"publisher","first-page":"787","DOI":"10.1137\/070698816","volume":"48","author":"J Eckstein","year":"2009","unstructured":"Eckstein, J., Svaiter, B.F.: General projective splitting methods for sums of maximal monotone operators. SIAM J. Control. Optim. 48(2), 787\u2013811 (2009)","journal-title":"SIAM J. Control. Optim."},{"key":"528_CR26","unstructured":"Edwards, H., Storkey, A.: Censoring representations with an adversary. arXiv preprint arXiv:1511.05897 (2015)"},{"key":"528_CR27","doi-asserted-by":"crossref","unstructured":"Gabay, D.: Applications of the method of multipliers to variational inequalities. In: Fortin, M., Glowinski, R. (eds.) Augmented Lagrangian Methods: Applications to the Solution of Boundary Value Problems, chap.\u00a0IX, pp. 299\u2013340. North-Holland, Amsterdam (1983)","DOI":"10.1016\/S0168-2024(08)70034-1"},{"key":"528_CR28","unstructured":"Gidel, G., Berard, H., Vignoud, G., Vincent, P., Lacoste-Julien, S.: A variational inequality perspective on generative adversarial networks. In: International Conference on Learning Representations (2019). https:\/\/openreview.net\/forum?id=r1laEnA5Ym"},{"key":"528_CR29","unstructured":"Goodfellow, I., Pouget-Abadie, J., Mirza, M., Xu, B., Warde-Farley, D., Ozair, S., Courville, A., Bengio, Y.: Generative adversarial nets. In: Ghahramani, Z., Welling, M., Cortes, C., Lawrence, N., Weinberger, K.Q. (eds.) Advances in Neural Information Processing Systems, vol.\u00a027. Curran Associates (2014)"},{"key":"528_CR30","unstructured":"Grnarova, P., Kilcher, Y., Levy, K.Y., Lucchi, A., Hofmann, T.: Generative minimization networks: training GANs without competition. arXiv preprint arXiv:2103.12685 (2021)"},{"key":"528_CR31","unstructured":"Hsieh, Y.G., Iutzeler, F., Malick, J., Mertikopoulos, P.: On the convergence of single-call stochastic extra-gradient methods. In: Wallach, H., Larochelle, H., Beygelzimer, A., d\u2019Alch\u00e9 Buc, F., Fox, E., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a032. Curran Associates (2019)"},{"key":"528_CR32","unstructured":"Hsieh, Y.G., Iutzeler, F., Malick, J., Mertikopoulos, P.: Explore aggressively, update conservatively: Stochastic extragradient methods with variable stepsize scaling. In: Larochelle, H., Ranzato, M., Hadsell, R., Balcan, M.F., Lin, H. (eds.) Advances in Neural Information Processing Systems, vol.\u00a033, pp. 16223\u201316234. Curran Associates (2020)"},{"issue":"12","key":"528_CR33","doi-asserted-by":"publisher","first-page":"656","DOI":"10.3390\/e19120656","volume":"19","author":"C Huang","year":"2017","unstructured":"Huang, C., Kairouz, P., Chen, X., Sankar, L., Rajagopal, R.: Context-aware generative adversarial privacy. Entropy 19(12), 656 (2017)","journal-title":"Entropy"},{"issue":"3","key":"528_CR34","doi-asserted-by":"publisher","first-page":"1931","DOI":"10.1137\/18M1203523","volume":"29","author":"PR Johnstone","year":"2019","unstructured":"Johnstone, P.R., Eckstein, J.: Convergence rates for projective splitting. SIAM J. Optim. 29(3), 1931\u20131957 (2019)","journal-title":"SIAM J. Optim."},{"key":"528_CR35","doi-asserted-by":"crossref","unstructured":"Johnstone, P.R., Eckstein, J.: Single-forward-step projective splitting: exploiting cocoercivity. arXiv preprint arXiv:1902.09025 (2019)","DOI":"10.1007\/s10589-020-00238-3"},{"issue":"1","key":"528_CR36","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1007\/s11590-019-01509-7","volume":"14","author":"PR Johnstone","year":"2020","unstructured":"Johnstone, P.R., Eckstein, J.: Projective splitting with forward steps only requires continuity. Optim. Lett. 14(1), 229\u2013247 (2020)","journal-title":"Optim. Lett."},{"issue":"1","key":"528_CR37","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1007\/s10589-020-00238-3","volume":"78","author":"PR Johnstone","year":"2021","unstructured":"Johnstone, P.R., Eckstein, J.: Single-forward-step projective splitting: exploiting cocoercivity. Comput. Optim. Appl. 78(1), 125\u2013166 (2021)","journal-title":"Comput. Optim. Appl."},{"issue":"2","key":"528_CR38","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1007\/s10107-020-01565-3","volume":"191","author":"PR Johnstone","year":"2022","unstructured":"Johnstone, P.R., Eckstein, J.: Projective splitting with forward steps. Math. Program. 191(2), 631\u2013670 (2022)","journal-title":"Math. Program."},{"issue":"4","key":"528_CR39","first-page":"35","volume":"13","author":"G Korpelevich","year":"1977","unstructured":"Korpelevich, G.: Extragradient method for finding saddle points and other problems. Matekon 13(4), 35\u201349 (1977)","journal-title":"Matekon"},{"key":"528_CR40","doi-asserted-by":"crossref","unstructured":"Kuhn, D., Esfahani, P.M., Nguyen, V.A., Shafieezadeh-Abadeh, S.: Wasserstein distributionally robust optimization: theory and applications in machine learning. In: Netessine, S. (ed.) Operations Research & Management Science in the Age of Analytics, Tutorials in Operations Research, pp. 130\u2013166. INFORMS (2019)","DOI":"10.1287\/educ.2019.0198"},{"key":"528_CR41","unstructured":"Li, C.J., Yu, Y., Loizou, N., Gidel, G., Ma, Y., Roux, N.L., Jordan, M.I.: On the convergence of stochastic extragradient for bilinear games with restarted iteration averaging. arXiv preprint arXiv:2107.00464 (2021)"},{"key":"528_CR42","unstructured":"Lin, T., Jin, C., Jordan, M.: On gradient descent ascent for nonconvex-concave minimax problems. In: Singh, H.D. III, A (ed.) Proceedings of the 37th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol. 119, pp. 6083\u20136093. PMLR (2020)"},{"issue":"6","key":"528_CR43","doi-asserted-by":"publisher","first-page":"964","DOI":"10.1137\/0716071","volume":"16","author":"PL Lions","year":"1979","unstructured":"Lions, P.L., Mercier, B.: Splitting algorithms for the sum of two nonlinear operators. SIAM J. Numer. Anal. 16(6), 964\u2013979 (1979)","journal-title":"SIAM J. Numer. Anal."},{"issue":"2","key":"528_CR44","doi-asserted-by":"publisher","first-page":"1451","DOI":"10.1137\/18M1207260","volume":"30","author":"Y Malitsky","year":"2020","unstructured":"Malitsky, Y., Tam, M.K.: A forward-backward splitting method for monotone inclusions without cocoercivity. SIAM J. Optim. 30(2), 1451\u20131472 (2020)","journal-title":"SIAM J. Optim."},{"key":"528_CR45","unstructured":"Mescheder, L., Geiger, A., Nowozin, S.: Which training methods for GANs do actually converge? In: Dy, J., Krause, A. (eds.) Proceedings of the 35th International Conference on Machine Learning, Proceedings of Machine Learning Research, vol.\u00a080, pp. 3481\u20133490. PMLR (2018)"},{"key":"528_CR46","unstructured":"Mescheder, L., Nowozin, S., Geiger, A.: The numerics of GANs. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a030. Curran Associates (2017)"},{"issue":"6","key":"528_CR47","doi-asserted-by":"publisher","first-page":"2755","DOI":"10.1137\/090753127","volume":"20","author":"RD Monteiro","year":"2010","unstructured":"Monteiro, R.D., Svaiter, B.F.: On the complexity of the hybrid proximal extragradient method for the iterates and the ergodic mean. SIAM J. Optim. 20(6), 2755\u20132787 (2010)","journal-title":"SIAM J. Optim."},{"key":"528_CR48","unstructured":"Nagarajan, V., Kolter, J.Z.: Gradient descent GAN optimization is locally stable. In: Guyon, I., Luxburg, U.V., Bengio, S., Wallach, H., Fergus, R., Vishwanathan, S., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a030. Curran Associates (2017)"},{"key":"528_CR49","unstructured":"Namkoong, H., Duchi, J.C.: Stochastic gradient methods for distributionally robust optimization with $$f$$-divergences. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a029. Curran Associates (2016)"},{"issue":"1","key":"528_CR50","doi-asserted-by":"publisher","first-page":"229","DOI":"10.1137\/S1052623403425629","volume":"15","author":"A Nemirovski","year":"2004","unstructured":"Nemirovski, A.: Prox-method with rate of convergence O$$(1\/t)$$ for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems. SIAM J. Optim. 15(1), 229\u2013251 (2004)","journal-title":"SIAM J. Optim."},{"issue":"3","key":"528_CR51","first-page":"123","volume":"1","author":"N Parikh","year":"2013","unstructured":"Parikh, N., Boyd, S.: Proximal algorithms. Found. Trends Optim. 1(3), 123\u2013231 (2013)","journal-title":"Found. Trends Optim."},{"key":"528_CR52","unstructured":"Pedregosa, F., Fatras, K., Casotto, M.: Proximal splitting meets variance reduction. In: Chaudhuri, K., Sugiyama, M. (eds.) Proceedings of the Twenty-Second International Conference on Artificial Intelligence and Statistics, Proceedings of Machine Learning Research, vol.\u00a089, pp. 1\u201310. PMLR (2019)"},{"key":"528_CR53","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"H Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Stat. 22, 400\u2013407 (1951)","journal-title":"Ann. Math. Stat."},{"key":"528_CR54","doi-asserted-by":"crossref","unstructured":"Rockafellar, R.T.: Monotone operators associated with saddle-functions and minimax problems. Nonlinear Funct. Anal. 18(part 1), 397\u2013407 (1970)","DOI":"10.1090\/pspum\/018.1\/0285942"},{"issue":"1","key":"528_CR55","first-page":"3","volume":"15","author":"EK Ryu","year":"2016","unstructured":"Ryu, E.K., Boyd, S.: Primer on monotone operator methods. Appl. Comput. Math 15(1), 3\u201343 (2016)","journal-title":"Appl. Comput. Math"},{"key":"528_CR56","unstructured":"Shafieezadeh-Abadeh, S., Esfahani, P.M., Kuhn, D.: Distributionally robust logistic regression. In: Cortes, C., Lawrence, N.D., Lee, D.D., Sugiyama, M., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a028, pp. 1576\u20131584. Curran Associates (2015)"},{"key":"528_CR57","unstructured":"Sinha, A., Namkoong, H., Duchi, J.: Certifying some distributional robustness with principled adversarial training. In: International Conference on Learning Representations (2018). https:\/\/openreview.net\/forum?id=Hk6kPgZA-"},{"issue":"2","key":"528_CR58","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1137\/S0363012998338806","volume":"38","author":"P Tseng","year":"2000","unstructured":"Tseng, P.: A modified forward\u2013backward splitting method for maximal monotone mappings. SIAM J. Control. Optim. 38(2), 431\u2013446 (2000)","journal-title":"SIAM J. Control. Optim."},{"key":"528_CR59","unstructured":"Van\u00a0Dung, N., Vu, B.C.: Convergence analysis of the stochastic reflected forward\u2013backward splitting algorithm. arXiv preprint arXiv:2102.08906 (2021)"},{"key":"528_CR60","unstructured":"Wadsworth, C., Vera, F., Piech, C.: Achieving fairness through adversarial learning: an application to recidivism prediction. arXiv preprint arXiv:1807.00199 (2018)"},{"key":"528_CR61","unstructured":"Yu, Y., Lin, T., Mazumdar, E., Jordan, M.I.: Fast distributionally robust learning with variance reduced min-max optimization. arXiv preprint arXiv:2104.13326 (2021)"},{"key":"528_CR62","unstructured":"Yurtsever, A., Vu, B.C., Cevher, V.: Stochastic three-composite convex minimization. In: Lee, D., Sugiyama, M., Luxburg, U., Guyon, I., Garnett, R. (eds.) Advances in Neural Information Processing Systems, vol.\u00a029. Curran Associates (2016)"},{"key":"528_CR63","doi-asserted-by":"crossref","unstructured":"Zhang, B.H., Lemoine, B., Mitchell, M.: Mitigating unwanted biases with adversarial learning. In: Proceedings of the 2018 AAAI\/ACM Conference on AI, Ethics, and Society, pp. 335\u2013340 (2018)","DOI":"10.1145\/3278721.3278779"}],"updated-by":[{"DOI":"10.1007\/s10589-023-00539-3","type":"correction","label":"Correction","source":"publisher","updated":{"date-parts":[[2023,10,27]],"date-time":"2023-10-27T00:00:00Z","timestamp":1698364800000}}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00528-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10589-023-00528-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10589-023-00528-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,16]],"date-time":"2024-02-16T08:06:55Z","timestamp":1708070815000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10589-023-00528-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,9,23]]},"references-count":63,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,3]]}},"alternative-id":["528"],"URL":"https:\/\/doi.org\/10.1007\/s10589-023-00528-6","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"value":"0926-6003","type":"print"},{"value":"1573-2894","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,9,23]]},"assertion":[{"value":"5 July 2022","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"1 September 2023","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 September 2023","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"27 October 2023","order":4,"name":"change_date","label":"Change Date","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"Correction","order":5,"name":"change_type","label":"Change Type","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"A Correction to this paper has been published:","order":6,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"https:\/\/doi.org\/10.1007\/s10589-023-00539-3","URL":"https:\/\/doi.org\/10.1007\/s10589-023-00539-3","order":7,"name":"change_details","label":"Change Details","group":{"name":"ArticleHistory","label":"Article History"}},{"order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The authors have no competing interests to declare with regards to the current study.","order":2,"name":"Ethics","group":{"name":"EthicsHeading","label":"Conflict of interest"}}]}}