mlsanityData to 7 Oct 2026

Virtual Parameter Sharpening: Dynamic Low-Rank Perturbations for Inference-Time Reasoning Enhancement

arXiv 2602.19169 ↗First posted 2 Dec 2025cs.LG cs.AI cs.MScited by 0

On the map: LLM reasoning → Test-time compute and efficient thinking

Abstract (arXiv)

I introduce Virtual Parameter Sharpening (VPS), an inference-time technique that augments frozen transformer linear layers with dynamic, activation-conditioned low-rank perturbations. Unlike parameter-efficient fine-tuning methods such as LoRA, which learn static low-rank adapters, VPS constructs its perturbation factors on the fly from batch activation statistics and optional gradient signals, enabling test-time adaptation without persistent parameter updates. The perturbation takes the form Delta W = gamma * W^T V U^T W, where selector matrices U and V are constructed via sparse activation-guided selection or Sylvester-coupled regression. We provide a theoretical analysis of the perturbation's spectral properties and describe an adaptive policy system that modulates perturbation magnitude based on activation energy and token-level entropy. This system incorporates multi-objective verification with iterative refinement for tasks with ground-truth supervision. We present the complete algorithmic framework, analyze its mathematical foundations, and discuss the mechanisms by which activation-conditioned computation may enhance reasoning capabilities in large language models. Implementation and experimental code are available at https://github.com/Saba-Kublashvili/vps-virtual-parameter-synthesis .

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Placed in Test-time compute and efficient thinking, one of 17 directions in LLM reasoning. Builds on 8 of its 24 references that are in the map. First posted on arXiv 2 Dec 2025.

Builds on

8 of 24 references.

References · 8

  1. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  2. 2021Training Verifiers to Solve Math Word Problemscited by 9,743
  3. 2024Qwen2.5 Technical Reportcited by 4,713
  4. 2018Think you have Solved Question Answering? Try ARC, the AI2 Reasoning Challengecited by 4,710
  5. 2016HyperNetworkscited by 1,003
  6. 2020AdapterFusion: Non-Destructive Task Composition for Transfer Learningcited by 780
  7. 2024DoRA: Weight-Decomposed Low-Rank Adaptationcited by 740
  8. 2022Rethinking the Role of Scale for In-Context Learning: An Interpretability-based Case Study at 66 Billion Scalecited by 64

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2025Singular Value Decomposition on Kronecker Adaptation for Large Language Model
  2. 2025Step-level Verifier-guided Hybrid Test-Time Scaling for Large Language Models
  3. 2025EDIT: Early Diffusion Inference Termination for dLLMs Based on Dynamics of Training Gradients
  4. 2025PERK: Long-Context Reasoning as Test-Time Learning
  5. 2026Flexi-LoRA with Input-Adaptive Ranks: Efficient Finetuning for Speech and Reasoning Tasks
  6. 2025Less is More: Improving LLM Reasoning with Minimal Test-Time Intervention
  7. 2025Adaptive GoGI-Skip: Coupling Goal-Gradient Importance with Dynamic Uncertainty for Efficient Reasoning
  8. 2026Explore Broadly, Reason Sharply: Push Small Models toward the Frontier via Sampling