arXiv (All)
open access
GroupDPO: Memory-Efficient Group-Wise Direct Preference Optimization
Preference optimization is widely used to align Large Language Models (LLMs) with preference feedback. However, most existing methods train on a single positive-negative pair per prompt, discarding additional supervision available in preference datasets that typically contain multiple candidate resp
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
- MOSCOPT: Mixture-of-Skills Collective Optimization for LLM Agents#1035610
- Aggregating extended preferences#83125
- Rewarding Novel Deductions: Solver-guided Process Rewards for Logical Reasoning#1128919
- FreqBLiMP: Frequency-Controlled Minimal Pairs Reveal Robustness and Fragility of LLMs Under Lexical Rarity#975210
- SKIP: a Self-knowledge-guided Step-wise Preference Learning Framework for Concise Reasoning#1123424
Record · ID 821839
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