BiRG-LoRA: Clinically Structured Rank-Gated Low-Rank Adaptation for Cross-Benchmark Medical Question Answering
Score
75Base 83.5
Why selected
The method achieves both performance and efficiency gains across multiple medical benchmarks with theoretical novelty, but is only evaluated under a single-seed protocol without exploring seed variance, so a slight deduction is applied.
AI commentary
「This paper is particularly worth reading for researchers in medical NLP and parameter-efficient fine-tuning: it directly integrates clinical priors into LoRA's rank selection, not as a mixture-of-experts but by dynamically adjusting a single adapter's expressiveness per input—a clever design. The experiments are rigorous with proper statistical testing, though only single-seed. For practitioners seeking low-cost adaptation of large models in medical products, this parameter-reducing yet effective solution offers a valuable reference.」
Quick overview
This paper proposes BiRG-LoRA, a single-adapter rank-gated LoRA method tailored for medical multiple-choice question answering. It employs a biaxial gate mechanism that combines hidden semantic evidence with clinical specialty/operation priors to dynamically select sparse top-k rank atoms, with a scalar injection coefficient controlling adapter strength. Evaluated on Qwen3-8B, BiRG-LoRA achieves 69.31% macro-average accuracy across CMB, CMExam, MedQA, and MedMCQA, outperforming MoELoRA by 0.89 percentage points while using 28.1% fewer trainable parameters. The results demonstrate that clinically structured rank allocation effectively improves cross-benchmark medical QA.
- Proposes BiRG-LoRA, a single-adapter rank-gated LoRA that conditions on input via biaxial gate (hidden semantics + clinical priors) to select sparse top-k rank atoms and control adapter strength.
- Achieves 69.31% macro-average accuracy across four medical QA benchmarks using Qwen3-8B, surpassing MoELoRA by 0.89 pp with 28.1% fewer parameters.
- Outperforms vanilla LoRA r16 and rank-matched LoRA r4 by 0.83 macro points, and remains robust to moderate tag noise.
Full text
Showing the source text; the full translation is being generated.
Computer Science > Computation and Language
arXiv:2606.31432v1 (cs) [Submitted on 30 Jun 2026 (this version), latest version 2 Jul 2026 (v3)]Title:Clinically Structured Rank-Gated LoRA for Cross-Benchmark Medical Question Answering
Authors:Yining Huang View a PDF of the paper titled Clinically Structured Rank-Gated LoRA for Cross-Benchmark Medical Question Answering, by Yining Huang View PDF HTML (experimental)Abstract:Medical multiple-choice question answering requires parameter-efficient adaptation across heterogeneous knowledge domains and reasoning operations. A medication question, a diagnostic decision, a public-health item, and a nursing-action item may require different low-rank updates, while some recall items should preserve the base model's representation with only mild adapter intervention. We propose BiRG-LoRA, a single-adapter rank-gated LoRA method for medical question answering. BiRG-LoRA keeps one LoRA module per target layer but makes its rank dimension input-conditioned: for each question, a biaxial gate combines hidden semantic evidence with specialty/profession priors, clinical-operation priors, and their interaction to select a sparse top-$k$ subset of rank atoms. A scalar injection coefficient further controls the strength of the selected adapter update. Under a matched Qwen3-8B CMB-source protocol, BiRG-LoRA achieves the highest four-benchmark macro-average accuracy among trainable PEFT baselines and matched routing controls: 69.31% averaged over CMB, CMExam, MedQA, and MedMCQA. It improves over MoELoRA by 0.89 percentage points while using 28.1% fewer trainable parameters; a paired, benchmark-stratified bootstrap over final predictions gives a 95% confidence interval of [0.42, 1.37] for this macro-average gain. Basic controls show that BiRG-LoRA also improves over vanilla LoRA r16 and active-rank-matched LoRA r4 by 0.83 macro points, and an evaluation-time weak-axis perturbation check suggests that performance is not brittle to moderate tag noise. The results support a bounded claim: clinically structured rank allocation improves cross-benchmark medical QA under a matched single-seed protocol, while training-seed variance remains future work.
| Subjects: | Computation and Language (cs.CL) |
| Cite as: | arXiv:2606.31432 [cs.CL] |
| (or arXiv:2606.31432v1 [cs.CL] for this version) | |
| https://doi.org/10.48550/arXiv.2606.31432 Focus to learn more arXiv-issued DOI via DataCite |
Submission history
From: Yining Huang [view email][v1] Tue, 30 Jun 2026 09:59:05 UTC (185 KB)
[v2] Wed, 1 Jul 2026 11:12:56 UTC (265 KB)
[v3] Thu, 2 Jul 2026 08:43:43 UTC (1,607 KB)
Full-text links:
Access Paper:
-
View a PDF of the paper titled Clinically Structured Rank-Gated LoRA for Cross-Benchmark Medical Question Answering, by Yining Huang
- View PDF
- HTML (experimental)
- TeX Source
view license
Current browse context:
cs.CL < prev | next >new | recent | 2026-06 Change to browse by: cs
References & Citations
export BibTeX citation Loading...BibTeX formatted citation
× Data provided by:Bookmark
Bibliographic Tools
Bibliographic and Citation Tools
Bibliographic Explorer Toggle Bibliographic Explorer (What is the Explorer?) Connected Papers Toggle Connected Papers (What is Connected Papers?) Litmaps Toggle Litmaps (What is Litmaps?) scite.ai Toggle scite Smart Citations (What are Smart Citations?) Code, Data, MediaCode, Data and Media Associated with this Article
alphaXiv Toggle alphaXiv (What is alphaXiv?) Links to Code Toggle CatalyzeX Code Finder for Papers (What is CatalyzeX?) DagsHub Toggle DagsHub (What is DagsHub?) GotitPub Toggle Gotit.pub (What is GotitPub?) Huggingface Toggle Hugging Face (What is Huggingface?) ScienceCast Toggle ScienceCast (What is ScienceCast?) DemosDemos
Replicate Toggle Replicate (What is Replicate?) Spaces Toggle Hugging Face Spaces (What is Spaces?) Spaces Toggle TXYZ.AI (What is TXYZ.AI?) Related PapersRecommenders and Search Tools
Link to Influence Flower Influence Flower (What are Influence Flowers?) Core recommender toggle CORE Recommender (What is CORE?) About arXivLabsarXivLabs: experimental projects with community collaborators
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)Related items
FeaturedDeepSeek V4 Doubles Token Share on OpenRouter, Driven by Agentic Workloads
DeepSeek V4 在 OpenRouter 上的代币份额翻倍，智能体工作负载成主要驱动力
The rapid adoption of DeepSeek V4 signals a strong market preference for high-performance, low-cost inference models, especially as agentic use cases reshape AI deployment.
91
FeaturedEnabling Two Settings Triples ARC-AGI-3 Benchmark Scores
启用两项设置使ARC-AGI-3基准测试分数提升三倍
This finding is crucial! It shows that model performance depends not only on training but also on inference-time configuration. For AI engineers and researchers, this is a must-know optimization direction. Teams deploying models on resource-constrained devices in particular could find a low-cost way to boost capabilities.
91
FeaturedGPT-5.6: Fusing Frontier Intelligence with Frontier Efficiency
GPT-5.6：前沿智能与前沿效率的融合
This news is worth watching as it marks a shift from pure parameter scaling to efficiency competition. For AI developers and business decision-makers, GPT-5.6 means higher performance at lower cost, especially for long-context or agentic tasks previously hindered by inference expenses. OpenAI's move may redefine what 'frontier' means.
91
FeaturedLFM2.5-Encoders: New Models for Fast Long-Context Inference on CPU
LFM2.5-Encoder：面向CPU快速长上下文推理的新模型
This blog post catches my eye because it directly solves the pain point of running long-context LLMs on CPU. For teams or individual developers without high-end GPUs, the LFM2.5-Encoder series offers a ready-to-use open-source solution. Highly recommended for those working on RAG, document search, or code analysis—now a standard server can handle million-token documents.
91
FeaturedGPT-Red: OpenAI Automates Red Teaming via Self-Play to Boost Model Robustness
GPT-Red：OpenAI通过自我对弈实现AI红队自动化，提升模型鲁棒性
GPT-Red marks a milestone from human to automated red-teaming—essential for safety engineers and alignment researchers. While reducing cost, it also raises ethical questions about automated attacks, worth pondering for everyone in AI governance.
91
FeaturedOpenAI Launches GPT-5.5 Bio Bug Bounty Program
OpenAI推出GPT-5.5生物漏洞赏金计划
This program deserves attention as it pioneers the extension of AI bug bounty to biosecurity, offering a new research direction for the security community and a practical training ground for AI risk governance. It is particularly important for model safety researchers, biosecurity experts, and practitioners concerned about dual-use AI risks.
91
FeaturedvLLM Introduces Native-Speed Transformers Modeling Backend for Enhanced Inference Performance
vLLM推出原生速度Transformers建模后端，大幅提升推理性能
This update is critical for AI engineering teams: eliminating format conversion speeds up model iteration, and 2-5x speedup directly reduces GPU costs. If you're building LLM online services or batch inference, this is practically a must-read technical update.
90
FeaturedGoogle DeepMind Introduces SL2T, a Sign Language-to-Text Model for Deaf Users
Google DeepMind 发布手语转文本模型 SL2T，助力聋人用户
This news matters not only as a technical breakthrough but also as a sign that AI is beginning to address the needs of marginalized groups. For developers, the architecture and technical approach of SL2T merit deep study; for accessibility advocates, it's a key case for advancing industry standards.