Intelligent Systems


2022


no image
Hermite Polynomial Features for Private Data Generation

Vinaroz*, M., Charusaie*, M., Harder, F., Adamczewski, K., Park, M. J.

Proceedings of the 39th International Conference on Machine Learning (ICML), 162, pages: 22300-22324, Proceedings of Machine Learning Research, (Editors: Chaudhuri, Kamalika and Jegelka, Stefanie and Song, Le and Szepesvari, Csaba and Niu, Gang and Sabato, Sivan), PMLR, July 2022 (conference)

link (url) [BibTex]

2022

link (url) [BibTex]


no image
Sample Efficient Learning of Predictors that Complement Humans

Charusaie*, M., Mozannar*, H., Sontag, D., Samadi, S.

International Conference of Machine Learning (ICML22), 2022 (conference)

[BibTex]

[BibTex]


no image
Compressibility Measures for Affinely Singular Random Vectors

Charusaie, M., Amini, A., Rini, S.

IEEE Transactions on Information Theory, 2022 (article)

[BibTex]

[BibTex]

2021


no image
Pairwise Fairness for Ordinal Regression

Kleindessner, M., Samadi, S., Zafar, M. B., Kenthapadi, K., Russell, C.

arXiv preprint arXiv:2105.03153, 2021 (article)

Abstract
We initiate the study of fairness for ordinal regression, or ordinal classification. We adapt two fairness notions previously considered in fair ranking and propose a strategy for training a predictor that is approximately fair according to either notion. Our predictor consists of a threshold model, composed of a scoring function and a set of thresholds, and our strategy is based on a reduction to fair binary classification for learning the scoring function and local search for choosing the thresholds. We can control the extent to which we care about the accuracy vs the fairness of the predictor via a parameter. In extensive experiments we show that our strategy allows us to effectively explore the accuracy-vs-fairness trade-off and that it often compares favorably to “unfair” state-of-the-art methods for ordinal regression in that it yields predictors that are only slightly less accurate, but significantly more fair.

arXiv Project Page [BibTex]

2021

arXiv Project Page [BibTex]


no image
Socially Fair k-Means Clustering

Mehrdad Ghadiri, S. S. S. V.

In ACM Conference on Fairness, Accountability, and Transparency, 2021 (inproceedings)

PDF Code Talk [BibTex]

PDF Code Talk [BibTex]

2020


no image
Human Aspects of Machine Learning

Samadi, S.

Georgia Tech, 2020 (phdthesis)

PDF [BibTex]

2020


no image
On the Compressibility of Affinely Singular Random Vectors

Charusaie, M., Rini, S., Amini, A.

On the Compressibility of Affinely Singular Random Vectors, pages: 2240-2245, 2020 (conference)

DOI [BibTex]

DOI [BibTex]

2019


no image
Multi-Criteria Dimensionality Reduction with Applications to Fairness

Uthaipon Tantipongpipat, S. S. M. S. J. M., Vempala, S.

In Conference on Neural Information Processing Systems, 2019 (inproceedings)

arXiv Code Press [BibTex]

2019

arXiv Code Press [BibTex]


no image
Guarantees for Spectral Clustering with Fairness Constraints

Matthäus Kleindessner, S. S. P. A., Morgenstern, J.

In International Conference on Machine Learning, 2019 (inproceedings)

pdf Code Poster Press [BibTex]

pdf Code Poster Press [BibTex]

2018


no image
Usability of Humanly Computable Passwords

Samira Samadi, S. V., Kalai, A. T.

In AAAI Conference on Human Computation and Crowdsourcing, 2018 (inproceedings)

pdf Press [BibTex]

2018

pdf Press [BibTex]


no image
The Price of Fair PCA: One Extra Dimension

Samira Samadi, U. T. J. M. M. S., Vempala, S.

In Conference on Neural Information Processing Systems, 2018 (inproceedings)

pdf Code` Press [BibTex]

pdf Code` Press [BibTex]

2016


no image
Finding Meaningful Cluster Structure amidst Background Noise

Shrinu Kushagra, Samira Samadi,, Shai Ben-David.

Algorithmic Learning Theory, 2016 (article)

pdf [BibTex]

2016

pdf [BibTex]

2014


no image
Near-Optimal Herding

Nicholas J. A. Harvey, , Samadi, S.

In Conference on Learning Theory, 2014 (inproceedings)

pdf Blog post [BibTex]

2014

pdf Blog post [BibTex]