Saved in:
Bibliographic Details
Main Authors: Wang, Hanyin, Wu, Zhenbang, Kolar, Gururaj, Korsapati, Hariprasad, Bartlett, Brian, Hull, Bryan, Sun, Jimeng
Format: Preprint
Published: 2025
Subjects:
Online Access:https://arxiv.org/abs/2505.21908
Tags: Add Tag
No Tags, Be the first to tag this record!
_version_ 1866912647593590784
author Wang, Hanyin
Wu, Zhenbang
Kolar, Gururaj
Korsapati, Hariprasad
Bartlett, Brian
Hull, Bryan
Sun, Jimeng
author_facet Wang, Hanyin
Wu, Zhenbang
Kolar, Gururaj
Korsapati, Hariprasad
Bartlett, Brian
Hull, Bryan
Sun, Jimeng
contents Diagnosis-Related Group (DRG) codes are essential for hospital reimbursement and operations but require labor-intensive assignment. Large Language Models (LLMs) struggle with DRG coding due to the out-of-distribution (OOD) nature of the task: pretraining corpora rarely contain private clinical or billing data. We introduce DRG-Sapphire, which uses large-scale reinforcement learning (RL) for automated DRG coding from clinical notes. Built on Qwen2.5-7B and trained with Group Relative Policy Optimization (GRPO) using rule-based rewards, DRG-Sapphire introduces a series of RL enhancements to address domain-specific challenges not seen in previous mathematical tasks. Our model achieves state-of-the-art accuracy on the MIMIC-IV benchmark and generates physician-validated reasoning for DRG assignments, significantly enhancing explainability. Our study further sheds light on broader challenges of applying RL to knowledge-intensive, OOD tasks. We observe that RL performance scales approximately linearly with the logarithm of the number of supervised fine-tuning (SFT) examples, suggesting that RL effectiveness is fundamentally constrained by the domain knowledge encoded in the base model. For OOD tasks like DRG coding, strong RL performance requires sufficient knowledge infusion prior to RL. Consequently, scaling SFT may be more effective and computationally efficient than scaling RL alone for such tasks.
format Preprint
id arxiv_https___arxiv_org_abs_2505_21908
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Reinforcement Learning for Out-of-Distribution Reasoning in LLMs: An Empirical Study on Diagnosis-Related Group Coding
Wang, Hanyin
Wu, Zhenbang
Kolar, Gururaj
Korsapati, Hariprasad
Bartlett, Brian
Hull, Bryan
Sun, Jimeng
Machine Learning
Artificial Intelligence
Diagnosis-Related Group (DRG) codes are essential for hospital reimbursement and operations but require labor-intensive assignment. Large Language Models (LLMs) struggle with DRG coding due to the out-of-distribution (OOD) nature of the task: pretraining corpora rarely contain private clinical or billing data. We introduce DRG-Sapphire, which uses large-scale reinforcement learning (RL) for automated DRG coding from clinical notes. Built on Qwen2.5-7B and trained with Group Relative Policy Optimization (GRPO) using rule-based rewards, DRG-Sapphire introduces a series of RL enhancements to address domain-specific challenges not seen in previous mathematical tasks. Our model achieves state-of-the-art accuracy on the MIMIC-IV benchmark and generates physician-validated reasoning for DRG assignments, significantly enhancing explainability. Our study further sheds light on broader challenges of applying RL to knowledge-intensive, OOD tasks. We observe that RL performance scales approximately linearly with the logarithm of the number of supervised fine-tuning (SFT) examples, suggesting that RL effectiveness is fundamentally constrained by the domain knowledge encoded in the base model. For OOD tasks like DRG coding, strong RL performance requires sufficient knowledge infusion prior to RL. Consequently, scaling SFT may be more effective and computationally efficient than scaling RL alone for such tasks.
title Reinforcement Learning for Out-of-Distribution Reasoning in LLMs: An Empirical Study on Diagnosis-Related Group Coding
topic Machine Learning
Artificial Intelligence
url https://arxiv.org/abs/2505.21908