Papers › Unlocking the Potential of Prompt-Tuning in Bridging Generalized and Personalized...

Unlocking the Potential of Prompt-Tuning in Bridging Generalized and Personalized Federated Learning

27 Oct 2023CVPR 2024 1arXiv:2310.18285archive 2025-07-28

Wenlong Deng, Christos Thrampoulidis, Xiaoxiao Li

Vision Transformers (ViT) and Visual Prompt Tuning (VPT) achieve state-of-the-art performance with improved efficiency in various computer vision tasks. This suggests a promising paradigm shift of adapting pre-trained ViT models to Federated Learning (FL) settings. However, the challenge of data heterogeneity among FL clients presents a significant hurdle in effectively deploying ViT models. Existing Generalized FL (GFL) and Personalized FL (PFL) methods have limitations in balancing performance across both global and local data distributions. In this paper, we present a novel algorithm, SGPT, that integrates GFL and PFL approaches by employing a unique combination of both shared and group-specific prompts. This design enables SGPT to capture both common and group-specific features. A key feature of SGPT is its prompt selection module, which facilitates the training of a single global model capable of automatically adapting to diverse local client data distributions without the need for local fine-tuning. To effectively train the prompts, we utilize block coordinate descent (BCD), learning from common feature information (shared prompts), and then more specialized knowledge (group prompts) iteratively. Theoretically, we justify that learning the proposed prompts can reduce the gap between global and local performance. Empirically, we conduct experiments on both label and feature heterogeneity settings in comparison with state-of-the-art baselines, along with extensive ablation studies, to substantiate the superior performance of SGPT.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2310.18285")

Code

Syntology Ran 7 of 14 code samples harvested from 1 repository linked to this paper; 7 have no recorded run. Of those that ran: 1 ran · honoured contract; 1 ran · violated contract; 3 ran · our draft was wrong; 1 ran · fixture could not drive it; 1 ran with no contract checked.

By repository: community (archive-listed): 14 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

ubc-tea/SGPT mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

14 samples harvested; 7 ran; 1 honoured the contract we drafted; 7 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1ran · honoured contract
1ran · violated contract
3ran · our draft was wrong
1ran · fixture could not drive it
1ran
7unverified

Licence: 0 of the 14 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from ubc-tea/SGPT. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

np2th ubc-tea/SGPT/models/modeling_resnet.py community (archive-listed) ran · fixture could not drive it MIT (permissive) · 7d8eaf5537f699e4 · report
swish ubc-tea/SGPT/models/vit_models_pr.py community (archive-listed) ran · our draft was wrong fingerprinted MIT (permissive) · 0f786c407fb1ee4c · report
conv1x1 ubc-tea/SGPT/models/modeling_resnet.py community (archive-listed) ran · our draft was wrong MIT (permissive) · b0f916df39e78ae5 · report
conv3x3 ubc-tea/SGPT/models/modeling_resnet.py community (archive-listed) ran · our draft was wrong MIT (permissive) · 4e5bf13dbdc4f008 · report
default_loader ubc-tea/SGPT/datasets.py community (archive-listed) ran MIT (permissive) · 9becbb1bb6878d86 · report
pair ubc-tea/SGPT/models/vit.py community (archive-listed) ran · violated contract fingerprinted MIT (permissive) · 6ba8cee9f5daea41 · report
pil_loader ubc-tea/SGPT/datasets.py community (archive-listed) ran · honoured contract MIT (permissive) · f321f54723433661 · report
accimage_loader ubc-tea/SGPT/datasets.py community (archive-listed) unverified MIT (permissive) · 404fb2b2daa1ae78 · report
compute_accuracy_loss_our ubc-tea/SGPT/utils.py community (archive-listed) unverified MIT (permissive) · e5aedcdcb47e6187 · report
compute_accuracy_our ubc-tea/SGPT/utils.py community (archive-listed) unverified MIT (permissive) · 7f6d371a0070d858 · report
fine_to_coarse ubc-tea/SGPT/utils.py community (archive-listed) unverified MIT (permissive) · 35471b48391ad731 · report
mul ubc-tea/SGPT/models/vit_models_pr.py community (archive-listed) unverified MIT (permissive) · ed12305ac7a0e8c6 · report
prepare_data ubc-tea/SGPT/office_dataset.py community (archive-listed) unverified MIT (permissive) · 3ddb1351d0520849 · report
prepare_data_domain ubc-tea/SGPT/domainnet_dataset.py community (archive-listed) unverified MIT (permissive) · 4cf21940c65881c8 · report

Tasks

Federated LearningPersonalized Federated LearningVisual Prompt Tuning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Focus

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections