Hierarchical Semantic RL: Tackling the Problem of Dynamic Action Space for RL-based Recommendations

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Wang, Minmao, Liu, Xingchen, Yi, Shijie, Wu, Likang, Zhao, Hongke, Pan, Fei, Cai, Qingpeng, Jiang, Peng
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866912924965011456
author Wang, Minmao
Liu, Xingchen
Yi, Shijie
Wu, Likang
Zhao, Hongke
Pan, Fei
Cai, Qingpeng
Jiang, Peng
author_facet Wang, Minmao
Liu, Xingchen
Yi, Shijie
Wu, Likang
Zhao, Hongke
Pan, Fei
Cai, Qingpeng
Jiang, Peng
contents Recommender Systems (RS) are fundamental to modern online services. While most existing approaches optimize for short-term engagement, recent work has begun to explore reinforcement learning (RL) to model long-term user value. However, these efforts face significant challenges due to the vast, dynamic action spaces inherent in RS, which hinder stable policy learning. To resolve this bottleneck, we introduce Hierarchical Semantic RL (HSRL), which reframes RL-based recommendation over a fixed Semantic Action Space (SAS). HSRL encodes items as Semantic IDs (SIDs) for policy learning, and maps SIDs back to their original items via a fixed lookup during execution. To align decision-making with SID generation, the Hierarchical Policy Network (HPN) operates in a coarse-to-fine manner, employing hierarchical residual state modeling to refine each level's context from the previous level's residual, thereby reducing representation-decision mismatch. In parallel, a Multi-level Critic (MLC) provides token-level value estimates, enabling fine-grained credit assignment. Across public benchmarks and a large-scale production dataset from a leading short-video advertising platform, HSRL consistently surpasses state-of-the-art baselines. In online deployment over a 7-day A/B testing, it delivers an 18.421% ADVV lift and a 1.251% increase in Revenue, supporting HSRL as a scalable paradigm for RL-based recommendation.
format Preprint
id arxiv_https___arxiv_org_abs_2510_09167
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle Hierarchical Semantic RL: Tackling the Problem of Dynamic Action Space for RL-based Recommendations
Wang, Minmao
Liu, Xingchen
Yi, Shijie
Wu, Likang
Zhao, Hongke
Pan, Fei
Cai, Qingpeng
Jiang, Peng
Information Retrieval
Recommender Systems (RS) are fundamental to modern online services. While most existing approaches optimize for short-term engagement, recent work has begun to explore reinforcement learning (RL) to model long-term user value. However, these efforts face significant challenges due to the vast, dynamic action spaces inherent in RS, which hinder stable policy learning. To resolve this bottleneck, we introduce Hierarchical Semantic RL (HSRL), which reframes RL-based recommendation over a fixed Semantic Action Space (SAS). HSRL encodes items as Semantic IDs (SIDs) for policy learning, and maps SIDs back to their original items via a fixed lookup during execution. To align decision-making with SID generation, the Hierarchical Policy Network (HPN) operates in a coarse-to-fine manner, employing hierarchical residual state modeling to refine each level's context from the previous level's residual, thereby reducing representation-decision mismatch. In parallel, a Multi-level Critic (MLC) provides token-level value estimates, enabling fine-grained credit assignment. Across public benchmarks and a large-scale production dataset from a leading short-video advertising platform, HSRL consistently surpasses state-of-the-art baselines. In online deployment over a 7-day A/B testing, it delivers an 18.421% ADVV lift and a 1.251% increase in Revenue, supporting HSRL as a scalable paradigm for RL-based recommendation.
title Hierarchical Semantic RL: Tackling the Problem of Dynamic Action Space for RL-based Recommendations
topic Information Retrieval
url https://arxiv.org/abs/2510.09167