Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Mei-Yu Wang

dblp:52/7470 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 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.

Network and information security
1 paper
Privacy and data protection · 100%
Artificial intelligence
1 paper
Efficient and distributed learning · 77% Language models and text generation · 23%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning › federated learning › privacy-preserving federated learning
differentially private federated learning
0.912025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
Machine learning › Efficient and distributed learning
federated learning
0.912025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
Privacy and data protection › differential privacy › differentially private learning
differentially private federated learning
0.912025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
Privacy and data protection
privacy-preserving machine learning
0.912025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
Privacy and data protection › differential privacy
synthetic data generation
0.912025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
Natural language and speech › Language models and text generation
large language model fine-tuning
0.312025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
Natural language and speech › Language models and text generation
preference optimization
0.312025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025

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

reinforcement learning · 1.7policy optimization · 1.7direct preference optimization · 1.7
YearPublicationVenuePosition
2025 Private Federated Learning using Preference-Optimized Synthetic Data
abstract
In practical settings, differentially private federated learning (DP-FL) is the dominant method for training models from private, on-device client data. Recent work has suggested that DP-FL may be enhanced or outperformed by methods that use DP synthetic data (Wu et al., 2024; Hou et al., 2024). The primary algorithms for generating DP synthetic data for FL applications require careful prompt engineering based on public information and/or iterative private client feedback. Our key insight is that the private client feedback collected by prior DP synthetic data methods (Hou et al., 2024; Xie et al., 2024) can be viewed as an RL reward. Our algorithm, Policy Optimization for Private Data (POPri) harnesses client feedback using policy optimization algorithms such as Direct Preference Optimization (DPO) to fine-tune LLMs to generate high-quality DP synthetic data. To evaluate POPri, we release LargeFedBench, a new federated text benchmark for uncontaminated LLM evaluations on federated client data. POPri closes the gap in performance between the fully-private and non-private settings by up to 58%, compared to 28% for prior synthetic data methods, and 3% for state-of-the-art DP federated learning methods. The code and data are available at https://github.com/meiyuw/POPri.
Charlie Hou, Mei-Yu Wang, Yige Zhu, Daniel Lazar, Giulia Fanti
ICML2