Cold-Start Reinforcement Learning with Softmax Policy Gradient
Nan Ding, Radu Soricut

TL;DR
This paper introduces a novel reinforcement learning method using a softmax value function that eliminates the need for warm-start training and variance reduction, improving efficiency in sequence generation tasks.
Contribution
It presents a new cold-start reinforcement learning approach combining policy-gradient benefits with maximum-likelihood simplicity, validated on summarization and captioning tasks.
Findings
Effective in automatic summarization
Improves image captioning performance
Reduces training overhead
Abstract
Policy-gradient approaches to reinforcement learning have two common and undesirable overhead procedures, namely warm-start training and sample variance reduction. In this paper, we describe a reinforcement learning method based on a softmax value function that requires neither of these procedures. Our method combines the advantages of policy-gradient methods with the efficiency and simplicity of maximum-likelihood approaches. We apply this new cold-start reinforcement learning method in training sequence generation models for structured output prediction problems. Empirical evidence validates this method on automatic summarization and image captioning tasks.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Code & Models
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMultimodal Machine Learning Applications · Reinforcement Learning in Robotics · Domain Adaptation and Few-Shot Learning
MethodsSoftmax
