Sahaj Garg

dblp:227/3388 · DBLP profile ↗
← Back
3ranked-venue papers
1as first author
1since 2021 · last 2021
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 1 first-author · 1 since 2021Human-computer interaction and ubiquitous computing · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Generative modeling · 50% Representation and self-supervised learning · 50%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Representation and self-supervised learning › representation learning › unsupervised representation learning
autoencoding
0.512021
Anytime Sampling for Autoregressive Models via Ordered Autoencoding · ICLR 2021
Machine learning › Generative modeling
autoregressive model
0.512021
Anytime Sampling for Autoregressive Models via Ordered Autoencoding · ICLR 2021

Methods — techniques the papers use, named apart from their topics

ordered autoencoding · 0.5anytime sampling · 0.5
YearPublicationVenuePosition
2021 Anytime Sampling for Autoregressive Models via Ordered Autoencoding
Yang Song 0011, Sahaj Garg, Linyuan Gong, Aditya Grover, Stefano Ermon
ICLR3
2019 Counterfactual Fairness in Text Classification through Robustness
abstract
In this paper, we study counterfactual fairness in text classification, which asks the question: How would the prediction change if the sensitive attribute referenced in the example were different? Toxicity classifiers demonstrate a counterfactual fairness issue by predicting that "Some people are gay" is toxic while "Some people are straight" is nontoxic. We offer a metric, counterfactual token fairness (CTF), for measuring this particular form of fairness in text classifiers, and describe its relationship with group fairness. Further, we offer three approaches, blindness, counterfactual augmentation, and counterfactual logit pairing (CLP), for optimizing counterfactual token fairness during training, bridging the robustness and fairness literature. Empirically, we find that blindness and CLP address counterfactual token fairness. The methods do not harm classifier performance, and have varying tradeoffs with group fairness. These approaches, both for measurement and optimization, provide a new path forward for addressing fairness concerns in text classification.
Sahaj Garg, Vincent Perot, Nicole Limtiaco, Ankur Taly, Ed H. Chi, Alex Beutel
AIES1
2019 Sliced Score Matching: A Scalable Approach to Density and Score Estimation
Yang Song 0011, Sahaj Garg, Jiaxin Shi, Stefano Ermon
UAI2