Demo Data from EDBT 2026 / reviewers in the wild / expert
Caridad Arroyo Arevalo
dblp:364/2388
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2024
—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 2021Graphics, computer vision, multimedia, augmented reality and games · 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 |
Efficient and distributed learning · 50% Trustworthy machine learning · 50% | |
| Network and information security
1 paper |
Privacy and data protection · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Machine learning › Efficient and distributed learning
federated learning |
0.8 | 1 | 2024 | Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning against Attribute Inference Attacks · AAAI 2024 |
Machine learning › Trustworthy machine learning
privacy and data protection |
0.8 | 1 | 2024 | Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning against Attribute Inference Attacks · AAAI 2024 |
Privacy and data protection › privacy-preserving machine learning
privacy-preserving representation learning |
0.8 | 1 | 2024 | Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning against Attribute Inference Attacks · AAAI 2024 |
Privacy and data protection › inference attack
attribute inference attack |
0.2 | 1 | 2024 | Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning against Attribute Inference Attacks · AAAI 2024 |
Methods — techniques the papers use, named apart from their topics
mutual information · 1.5information theory · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning against Attribute Inference AttacksabstractFederated learning (FL) has been widely studied recently due to its property to collaboratively train data from different devices without sharing the raw data. Nevertheless, recent studies show that an adversary can still be possible to infer private information about devices' data, e.g., sensitive attributes such as income, race, and sexual orientation. To mitigate the attribute inference attacks, various existing privacy-preserving FL methods can be adopted/adapted. However, all these existing methods have key limitations: they need to know the FL task in advance, or have intolerable computational overheads or utility losses, or do not have provable privacy guarantees. We address these issues and design a task-agnostic privacy-preserving presentation learning method for FL (TAPPFL) against attribute inference attacks. TAPPFL is formulated via information theory. Specifically, TAPPFL has two mutual information goals, where one goal learns task-agnostic data representations that contain the least information about the private attribute in each device's data, and the other goal ensures the learnt data representations include as much information as possible about the device data to maintain FL utility. We also derive privacy guarantees of TAPPFL against worst-case attribute inference attacks, as well as the inherent tradeoff between utility preservation and privacy protection. Extensive results on multiple datasets and applications validate the effectiveness of TAPPFL to protect data privacy, maintain the FL utility, and be efficient as well. Experimental results also show that TAPPFL outperforms the existing defenses. Caridad Arroyo Arevalo, Sayedeh Leila Noorbakhsh, Yuan Hong 0001, Binghui Wang |
AAAI | 1 |