arXiv (All)
open access
Learning a Ranking from Human Feedback in Log-Concave Random Utility Models
We study the problem of recovering the ranking of a fixed set of items according to their unknown numerical utilities. At each interaction with the environment, a learner presents the item set to a human and receives comparative feedback of two types. Under full-ranking feedback, each interaction re
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
- Best-of-Both Worlds for linear contextual bandits with paid observations#986160
- Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models#652164
- Efficient Inference for Inverse Reinforcement Learning and Dynamic Discrete Choice Models#650711
- EARL: Exposure- and Allocation-Reweighted Linear Estimator for Bipartite Experiments with Partial Assignment#1105580
- A proximal gradient algorithm for composite log-concave sampling#178871
Record · ID 1217708
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