arXiv (All)
open access
Range-GRPO: Policy Optimization via Pairwise Relations among Reward Intervals
As the use of large language models (LLMs) expands, post-training has become increasingly important for adapting them to downstream tasks. However, obtaining reliable supervision remains costly, especially in domains without reference answers or executable verifiers. LLM-as-a-Judge provides scalable
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Multi-module GRPO: Composing Policy Gradients and Prompt Optimization for Language Model Programs#130775
- NLPG: Natural-Language Policy Gradients for Self-Evolving Language Agents#1118091
- IndustryLLM: Failure-Driven LLM Training for Industrial Procurement#1115827
- MLREF: Efficient Module Reuse for Reward Design in Reinforcement Learning via Large Language Models#467145
- The Vector Grounding Problem#111010
Record · ID 1156820
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive