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

Charlie Hou

dblp:255/4932 · DBLP profile ↗
← Back
4ranked-venue papers
4as first author
4since 2021 · last 2025
—ORCID · none

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

Artificial intelligence and machine learning · 3 · 3 first-author · 3 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 · 89% Blockchain and cryptocurrency security · 11%
Artificial intelligence
4 papers
Efficient and distributed learning · 77% Language models and text generation · 19% Reinforcement learning · 4%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Distributed systems · 100%

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

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
federated learning
2.232025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
PrE-Text: Training Language Models on Private Federated Data in the Age of LLMs · ICML 2024
FedChain: Chained Algorithms for Near-optimal Communication Cost in Federated Learning · ICLR 2022
Privacy and data protection › differential privacy
synthetic data generation
1.622025
Private Federated Learning using Preference-Optimized Synthetic Data · ICML 2025
PrE-Text: Training Language Models on Private Federated Data in the Age of LLMs · ICML 2024
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
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
0.812024
PrE-Text: Training Language Models on Private Federated Data in the Age of LLMs · ICML 2024
Distributed systems
distributed optimization
0.612022
FedChain: Chained Algorithms for Near-optimal Communication Cost in Federated Learning · ICLR 2022
Distributed systems › distributed machine learning
federated learning
0.612022
FedChain: Chained Algorithms for Near-optimal Communication Cost in Federated Learning · ICLR 2022
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
Machine learning › Reinforcement learning
deep reinforcement learning
0.112021
SquirRL: Automating Attack Analysis on Blockchain Incentive Mechanisms with Deep Reinforcement Learning · NDSS 2021

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

reinforcement learning · 1.7policy optimization · 1.7direct preference optimization · 1.7synthetic data generation · 1.5private evolution · 1.5gradient compression · 1.1chained algorithms · 1.1deep reinforcement learning · 1.0
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
ICML1
2024 PrE-Text: Training Language Models on Private Federated Data in the Age of LLMs
abstract
On-device training is currently the most common approach for training machine learning (ML) models on private, distributed user data. Despite this, on-device training has several drawbacks: (1) most user devices are too small to train large models on-device, (2) on-device training is communication- and computation-intensive, and (3) on-device training can be difficult to debug and deploy. To address these problems, we propose Private Evolution-Text (PrE-Text), a method for generating differentially private (DP) synthetic textual data. First, we show that across multiple datasets, training small models (models that fit on user devices) with PrE-Text synthetic data outperforms small models trained on-device under practical privacy regimes ($\epsilon=1.29$, $\epsilon=7.58$). We achieve these results while using 9$\times$ fewer rounds, 6$\times$ less client computation per round, and 100$\times$ less communication per round. Second, finetuning large models on PrE-Text’s DP synthetic data improves large language model (LLM) performance on private data across the same range of privacy budgets. Altogether, these results suggest that training on DP synthetic data can be a better option than training a model on-device on private distributed data. Code is available at https://github.com/houcharlie/PrE-Text.
Charlie Hou, Akshat Shrivastava, Hongyuan Zhan, Rylan Conway, Trang Le, Adithya Sagar, Giulia Fanti, Daniel Lazar
ICML1
2022 FedChain: Chained Algorithms for Near-optimal Communication Cost in Federated Learning
Charlie Hou, Kiran Koshy Thekumparampil, Giulia Fanti, Sewoong Oh
ICLR1
2021 SquirRL: Automating Attack Analysis on Blockchain Incentive Mechanisms with Deep Reinforcement Learning
Charlie Hou, Mingxun Zhou, Yan Ji 0001, Philip Daian, Florian Tramèr, Giulia Fanti, Ari Juels
NDSS1