dorsal/arxiv
View SchemaGeoRA: Geometry-Aware Low-Rank Adaptation for RLVR
| Authors | Jiaying Zhang, Lei Shi, Jiguo Li, Jun Xu, Jiuchong Gao, Jinghua Hao, Renqing He |
|---|---|
| Categories | |
| ArXiv ID | 2601.09361vv1 |
| URL | https://arxiv.org/abs/2601.09361 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Reinforcement Learning with Verifiable Rewards (RLVR) is crucial for advancing large-scale reasoning models. However, existing parameter-efficient methods, such as PiSSA and MiLoRA, are designed for Supervised Fine-Tuning (SFT) and do not account for the distinct optimization dynamics and geometric structures of RLVR. Applying these methods directly leads to spectral collapse and optimization instability, which severely limit model performance. Meanwhile, alternative approaches that leverage update sparsity encounter significant efficiency bottlenecks on modern hardware due to unstructured computations. To address these challenges, we propose GeoRA (Geometry-Aware Low-Rank Adaptation), which exploits the anisotropic and compressible nature of RL update subspaces. GeoRA initializes adapters by extracting principal directions via Singular Value Decomposition (SVD) within a geometrically constrained subspace while freezing the residual components. This method preserves the pre-trained geometric structure and enables efficient GPU computation through dense operators. Experiments on Qwen and Llama demonstrate that GeoRA mitigates optimization bottlenecks caused by geometric misalignment. It consistently outperforms established low-rank baselines on key mathematical benchmarks, achieving state-of-the-art (SOTA) results. Moreover, GeoRA shows superior generalization and resilience to catastrophic forgetting in out-of-domain tasks.
{
"annotation_id": "c73cbf54-5baa-4a29-8ad1-c464d07cc8ea",
"date_created": "2026-02-17T05:53:19.904000Z",
"date_modified": "2026-02-17T05:53:19.904000Z",
"file_hash": "950553ac5bef64f37d2de78758e0d5b9da3783e46f549093a384e79c17af9fea",
"private": false,
"record": {
"abstract": "Reinforcement Learning with Verifiable Rewards (RLVR) is crucial for advancing large-scale reasoning models. However, existing parameter-efficient methods, such as PiSSA and MiLoRA, are designed for Supervised Fine-Tuning (SFT) and do not account for the distinct optimization dynamics and geometric structures of RLVR. Applying these methods directly leads to spectral collapse and optimization instability, which severely limit model performance. Meanwhile, alternative approaches that leverage update sparsity encounter significant efficiency bottlenecks on modern hardware due to unstructured computations. To address these challenges, we propose GeoRA (Geometry-Aware Low-Rank Adaptation), which exploits the anisotropic and compressible nature of RL update subspaces. GeoRA initializes adapters by extracting principal directions via Singular Value Decomposition (SVD) within a geometrically constrained subspace while freezing the residual components. This method preserves the pre-trained geometric structure and enables efficient GPU computation through dense operators. Experiments on Qwen and Llama demonstrate that GeoRA mitigates optimization bottlenecks caused by geometric misalignment. It consistently outperforms established low-rank baselines on key mathematical benchmarks, achieving state-of-the-art (SOTA) results. Moreover, GeoRA shows superior generalization and resilience to catastrophic forgetting in out-of-domain tasks.",
"arxiv_id": "2601.09361",
"authors": [
"Jiaying Zhang",
"Lei Shi",
"Jiguo Li",
"Jun Xu",
"Jiuchong Gao",
"Jinghua Hao",
"Renqing He"
],
"categories": [
"cs.LG",
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "GeoRA: Geometry-Aware Low-Rank Adaptation for RLVR",
"url": "https://arxiv.org/abs/2601.09361",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "d83f6abf-a962-4175-9e63-1332f94b0057",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}