{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,19]],"date-time":"2026-08-19T18:01:59Z","timestamp":1787162519310,"version":"build-2736575974"},"reference-count":85,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,3,1]],"date-time":"2023-03-01T00:00:00Z","timestamp":1677628800000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"NSF-Simons MoDL","award":["2031895"],"award-info":[{"award-number":["2031895"]}]},{"name":"NSF HDR TRIPODS","award":["1934960"],"award-info":[{"award-number":["1934960"]}]},{"name":"NSF-Simons MoDL","award":["2031895"],"award-info":[{"award-number":["2031895"]}]},{"name":"ARL DCIST","award":["W911NF-17-2-0181"],"award-info":[{"award-number":["W911NF-17-2-0181"]}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2023,3]]},"DOI":"10.1109\/tit.2022.3187948","type":"journal-article","created":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T15:35:43Z","timestamp":1656689743000},"page":"1739-1760","source":"Crossref","is-referenced-by-count":17,"title":["Constrained Learning With Non-Convex Losses"],"prefix":"10.1109","volume":"69","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-7731-6650","authenticated-orcid":false,"given":"Luiz F. O.","family":"Chamon","sequence":"first","affiliation":[{"name":"Simons Institute for the Theory of Computing, University of California at Berkeley, Berkeley, CA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6310-6345","authenticated-orcid":false,"given":"Santiago","family":"Paternain","sequence":"additional","affiliation":[{"name":"Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9001-3379","authenticated-orcid":false,"given":"Miguel","family":"Calvo-Fullana","sequence":"additional","affiliation":[{"name":"Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-4230-9906","authenticated-orcid":false,"given":"Alejandro","family":"Ribeiro","sequence":"additional","affiliation":[{"name":"Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9054128"},{"key":"ref2","first-page":"16722","article-title":"Probably approximately correct constrained learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Chamon"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-3264-1"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1017\/cbo9781107298019"},{"key":"ref5","volume-title":"Foundations of Machine Learning","author":"Mohri","year":"2018"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1137\/1.9780898718751"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.sorms.2014.05.001"},{"key":"ref8","first-page":"2415","article-title":"Satisfying real-world goals with dataset constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Goh"},{"key":"ref9","first-page":"1920","article-title":"Learning non-discriminatory predictors","volume-title":"Proc. Conf. Learn. Theory","author":"Woodworth"},{"key":"ref10","first-page":"60","article-title":"A reductions approach to fair classification","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Agarwal"},{"key":"ref11","first-page":"2791","article-title":"Empirical risk minimization under fairness constraints","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Donini"},{"key":"ref12","first-page":"2564","article-title":"Preventing fairness gerrymandering: Auditing and learning for subgroup fairness","volume-title":"Proc. 35th Int. Conf. Mach. Learn.","author":"Kearns"},{"issue":"75","key":"ref13","first-page":"1","article-title":"Fairness constraints: A flexible approach for fair classification","volume":"20","author":"Zafar","year":"2019","journal-title":"J. Mach. Learn. Res."},{"issue":"172","key":"ref14","first-page":"1","article-title":"Optimization with non-differentiable constraints with applications to fairness, recall, churn, and other goals","volume":"20","author":"Cotter","year":"2019","journal-title":"J. Mach. Learn. Res."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.48550\/ARXIV.1706.06083"},{"key":"ref16","first-page":"1","article-title":"Certifying some distributional robustness with principled adversarial training","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Sinha"},{"key":"ref17","first-page":"7472","article-title":"Theoretically principled trade-off between robustness and accuracy","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Zhang"},{"issue":"1","key":"ref18","first-page":"1437","article-title":"A comprehensive survey on safe reinforcement learning","volume":"16","author":"Garc\u00eda","year":"2015","journal-title":"J. Mach. Learn. Res."},{"key":"ref19","first-page":"22","article-title":"Constrained policy optimization","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Achiam"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/CDC40024.2019.9029423"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1515\/popets-2015-0007"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2702123.2702520"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1201\/9781003278290-37"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611970128"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4419-9096-9"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511794308"},{"key":"ref27","first-page":"1501","article-title":"Learning from partial labels","volume":"12","author":"Cour","year":"2011","journal-title":"J. Mach. Learn. Res."},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-016-5606-4"},{"key":"ref29","first-page":"1","article-title":"Explaining and harnessing adversarial examples","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Goodfellow"},{"key":"ref30","article-title":"A convex framework for fair regression","volume-title":"arXiv:1706.02409","author":"Berk","year":"2017"},{"key":"ref31","first-page":"5502","article-title":"A semantic loss function for deep learning with symbolic knowledge","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xu"},{"key":"ref32","first-page":"1031","article-title":"The information autoencoding family: A Lagrangian perspective on latent variable generative models","volume-title":"Proc. Conf. Uncertainty Artif. Intell.","author":"Zhao"},{"key":"ref33","volume-title":"Convex Optimization Theory","author":"Bertsekas","year":"2009"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1016\/j.neucom.2018.04.027"},{"key":"ref35","first-page":"2990","article-title":"Group equivariant convolutional networks","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Cohen"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2018.00095"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2955832"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1098\/rsta.1933.0009"},{"key":"ref39","first-page":"1","article-title":"Learning one-hidden-layer neural networks with landscape design","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Ge"},{"key":"ref40","first-page":"605","article-title":"Globally optimal gradient descent for a convnet with Gaussian inputs","volume-title":"Proc. 34th Int. Conf. Mach. Learn.","author":"Brutzkus"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2854560"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45583-3_12"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/070702928"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1007\/s10957-009-9523-6"},{"key":"ref45","first-page":"1397","article-title":"Training well-generalizing classifiers for fairness metrics and other data-dependent constraints","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Cotter"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.07.016"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1016\/j.orl.2008.05.003"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-010-0428-9"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1080\/10556788.2017.1350177"},{"key":"ref50","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-022-01810-x"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2982834"},{"key":"ref52","volume-title":"Linear Estimation","author":"Kailath","year":"2000"},{"key":"ref53","volume-title":"The Elements of Statistical Learning","volume":"1","author":"Friedman","year":"2001"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/1968.1972"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/0890-5401(92)90010-D"},{"key":"ref56","first-page":"463","article-title":"Rademacher and Gaussian complexities: Risk bounds and structural results","volume":"3","author":"Bartlett","year":"2002","journal-title":"J. Mach. Learn. Res."},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1394-9"},{"key":"ref58","first-page":"1","article-title":"Understanding deep learning requires rethinking generalization","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Zhang"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1016\/0893-6080(89)90020-8"},{"key":"ref60","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-642-02431-3","volume-title":"Variational Analysis","author":"Rockafellar","year":"1998"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2019.2908906"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2020.2976577"},{"key":"ref63","volume-title":"Convex Optimization Algorithms","author":"Bertsekas","year":"2015"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1137\/070708111"},{"key":"ref65","volume-title":"Studies in Linear and Non-Linear Programming","author":"Arrow","year":"1958"},{"key":"ref66","first-page":"1","article-title":"Provably robust deep learning via adversarially trained smoothed classifiers","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Salman"},{"key":"ref67","first-page":"1310","article-title":"Certified adversarial robustness via randomized smoothing","volume-title":"Proc. 36th Int. Conf. Mach. Learn.","author":"Cohen"},{"key":"ref68","first-page":"1","article-title":"Intriguing properties of neural networks","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Szegedy"},{"key":"ref69","first-page":"1","article-title":"Robustness may be at odds with accuracy","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Tsipras"},{"key":"ref70","first-page":"2034","article-title":"Precise tradeoffs in adversarial training for linear regression","volume-title":"Proc. 33rd Conf. Learn. Theory","author":"Javanmard"},{"key":"ref71","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.485"},{"key":"ref72","first-page":"1","article-title":"Improving adversarial robustness requires revisiting misclassified examples","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Wang"},{"key":"ref73","article-title":"On evaluating adversarial robustness","volume-title":"arXiv:1902.06705","author":"Carlini","year":"2019"},{"key":"ref74","first-page":"6198","article-title":"Adversarial robustness with semi-infinite constrained learning","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Robey"},{"key":"ref75","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2016.90"},{"key":"ref76","article-title":"Adam: A method for stochastic optimization","volume-title":"arXiv:1412.6980","author":"Kingma","year":"2014"},{"key":"ref77","first-page":"11278","article-title":"Attacks which do not kill training make adversarial learning stronger","volume-title":"Proc. 37th Int. Conf. Mach. Learn.","author":"Zhang"},{"key":"ref78","article-title":"SAT: Improving adversarial training via curriculum-based loss smoothing","volume-title":"arXiv:2003.09347","author":"Sitawarin","year":"2020"},{"key":"ref79","first-page":"1","article-title":"Categorical reparameterization with Gumbel-softmax","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Jang"},{"key":"ref80","first-page":"1","article-title":"The concrete distribution: A continuous relaxation of discrete random variables","volume-title":"Proc. Int. Conf. Learn. Represent.","author":"Maddison"},{"key":"ref81","doi-asserted-by":"publisher","DOI":"10.1016\/0022-247X(67)90163-1"},{"key":"ref82","volume-title":"COMPAS Dataset Analysis","year":"2016"},{"key":"ref83","first-page":"7553","article-title":"Constrained reinforcement learning has zero duality gap","volume-title":"Proc. Adv. Neural Inf. Process. Syst. (NeurIPS)","author":"Paternain"},{"key":"ref84","doi-asserted-by":"publisher","DOI":"10.1090\/surv\/015"},{"key":"ref85","doi-asserted-by":"publisher","DOI":"10.1515\/9781400841059"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielam\/18\/10046300\/9813433-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/10046300\/09813433.pdf?arnumber=9813433","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,2,1]],"date-time":"2024-02-01T00:44:05Z","timestamp":1706748245000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9813433\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,3]]},"references-count":85,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2022.3187948","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023,3]]}}}