Pith. sign in

REVIEW 3 cited by

A Simple and Effective Approach to the Story Cloze Test

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 1803.05547 v1 pith:2AKWNVZ5 submitted 2018-03-15 cs.CL

classification cs.CL
keywords storyapproachtestclozeprompttrainingaccuracyendings
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

In the Story Cloze Test, a system is presented with a 4-sentence prompt to a story, and must determine which one of two potential endings is the 'right' ending to the story. Previous work has shown that ignoring the training set and training a model on the validation set can achieve high accuracy on this task due to stylistic differences between the story endings in the training set and validation and test sets. Following this approach, we present a simpler fully-neural approach to the Story Cloze Test using skip-thought embeddings of the stories in a feed-forward network that achieves close to state-of-the-art performance on this task without any feature engineering. We also find that considering just the last sentence of the prompt instead of the whole prompt yields higher accuracy with our approach.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. On saturated triangulation-free convex geometric graphs

    math.CO 2025-08 unverdicted novelty 8.0 of 10

    Saturated triangulation-free convex geometric graphs can have as few as O(n log n) edges, and every edge count from that bound up to the maximum is achievable.

  2. MesaNet: Sequence Modeling by Locally Optimal Test-Time Training

    cs.LG 2025-06 conditional novelty 7.0 of 10

    MesaNet uses conjugate-gradient-optimal test-time regression in a chunkwise-parallelizable recurrent layer, achieving strong language modeling and benchmark performance at up to 1B scale.

  3. Reinforcement Learning with Rubric Anchors

    cs.AI 2025-08 unverdicted novelty 6.0 of 10

    Rubric-based rewards extend reinforcement learning to open-ended text generation, yielding a 30B model that outperforms a 671B model on humanities-style benchmarks.

Pith tools