Demo Data from VLDB 2026 / reviewers in the wild / expert
Sayedeh Leila Noorbakhsh
dblp:364/1918
· DBLP profile ↗
3ranked-venue papers
1as first author
3since 2021 · last 2025
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Artificial intelligence and machine learning · 2 · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 since 2021Security and privacy · 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.
| Network and information security
3 papers |
Privacy and data protection · 95% Security and privacy of machine learning · 5% | |
| Artificial intelligence
2 papers |
Trustworthy machine learning · 62% Efficient and distributed learning · 29% Representation and self-supervised learning · 10% |
Topics — the 11 heaviest of 12, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Privacy and data protection › privacy-preserving machine learning
privacy-preserving representation learning |
1.5 | 2 | 2024 | Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference Attacks · USENIX Security Symposium 2024 Task-Agnostic Privacy-Preserving Representation Learning for Federated Learning against Attribute Inference Attacks · AAAI 2024 |
Machine learning › Trustworthy machine learning › robustness
adversarial robustness |
0.9 | 1 | 2025 | Learning Robust and Privacy-Preserving Representations via Information Theory · AAAI 2025 |
Privacy and data protection › sensitive data protection
attribute privacy |
0.9 | 1 | 2025 | Learning Robust and Privacy-Preserving Representations via Information Theory · AAAI 2025 |
Privacy and data protection › privacy metrics › privacy quantification
information-theoretic privacy |
0.9 | 1 | 2025 | Learning Robust and Privacy-Preserving Representations via Information Theory · AAAI 2025 |
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 protection mechanisms
inference attack defense |
0.8 | 1 | 2024 | Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference Attacks · USENIX Security Symposium 2024 |
Machine learning › Representation and self-supervised learning › representation learning
robust representation learning |
0.3 | 1 | 2025 | Learning Robust and Privacy-Preserving Representations via Information Theory · AAAI 2025 |
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 |
Privacy and data protection
inference attack |
0.2 | 1 | 2024 | Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference Attacks · USENIX Security Symposium 2024 |
Security and privacy of machine learning
privacy attack |
0.2 | 1 | 2024 | Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference Attacks · USENIX Security Symposium 2024 |
Methods — techniques the papers use, named apart from their topics
information theory · 3.3representation learning · 1.7mutual information · 1.5information-theoretic framework · 0.8
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | Learning Robust and Privacy-Preserving Representations via Information TheoryabstractMachine learning models are vulnerable to both security attacks (e.g., adversarial examples) and privacy attacks (e.g., private attribute inference). We take the first step to mitigate both the security and privacy attacks, and maintain task utility as well. Particularly, we propose an information-theoretic framework to achieve the goals through the lens of representation learning, i.e., learning representations that are robust to both adversarial examples and attribute inference adversaries. We also derive novel theoretical results under our framework, e.g., the inherent trade-off between adversarial robustness/utility and attribute privacy, and guaranteed attribute privacy leakage against attribute inference adversaries. Binghui Zhang, Sayedeh Leila Noorbakhsh, Yuan Hong 0001, Binghui Wang |
AAAI | 2 |
| 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 | 2 |
| 2024 | Inf2Guard: An Information-Theoretic Framework for Learning Privacy-Preserving Representations against Inference Attacks
Sayedeh Leila Noorbakhsh, Binghui Zhang, Yuan Hong 0001, Binghui Wang |
USENIX Security Symposium | 1 |