Reduced Products of Abstract Domains for Fairness Certification of Neural Networks
暂无分享,去创建一个
[1] Mykel J. Kochenderfer,et al. Reluplex: An Efficient SMT Solver for Verifying Deep Neural Networks , 2017, CAV.
[2] Bertrand Jeannet,et al. Apron: A Library of Numerical Abstract Domains for Static Analysis , 2009, CAV.
[3] Timon Gehr,et al. An abstract domain for certifying neural networks , 2019, Proc. ACM Program. Lang..
[4] Leo Breiman,et al. Random Forests , 2001, Machine Learning.
[5] Junfeng Yang,et al. Efficient Formal Safety Analysis of Neural Networks , 2018, NeurIPS.
[6] Caterina Urban,et al. Perfectly parallel fairness certification of neural networks , 2020, Proc. ACM Program. Lang..
[7] Toniann Pitassi,et al. Fairness through awareness , 2011, ITCS '12.
[8] Nello Cristianini,et al. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .
[9] Liqian Chen,et al. Analyzing Deep Neural Networks with Symbolic Propagation: Towards Higher Precision and Faster Verification , 2019, SAS.
[10] Geoffrey E. Hinton,et al. Rectified Linear Units Improve Restricted Boltzmann Machines , 2010, ICML.
[11] Timnit Gebru,et al. Gender Shades: Intersectional Accuracy Disparities in Commercial Gender Classification , 2018, FAT.
[12] Patrick Cousot,et al. Static determination of dynamic properties of programs , 1976 .
[13] M. H. van Emden,et al. Interval arithmetic: From principles to implementation , 2001, JACM.
[14] Nello Cristianini,et al. An Introduction to Support Vector Machines and Other Kernel-based Learning Methods , 2000 .
[15] Patrick Cousot,et al. Systematic design of program analysis frameworks , 1979, POPL.
[16] Sujit Gujar,et al. FNNC: Achieving Fairness through Neural Networks , 2018, IJCAI.
[17] Alexander I. Barvinok,et al. A Polynomial Time Algorithm for Counting Integral Points in Polyhedra when the Dimension Is Fixed , 1993, FOCS.
[18] J. Friedman. Greedy function approximation: A gradient boosting machine. , 2001 .
[19] Patrick Cousot,et al. Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints , 1977, POPL.
[20] Brian W. Powers,et al. Dissecting racial bias in an algorithm used to manage the health of populations , 2019, Science.
[21] A. Barvinok. A polynomial time algorithm for counting integral points in polyhedra when the dimension is fixed , 1994 .
[22] Nicolas Halbwachs,et al. Automatic discovery of linear restraints among variables of a program , 1978, POPL.
[23] Junfeng Yang,et al. Formal Security Analysis of Neural Networks using Symbolic Intervals , 2018, USENIX Security Symposium.
[24] Sean A. Munson,et al. Unequal Representation and Gender Stereotypes in Image Search Results for Occupations , 2015, CHI.
[25] Yuriy Brun,et al. Fairness testing: testing software for discrimination , 2017, ESEC/SIGSOFT FSE.
[26] Antoine Miné,et al. Symbolic Methods to Enhance the Precision of Numerical Abstract Domains , 2006, VMCAI.
[27] Flemming Nielson,et al. Principles of Program Analysis , 1999, Springer Berlin Heidelberg.