AIBullisharXiv – CS AI · May 127/10
🧠Echo-LoRA introduces a parameter-efficient fine-tuning method that injects cross-layer representations from deeper neural network layers into shallow LoRA modules during training, achieving 3-5.7% performance improvements on reasoning tasks without adding inference costs. The technique discards its auxiliary training path post-deployment, maintaining the efficiency benefits of standard LoRA while delivering measurable capability gains.
AIBullisharXiv – CS AI · May 127/10
🧠Researchers introduce BaLoRA, a Bayesian extension of Low-Rank Adaptation that improves fine-tuning of large AI models by adding uncertainty quantification while narrowing the accuracy gap with full fine-tuning. The method uses input-adaptive parameterization with minimal computational overhead and demonstrates stronger performance across language, vision, and materials science tasks.
AIBullisharXiv – CS AI · May 117/10
🧠Researchers introduce MatryoshkaLoRA, a novel training framework that improves upon Low-Rank Adaptation (LoRA) for efficient large language model fine-tuning by learning hierarchical low-rank representations through a strategically placed diagonal scaling matrix. The method enables dynamic rank selection with minimal accuracy loss and introduces AURAC, a new evaluation metric for hierarchical adapters, addressing a key limitation in current parameter-efficient fine-tuning approaches.
AIBullisharXiv – CS AI · May 97/10
🧠Researchers demonstrate that fine-tuned small language models (SLMs) can outperform larger language models for Windows event log analysis while requiring significantly fewer computational resources. The study creates a synthetic dataset with remediation actions and shows SLMs deliver superior issue identification and actionable solutions, presenting a practical alternative to cloud-dependent LLMs for enterprise security operations.
AIBullisharXiv – CS AI · May 97/10
🧠Researchers introduce DomLoRA, a parameter-efficient fine-tuning method that identifies a single 'dominant adaptation module' where most gradient energy concentrates, achieving superior performance with only 0.7% of standard LoRA's trainable parameters. The discovery reveals that optimal adapter placement is architecture-dependent but task-stable across instruction following, reasoning, and code generation applications.
AIBullisharXiv – CS AI · May 17/10
🧠Researchers introduce PARA, a post-optimization compression method for LoRA (Low-Rank Adaptation) that reduces parameter count by 75-90% while maintaining performance. The technique uses Singular Value Decomposition to allocate non-uniform ranks across model layers based on spectral importance, addressing inefficiencies in standard LoRA implementations.
AIBearisharXiv – CS AI · Mar 177/10
🧠Research reveals that fine-tuning aligned vision-language AI models on narrow harmful datasets causes severe safety degradation that generalizes across unrelated tasks. The study shows multimodal models exhibit 70% higher misalignment than text-only evaluation suggests, with even 10% harmful training data causing substantial alignment loss.
AIBullisharXiv – CS AI · Mar 177/10
🧠Researchers introduce MapReduce LoRA and Reward-aware Token Embedding (RaTE) to optimize multiple preferences in generative AI models without degrading performance across dimensions. The methods show significant improvements across text-to-image, text-to-video, and language tasks, with gains ranging from 4.3% to 136.7% on various benchmarks.
🧠 Llama🧠 Stable Diffusion
AIBullisharXiv – CS AI · Mar 97/10
🧠Researchers propose FLoRG, a new federated learning framework for efficiently fine-tuning large language models that reduces communication overhead by up to 2041x while improving accuracy. The method uses Gram matrix aggregation and Procrustes alignment to solve aggregation errors and decomposition drift issues in distributed AI training.
AIBullisharXiv – CS AI · Mar 57/10
🧠Researchers have developed Spectral Surgery, a training-free method to improve LoRA (Low-Rank Adaptation) model performance by reweighting singular values based on gradient sensitivity. The technique achieves significant performance gains (up to +4.4 points on CommonsenseQA) by adjusting only about 1,000 scalar coefficients without requiring retraining.
🧠 Llama
AIBullisharXiv – CS AI · Feb 277/107
🧠Researchers introduce NoRA (Non-linear Rank Adaptation), a new parameter-efficient fine-tuning method that overcomes the 'linear ceiling' limitations of traditional LoRA by using SiLU gating and structural dropout. NoRA achieves superior performance at rank 64 compared to LoRA at rank 512, demonstrating significant efficiency gains in complex reasoning tasks.
AIBullisharXiv – CS AI · 2d ago6/10
🧠Researchers introduce NaRA (Noise-aware Low-Rank Adaptation), a parameter-efficient fine-tuning method designed specifically for diffusion large language models that adapts to noise levels during the denoising process. Unlike existing methods like LoRA that use static parameters, NaRA employs a hypernetwork to dynamically adjust low-rank matrices based on noise, achieving better performance on reasoning and code generation tasks.
AINeutralarXiv – CS AI · 2d ago6/10
🧠Researchers introduce iLoRA, a Bayesian framework that combines low-rank adaptation with latent interaction graph inference for improved domain-specific predictions. The method is evaluated on microbiome diagnosis tasks, where it outperforms standard LoRA by jointly learning prediction models and underlying biological interaction structures rather than analyzing them separately.
AINeutralarXiv – CS AI · May 126/10
🧠AdaPreLoRA addresses a fundamental challenge in fine-tuning large language models by proposing a new optimization method that combines Adafactor preconditioning with Low-Rank Adaptation. The technique achieves competitive or superior performance across multiple benchmarks while maintaining memory efficiency comparable to standard LoRA optimizers.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers propose MoLF (Mixture of LoRA and Full Fine-Tuning), a hybrid framework that dynamically routes gradient updates between full fine-tuning and low-rank adaptation during LLM training. The approach addresses limitations of relying solely on either method, achieving competitive or superior performance across diverse tasks while maintaining training stability and memory efficiency.
AINeutralarXiv – CS AI · May 116/10
🧠Researchers introduce POETS, a novel framework that optimizes large language models through compute-efficient policy ensembles while quantifying uncertainty. By leveraging KL-regularized Thompson sampling and shared backbone architectures with independent LoRA branches, POETS achieves superior sample efficiency in scientific discovery tasks while reducing computational overhead compared to traditional ensemble methods.
AINeutralarXiv – CS AI · May 76/10
🧠Researchers introduce Budgeted LoRA, a distillation framework that compresses large language models by treating model compression as a structured compute allocation problem. The method achieves up to 4.05x speedup in inference through selective dense component removal and adaptive low-rank allocation, controlled by a single compute budget parameter.
🏢 Perplexity
AIBullisharXiv – CS AI · May 76/10
🧠Researchers introduce Delta-Code Generation, a method where fine-tuned LLMs generate compact code diffs to modify existing neural architectures rather than creating complete models from scratch. The approach achieves significantly higher validity rates (66-75%) and accuracy (64-66%) compared to baseline full-generation methods while reducing output by 75-85%, demonstrating a more efficient paradigm for LLM-driven neural architecture search.
AIBullisharXiv – CS AI · Apr 206/10
🧠Researchers introduce JumpLoRA, a novel framework that uses sparse adapters with JumpReLU gating to enable continual learning in large language models while mitigating catastrophic forgetting. The method dynamically isolates parameters across tasks, outperforming existing state-of-the-art approaches like ELLA and significantly improving IncLoRA performance.
AINeutralarXiv – CS AI · Apr 156/10
🧠Researchers propose an SVD-based orthogonal subspace projection method for continual machine unlearning that prevents interference between sequential deletion tasks in neural networks. The approach maintains model performance on retained data while effectively removing influence of unlearned data, addressing a critical limitation of naive LoRA fusion methods.
AINeutralarXiv – CS AI · Apr 156/10
🧠Researchers propose Polynomial Expansion Rank Adaptation (PERA), a novel fine-tuning method that enhances Low-Rank Adaptation (LoRA) by incorporating high-order polynomial interactions into low-rank factors. PERA improves the expressive capacity of LLM fine-tuning without increasing computational costs, demonstrating consistent performance gains across benchmarks while maintaining the efficiency benefits of rank-constrained adaptation.
AINeutralarXiv – CS AI · Apr 146/10
🧠Researchers present a unified framework for understanding how different methods control large language models—including fine-tuning, LoRA, and activation interventions—revealing a fundamental trade-off between steering strength and output quality. The analysis explains this through an activation manifold perspective and introduces SPLIT, a new steering method that improves control while better preserving model coherence.
AIBullisharXiv – CS AI · Apr 106/10
🧠Researchers propose FLeX, a parameter-efficient fine-tuning approach combining LoRA, advanced optimizers, and Fourier-based regularization to enable cross-lingual code generation across programming languages. The method achieves 42.1% pass@1 on Java tasks compared to a 34.2% baseline, demonstrating significant improvements in multilingual transfer without full model retraining.
🧠 Llama
AIBullisharXiv – CS AI · Apr 106/10
🧠Researchers introduce LoRA-DA, a new initialization method for Low-Rank Adaptation that leverages target-domain data and theoretical optimization principles to improve fine-tuning performance. The method outperforms existing initialization approaches across multiple benchmarks while maintaining computational efficiency.
AIBullisharXiv – CS AI · Apr 66/10
🧠Researchers developed new compression techniques for LLM-generated text, achieving massive compression ratios through domain-adapted LoRA adapters and an interactive 'Question-Asking' protocol. The QA method uses binary questions to transfer knowledge between small and large models, achieving compression ratios of 0.0006-0.004 while recovering 23-72% of capability gaps.
