Model overview
The Generalizable Reward Model (GRM) aims to enhance the generalization ability of reward models for LLMs through regularizing the hidden states. The framework is shown above. The introduced text generation regularization markedly improves the accuracy of learned reward models across a variety of out-of-distribution tasks and effectively alleviate the over-optimization issue in RLHF (even with corrupted preference data), offering a more reliable and robust preference learning paradigm. This reward model is finetuned from gemma-2b-it using the weqweasdas/preference_dataset_mixture2_and_safe_pku dataset.
Key features
特点摘要待依据来源补齐，不凭模型名称推断能力。
Limitations & considerations
Sources are insufficient to establish specific limitations. Verify task performance, latency, data policies, licensing and version lifecycle.
Source prices & cost analysis
Prices vary by channel, region and configuration. Channel quotes are listed independently and are not treated as a single official provider price.
| Source / channel | Input | Output | Billing unit | Collected at |
|---|---|---|---|---|
| No verified prices yet. Check the source channel. | ||||
Estimate monthly base token costs
Estimates exclude cache discounts, tiered pricing, multimodal surcharges, web search, taxes and additional reasoning output.
Public benchmarks & run configuration
暂无已采集的可核验公开评分。模型未上榜不代表能力较低。
View full indexed rankings →Frequently asked questions
Do open weights permit free commercial use?
Not necessarily. Check the version license, commercial conditions and usage policies. Self-hosting incurs compute and maintenance costs.
Are these real-time billing prices?
These are timestamped source snapshots, not live billing prices. Check the channel for current versions, regions, discounts and billing methods.
Sources & traceability
许可证：mit。模型介绍与第三方评测均以原来源的具体版本和方法为准。