Agrawal, A. and Boyd, S. Disciplined quasiconvex programming. Optimization Letters, 14:1643-1657, 2020.
Alger, N. Smallest axis-aligned bounding box of hyper-ellipsoid. Mathematics Stack Exchange, 2020. URL https://math.stackexchange.com/q/3926885. URL:https://math.stackexchange.com/q/3926885 (version: 2020-11-29).
Barocas, S. and Selfst, A. D. Big data's disparate impact. *Calif. L. Rev.*, 104:671, 2016.
Benussi, E., Patane, A., Wicker, M., Laurenti, L., and Kwiatkowska, M. Individual fairness guarantees for neural networks. arXiv preprint arXiv:2205.05763, 2022.
Carbone, G., Wicker, M., Laurenti, L., Patane, A., Bortolussi, L., and Sanguinetti, G. Robustness of bayesian neural networks to gradient-based attacks. Advances in Neural Information Processing Systems, 33:15602-15613, 2020.
Davenport, T. and Kalakota, R. The potential for artificial intelligence in healthcare. *Future healthcare journal*, 6(2):94, 2019.
Ding, F., Hardt, M., Miller, J., and Schmidt, L. Retiring adult: New datasets for fair machine learning. Advances in Neural Information Processing Systems, 34:6478-6490, 2021.
Doherty, A., Wicker, M., Laurenti, L., and Patane, A. Individual fairness in bayesian neural networks. Advances in Approximate Bayesian Inference, 2023.
Dressel, J. and Farid, H. The accuracy, fairness, and limits of predicting recidivism. Science advances, 4(1):eao5580, 2018.
Dua, D. and Graff, C. UCI machine learning repository, 2017. URL http://archive.ics.uci.edu/ml.
Dwork, C., Hardt, M., Pitassi, T., Reingold, O., and Zemel, R. Fairness through awareness. In Proceedings of the 3rd innovations in theoretical computer science conference, pp. 214-226, 2012.
Emrich, T., Jossé, G., Kriegel, H.-P., Mauder, M., Niedermayer, J., Renz, M., Schubert, M., and Züfle, A. Optimal distance bounds for the mahalanobis distance. In International Conference on Similarity Search and Applications, pp. 175-181. Springer, 2013.
Fazelpour, S. and Lipton, Z. C. Algorithmic fairness from a non-ideal perspective. In Proceedings of the AAAI/ACM Conference on AI, Ethics, and Society, pp. 57-63, 2020.
Fazlyab, M., Robey, A., Hassani, H., Morari, M., and Pappas, G. Efficient and accurate estimation of lipschitz constants for deep neural networks. Advances in Neural Information Processing Systems, 32, 2019.
Gehr, T., Mirman, M., Drachsler-Cohen, D., Tsankov, P., Chaudhuri, S., and Vechev, M. Ai2: Safety and robustness certification of neural networks with abstract interpretation. In 2018 IEEE symposium on security and privacy (SP), pp. 3-18. IEEE, 2018.
Gowal, S., Dvijotham, K., Stanforth, R., Bunel, R., Qin, C., Uesato, J., Arandjelovic, R., Mann, T., and Kohli, P. On the effectiveness of interval bound propagation for training verifiably robust models. arXiv preprint arXiv:1810.12715, 2018.
Gupta, S. and Kamble, V. Individual fairness in hindsight. The Journal of Machine Learning Research, 22(1):6386-6420, 2021.
Hu, Y., Li, J., and Yu, C. K. W. Convergence rates of subgradient methods for quasi-convex optimization problems. Computational Optimization and Applications, 77:183-212, 2020.
Hu, Y., Li, G., Yu, C. K. W., and Yip, T. L. Quasi-convex feasibility problems: Subgradient methods and convergence rates. European Journal of Operational Research, 298(1):45-58, 2022.
John, P. G., Vijaykeerthy, D., and Saha, D. Verifying individual fairness in machine learning models. In Conference on Uncertainty in Artificial Intelligence, pp. 749-758. PMLR, 2020.