Demo Data from EDBT 2026 / reviewers in the wild / expert
Tim Räz
dblp:177/0612
· DBLP profile ↗
2ranked-venue papers
1as first author
2since 2021 · last 2024
0000-0002-8464-4190ORCID · corroborated
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 1 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
2 papers |
Trustworthy machine learning · 100% |
Topics — the 3 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
fairness |
1.3 | 2 | 2024 | Gerrymandering individual fairness · Artif. Intell. 2024 Gradual (In)Compatibility of Fairness Criteria · AAAI 2022 |
Machine learning › Trustworthy machine learning › fairness
individual fairness |
0.8 | 1 | 2024 | Gerrymandering individual fairness · Artif. Intell. 2024 |
Machine learning › Trustworthy machine learning › fairness › fair optimization
fairness regularization |
0.6 | 1 | 2022 | Gradual (In)Compatibility of Fairness Criteria · AAAI 2022 |
Methods — techniques the papers use, named apart from their topics
regularization · 0.6information theory · 0.6
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Gerrymandering individual fairnessabstractIndividual fairness requires that similar individuals are treated similarly. It is supposed to prevent the unfair treatment of individuals on the subgroup level and to overcome the problem that group fairness measures are susceptible to manipulation or gerrymandering. The goal of the present paper is to explore the extent to which individual fairness itself can be gerrymandered. It will be proved that individual fairness can be gerrymandered in the context of predicting scores. Then, it will be argued that individual fairness is a very weak notion of fairness for some choices of feature space and metric. Finally, it will be discussed which properties of (individual) fairness are desirable. Tim Räz |
Artif. Intell. | 1 |
| 2022 | Gradual (In)Compatibility of Fairness CriteriaabstractImpossibility results show that important fairness measures (independence, separation, sufficiency) cannot be satisfied at the same time under reasonable assumptions. This paper explores whether we can satisfy and/or improve these fairness measures simultaneously to a certain degree. We introduce information-theoretic formulations of the fairness measures and define degrees of fairness based on these formulations. The information-theoretic formulations suggest unexplored theoretical relations between the three fairness measures. In the experimental part, we use the information-theoretic expressions as regularizers to obtain fairness-regularized predictors for three standard datasets. Our experiments show that a) fairness regularization directly increases fairness measures, in line with existing work, and b) some fairness regularizations indirectly increase other fairness measures, as suggested by our theoretical findings. This establishes that it is possible to increase the degree to which some fairness measures are satisfied at the same time -- some fairness measures are gradually compatible. Corinna Hertweck, Tim Räz |
AAAI | 2 |