arXiv (All)
open access
Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare
Learning from human preference data is becoming a useful tool, from fine-tuning large language models to training reinforcement learning agents. However, in most scenarios, the model is trained on the average preference of all human evaluators, which, under large variations of preferences, can be un
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
- RMB: Reward Model Boosting Mitigates Reward Hacking#1117933
- When Maximum Nash Welfare Becomes Strongly Fair: Bi-valued Goods#1154745
- CheatBench: Measuring Reward Gaming in AI Agents#1131150
- Graph Structured Combinatorial Semi-Bandit with Nonlinear Reward Associations through Separable Signals#271827
- Provably Optimal Reinforcement Learning under Safety Filtering#1034680
Record · ID 973158
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