← Search

Taha Ceritli

4 accepted papers

2025

A Study of Improving The Privacy-Utility Trade-off of Task-specific Models with Learnable Privacy

ICASSP 2025accepted

In recent years, machine learning (ML) models have been integrated into various applications and products to improve user experience. However, this approach raises significant concerns about the protection of private user data utilized for training the models. One limitation of vanilla privacy metho…

Cited by 0SourceScholar
2025

HydraOpt: Navigating the Efficiency-Performance Trade-off of Adapter Merging

EMNLP 2025

Large language models (LLMs) often leverage adapters, such as low-rank-based adapters, to achieve strong performance on downstream tasks. However, storing a separate adapter for each task significantly increases memory requirements, posing a challenge for resource-constrained environ ments such as m

Cited by 0SourcePDFScholar
2025

Hyper-Refinement for Low-Rank Adaptation

ICASSP 2025accepted

Parameter-efficient fine-tuning (PEFT) is utilized to adapt large pre-trained machine learning (ML) models to new tasks using a small number of trainable parameters. In particular, Low-Rank Adaptation (LoRA) is one of the prominent PEFT methods. To this end, we introduce a novel method that exploits…

Cited by 0SourceScholar
2024

A Study of Parameter Efficient Fine-tuning by Learning to Efficiently Fine-Tune

EMNLP 2024finding

The growing size of large language models (LLMs) requires parameter-efficient fine-tuning (PEFT) methods for their adaptation to new tasks. Existing methods, such as Low-Rank Adaptation (LoRA), typically involve model adaptation by training the PEFT parameters. One open problem required to be solved…

Cited by 1SourcePDFScholar