Raymond Feng

dblp:276/5253 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
2since 2021 · last 2023
—ORCID · none

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

Artificial intelligence and machine learning · 1 · 1 first-author · 1 since 2021Theory of computation · 1 · 1 first-author · 1 since 2021

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
Trustworthy machine learning · 100%
Databases, data mining, and information retrieval
1 paper
Data integration and cleaning · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Trustworthy machine learning
fairness
0.712023
Adapting Fairness Interventions to Missing Values · NeurIPS 2023
Data integration and cleaning
missing data
0.712023
Adapting Fairness Interventions to Missing Values · NeurIPS 2023

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

statistical hypothesis testing · 1.3adaptive algorithm design · 1.3
YearPublicationVenuePosition
2023 Adapting Fairness Interventions to Missing Values
abstract
Missing values in real-world data pose a significant and unique challenge to algorithmic fairness. Different demographic groups may be unequally affected by missing data, and the standard procedure for handling missing values where first data is imputed, then the imputed data is used for classification—a procedure referred to as "impute-then-classify"—can exacerbate discrimination. In this paper, we analyze how missing values affect algorithmic fairness. We first prove that training a classifier from imputed data can significantly worsen the achievable values of group fairness and average accuracy. This is because imputing data results in the loss of the missing pattern of the data, which often conveys information about the predictive label. We present scalable and adaptive algorithms for fair classification with missing values. These algorithms can be combined with any preexisting fairness-intervention algorithm to handle all possible missing patterns while preserving information encoded within the missing patterns. Numerical experiments with state-of-the-art fairness interventions demonstrate that our adaptive algorithms consistently achieve higher fairness and accuracy than impute-then-classify across different datasets.
Raymond Feng, Flávio P. Calmon, Hao Wang 0063
NeurIPS1
2023 Sharp bounds on the price of bandit feedback for several models of mistake-bounded online learning
Raymond Feng, Jesse Geneson, Espen Slettnes
Theor. Comput. Sci.1