Reinforcement Learning with Conformal Action Sets: An Application to Sequential Recommendation
We propose Reinforcement Learning with Calibrated Pruning (RLCP), which adapts the retained action set using critic scores and an online threshold.
ProofPaper ↗
Key points
- Sequential recommenders typically use a fixed slate size even though the number of useful alternatives changes within a session.
- We prove a deterministic bound on the observed proxy miss rate along adaptive trajectories.
- To quantify the effect of pruning on reward, we derive an exact decomposition of value loss into filtering and selection losses.
- Under explicit proxy and critic approximation conditions, this decomposition yields a finite session reward bound that also accounts for imperfect selection and set truncation, without requiring the learning parameters to converge.
Sources (1)
- [1]Reinforcement Learning with Conformal Action Sets: An Application to Sequential RecommendationarXiv (AI, ML, NLP, CV, robotics, multi-agent) · Oct 6, 05:40 PM
We propose Reinforcement Learning with Calibrated Pruning (RLCP), which adapts the retained action set using critic scores and an online threshold.
Sequential recommenders typically use a fixed slate size even though the number of useful alternatives changes within a session.
Extractive summary: sentences quoted from the sources.