Search Results for author:
Found 12 papers, 2 papers with code
Leave No One Behind: Online Self-Supervised Self-Distillation for Sequential Recommendation
Subsequently, we employ self-distillation to facilitate the transfer of knowledge from users with extensive behaviors (teachers) to users with limited behaviors (students).
Breaking the Barrier: Utilizing Large Language Models for Industrial Recommendation Systems through an Inferential Knowledge Graph
In summary, LLM-KERec addresses the limitations of traditional recommendation systems by incorporating complementary knowledge and utilizing a large language model to capture user intent transitions, adapt to new items, and enhance recommendation efficiency in the evolving e-commerce landscape.
Marketing Budget Allocation with Offline Constrained Deep Reinforcement Learning
We further show that this method is guaranteed to converge to the optimal policy, which cannot be achieved by previous value-based reinforcement learning methods for marketing budget allocation.
Model-free Reinforcement Learning with Stochastic Reward Stabilization for Recommender Systems
Model-free RL-based recommender systems have recently received increasing research attention due to their capability to handle partial feedback and long-term rewards.
Generalized Consistent Multi-Class Classification with Rejection to be Compatible with Arbitrary Losses
\emph{Classification with rejection} (CwR) refrains from making a prediction to avoid critical misclassification when encountering test samples that are difficult to classify.
Adversarial Learning for Incentive Optimization in Mobile Payment Marketing
This bias deteriorates the performance of the response model and misleads the linear programming process, dramatically degrading the performance of the resulting allocation policy.
Multi-Objective Online Learning
This paper presents a systematic study of multi-objective online learning.
A Policy Efficient Reduction Approach to Convex Constrained Deep Reinforcement Learning
To apply value-based methods to CRL, a recent groundbreaking line of game-theoretic approaches uses the mixed policy that randomizes among a set of carefully generated policies to converge to the desired constraint-satisfying policy.
Adaptive Optimizers with Sparse Group Lasso for Neural Networks in CTR Prediction
We develop a novel framework that adds the regularizers of the sparse group lasso to a family of adaptive optimizers in deep learning, such as Momentum, Adagrad, Adam, AMSGrad, AdaHessian, and create a new class of optimizers, which are named Group Momentum, Group Adagrad, Group Adam, Group AMSGrad and Group AdaHessian, etc., accordingly.
LinkLouvain: Link-Aware A/B Testing and Its Application on Online Marketing Campaign
In this paper, we analyze the network A/B testing problem under a real-world online marketing campaign, describe our proposed LinkLouvain method, and evaluate it on real-world data.
A Reduction Approach to Constrained Reinforcement Learning
In this paper, we present a reduction approach to find sparse policies that randomize among a constant number of policies for the constrained RL problem.
Robust Offline Reinforcement Learning from Low-Quality Data
We theoretically show that AdaPT produces a tight upper bound on the distributional deviation between the learned policy and the behavior policy, and this upper bound is the minimum requirement to guarantee policy improvement at each iteration.
