The reviewed record of science sign in
Pith

arxiv: 2003.10925 · v1 · pith:IFKGFBYR · submitted 2020-03-24 · cs.CV · cs.CL

Learning Compact Reward for Image Captioning

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:IFKGFBYRrecord.jsonopen to challenge →

classification cs.CV cs.CL
keywords rewardadversarialcaptioningimagelearningambiguitycompactdescriptions
0
0 comments X
read the original abstract

Adversarial learning has shown its advances in generating natural and diverse descriptions in image captioning. However, the learned reward of existing adversarial methods is vague and ill-defined due to the reward ambiguity problem. In this paper, we propose a refined Adversarial Inverse Reinforcement Learning (rAIRL) method to handle the reward ambiguity problem by disentangling reward for each word in a sentence, as well as achieve stable adversarial training by refining the loss function to shift the generator towards Nash equilibrium. In addition, we introduce a conditional term in the loss function to mitigate mode collapse and to increase the diversity of the generated descriptions. Our experiments on MS COCO and Flickr30K show that our method can learn compact reward for image captioning.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.