Pith. sign in

REVIEW

Adaptive Correlated Monte Carlo for Contextual Categorical Sequence Generation

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1912.13151 v2 pith:7IKQDUZ7 submitted 2019-12-31 stat.ML cs.LG

classification stat.MLcs.LG
keywords generationgradientrolloutsvariancecategoricalcorrelatedsequenceadaptive
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Sequence generation models are commonly refined with reinforcement learning over user-defined metrics. However, high gradient variance hinders the practical use of this method. To stabilize this method, we adapt to contextual generation of categorical sequences a policy gradient estimator, which evaluates a set of correlated Monte Carlo (MC) rollouts for variance control. Due to the correlation, the number of unique rollouts is random and adaptive to model uncertainty; those rollouts naturally become baselines for each other, and hence are combined to effectively reduce gradient variance. We also demonstrate the use of correlated MC rollouts for binary-tree softmax models, which reduce the high generation cost in large vocabulary scenarios by decomposing each categorical action into a sequence of binary actions. We evaluate our methods on both neural program synthesis and image captioning. The proposed methods yield lower gradient variance and consistent improvement over related baselines.

Discussion (0). Continue with ORCID to comment.

Pith tools