arXiv (All)
open access
Efficient Exploration for Iterative Nash Preference Optimization
Preference alignment is central to improving large language models (LLMs), but reward-based formulations can be restrictive when human preferences are non-transitive. Nash learning from human feedback (NLHF) addresses this limitation by modeling alignment as a preference game and seeking a Nash equi
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
- Learning Ordinal Probabilistic Reward from Preferences#1326204
- Consistency Without Alignment: Item-Sensitive Language Models Indistinguishable From Random#820011
- To Go Far, Go Together: Diverse Preferences Induce a Curriculum for Reward Optimization#467154
- Evaluating the Capabilities of LLMs for Persuasive Dialogue#798369
- Evaluating the Capabilities of LLMs for Persuasive Dialogue#796956
Record · ID 1187426
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