3 citations · 6 across the 22 of their papers we have counts for
18 papers · 1 filter
Unlearning Offline Stochastic Multi-Armed Bandits
Zichun Ye, Runqi Wang, Xuchuang Wang +3
Machine unlearning aims to unlearn data points from a learned model, offering a principled way to process data-deletion requests and mitigate privacy risks without full retraining.…
Online Learning to Rank under Corruption: A Robust Cascading Bandits Approach
Fatemeh Ghaffari, Siddarth Sitaraman, Xutong Liu +2
Online learning to rank (OLTR) studies how to recommend a short ranked list of items from a large pool and improves future rankings based on user clicks. This setting is commonly m…
Offline Clustering of Preference Learning with Active-data Augmentation
Jingyuan Liu, Fatemeh Ghaffari, Xuchuang Wang +3
Preference learning from pairwise feedback is a widely adopted framework in applications such as reinforcement learning with human feedback and recommendations. In many practical s…
Competitive Algorithms for Multi-Agent Ski-Rental Problems
Xuchuang Wang, Bo Sun, Hedyeh Beyhaghi +3
This paper introduces a novel multi-agent ski-rental problem that generalizes the classical ski-rental dilemma to a group setting where agents incur individual and shared costs. In…
Offline Clustering of Linear Bandits: The Power of Clusters under Limited Data
Jingyuan Liu, Zeyu Zhang, Xuchuang Wang +4
Contextual multi-armed bandit is a fundamental learning framework for making a sequence of decisions, e.g., advertising recommendations for a sequence of arriving users. Recent wor…
Fusing Reward and Dueling Feedback in Stochastic Bandits
Xuchuang Wang, Qirun Zeng, Jinhang Zuo +4
This paper investigates the fusion of absolute (reward) and relative (dueling) feedback in stochastic bandits, where both feedback types are gathered in each decision round. We der…