Benjamin Marlin, Satya Narayan
We lifted 3 functions out of this paper's own repositories and ran 2 of them in a sandbox. "Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results.
| Repository | Role | Ran |
|---|---|---|
| WenjieDu/PyPOTS | — | 1 of 2 |
| reml-lab/mTAN | — | 1 of 1 |
| Function | Status | Where it lives |
|---|---|---|
| AttentionLayer | Ran | WenjieDu/PyPOTS/pypots/nn/modules/imputeformer/attention.py code served (permissive licence) · get_code("9438feeabbc94e15") |
| multiTimeAttention | Ran | reml-lab/mTAN/src/models.py code served (permissive licence) · get_code("8c9eaaccf55340da") |
| ProjectedAttentionLayer | Not yet run | WenjieDu/PyPOTS/pypots/nn/modules/imputeformer/attention.py code served (permissive licence) · get_code("a1c5793b1853d444") |
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Irregular sampling occurs in many time series modeling applications where it presents a significant challenge to standard deep learning models. This work is motivated by the analysis of physiological time series data in electronic health records, which are sparse, irregularly sampled, and multivariate. In this paper, we propose a new deep learning framework for this setting that we call Multi-Time Attention Networks. Multi-Time Attention Networks learn an embedding of continuous time values and use an attention mechanism to produce a fixed-length representation of a time series containing a variable number of observations. We investigate the performance of this framework on interpolation and classification tasks using multiple datasets. Our results show that the proposed approach performs as well or better than a range of baseline and recently proposed models while offering significantly faster training times than current state-of-the-art methods. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2101.10318")
get_code_for_paper("2101.10318")
have("2101.10318")
Connect an agent — have() is free.