Fetching the paper…
Reading the bibliography…
We present a data-driven framework for learning fair universal representations (FUR) that guarantee statistical fairness for any learning task that may not be known a priori.
T. M. Cover and J. A. Thomas, Elements of information theory . John Wiley & Sons, 2012
1910
Earlier work this paper cites.
S. Arimoto, “Information measures and capacity of order α \alpha for discrete memoryless channels,” Topics in Information Theory , 1977
1977
Earlier work this paper cites.
W. E. Lillo, M. H. Loh, S. Hui, and S. H. Zak, “On solving constrained optimization problems with neural networks: A penalty method approach,” IEEE Trans. Neural Nets. , vol. 4, no. 6, pp. 931–940, 1993
1993
Earlier work this paper cites.
R. Kohavi, “Scaling up the accuracy of naive-bayes classifiers: A decision-tree hybrid,” in KDD , vol. 96, 1996, pp. 202–207
1996
Earlier work this paper cites.
H. F. Ladd, “Evidence on discrimination in mortgage lending,” Journal of Economic Perspectives , vol. 12, no. 2, pp. 41–62, 1998
1998
Earlier work this paper cites.
T. Hastie, R. Tibshirani, and J. Friedman, The Elements of Statistical Learning , ser. Springer Series in Statistics. New York, NY, USA: Springer New York Inc., 2001
2001
Earlier work this paper cites.
A. Kraskov, H. Stögbauer, and P. Grassberger, “Estimating mutual information,” Physical review E , vol. 69, no. 6, p. 066138, 2004
2004
Earlier work this paper cites.
D. Pedreshi, S. Ruggieri, and F. Turini, “Discrimination-aware data mining,” in 14th ACM SIGKDD , 2008, pp. 560–568
2008
Earlier work this paper cites.
C. Dwork, “Differential privacy: A survey of results,” in Lecture Notes in Computer Science . New York:Springer, Apr. 2008
2008
Earlier work this paper cites.
C. Dwork, M. Hardt, T. Pitassi, O. Reingold, and R. Zemel, “Fairness through awareness,” in Proc. Innovations in Th. CS , 2012, pp. 214–226
2012
Earlier work this paper cites.
J. Whitehill and J. Movellan, “Discriminately decreasing discriminability with learned image filters,” in IEEE CVPR , 2012, pp. 2488–2495
2012
Earlier work this paper cites.
J. Eckstein and W. Yao, “Augmented lagrangian and alternating direction methods for convex optimization: A tutorial and some illustrative computational results,” RUTCOR Res. Rep. , vol. 32, 2012
2012
Earlier work this paper cites.
D. Anguita et al. , “Human activity recognition on smartphones using a multiclass hardware-friendly support vector machine,” in Intl. Workshop Ambient Assist. Living . Springer, 2012, pp. 216–223
2012
Earlier work this paper cites.
A. Krizhevsky, I. Sutskever, and G. E. Hinton, “Imagenet classification with deep convolutional neural networks,” in Advances in Neural Information Processing Systems (NeurIPS) , 2012, pp. 1097–1105
2012
Earlier work this paper cites.
D. Anguita et al. , “A public domain dataset for human activity recognition using smartphones.” in ESANN , 2013
2013
Earlier work this paper cites.
R. G. Gallager, Stochastic processes: theory for applications . Cambridge University Press, 2013
2013
Earlier work this paper cites.
T. Nguyen and S. Sanner, “Algorithms for direct 0–1 loss optimization in binary classification,” in Proc. ICML , 2013, pp. 1085–1093
2013
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,” in Proc. NeurIPS , 2014, pp. 2672–2680
2014
Cited alongside, same era.
M. Feldman, S. A. Friedler, J. Moeller, C. Scheidegger, and S. Venkatasubramanian, “Certifying and removing disparate impact,” in 21th ACM SIGKDD , 2015, pp. 259–268
2015
Cited alongside, same era.
S. Hajian, J. Domingo-Ferrer, A. Monreale, D. Pedreschi, and F. Giannotti, “Discrimination-and privacy-aware patterns,” Data Mining and Knowledge Discovery , vol. 29, no. 6, pp. 1733–1782, 2015
2015
Cited alongside, same era.
S. Verdú, “ α \alpha -mutual information,” in Inform. Th. Apps Workshop , 2015
2015
Cited alongside, same era.
S. Ioffe and C. Szegedy, “Batch normalization: Accelerating deep network training by reducing internal covariate shift,” in Proc. Intl. Conf. Mach. Learning (ICML) , 2015, pp. 448–456
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint:1412.6980 , 2017
2017
Later among the works it cites.
D. P. Kingma and J. Ba, “Adam: A method for stochastic optimization,” arXiv preprint:1412.6980 , 2017
2017
Later among the works it cites.
Z. Zhang, Y. Song, and H. Qi, “Age progression/regression by conditional adversarial autoencoder,” in Proc. CVPR , 2017
2017
Later among the works it cites.
F. Calmon, D. Wei, B. Vinzamuri, K. N. Ramamurthy, and K. R. Varshney, “Data pre-processing for discrimination prevention: Information-theoretic optimization and analysis,” IEEE JSTSP , vol. 12, no. 5, 2018
2018
Later among the works it cites.
M. Kearns, S. Neel, A. Roth, and Z. S. Wu, “Preventing fairness gerrymandering: Auditing and learning for subgroup fairness,” in Proc. Intl. Conf. Mach. Learning (ICML) , 2018, pp. 2564–2572
2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
2015
Cited alongside, same era.
C. Szegedy, W. Liu, Y. Jia, P. Sermanet, S. Reed, D. Anguelov, D. Erhan, V. Vanhoucke, and A. Rabinovich, “Going deeper with convolutions,” in Proc. CVPR , 2015
2015
Cited alongside, same era.
M. Hardt, E. Price, and N. Srebro, “Equality of opportunity in supervised learning,” in Proc. NeurIPS , 2016, pp. 3315–3323
2016
Cited alongside, same era.
H. Edwards and A. J. Storkey, “Censoring representations with an adversary,” in ICLR , 2016, pp. 1–14
2016
Cited alongside, same era.
M. Abadi et al. , “Tensorflow: Large-scale machine learning on heterogeneous distributed systems,” arXiv preprint:1603.04467 , 2016
2016
Cited alongside, same era.
P. Kairouz, S. Oh, and P. Viswanath, “Extremal mechanisms for local differential privacy,” J. Mach. Learn. Res. , vol. 17, no. 1, pp. 492–542, Jan. 2016
2016
Cited alongside, same era.
M. Abadi et al. , “Tensorflow: Large-scale machine learning on heterogeneous distributed systems,” arXiv preprint:1603.04467 , 2016
2016
Cited alongside, same era.
A. Chouldechova, “Fair prediction with disparate impact: A study of bias in recidivism prediction instruments,” Big data , vol. 5, no. 2, pp. 153–163, 2017
2017
Cited alongside, same era.
Later among the works it cites.
B. H. Zhang, B. Lemoine, and M. Mitchell, “Mitigating unwanted biases with adversarial learning,” in Proc. IEEE/ACM AIES , 2018
2018
Later among the works it cites.
D. Madras, E. Creager, T. Pitassi, and R. Zemel, “Learning adversarially fair and transferable representations,” in Proc. ICML , 2018, pp. 3384–3393
2018
Later among the works it cites.
S. Asoodeh, M. Diaz, F. Alajaji, and T. Linder, “Estimation efficiency under privacy constraints,” IEEE Trans. Inf. Theory , vol. 65, no. 3, 2018
2018
Later among the works it cites.
C. Song and V. Shmatikov, “Overlearning reveals sensitive attributes,” arXiv:1905.11742 , 2019
2019
Closest in time.
M. Bertran, N. Martinez, A. Papadaki, Q. Qiu, M. Rodrigues, G. Reeves, and G. Sapiro, “Adversarially learned representations for information obfuscation and inference,” in Proc. ICML , 2019, pp. 614–623
2019
Closest in time.
E. Creager, D. Madras, J.-H. Jacobsen, M. Weis, K. Swersky, T. Pitassi, and R. Zemel, “Flexibly fair representation learning by disentanglement,” in Proc. ICML , vol. 97, 2019, pp. 1436–1445
2019
Closest in time.
J. Liao, O. Kosut, L. Sankar, and F. du Pin Calmon, “Tunable measures for information leakage and applications to privacy-utility tradeoffs,” IEEE Trans. Inf. Theory , vol. 65, no. 12, pp. 8043 – 8066, 2019
2019
Closest in time.
J. Song, P. Kalluri, A. Grover, S. Zhao, and S. Ermon, “Learning controllable fair representations,” in Proc. AISTATS , 2019, pp. 2164–2173
2019
Closest in time.
P. Lahoti, K. P. Gummadi, and G. Weikum, “ifair: Learning individually fair data representations for algorithmic decision making,” in IEEE 35th Intl. Conf. Data Engineering (ICDE) , 2019, pp. 1334–1345
2019
Closest in time.
D. Wei, K. N. Ramamurthy, and F. Calmon, “Optimized score transformation for fair classification,” in Proc. AISTATS , 2020, pp. 1673–1683
2020
Closest in time.
T. Sypherd, M. Diaz, J. K. Cava, G. Dasarathy, P. Kairouz, and L. Sankar, “A tunable loss function for robust classification: Calibration, landscape, and generalization,” arXiv preprint:1906.02314 , 2021
2021
Closest in time.