Search Results for author:
Found 5 papers, 1 papers with code
Bandit Learning to Rank with Position-Based Click Models: Personalized and Equal Treatments
Online learning to rank (ONL2R) is a foundational problem for recommender systems and has received increasing attention in recent years.
AdaSelection: Accelerating Deep Learning Training through Data Subsampling
In this paper, we introduce AdaSelection, an adaptive sub-sampling method to identify the most informative sub-samples within each minibatch to speed up the training of large-scale deep learning models without sacrificing model performance.
SLPerf: a Unified Framework for Benchmarking Split Learning
Data privacy concerns has made centralized training of data, which is scattered across silos, infeasible, leading to the need for collaborative learning frameworks.
Bandit Learning with Joint Effect of Incentivized Sampling, Delayed Sampling Feedback, and Self-Reinforcing User Preferences
We show that the delay impacts in both cases can still be upper bounded by an additive penalty on both the regret and total incentive costs.
Incentivized Bandit Learning with Self-Reinforcing User Preferences
In this paper, we investigate a new multi-armed bandit (MAB) online learning model that considers real-world phenomena in many recommender systems: (i) the learning agent cannot pull the arms by itself and thus has to offer rewards to users to incentivize arm-pulling indirectly; and (ii) if users with specific arm preferences are well rewarded, they induce a "self-reinforcing" effect in the sense that they will attract more users of similar arm preferences.
