Demo Data from SIGIR 2026 / reviewers in the wild / expert
Violet Xinying Chen
dblp:273/4017 · also Violet (Xinying) Chen
· DBLP profile ↗
4ranked-venue papers
3as first author
3since 2021 · last 2024
0000-0002-5669-6102ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 4 · 3 first-author · 3 since 2021Databases, data management, data science and information retrieval · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 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
2 papers |
Trustworthy machine learning · 38% Efficient and distributed learning · 24% Multi-agent systems · 19% | |
| Interdisciplinary, comprehensive, and emerging computing
1 paper |
Computational social science and digital humanities · 100% |
Topics — the 6 heaviest of 8, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Trustworthy machine learning
fairness |
0.7 | 1 | 2023 | Equipping Federated Graph Neural Networks with Structure-aware Group Fairness · ICDM 2023 |
Machine learning › Efficient and distributed learning › federated learning
federated graph learning |
0.7 | 1 | 2023 | Equipping Federated Graph Neural Networks with Structure-aware Group Fairness · ICDM 2023 |
Machine learning › Graph learning
graph neural network |
0.7 | 1 | 2023 | Equipping Federated Graph Neural Networks with Structure-aware Group Fairness · ICDM 2023 |
Machine learning › Trustworthy machine learning › fairness
group fairness |
0.7 | 1 | 2023 | Equipping Federated Graph Neural Networks with Structure-aware Group Fairness · ICDM 2023 |
Machine learning › Efficient and distributed learning
federated learning |
0.2 | 1 | 2023 | Equipping Federated Graph Neural Networks with Structure-aware Group Fairness · ICDM 2023 |
Computational social science and digital humanities
resource allocation |
0.2 | 1 | 2023 | Local Justice and Machine Learning: Modeling and Inferring Dynamic Ethical Preferences toward Allocations · AAAI 2023 |
Methods — techniques the papers use, named apart from their topics
mathematical modeling · 1.3local model update · 0.7human-subject experiments · 0.7human subject experiment · 0.7fairness-aware aggregation · 0.7
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Assessing Group Fairness with Social Welfare Optimization
Violet Xinying Chen, John N. Hooker, Derek Leben |
CPAIOR (1) | 1 |
| 2023 | Local Justice and Machine Learning: Modeling and Inferring Dynamic Ethical Preferences toward AllocationsabstractWe consider a setting in which a social planner has to make a sequence of decisions to allocate scarce resources in a high-stakes domain. Our goal is to understand stakeholders' dynamic moral preferences toward such allocational policies. In particular, we evaluate the sensitivity of moral preferences to the history of allocations and their perceived future impact on various socially salient groups. We propose a mathematical model to capture and infer such dynamic moral preferences. We illustrate our model through small-scale human-subject experiments focused on the allocation of scarce medical resource distributions during a hypothetical viral epidemic. We observe that participants' preferences are indeed history- and impact-dependent. Additionally, our preliminary experimental results reveal intriguing patterns specific to medical resources---a topic that is particularly salient against the backdrop of the global covid-19 pandemic. Violet Xinying Chen, Derek Leben, Hoda Heidari |
AAAI | 1 |
| 2023 | Equipping Federated Graph Neural Networks with Structure-aware Group FairnessabstractGraph Neural Networks (GNNs) are used for graph data processing across various domains. Centralized training of GNNs often faces challenges due to privacy and regulatory issues, making federated learning (FL) a preferred solution in a distributed paradigm. However, GNNs may inherit biases from training data, causing these biases to propagate to the global model in distributed scenarios. To address this issue, we introduce $\mathrm{F}^{2}$GNN, a Fair Federated Graph Neural Network, to enhance group fairness. Recognizing that bias originates from both data and algorithms, $\mathrm{F}^{2}$GNN aims to mitigate both types of bias under federated settings. We offer theoretical insights into the relationship between data bias and statistical fairness metrics in GNNs. Building on our theoretical analysis, $\mathrm{F}^{2}$GNN features a fairness-aware local model update scheme and a fairness-weighted global model update scheme, considering both data bias and local model fairness during aggregation. Empirical evaluations show $\mathrm{F}^{2}$GNN outperforms SOTA baselines in fairness and accuracy. Nan Cui, Wendy Hui Wang, Violet Xinying Chen, Yue Ning 0001 |
ICDM | 4 |
| 2020 | A Just Approach Balancing Rawlsian Leximax Fairness and UtilitarianismabstractNumerous AI-assisted resource allocation decisions need to balance the conflicting goals of fairness and efficiency. Our paper studies the challenging task of defining and modeling a proper fairness-efficiency trade off. We define fairness with Rawlsian leximax fairness, which views the lexicographic maximum among all feasible outcomes as the most equitable; and define efficiency with Utilitarianism, which seeks to maximize the sum of utilities received by entities regardless of individual differences. Motivated by a justice-driven trade off principle: prioritize fairness to benefit the less advantaged unless too much efficiency is sacrificed, we propose a sequential optimization procedure to balance leximax fairness and utilitarianism in decision-making. Each iteration of our approach maximizes a social welfare function, and we provide a practical mixed integer/linear programming (MILP) formulation for each maximization problem. We illustrate our method on a budget allocation example. Compared with existing approaches of balancing equity and efficiency, our method is more interpretable in terms of parameter selection, and incorporates a strong equity criterion with a thoroughly balanced perspective. Violet Xinying Chen, John N. Hooker |
AIES | 1 |