Dhananjaya Gowda
Author directory2026
Latent Task Embedding: Geometric Expansion for Single-Path Multi-Task PEFT
Junhyun Lee | Seoha Song | Dhananjaya Gowda
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Junhyun Lee | Seoha Song | Dhananjaya Gowda
Proceedings of the 2026 Conference on Empirical Methods in Natural Language Processing
Parameter-efficient fine-tuning (PEFT) typically relies on additive weight perturbation. However, in dynamic deployment environments like multi-tenant cloud serving or mobile edge devices, additive methods force a dilemma: merge weights and lose task-switching flexibility, or remain unmerged and suffer severe parallel-branching latency. To break this bottleneck, we propose Latent Task Embedding (LatTE), which shifts the PEFT design axis to geometric expansion. Instead of perturbing frozen parameters, LatTE concatenates a task-specific auxiliary embedding to the input and expands the corresponding weight matrices. This structural fusion ensures the forward pass remains a single, optimized matrix multiplication, bypassing the routing overhead of unmerged adapters. Furthermore, LatTE natively supports router-free, intra-batch multi-tasking by isolating tasks into distinct subspaces controlled via binary masking. Extensive evaluations across 1B to 14B parameter models demonstrate that LatTE matches highly optimized baselines like LoRA, while raising throughput by 1.7× over routed multi-adapter LoRA under heterogeneous-task batching.
2025
zFLoRA: Zero-Latency Fused Low-Rank Adapters
Dhananjaya Gowda | Seoha Song | Harshith Goka | Junhyun Lee
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Dhananjaya Gowda | Seoha Song | Harshith Goka | Junhyun Lee
Proceedings of the 2025 Conference on Empirical Methods in Natural Language Processing
Large language models (LLMs) are increasingly deployed with task-specific adapters catering to multiple downstream applications. In such a scenario, the additional compute associated with these apparently insignificant number of adapter parameters (typically less than 1% of the base model) turns out to be disproportionately significant during inference time (up to 2.5x times that of the base model). In this paper, we propose a new zero-latency fused low-rank adapter (zFLoRA) that introduces zero or negligible latency overhead on top of the base model. Experimental results on LLMs of size 1B, 3B and 7B show that zFLoRA compares favorably against the popular supervised fine-tuning benchmarks including low-rank adapters (LoRA) as well as full fine-tuning (FFT). Experiments are conducted on 18 different tasks across three different categories namely commonsense reasoning, math reasoning and summary-dialogue. Latency measurements made on NPU (Samsung Galaxy S25+) as well as GPU (NVIDIA H100) platforms show that the proposed zFLoRA adapters introduce zero to negligible latency overhead.