Active Ranking with Subset-wise Preferences

v1v2 (latest)

Active Ranking with Subset-wise Preferences

23 October 2018

ArXiv (abs)PDF HTML

Papers citing "Active Ranking with Subset-wise Preferences"

10 / 10 papers shown

Title
Learning an Optimal Assortment Policy under Observational Data Yuxuan Han Han Zhong Miao Lu Jose H. Blanchet Zhengyuan Zhou OffRL 122 0 0 10 Feb 2025
Online Clustering of Dueling Bandits Zhiyong Wang Jiahang Sun Mingze Kong Jize Xie Qinghua Hu J. C. Lui Zhongxiang Dai 124 0 0 04 Feb 2025
Neural Dueling Bandits: Preference-Based Optimization with Human Feedback Arun Verma Zhongxiang Dai Xiaoqiang Lin Patrick Jaillet K. H. Low 191 6 0 24 Jul 2024
The Power of Active Multi-Task Learning in Reinforcement Learning from Human Feedback Ruitao Chen Liwei Wang 140 1 0 18 May 2024
Versatile Dueling Bandits: Best-of-both-World Analyses for Online Learning from Preferences Aadirupa Saha Pierre Gaillard 75 7 0 14 Feb 2022
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability Aadirupa Saha A. Krishnamurthy 105 38 0 24 Nov 2021
Dueling RL: Reinforcement Learning with Trajectory Preferences Aldo Pacchiano Aadirupa Saha Jonathan Lee 110 90 0 08 Nov 2021
Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits Aadirupa Saha Shubham Gupta 68 10 0 06 Nov 2021
Best-item Learning in Random Utility Models with Subset Choices Aadirupa Saha Aditya Gopalan 42 8 0 19 Feb 2020
Online Preselection with Context Information under the Plackett-Luce Model Adil El Mesaoudi-Paul Viktor Bengs Eyke Hüllermeier 51 4 0 11 Feb 2020