activity
20172024
most citedComparison-based Conversational Recommender System with Relative Bandit Feedback

40 citations · 180 across the 31 of their papers we have counts for

collaborators
Showing 2023Show all

11 papers · 1 filter

cs.LG2023

DPMAC: Differentially Private Communication for Cooperative Multi-Agent Reinforcement Learning

Canzhe Zhao, Yanjie Ze, Jing Dong +2

Communication lays the foundation for cooperation in human society and in multi-agent reinforcement learning (MARL). Humans also desire to maintain their privacy when communicating…

cs.IR2023

Disentangled Counterfactual Reasoning for Unbiased Sequential Recommendation

Yi Ren, Xu Zhao, Hongyan Tang +1

Sequential recommender systems have achieved state-of-the-art recommendation performance by modeling the sequential dynamics of user activities. However, in most recommendation sce…

cs.LG2023

Player-optimal Stable Regret for Bandit Learning in Matching Markets

Fang Kong, Shuai Li

The problem of matching markets has been studied for a long time in the literature due to its wide range of applications. Finding a stable matching is a common equilibrium objectiv…

cs.CL2023★ 4 cited

InfoPrompt: Information-Theoretic Soft Prompt Tuning for Natural Language Understanding

Junda Wu, Tong Yu, Rui Wang +6

Soft prompt tuning achieves superior performances across a wide range of few-shot tasks. However, the performances of prompt tuning can be highly sensitive to the initialization of…

cs.LG2023

Adversarial Attacks on Online Learning to Rank with Click Feedback

Jinhang Zuo, Zhiyao Zhang, Zhiyong Wang +3

Online learning to rank (OLTR) is a sequential decision-making problem where a learning agent selects an ordered list of items and receives feedback through user clicks. Although p…

cs.LG2023★ 2 cited

Future-conditioned Unsupervised Pretraining for Decision Transformer

Zhihui Xie, Zichuan Lin, Deheng Ye +3

Recent research in offline reinforcement learning (RL) has demonstrated that return-conditioned supervised learning is a powerful paradigm for decision-making problems. While promi…

cs.SI2023★ 1 cited

Online Influence Maximization under Decreasing Cascade Model

Fang Kong, Jize Xie, Baoxiang Wang +2

We study online influence maximization (OIM) under a new model of decreasing cascade (DC). This model is a generalization of the independent cascade (IC) model by considering the c…

cs.CL2023★ 2 cited

The Closeness of In-Context Learning and Weight Shifting for Softmax Regression

Shuai Li, Zhao Song, Yu Xia +2

Large language models (LLMs) are known for their exceptional performance in natural language processing, making them highly effective in many human life-related or even job-related…

cs.LG2023

Best-of-three-worlds Analysis for Linear Bandits with Follow-the-regularized-leader Algorithm

Fang Kong, Canzhe Zhao, Shuai Li

The linear bandit problem has been studied for many years in both stochastic and adversarial settings. Designing an algorithm that can optimize the environment without knowing the…

cs.LG2023

Efficient Explorative Key-term Selection Strategies for Conversational Contextual Bandits

Zhiyong Wang, Xutong Liu, Shuai Li +1

Conversational contextual bandits elicit user preferences by occasionally querying for explicit feedback on key-terms to accelerate learning. However, there are aspects of existing…

cs.LG2023

Improved Regret Bounds for Linear Adversarial MDPs via Linear Optimization

Fang Kong, Xiangcheng Zhang, Baoxiang Wang +1

Learning Markov decision processes (MDP) in an adversarial environment has been a challenging problem. The problem becomes even more challenging with function approximation, since…