Fetching the paper…
Reading the bibliography…
Designing machine learning algorithms that are accurate yet fair, not discriminating based on any sensitive attribute, is of paramount importance for society to accept AI for critical applications.
A. Rényi, “On measures of entropy and information,” in
1961
Earlier work this paper cites.
M. D. Donsker and S. S. Varadhan, “Asymptotic evaluation of certain markov process expectations for large time. IV,”
1983
Earlier work this paper cites.
J. Burbea, “The convexity with respect to Gaussian distributions of divergences of order
1984
Earlier work this paper cites.
N. Tishby, F. C. Pereira, and W. Bialek, “The information bottleneck method,” in
1999
Earlier work this paper cites.
J. Rawls,
2001
Earlier work this paper cites.
T. M. Cover and J. A. Thomas,
2006
Earlier work this paper cites.
G. Mavrotas, “Effective implementation of the
2009
Earlier work this paper cites.
S. Ben-David, J. Blitzer, K. Crammer, A. Kulesza, F. Pereira, and J. W. Vaughan, “A theory of learning from different domains,”
2010
Earlier work this paper cites.
F. du Pin Calmon and N. Fawaz, “Privacy against statistical inference,” in
2012
Earlier work this paper cites.
R. Zemel, Y. Wu, K. Swersky, T. Pitassi, and C. Dwork, “Learning fair representations,” in
2013
Earlier work this paper cites.
M. Gil, F. Alajaji, and T. Linder, “Rényi divergence measures for commonly used univariate continuous distributions,”
2013
Earlier work this paper cites.
L. Sankar, S. R. Rajagopalan, and H. V. Poor, “Utility-privacy tradeoffs in databases: An information-theoretic approach,”
2013
Earlier work this paper cites.
A. Makhdoumi, S. Salamatian, N. Fawaz, and M. Médard, “From the information bottleneck to the privacy funnel,” in
2014
Earlier work this paper cites.
D. P. Kingma and M. Welling, “Auto-encoding variational Bayes,” in
2014
Earlier work this paper cites.
T. van Erwen and P. Harremos, “Rényi divergence and Kullback-Leibler divergence,”
2014
Earlier work this paper cites.
I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,”
2014
Earlier work this paper cites.
M. Long, Y. Cao, J. Wang, and M. Jordan, “Learning transferable features with deep adaptation networks,” in
2015
Earlier work this paper cites.
Z. Liu, P. Luo, X. Wang, and X. Tang, “Deep learning face attributes in the wild,” in
2015
Earlier work this paper cites.
M. Wilkes, C. Y. Wright, J. L. du Plessis, and A. Reeder, “Fitzpatrick skin type, individual typology angle, and melanin index in an african population: steps toward universally applicable skin photosensitivity assessments,”
2015
Earlier work this paper cites.
EyePACS, “Diabetic retinopathy detection,” Data retrieved from Kaggle, https://www.kaggle.com/agaldran/eyepacs, 2015
2015
Earlier work this paper cites.
T. Bolukbasi, K.-W. Chang, J. Y. Zou, V. Saligrama, and A. T. Kalai, “Man is to computer programmer as woman is to homemaker? Debiasing word embeddings,” in
2016
Earlier work this paper cites.
M. Hardt, E. Price, and N. Srebro, “Equality of opportunity in supervised learning,” in
2016
Earlier work this paper cites.
H. Edwards and A. Storkey, “Censoring representations with an adversary,” in
2016
Earlier work this paper cites.
Y. Li and R. E. Turner, “Rényi divergence variational inference,” in
2016
Earlier work this paper cites.
Y. Ganin, E. Ustinova, H. Ajakan, P. Germain, H. Larochelle, F. Laviolette, M. Marchand, and V. Lempitsky, “Domain-adversarial training of neural networks,”
2016
Earlier work this paper cites.
W. Dieterich, C. Mendoza, and T. Brennan, “Compas risk scales: Demonstrating accuracy equity and predictive parity,”
2016
Earlier work this paper cites.
K. He, X. Zhang, S. Ren, and J. Sun, “Deep residual learning for image recognition,” in
2016
Earlier work this paper cites.
S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Information extraction under privacy constraints,”
2016
Earlier work this paper cites.
G. Pleiss, M. Raghavan, F. Wu, J. Kleinberg, and K. Q. Weinberger, “On fairness and calibration,” in
2017
Earlier work this paper cites.
2017
Earlier work this paper cites.
D. Strouse and D. J. Schwab, “The deterministic information bottleneck,”
2017
Earlier work this paper cites.
I. Mironov, “Rényi differential privacy,” in
2017
Earlier work this paper cites.
A. A. Alemi, I. Fischer, J. V. Dillon, and K. Murphy, “Deep variational information bottleneck,” in
2017
Earlier work this paper cites.
D. Dua and C. Graff, “UCI machine learning repository,” Online; http://archive.ics.uci.edu/ml, 2017
2017
Cited alongside, same era.
C. Wadsworth, F. Vera, and C. Piech, “Achieving fairness through adversarial learning: an application to recidivism prediction,” in
2018
Cited alongside, same era.
B. H. Zhang, B. Lemoine, and M. Mitchell, “Mitigating unwanted biases with adversarial learning,” in
2018
Cited alongside, same era.
D. Madras, E. Creager, T. Pitassi, and R. Zemel, “Learning adversarially fair and transferable representations,” in
2018
Cited alongside, same era.
H. Hsu, S. Asoodeh, S. Salamatian, and F. P. Calmon, “Generalizing bottleneck problems,” in
2018
Cited alongside, same era.
S. Baharlouei, M. Nouiehed, A. Beirami, and M. Razaviyayn, “Rényi fair inference,” in
2020
Later among the works it cites.
S. Sagawa, P. W. Koh, T. B. Hashimoto, and P. Liang, “Distributionally robust neural networks for group shifts: On the importance of regularization for worst-case generalization,” in
2020
Later among the works it cites.
N. Sohoni, J. Dunnmon, G. Angus, A. Gu, and C. Ré, “No subclass left behind: Fine-grained robustness in coarse-grained classification problems,”
2020
Later among the works it cites.
P. Burlina, N. Joshi, W. Paul, K. D. Pacheco, and N. M. Bressler, “Addressing artificial intelligence bias in retinal disease diagnostics,”
2020
Later among the works it cites.
J. Cho, G. Hwang, and C. Suh, “A fair classifier using mutual information,” in
2020
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2018
Cited alongside, same era.
F. Alajaji and P.-N. Chen,
2018
Cited alongside, same era.
L. McInnes, J. Healy, N. Saul, and L. Großberger, “UMAP: Uniform manifold approximation and projection,”
2018
Cited alongside, same era.
2018
Cited alongside, same era.
——, “Estimation efficiency under privacy constraints,”
2018
Cited alongside, same era.
2019
Cited alongside, same era.
F. J. Valverde-Albacete and C. Peláez-Moreno, “The case for shifting the Rényi entropy,”
2019
Cited alongside, same era.
Y. Roh, K. Lee, S. Whang, and C. Suh, “Fr-Train: A mutual information-based approach to fair and robust training,” in
2020
Later among the works it cites.
V. Albiero, K. Zhang, M. C. King, and K. W. Bowyer, “Gendered differences in face recognition accuracy explained by hairstyles, makeup, and facial morphology,”
2021
Later among the works it cites.
H. Bhatia, W. Paul, F. Alajaji, B. Gharesifard, and P. Burlina, “Least
2021
Later among the works it cites.
X. Gitiaux and H. Rangwala, “Learning smooth and fair representations,” in
2021
Later among the works it cites.
V. Grari, S. Lamprier, and M. Detyniecki, “Fairness-aware neural Rényi minimization for continuous features,” in
2021
Later among the works it cites.
J.-J. Weng, F. Alajaji, and T. Linder, “An information bottleneck problem with Rényi’s entropy,” in
2021
Later among the works it cites.
B. Rodríguez-Gálvez, R. Thobaben, and M. Skoglund, “A variational approach to privacy and fairness,” in
2021
Later among the works it cites.
A. Sarraf and Y. Nie, “RGAN: Rényi generative adversarial network,”
2021
Later among the works it cites.
G. R. Kurri, T. Sypherd, and L. Sankar, “Realizing GANs via a tunable loss function,” in
2021
Later among the works it cites.
N. Zhang, M. Mohri, and J. Hoffman, “Multiple-source adaptation theory and algorithms,”
2021
Later among the works it cites.
T. Zhang, T. Zhu, K. Gao, W. Zhou, and S. Y. Philip, “Balancing learning model privacy, fairness, and accuracy with early stopping criteria,”
2021
Later among the works it cites.
K. Karkkainen and J. Joo, “Fairface: Face attribute dataset for balanced race, gender, and age for bias measurement and mitigation,” in
2021
Later among the works it cites.
X. Wang, A. Al-Bashabsheh, C. Zhao, and C. Chan, “Adaptive label smoothing for classifier-based mutual information neural estimation,” in
2021
Later among the works it cites.
J. Birrell, P. Dupuis, M. A. Katsoulakis, L. Rey-Bellet, and J. Wang, “Variational representations and neural network estimation of Rényi divergences,”
2021
Later among the works it cites.
M. Bloch, O. Günlü, A. Yener, F. Oggier, H. V. Poor, L. Sankar, and R. F. Schaefer, “An overview of information-theoretic security and privacy: Metrics, limits and applications,”
2021
Later among the works it cites.
A. Zamani, T. J. Oechtering, and M. Skoglund, “Data disclosure with non-zero leakage and non-invertible leakage matrix,”
2021
Later among the works it cites.
S. Saeidian, G. Cervia, T. J. Oechtering, and M. Skoglund, “Quantifying membership privacy via information leakage,”
2021
Later among the works it cites.
A. Gronowski, W. Paul, F. Alajaji, B. Gharesifard, and P. Burlina, “Rényi fair information bottleneck for image classification,” in
2022
Closest in time.
D. Friolo, F. Massacci, C. N. Ngo, and D. Venturi, “Cryptographic and financial fairness,”
2022
Closest in time.
F. C. Thierrin, F. Alajaji, and T. Linder, “Rényi cross-entropy measures for common distributions and processes with memory,”
2022
Closest in time.
W. Paul, A. Hadzic, N. Joshi, F. Alajaji, and P. Burlina, “TARA: Training and representation alteration for AI fairness and domain generalization,”
2022
Closest in time.
P. Kairouz, J. Liao, C. Huang, M. Vyas, M. Welfert, and L. Sankar, “Generating fair universal representations using adversarial models,”
2022
Closest in time.
Y. Pantazis, D. Paul, M. Fasoulakis, Y. Stylianou, and M. A. Katsoulakis, “Cumulant GAN,”
2022
Closest in time.
G. R. Kurri, M. Welfert, T. Sypherd, and L. Sankar, “
2022
Closest in time.
2022
Closest in time.
M. Welfert, K. Otstot, G. R. Kurri, and L. Sankar, “
2023
Closest in time.