Papers › Dynamic Evaluation of Neural Sequence Models

Dynamic Evaluation of Neural Sequence Models

21 Sep 2017ICML 2018 7arXiv:1709.07432archive 2025-07-28

Ben Krause, Emmanuel Kahembwe, Iain Murray, Steve Renals

We present methodology for using dynamic evaluation to improve neural sequence models. Models are adapted to recent history via a gradient descent based mechanism, causing them to assign higher probabilities to re-occurring sequential patterns. Dynamic evaluation outperforms existing adaptation approaches in our comparisons. Dynamic evaluation improves the state-of-the-art word-level perplexities on the Penn Treebank and WikiText-2 datasets to 51.1 and 44.3 respectively, and the state-of-the-art character-level cross-entropies on the text8 and Hutter Prize datasets to 1.19 bits/char and 1.08 bits/char respectively.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1709.07432")

Code

Syntology Ran 0 of 1 code samples harvested from 1 repository linked to this paper; 1 has no recorded run.

By repository: official repository: 1 sample from 1 repository, 0 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

benkrause/dynamic-evaluation officialmentioned in papermentioned on GitHubpytorch report
sacmehta/PRU mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

1 sample harvested; 0 ran; 0 honoured the contract we drafted; 1 has no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

1unverified

Licence: 0 of the 1 sample are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from benkrause/dynamic-evaluation. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

repackage_hidden benkrause/dynamic-evaluation/dynamiceval.py official repository unverified BSD-2-Clause (permissive) · d98e69125467f2f0 · report

Tasks

Language Modelling

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Language Modelling Hutter Prize mLSTM + dynamic eval Bit per Character (BPC) 1.08 #10 of 18 Archive leaderboard report
Language Modelling Hutter Prize mLSTM + dynamic eval Number of params 46M #10 of 18 Archive leaderboard report
Language Modelling Penn Treebank (Word Level) AWD-LSTM + dynamic eval Params 24M #14 of 43 Archive leaderboard report
Language Modelling Penn Treebank (Word Level) AWD-LSTM + dynamic eval Test perplexity 51.1 #14 of 43 Archive leaderboard report
Language Modelling Penn Treebank (Word Level) AWD-LSTM + dynamic eval Validation perplexity 51.6 #14 of 43 Archive leaderboard report
Language Modelling Text8 mLSTM + dynamic eval Bit per Character (BPC) 1.19 #15 of 24 Archive leaderboard report
Language Modelling Text8 mLSTM + dynamic eval Number of params 45M #15 of 24 Archive leaderboard report
Language Modelling WikiText-2 AWD-LSTM + dynamic eval Number of params 33M #18 of 38 Archive leaderboard report
Language Modelling WikiText-2 AWD-LSTM + dynamic eval Test perplexity 44.3 #18 of 38 Archive leaderboard report
Language Modelling WikiText-2 AWD-LSTM + dynamic eval Validation perplexity 46.4 #18 of 38 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections