250 citations · 532 across the 72 of their papers we have counts for
7 papers · 2 filters
Decomposing Task Vectors for Refined Model Editing
Hamed Damirchi, Ehsan Abbasnejad, Zhen Zhang +1
Large pre-trained models have transformed machine learning, yet adapting these models effectively to exhibit precise, concept-specific behaviors remains a significant challenge. Ta…
The Quest for Winning Tickets in Low-Rank Adapters
Hamed Damirchi, Cristian Rodriguez-Opazo, Ehsan Abbasnejad +2
The Lottery Ticket Hypothesis (LTH) suggests that over-parameterized neural networks contain sparse subnetworks ("winning tickets") capable of matching full model performance when…
Certified but Fooled! Breaking Certified Defences with Ghost Certificates
Quoc Viet Vo, Tashreque M. Haq, Paul Montague +3
Certified defenses promise provable robustness guarantees. We study the malicious exploitation of probabilistic certification frameworks to better understand the limits of guarante…
CEDL: Centre-Enhanced Discriminative Learning for Anomaly Detection
Zahra Zamanzadeh Darban, Qizhou Wang, Charu C. Aggarwal +3
Supervised anomaly detection methods perform well in identifying known anomalies that are well represented in the training set. However, they often struggle to generalise beyond th…
Beyond Imitation: Recovering Dense Rewards from Demonstrations
Jiangnan Li, Thuy-Trang Vu, Ehsan Abbasnejad +1
Conventionally, supervised fine-tuning (SFT) is treated as a simple imitation learning process that only trains a policy to imitate expert behavior on demonstration datasets. In th…
Towards Higher Effective Rank in Parameter-efficient Fine-tuning using Khatri--Rao Product
Paul Albert, Frederic Z. Zhang, Hemanth Saratchandran +2
Parameter-efficient fine-tuning (PEFT) has become a standard approach for adapting large pre-trained models. Amongst PEFT methods, low-rank adaptation (LoRA) has achieved notable s…