mlsanityData to 14 Oct 2026

CTR-LoRA: Curvature-Aware and Trust-Region Guided Low-Rank Adaptation for Large Language Models

arXiv 2510.15962 ↗First posted 11 Oct 2025cs.LG cs.AIcited by 6

Not on the map. Why?

Abstract (arXiv)

Parameter-efficient fine-tuning (PEFT) has become the standard approach for adapting large language models under limited compute and memory budgets. Although previous methods improve efficiency through low-rank updates, quantization, or heuristic budget reallocation, they often decouple the allocation of capacity from the way updates evolve during training. In this work, we introduce CTR-LoRA, a framework guided by curvature trust region that integrates rank scheduling with stability-aware optimization. CTR-LoRA allocates parameters based on marginal utility derived from lightweight second-order proxies and constrains updates using a Fisher/Hessian-metric trust region. Experiments on multiple open-source backbones (7B-13B), evaluated on both in-distribution and out-of-distribution benchmarks, show consistent improvements over strong PEFT baselines. In addition to increased accuracy, CTR-LoRA enhances training stability, reduces memory requirements, and achieves higher throughput, positioning it on the Pareto frontier of performance and efficiency. These results highlight a principled path toward more robust and deployable PEFT.

Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 18 of its 26 references that are in the map. First posted on arXiv 11 Oct 2025.

Builds on

18 of 26 references.

References · 18

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,380
  2. 2021Training Verifiers to Solve Math Word Problemscited by 10,109
  3. 2020Measuring Massive Multitask Language Understandingcited by 7,963
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,886
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,100
  6. 2023QLoRA: Efficient Finetuning of Quantized LLMscited by 3,418
  7. 2019BoolQ: Exploring the Surprising Difficulty of Natural Yes/No Questionscited by 2,183
  8. 2015Optimizing Neural Networks with Kronecker-factored Approximate Curvaturecited by 796
  9. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 758
  10. 2024LoRA+: Efficient Low Rank Adaptation of Large Modelscited by 377
  11. 2023AdaLoRA: Adaptive Budget Allocation for Parameter-Efficient Fine-Tuningcited by 357
  12. 2024LoRA Learns Less and Forgets Lesscited by 328
6 more
  1. 2024PiSSA: Principal Singular Values and Singular Vectors Adaptation of Large Language Modelscited by 269
  2. 2024DPCore: Dynamic Prompt Coreset for Continual Test-Time Adaptationcited by 33
  3. 2025Visual Instance-aware Prompt Tuningcited by 29
  4. 2025MagicID: Hybrid Preference Optimization for ID-Consistent and Dynamic-Preserved Video Customizationcited by 17
  5. 2025Visual Variational Autoencoder Prompt Tuningcited by 10
  6. 2025FOCUS: Fused Observation of Channels for Unveiling Spectracited by 7

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2025: 1; 2026: 5.

6 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Strategic Over-Parameterization for Generalizable Low-Rank Adaptation
  2. 2025ScaLoRA: Optimally Scaled Low-Rank Adaptation for Efficient High-Rank Fine-Tuning
  3. 2024LoRA-XS: Low-Rank Adaptation with Extremely Small Number of Parameters
  4. 2024LoRA Land: 310 Fine-tuned LLMs that Rival GPT-4, A Technical Report
  5. 2026Parameter-Efficient Fine-Tuning with Learnable Rank
  6. 2026TLoRA: Task-aware Low Rank Adaptation of Large Language Models
  7. 2026Sparsity-Aware Low-Rank Representation for Efficient Fine-Tuning of Large Language Models
  8. 2025Dual LoRA: Enhancing LoRA with Magnitude and Direction Updates