DBScholar

Back to papers

Communication Efficient and Provable Federated Unlearning

Summary: Introduces exact federated unlearning with retraining-equivalent, provable guarantees for deleted clients or samples. FATS adds total-variation stability to FedAvg, enabling communication-efficient unlearning. (summarized by gpt-5.6-luna on Jul 24 2026)

Paper ID
13549
Venue
VLDB
Year
2024
Pagerank
-
Overall Rank
13,355 | 8.38%
DOI
10.14778/3641204.3641220

Incoming Non-self Citations Over Time

No non-self incoming citations found for this paper in this database.

Authors

BibTeX Citation

@article{tao_vldb24,
        title = {{Communication Efficient and Provable Federated Unlearning}},
        author = {Tao, Youming and Wang, Cheng-Long and Pan, Miao and Yu, Dongxiao and Cheng, Xiuzhen and Wang, Di},
        journal = {PVLDB},
        series = {{VLDB} '24},
        volume = {17},
        number = {5},
        pages = {1119--1131},
        doi = {10.14778/3641204.3641220},
        url = {https://doi.org/10.14778/3641204.3641220},
        year = {2024}
}

Incoming Citations (Sorted by Pagerank)

Showing 0 of 0 citing papers.

Rank Citing Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Outgoing Citations (Sorted by Pagerank)

Showing 0 of 0 cited papers.

Citations counted here include only citations to other VLDB/SIGMOD/CIDR/PODS papers in this database.

Rank Cited Paper Year Venue Pagerank
Previous Page 1 / 1 Next

Semantically Similar Papers