Challenge: Personalized Large Language Models (PLLMs) aim to align outputs with individual user preferences . current methods of fine-tuning a separate module for each user are unscalable .
Approach: They propose a Merge-then-Adapt framework for Personalized Large Language Models . they construct a shared Meta-LoRA bank and propose an Adaptive LoRA Fusion stage .
Outcome: The proposed framework outperforms existing SOTA methods on the LaMP benchmark.

Similar Papers

Instant Personalized Large Language Model Adaptation via Hypernetwork (2026.acl-long)

Copied to clipboard

Challenge: Existing parameter-efficient fine-tuning methods require training a separate adapter for each user, making them computationally expensive and impractical for real-time updates.
Approach: They propose a scalable framework that maps a user's profile directly to a full set of adapter parameters.
Outcome: The proposed framework outperforms prompt-based personalization and OPPU while using substantially fewer computational resources at deployment.
pFedGPT: Hierarchically Optimizing LoRA Aggregation Weights for Personalized Federated GPT Models (2025.emnlp-main)

Copied to clipboard

Challenge: Existing methods for fine-tuning Large Language Models (LLMs) struggle with data heterogeneity and adapt shared global knowledge to individual client needs.
Approach: They propose a framework that leverages Hierarchical Bayesian Optimization (HBO) for fine-grained, personalized LoRA aggregation.
Outcome: The proposed framework achieves state-of-the-art (SOTA) performance on personalized FL benchmarks while introducing only minimal (approx. 4%) additional optimization overhead.
LoRA on the Go: Instance-level Dynamic LoRA Selection and Merging (2026.acl-long)

Copied to clipboard

Challenge: Low-Rank Adaptation (LoRA) is a parameter-efficient approach for fine-tuning large language models.
Approach: They propose a low-rank Adaptation framework that automatically selects and merges LoRA adapters at the instance level without additional training.
Outcome: The proposed framework outperforms training-based baselines on some tasks upto a margin of 3.6% while remaining competitive on other tasks and maintaining inference throughput.
PRISP: Privacy-Safe Few-Shot Personalization via Lightweight Adaptation (2026.acl-long)

Copied to clipboard

Challenge: Existing methods for large language model personalization are limited by data-rich settings and privacy risks.
Approach: They propose a lightweight and privacy-safe personalization framework tailored to constraints in large language models.
Outcome: Experiments on a few-shot variant of the LaMP benchmark show that PRISP achieves strong overall performance compared to prior approaches.
Adaptive LoRA Merge with Parameter Pruning for Low-Resource Generation (2025.findings-acl)

Copied to clipboard

Challenge: Existing methods for adapting LLMs to low-resource tasks keep LoRA parameters frozen and the low-level problem out of their scope.
Approach: They propose a LoRA merge method that updates and prunes LoRA parameters through fine-tuning with minimal target task data.
Outcome: The proposed method improves performance on a low-resource language generation task and improves on previous methods.
PROPER: A Progressive Learning Framework for Personalized Large Language Models with Group-Level Adaptation (2025.acl-long)

Copied to clipboard

Challenge: Personalized large language models (LLMs) aim to tailor outputs to user preferences . however, user data is typically sparse, making it challenging to adapt LLMs to specific user patterns.
Approach: They propose a progressive learning framework that groups users based on preferences and adapts LLMs in stages.
Outcome: The proposed approach outperforms SOTA models across multiple tasks.
LoRA-Flow: Dynamic LoRA Fusion for Large Language Models in Generative Tasks (2024.acl-long)

Copied to clipboard

Challenge: LoRA-Flow uses lightweight modules to customize large language models for downstream tasks . previous work on LoRA combination relied on task-level weights for each involved LoRA .
Approach: They propose a LoRA-Flow approach that uses dynamic weights to adjust the impact of different LoRAs.
Outcome: The proposed method outperforms baselines with task-level weights on six generative tasks.
Federated LoRA Fine-Tuning with Pipelined Error-Mitigated Aggregation and Matrix-Wise Freezing (2026.findings-acl)

Copied to clipboard

Challenge: Existing methods for fine-tuning large language models often suffer from biased model aggregation and are hindered by significant communication and computation burden.
Approach: They propose a Federated low-rank adaptation system for large language models that leverages pipelined error-mitigated model aggregation and adaptive matrix-wise parameter freezing to mitigate aggregations.
Outcome: The proposed system improves time-to-target by 2.17-8.48 on real-world datasets.
FanLoRA: Fantastic LoRAs and Where to Find Them in Large Language Model Fine-tuning (2024.emnlp-industry)

Copied to clipboard

Challenge: Lowrank adaptation and its variants introduce significant latency in multi-tenant settings, hindering their applications in the industry.
Approach: They propose a framework to fine-tune LoRA modules on a large-scale instruction tuning dataset.
Outcome: The proposed framework outperforms existing PEFT methods and significantly reduces inference latency.
NormAL LoRA: What is the perfect size? (2025.findings-emnlp)

Copied to clipboard

Challenge: Large Language Models (LLMs) are crucial for enabling intelligent experiences across applications.
Approach: They propose a low-rank adaptive localization method that uses rank-norm regularization to determine the optimal rank for each weight matrix.
Outcome: NormAL LoRA reduces adapter parameters by 37% while preserving full fine-tuning performance.

What is GenGO?

GenGO is an NLP powered publication search system. It currenctly indexes 30k+ papers from ACL Anthology, and implements multi-aspect summarization, semantic search, and more!

Information

About
Limitations