arXiv (All)
open access
Learning Ordinal Probabilistic Reward from Preferences
Reward models are crucial for aligning large language models (LLMs) with human values and intentions. Existing approaches follow either Generative (GRMs) or Discriminative (DRMs) paradigms, yet both suffer from limitations: GRMs typically demand costly point-wise supervision, while DRMs produce unca
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
- EnGRICH: Enhancing Generative Reward Modeling with Critiques from Humans#1201383
- Understanding Helpfulness and Harmless Tension in Reward Models#1342526
- Exploring More, Reasoning Better: Stepwise Risk-Sensitive GRPO for Diffusion Language Models#1155596
- Tail Competition Explains Scaling in Best-of-N Sampling for Verifiable Problems#1345185
- Next-token Preference: Scaling Unsupervised Reward Modeling#1328397
Record · ID 1326204
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