paper-with-me

Papers

Maximum-Entropy Regularized Decision Transformer with Reward Relabelling for Dynamic Recommendation

2024-06-02 · Xiaocong Chen, Siyu Wang, Lina Yao

Reinforcement learning-based recommender systems have recently gained popularity. However, due to the typical limitations of simulation environments (e.g., data inefficiency), most of the work cannot be broadly applied in all domains. To counter these challenges, recent advancements have leveraged offline reinforcement learning methods, notable for their data-driven approach utilizing offline datasets. A prominent example of this is the Decision Transformer. Despite its popularity, the Decision Transformer approach has inherent drawbacks, particularly evident in recommendation methods based on it. This paper identifies two key shortcomings in existing Decision Transformer-based methods: a lack of stitching capability and limited effectiveness in online adoption. In response, we introduce a novel methodology named Max-Entropy enhanced Decision Transformer with Reward Relabeling for Offline RLRS (EDT4Rec). Our approach begins with a max entropy perspective, leading to the development of a max entropy enhanced exploration strategy. This strategy is designed to facilitate more effective exploration in online environments. Additionally, to augment the model's capability to stitch sub-optimal trajectories, we incorporate a unique reward relabeling technique. To validate the effectiveness and superiority of EDT4Rec, we have conducted comprehensive experiments across six real-world offline datasets and in an online simulator.

📄 PDF Abstract BibTeX arXiv:2406.00725

Code (0)

등록된 구현이 없습니다.

Tasks

Recommendation Systemsreinforcement-learningReinforcement Learning

Methods 이 논문이 사용한 방법론

Softmax The Softmax output function transforms a previous layer's output into a vector of probabilities. It is commonly used for multiclass classification. Given an input vector $x$…
Layer Normalization Unlike batch normalization, Layer Normalization directly estimates the normalization statistics from the summed inputs…
Linear Layer A Linear Layer is a projection $\mathbf{XW + b}$.
BPE Byte Pair Encoding, or BPE, is a subword segmentation algorithm that encodes rare and unknown words as sequences of subword units. The intuition is that various word…
Label Smoothing Label Smoothing is a regularization technique that introduces noise for the labels. This accounts for the fact that datasets may have mistakes in them, so maximizing the…
Adam 설명 없음
Attention 설명 없음
Residual Connection 설명 없음

Similar Papers 제목 키워드 기반

Regularized Inverse Reinforcement Learning

2020-10-07 · ICLR 2021 1 · Wonseok Jeon, Chen-Yang Su, Paul Barde, Thang Doan 외

Inverse Reinforcement Learning (IRL) aims to facilitate a learner's ability to imitate expert behavior by acquiring reward functions that explain the expert's decisions. Regularized IRL applies strongly convex regularize…

reinforcement-learningReinforcement LearningReinforcement Learning (RL)

Optimal Rates of Convergence for Entropy Regularization in Discounted Markov Decision Processes

2024-06-06 · Johannes Müller, Semih Cayci

We study the error introduced by entropy regularization in infinite-horizon, discrete, discounted Markov decision processes. We show that this error decreases exponentially in the inverse regularization strength both in …

Policy Gradient Methods

Fast Rates for Maximum Entropy Exploration

2023-03-14 · Daniil Tiapkin, Denis Belomestny, Daniele Calandriello, Eric Moulines 외

We address the challenge of exploration in reinforcement learning (RL) when the agent operates in an unknown environment with sparse or no rewards. In this work, we study the maximum entropy exploration problem of two di…

Reinforcement Learning (RL)

A Relation Analysis of Markov Decision Process Frameworks

2020-08-18 · Tien Mai, Patrick Jaillet

We study the relation between different Markov Decision Process (MDP) frameworks in the machine learning and econometrics literatures, including the standard MDP, the entropy and general regularized MDP, and stochastic M…

Deep Reinforcement LearningEconometricsRelation

Maximum Entropy Exploration Without the Rollouts

2026-03-12 · Jacob Adamczyk, Adam Kamoski, Rahul V. Kulkarni arxiv

Efficient exploration remains a central challenge in reinforcement learning, serving as a useful pretraining objective for data collection, particularly when an external reward function is unavailable. A principled formu…

Reinforcement Learning