Papers › BRITS: Bidirectional Recurrent Imputation for Time Series

BRITS: Bidirectional Recurrent Imputation for Time Series

27 May 2018NeurIPS 2018 12arXiv:1805.10572archive 2025-07-28

Wei Cao, Dong Wang, Jian Li, Hao Zhou, Lei LI, Yitan Li

Time series are widely used as signals in many classification/regression tasks. It is ubiquitous that time series contains many missing values. Given multiple correlated time series data, how to fill in missing values and to predict their class labels? Existing imputation methods often impose strong assumptions of the underlying data generating process, such as linear dynamics in the state space. In this paper, we propose BRITS, a novel method based on recurrent neural networks for missing value imputation in time series data. Our proposed method directly learns the missing values in a bidirectional recurrent dynamical system, without any specific assumption. The imputed values are treated as variables of RNN graph and can be effectively updated during the backpropagation.BRITS has three advantages: (a) it can handle multiple correlated missing values in time series; (b) it generalizes to time series with nonlinear dynamics underlying; (c) it provides a data-driven imputation procedure and applies to general settings with missing data.We evaluate our model on three real-world datasets, including an air quality dataset, a health-care data, and a localization data for human activity. Experiments show that our model outperforms the state-of-the-art methods in both imputation and classification/regression accuracies.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

No sample from the archive's official repository (WenjieDu/PyPOTS) is linked to this paper; the 4 samples below come from 2 repositories the archive does not mark official. Syntology harvested code from WenjieDu/PyPOTS for 8 other papers.

WenjieDu/PyPOTS: Syntology's graph links these samples to Attention Is All You Need (arXiv:1706.03762; that paper's own run record: 610 ran (of which 293 constructed an object rather than computing a result; 529 with no instrument failure: 45 honoured, 15 violated, 469 with no contract checked; 81 where Syntology's instrument failed) · 336 unverified), Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting (arXiv:2012.07436; that paper's own run record: 62 ran (of which 53 constructed an object rather than computing a result; 62 with no instrument failure: 0 honoured, 1 violated, 61 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified), Multi-Time Attention Networks for Irregularly Sampled Time Series (arXiv:2101.10318; that paper's own run record: 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified) and 5 more (every one in this page's JSON twin); nothing checks that they implement this paper's method.

Syntology 4 code samples harvested from 2 repositories linked to this paper: 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. Where Syntology's instrument failed: 1 where the contract check could not run; failures of Syntology's instrument, not of the code.

By repository: named in the paper: 3 samples from 1 repository, 2 ran (1 with no instrument failure; 1 where Syntology's instrument failed); community (archive-listed): 1 sample from 1 repository, 0 ran (0 with no instrument failure; 0 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

No sample is linked to this paper from 2 of its repositories that Syntology harvested for other papers:

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

WenjieDu/PyPOTS officialpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Attention Is All You Need (arXiv:1706.03762; that paper's own run record: 610 ran (of which 293 constructed an object rather than computing a result; 529 with no instrument failure: 45 honoured, 15 violated, 469 with no contract checked; 81 where Syntology's instrument failed) · 336 unverified), Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting (arXiv:2012.07436; that paper's own run record: 62 ran (of which 53 constructed an object rather than computing a result; 62 with no instrument failure: 0 honoured, 1 violated, 61 with no contract checked; 0 where Syntology's instrument failed) · 14 unverified), Multi-Time Attention Networks for Irregularly Sampled Time Series (arXiv:2101.10318; that paper's own run record: 2 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified) and 5 more (every one in this page's JSON twin); nothing checks that they implement this paper's method. report
NIPS-BRITS/BRITS mentioned in paperpytorchSyntology: not harvested report
caow13/BRITS mentioned in paperpytorchSyntology: 3 samples, 2 ran (1 instrument-failed) · 1 unverified report
flaviagiammarino/brits-tensorflow mentioned on GitHubtfMITSyntology: 1 sample, 0 ran · 1 unverified report
WenjieDu/SAITS pytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to SAITS: Self-Attention-based Imputation for Time Series (arXiv:2202.08516; that paper's own run record: 5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

4 samples harvested: 2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is not when the samples ran.

1ran · honoured contract
1ran; the contract check could not run
2unverified

Licence: 0 of the 4 samples 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 2 repositories linked to this paper, official or community; the list below is grouped by repository, each group headed by its name and what it is to the paper. “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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity.

caow13/BRITS named in the paper 3 samples, 2 ran (1 instrument-failed) · 1 unverified
parse_delta input_process.py ran; the contract check could not run (RAISES) · metamorphic tier: invariant MIT (permissive) · f63ba35d466f3c1f · report fixture: signature masks:ndarray/2/float, dir_:str/0/str · returned ndarray · level recorded 2026-09-22
to_time_bin input_process.py ran · honoured contract MIT (permissive) · 310bad2b2b34385d · report fixture: signature x:str/0/str · returned int · level recorded 2026-09-22
parse_data in 16 papers input_process.py unverified MIT (permissive) · 1f69d0fb9551471c · report
flaviagiammarino/brits-tensorflow community (archive-listed) 1 sample, 0 ran · 1 unverified
get_inputs in 14 papers brits_tensorflow/utils.py unverified MIT (permissive) · 09da6e3827e4f7db · report

Tasks

General ClassificationImputationMissing ValuesMultivariate Time Series ForecastingMultivariate Time Series ImputationTime SeriesTime Series AnalysisTraffic Data Imputationregression

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Multivariate Time Series Forecasting USHCN-Daily BRITS MSE 0.53 #4 of 8 Archive leaderboard report
Multivariate Time Series Imputation Basketball Players Movement BRITS (SingleRes) OOB Rate (10^−3) 3.874 #2 of 5 Archive leaderboard report
Multivariate Time Series Imputation Basketball Players Movement BRITS (SingleRes) Path Difference 0.571 #2 of 5 Archive leaderboard report
Multivariate Time Series Imputation Basketball Players Movement BRITS (SingleRes) Path Length 0.702 #2 of 5 Archive leaderboard report
Multivariate Time Series Imputation Basketball Players Movement BRITS (SingleRes) Player Distance 0.417 #2 of 5 Archive leaderboard report
Multivariate Time Series Imputation Basketball Players Movement BRITS (SingleRes) Step Change (10^−3) 4.811 #2 of 5 Archive leaderboard report
Multivariate Time Series Imputation Beijing Multi-Site Air-Quality Dataset BRITS MAE (PM2.5) 11.56 #2 of 6 Archive leaderboard report
Multivariate Time Series Imputation PEMS-SF BRITS (SingleRes) L2 Loss (10^-4) 4.51 #2 of 5 Archive leaderboard report
Multivariate Time Series Imputation PhysioNet Challenge 2012 BRITS MAE (10% of data as GT) 0.281 #2 of 9 Archive leaderboard report
Multivariate Time Series Imputation UCI localization data BRITS MAE (10% missing) 0.219 #1 of 5 Archive leaderboard report
Traffic Data Imputation METR-LA Point Missing BRITS MAE 2.34 #2 of 2 Archive leaderboard report
Traffic Data Imputation PEMS-BAY Point Missing BRITS MAE 1.47 #2 of 2 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