← Search

Yahav Bechavod

7 accepted papers

2024

Monotone Individual Fairness

ICML 2024poster

We revisit the problem of online learning with individual fairness, where an online learner strives to maximize predictive accuracy while ensuring that similar individuals are treated similarly. We first extend the frameworks of Gillen et al. (2018); Bechavod et al. (2020), which rely on feedback fr…

Cited by 1SourcePDFScholar
2021

Gaming Helps! Learning from Strategic Interactions in Natural Dynamics

AISTATS 2021poster

We consider an online regression setting in which individuals adapt to the regression model: arriving individuals may access the model throughout the process, and invest strategically in modifying their own features so as to improve their predicted score. Such feature manipulation, or “gaming”, has…

Cited by 53SourcePDFScholar
2019

Equal Opportunity in Online Classification with Partial Feedback

NeurIPS 2019poster

We study an online classification problem with partial feedback in which individuals arrive one at a time from a fixed but unknown distribution, and must be classified as positive or negative. Our algorithm only observes the true label of an individual if they are given a positive classification. Th…

Cited by 71SourcePDFScholar