Constrained Learning With Non-Convex Losses-Reference-Cited by-同舟云学术

Constrained Learning With Non-Convex Losses

Author:

Chamon Luiz F. O.¹^ORCID,Paternain Santiago²^ORCID,Calvo-Fullana Miguel³^ORCID,Ribeiro Alejandro⁴^ORCID

Affiliation:

1. Simons Institute for the Theory of Computing, University of California at Berkeley, Berkeley, CA, USA

2. Department of Electrical, Computer and Systems Engineering, Rensselaer Polytechnic Institute, Troy, NY, USA

3. Department of Aeronautics and Astronautics, Massachusetts Institute of Technology, Cambridge, MA, USA

4. Department of Electrical and Systems Engineering, University of Pennsylvania, Philadelphia, PA, USA

Funder

NSF-Simons MoDL

NSF HDR TRIPODS

ARL DCIST

Publisher

Institute of Electrical and Electronics Engineers (IEEE)

Subject

Library and Information Sciences,Computer Science Applications,Information Systems

Link

Reference85 articles.

1. Fairness constraints: A flexible approach for fair classification;zafar;J Mach Learn Res,2019

3. Preventing fairness gerrymandering: Auditing and learning for subgroup fairness;kearns;Proc 35th Int Conf Mach Learn,2018

4. Rademacher and Gaussian complexities: Risk bounds and structural results;bartlett;J Mach Learn Res,2002

5. Towards deep learning models resistant to adversarial attacks;ma?dry;Proc Int Conf Learn Represent,2018

Cited by 2 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

2. Strong Duality Relations in Nonconvex Risk-Constrained Learning;2024 58th Annual Conference on Information Sciences and Systems (CISS);2024-03-13