ResearchTrend.AI
Best-item Learning in Random Utility Models with Subset Choices

Best-item Learning in Random Utility Models with Subset Choices

Aadirupa Saha
Aditya Gopalan
ArXiv (abs)PDFHTML

Papers citing "Best-item Learning in Random Utility Models with Subset Choices"

6 / 6 papers shown
Title
DP-Dueling: Learning from Preference Feedback without Compromising User Privacy
DP-Dueling: Learning from Preference Feedback without Compromising User Privacy
Aadirupa Saha
Hilal Asi
81
1
0
22 Mar 2024
Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources
Think Before You Duel: Understanding Complexities of Preference Learning under Constrained Resources
Rohan Deb
Aadirupa Saha
67
0
0
28 Dec 2023
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits
ANACONDA: An Improved Dynamic Regret Algorithm for Adaptive Non-Stationary Dueling Bandits
Thomas Kleine Buening
Aadirupa Saha
72
7
0
25 Oct 2022
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits
Exploiting Correlation to Achieve Faster Learning Rates in Low-Rank Preference Bandits
Suprovat Ghoshal
Aadirupa Saha
63
12
0
23 Feb 2022
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability
Efficient and Optimal Algorithms for Contextual Dueling Bandits under Realizability
Aadirupa Saha
A. Krishnamurthy
105
38
0
24 Nov 2021
Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits
Optimal and Efficient Dynamic Regret Algorithms for Non-Stationary Dueling Bandits
Aadirupa Saha
Shubham Gupta
70
10
0
06 Nov 2021