Pith. sign in

REVIEW 4 cited by

FedCLIP: Fast Generalization and Personalization for CLIP in Federated Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2302.13485 v2 pith:FCBBPG5E submitted 2023-02-27 cs.LG cs.AI

classification cs.LGcs.AI
keywords costsclipcommunicationcomputationalfedclipfederatedlargelearning
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Federated learning (FL) has emerged as a new paradigm for privacy-preserving computation in recent years. Unfortunately, FL faces two critical challenges that hinder its actual performance: data distribution heterogeneity and high resource costs brought by large foundation models. Specifically, the non-IID data in different clients make existing FL algorithms hard to converge while the high resource costs, including computational and communication costs that increase the deployment difficulty in real-world scenarios. In this paper, we propose an effective yet simple method, named FedCLIP, to achieve fast generalization and personalization for CLIP in federated learning. Concretely, we design an attention-based adapter for the large model, CLIP, and the rest operations merely depend on adapters. Lightweight adapters can make the most use of pretrained model information and ensure models be adaptive for clients in specific tasks. Simultaneously, small-scale operations can mitigate the computational burden and communication burden caused by large models. Extensive experiments are conducted on three datasets with distribution shifts. Qualitative and quantitative results demonstrate that FedCLIP significantly outperforms other baselines (9% overall improvements on PACS) and effectively reduces computational and communication costs (283x faster than FedAVG). Our code will be available at: https://github.com/microsoft/PersonalizedFL.

Discussion (0). Sign in to comment.

Forward citations

Cited by 4 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. PID-Guided Partial Alignment for Multimodal Decentralized Federated Learning

    cs.LG 2026-01 conditional novelty 6.0 of 10

    PARSE splits multimodal features into redundant, unique, and synergistic slices and shares only alignable slices over per-modality P2P subgraphs, reporting consistent but modest accuracy gains over existing multimodal...

  2. Generalized and Personalized Federated Learning with Black-Box Foundation Models via Orthogonal Transformations

    cs.LG 2025-05 conditional novelty 6.0 of 10

    A federated learning method combines client-specific orthogonal transformations on frozen black-box foundation model embeddings with a shared classifier, outperforming baselines on several domain-shift benchmarks.

  3. Multimodal Federated Learning: A Survey through the Lens of Different FL Paradigms

    cs.LG 2025-05 conditional novelty 5.0 of 10

    A paradigm-based taxonomy of multimodal federated learning that assigns each branch a headline challenge: modality heterogeneity (horizontal), privacy leakage (vertical), and efficiency (hybrid).

  4. Personalized Federated Learning via Dual-Prompt Optimization and Cross Fusion

    cs.LG 2025-06 conditional novelty 3.0 of 10

    pFedDC combines global and local text and vision prompts with cross-attention fusion to personalize federated CLIP models under label and domain shift.

Pith tools