{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/task/time-series/papers/ran/3","list_of":"/task/time-series","task":"Time Series Analysis","archive":{"snapshot":"2025-07-28"},"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"ran","order_definition":"only papers where Syntology ran at least one harvested sample; date (newest first), ties by arXiv id","caption":"We ran code from the paper's repository; we did not run it on this task or check it against the task's benchmarks.","absence":"A paper missing from this list is not a recorded non-run: it may have no arXiv id, no harvested code, or only samples that have not run yet.","page":3,"pages_in_order":4,"rows_per_page":100,"rows":[201,300],"of":383,"counts":{"archive_papers_tagged":6748,"with_a_code_link":1993,"where_syntology_ran_a_sample":383,"not_listed_spam_title":0,"listed":6748,"listed_where_code_ran":383,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":327,"every_run_a_failure_of_syntologys_instrument":56,"listed_with_a_run_with_no_instrument_failure":327,"listed_every_run_a_failure_of_syntologys_instrument":56,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"first_page":"/task/time-series/papers/ran/1","prev":"/task/time-series/papers/ran/2","next":"/task/time-series/papers/ran/4","papers":[{"url":"/paper/learning-timestamp-level-representations-for","slug":"learning-timestamp-level-representations-for","title":"TS2Vec: Towards Universal Representation of Time Series","date":"2021-06-19","arxiv_id":"2106.10466","repositories_listed":4,"syntology":{"n":23,"n_ran":15,"n_constructed":0,"n_ran_checked":7,"n_instrument":8,"n_unverified":8,"n_honours":0,"n_violates":2,"n_no_contract":5,"n_pointer_only":6,"phrase":"15 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 2 violated, 5 with no contract checked; 8 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/learning-timestamp-level-representations-for#ran","syntology_url":"https://syntology.ai/paper/2106.10466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10466"}},"official":{"repos":["zhihanyue/ts2vec"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":5,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/on-contrastive-representations-of-stochastic","slug":"on-contrastive-representations-of-stochastic","title":"On Contrastive Representations of Stochastic Processes","date":"2021-06-18","arxiv_id":"2106.10052","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/on-contrastive-representations-of-stochastic#ran","syntology_url":"https://syntology.ai/paper/2106.10052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10052"}},"official":{"repos":["ae-foster/cresp"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/voice2series-reprogramming-acoustic-models","slug":"voice2series-reprogramming-acoustic-models","title":"Voice2Series: Reprogramming Acoustic Models for Time Series Classification","date":"2021-06-17","arxiv_id":"2106.09296","repositories_listed":3,"syntology":{"n":7,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":3,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/voice2series-reprogramming-acoustic-models#ran","syntology_url":"https://syntology.ai/paper/2106.09296","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09296"}},"official":{"repos":["huckiyang/Voice2Series-Reprogramming"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/time-series-is-a-special-sequence-forecasting","slug":"time-series-is-a-special-sequence-forecasting","title":"SCINet: Time Series Modeling and Forecasting with Sample Convolution and Interaction","date":"2021-06-17","arxiv_id":"2106.09305","repositories_listed":6,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/time-series-is-a-special-sequence-forecasting#ran","syntology_url":"https://syntology.ai/paper/2106.09305","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09305"}},"official":{"repos":["WenjieDu/PyPOTS"],"state":"official: no sample here; runs from other or unrecorded repositories","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed","named_in_paper"]}}},{"url":"/paper/disentangling-identifiable-features-from","slug":"disentangling-identifiable-features-from","title":"Disentangling Identifiable Features from Noisy Data with Structured Nonlinear ICA","date":"2021-06-17","arxiv_id":"2106.09620","repositories_listed":1,"syntology":{"n":40,"n_ran":23,"n_constructed":0,"n_ran_checked":5,"n_instrument":18,"n_unverified":17,"n_honours":4,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 4 honoured, 1 violated, 0 with no contract checked; 18 where Syntology's instrument failed) · 17 unverified","sample_list":"/paper/disentangling-identifiable-features-from#ran","syntology_url":"https://syntology.ai/paper/2106.09620","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.09620"}},"official":{"repos":["HHalva/snica"],"state":"official (archive's flag): 23 ran","n_ran":23,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":17,"ran_from_kinds":["official"]}}},{"url":"/paper/time-series-anomaly-detection-for-cyber","slug":"time-series-anomaly-detection-for-cyber","title":"Time Series Anomaly Detection for Cyber-Physical Systems via Neural System Identification and Bayesian Filtering","date":"2021-06-15","arxiv_id":"2106.07992","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/time-series-anomaly-detection-for-cyber#ran","syntology_url":"https://syntology.ai/paper/2106.07992","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07992"}},"official":{"repos":["NSIBF/NSIBF"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/next-generation-reservoir-computing","slug":"next-generation-reservoir-computing","title":"Next Generation Reservoir Computing","date":"2021-06-14","arxiv_id":"2106.07688","repositories_listed":1,"syntology":{"n":8,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/next-generation-reservoir-computing#ran","syntology_url":"https://syntology.ai/paper/2106.07688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.07688"}},"official":{"repos":["quantinfo/ng-rc-paper-code"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-neural-network-based-anomaly-detection","slug":"graph-neural-network-based-anomaly-detection","title":"Graph Neural Network-Based Anomaly Detection in Multivariate Time Series","date":"2021-06-13","arxiv_id":"2106.06947","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":1,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"phrase":"3 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/graph-neural-network-based-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2106.06947","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06947"}},"official":{"repos":["d-ailin/GDN"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/compositional-modeling-of-nonlinear-dynamical","slug":"compositional-modeling-of-nonlinear-dynamical","title":"Compositional Modeling of Nonlinear Dynamical Systems with ODE-based Random Features","date":"2021-06-10","arxiv_id":"2106.05960","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/compositional-modeling-of-nonlinear-dynamical#ran","syntology_url":"https://syntology.ai/paper/2106.05960","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05960"}},"official":{"repos":["tomcdonald/Deep-LFM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/rnn-with-particle-flow-for-probabilistic","slug":"rnn-with-particle-flow-for-probabilistic","title":"RNN with Particle Flow for Probabilistic Spatio-temporal Forecasting","date":"2021-06-10","arxiv_id":"2106.06064","repositories_listed":1,"syntology":{"n":5,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":5,"phrase":"3 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; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rnn-with-particle-flow-for-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2106.06064","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.06064"}},"official":{"repos":["networkslab/rnn_flow"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/gp-convcnp-better-generalization-for","slug":"gp-convcnp-better-generalization-for","title":"GP-ConvCNP: Better Generalization for Convolutional Conditional Neural Processes on Time Series Data","date":"2021-06-09","arxiv_id":"2106.04967","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/gp-convcnp-better-generalization-for#ran","syntology_url":"https://syntology.ai/paper/2106.04967","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04967"}},"official":{"repos":["MIC-DKFZ/gpconvcnp"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neighborhood-contrastive-learning-applied-to","slug":"neighborhood-contrastive-learning-applied-to","title":"Neighborhood Contrastive Learning Applied to Online Patient Monitoring","date":"2021-06-09","arxiv_id":"2106.05142","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neighborhood-contrastive-learning-applied-to#ran","syntology_url":"https://syntology.ai/paper/2106.05142","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05142"}},"official":{"repos":["ratschlab/ncl"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/explaining-time-series-predictions-with","slug":"explaining-time-series-predictions-with","title":"Explaining Time Series Predictions with Dynamic Masks","date":"2021-06-09","arxiv_id":"2106.05303","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/explaining-time-series-predictions-with#ran","syntology_url":"https://syntology.ai/paper/2106.05303","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.05303"}},"official":{"repos":["JonathanCrabbe/Dynamask"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/manifold-topology-divergence-a-framework-for","slug":"manifold-topology-divergence-a-framework-for","title":"Manifold Topology Divergence: a Framework for Comparing Data Manifolds","date":"2021-06-08","arxiv_id":"2106.04024","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/manifold-topology-divergence-a-framework-for#ran","syntology_url":"https://syntology.ai/paper/2106.04024","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04024"}},"official":{"repos":["ilyatrofimov/mtopdiv"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-statistical-arbitrage","slug":"deep-learning-statistical-arbitrage","title":"Deep Learning Statistical Arbitrage","date":"2021-06-08","arxiv_id":"2106.04028","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-learning-statistical-arbitrage#ran","syntology_url":"https://syntology.ai/paper/2106.04028","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04028"}},"official":null}},{"url":"/paper/when-in-doubt-neural-non-parametric","slug":"when-in-doubt-neural-non-parametric","title":"When in Doubt: Neural Non-Parametric Uncertainty Quantification for Epidemic Forecasting","date":"2021-06-07","arxiv_id":"2106.03904","repositories_listed":1,"syntology":{"n":10,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":4,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/when-in-doubt-neural-non-parametric#ran","syntology_url":"https://syntology.ai/paper/2106.03904","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03904"}},"official":{"repos":["AdityaLab/EpiFNP"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-gradient-boosting-machines-for","slug":"probabilistic-gradient-boosting-machines-for","title":"Probabilistic Gradient Boosting Machines for Large-Scale Probabilistic Regression","date":"2021-06-03","arxiv_id":"2106.01682","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/probabilistic-gradient-boosting-machines-for#ran","syntology_url":"https://syntology.ai/paper/2106.01682","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01682"}},"official":{"repos":["elephaint/pgbm"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/unsupervised-representation-learning-for-time-1","slug":"unsupervised-representation-learning-for-time-1","title":"Unsupervised Representation Learning for Time Series with Temporal Neighborhood Coding","date":"2021-06-01","arxiv_id":"2106.00750","repositories_listed":2,"syntology":{"n":5,"n_ran":3,"n_constructed":1,"n_ran_checked":1,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":5,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/unsupervised-representation-learning-for-time-1#ran","syntology_url":"https://syntology.ai/paper/2106.00750","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.00750"}},"official":{"repos":["sanatonek/TNC_representation_learning"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/the-power-of-log-sum-exp-sequential-density","slug":"the-power-of-log-sum-exp-sequential-density","title":"The Power of Log-Sum-Exp: Sequential Density Ratio Matrix Estimation for Speed-Accuracy Optimization","date":"2021-05-28","arxiv_id":"2105.13636","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/the-power-of-log-sum-exp-sequential-density#ran","syntology_url":"https://syntology.ai/paper/2105.13636","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.13636"}},"official":{"repos":["TaikiMiyagawa/MSPRT-TANDEM"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-learning-based-damage-mapping-with-insar","slug":"deep-learning-based-damage-mapping-with-insar","title":"Deep Learning-based Damage Mapping with InSAR Coherence Time Series","date":"2021-05-24","arxiv_id":"2105.11544","repositories_listed":2,"syntology":{"n":15,"n_ran":10,"n_constructed":0,"n_ran_checked":9,"n_instrument":1,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 1 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/deep-learning-based-damage-mapping-with-insar#ran","syntology_url":"https://syntology.ai/paper/2105.11544","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.11544"}},"official":{"repos":["olliestephenson/dpm-rnn-public"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/z-gcnets-time-zigzags-at-graph-convolutional","slug":"z-gcnets-time-zigzags-at-graph-convolutional","title":"Z-GCNETs: Time Zigzags at Graph Convolutional Networks for Time Series Forecasting","date":"2021-05-10","arxiv_id":"2105.04100","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":3,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified; every one of the 3 samples that ran constructed an object rather than computing a result","sample_list":"/paper/z-gcnets-time-zigzags-at-graph-convolutional#ran","syntology_url":"https://syntology.ai/paper/2105.04100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04100"}},"official":{"repos":["Z-GCNETs/Z-GCNETs"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/sirnn-a-math-library-for-secure-rnn-inference","slug":"sirnn-a-math-library-for-secure-rnn-inference","title":"SIRNN: A Math Library for Secure RNN Inference","date":"2021-05-10","arxiv_id":"2105.04236","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":7,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/sirnn-a-math-library-for-secure-rnn-inference#ran","syntology_url":"https://syntology.ai/paper/2105.04236","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.04236"}},"official":{"repos":["mpc-msri/EzPC"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/consistency-of-mechanistic-causal-discovery","slug":"consistency-of-mechanistic-causal-discovery","title":"Neural graphical modelling in continuous-time: consistency guarantees and algorithms","date":"2021-05-06","arxiv_id":"2105.02522","repositories_listed":2,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/consistency-of-mechanistic-causal-discovery#ran","syntology_url":"https://syntology.ai/paper/2105.02522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02522"}},"official":{"repos":["vanderschaarlab/mlforhealthlabpub"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/out-of-distribution-detection-and-generation","slug":"out-of-distribution-detection-and-generation","title":"Out-of-distribution Detection and Generation using Soft Brownian Offset Sampling and Autoencoders","date":"2021-05-04","arxiv_id":"2105.02965","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/out-of-distribution-detection-and-generation#ran","syntology_url":"https://syntology.ai/paper/2105.02965","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.02965"}},"official":null}},{"url":"/paper/data-generating-process-to-evaluate-causal","slug":"data-generating-process-to-evaluate-causal","title":"Data Generating Process to Evaluate Causal Discovery Techniques for Time Series Data","date":"2021-04-16","arxiv_id":"2104.08043","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/data-generating-process-to-evaluate-causal#ran","syntology_url":"https://syntology.ai/paper/2104.08043","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.08043"}},"official":{"repos":["causalens/cdml-neurips2020"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/forecasting-covid-19-counts-at-a-single","slug":"forecasting-covid-19-counts-at-a-single","title":"Forecasting COVID-19 Counts At A Single Hospital: A Hierarchical Bayesian Approach","date":"2021-04-14","arxiv_id":"2104.09327","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/forecasting-covid-19-counts-at-a-single#ran","syntology_url":"https://syntology.ai/paper/2104.09327","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.09327"}},"official":{"repos":["tufts-ml/single-hospital-count-forecasting"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-basis-expansion-analysis-with","slug":"neural-basis-expansion-analysis-with","title":"Neural basis expansion analysis with exogenous variables: Forecasting electricity prices with NBEATSx","date":"2021-04-12","arxiv_id":"2104.05522","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-basis-expansion-analysis-with#ran","syntology_url":"https://syntology.ai/paper/2104.05522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05522"}},"official":{"repos":["cchallu/nbeatsx"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/ast-audio-spectrogram-transformer","slug":"ast-audio-spectrogram-transformer","title":"AST: Audio Spectrogram Transformer","date":"2021-04-05","arxiv_id":"2104.01778","repositories_listed":5,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ast-audio-spectrogram-transformer#ran","syntology_url":"https://syntology.ai/paper/2104.01778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.01778"}},"official":{"repos":["YuanGongND/ast"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/learnable-dynamic-temporal-pooling-for-time","slug":"learnable-dynamic-temporal-pooling-for-time","title":"Learnable Dynamic Temporal Pooling for Time Series Classification","date":"2021-04-02","arxiv_id":"2104.02577","repositories_listed":1,"syntology":{"n":13,"n_ran":9,"n_constructed":7,"n_ran_checked":7,"n_instrument":2,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":13,"phrase":"9 ran (of which 7 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/learnable-dynamic-temporal-pooling-for-time#ran","syntology_url":"https://syntology.ai/paper/2104.02577","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.02577"}},"official":null}},{"url":"/paper/neural-ode-processes-1","slug":"neural-ode-processes-1","title":"Neural ODE Processes","date":"2021-03-23","arxiv_id":"2103.12413","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 2 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-ode-processes-1#ran","syntology_url":"https://syntology.ai/paper/2103.12413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12413"}},"official":{"repos":["crisbodnar/ndp"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/an-experimental-review-on-deep-learning","slug":"an-experimental-review-on-deep-learning","title":"An Experimental Review on Deep Learning Architectures for Time Series Forecasting","date":"2021-03-22","arxiv_id":"2103.12057","repositories_listed":1,"syntology":{"n":9,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/an-experimental-review-on-deep-learning#ran","syntology_url":"https://syntology.ai/paper/2103.12057","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.12057"}},"official":{"repos":["pedrolarben/TimeSeriesForecasting-DeepLearning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/lossless-compression-with-state-space-models","slug":"lossless-compression-with-state-space-models","title":"Lossless compression with state space models using bits back coding","date":"2021-03-18","arxiv_id":"2103.10150","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/lossless-compression-with-state-space-models#ran","syntology_url":"https://syntology.ai/paper/2103.10150","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.10150"}},"official":{"repos":["j-towns/ssm-code"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-discriminative-prototypes-with","slug":"learning-discriminative-prototypes-with","title":"Learning Discriminative Prototypes with Dynamic Time Warping","date":"2021-03-17","arxiv_id":"2103.09458","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/learning-discriminative-prototypes-with#ran","syntology_url":"https://syntology.ai/paper/2103.09458","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.09458"}},"official":{"repos":["BorealisAI/TSC-Disc-Proto"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/spectral-temporal-graph-neural-network-for-1","slug":"spectral-temporal-graph-neural-network-for-1","title":"Spectral Temporal Graph Neural Network for Multivariate Time-series Forecasting","date":"2021-03-13","arxiv_id":"2103.07719","repositories_listed":3,"syntology":{"n":13,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"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) · 11 unverified","sample_list":"/paper/spectral-temporal-graph-neural-network-for-1#ran","syntology_url":"https://syntology.ai/paper/2103.07719","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.07719"}},"official":{"repos":["WenjieDu/PyPOTS"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/understanding-the-robustness-of-skeleton","slug":"understanding-the-robustness-of-skeleton","title":"Understanding the Robustness of Skeleton-based Action Recognition under Adversarial Attack","date":"2021-03-09","arxiv_id":"2103.05347","repositories_listed":1,"syntology":{"n":6,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":6,"phrase":"2 ran (of which 2 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) · 4 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/understanding-the-robustness-of-skeleton#ran","syntology_url":"https://syntology.ai/paper/2103.05347","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05347"}},"official":{"repos":["realcrane/SMART"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/unicornn-a-recurrent-model-for-learning-very","slug":"unicornn-a-recurrent-model-for-learning-very","title":"UnICORNN: A recurrent model for learning very long time dependencies","date":"2021-03-09","arxiv_id":"2103.05487","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/unicornn-a-recurrent-model-for-learning-very#ran","syntology_url":"https://syntology.ai/paper/2103.05487","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.05487"}},"official":{"repos":["tk-rusch/unicornn"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/simultaneously-reconciled-quantile","slug":"simultaneously-reconciled-quantile","title":"Simultaneously Reconciled Quantile Forecasting of Hierarchically Related Time Series","date":"2021-02-25","arxiv_id":"2102.12612","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/simultaneously-reconciled-quantile#ran","syntology_url":"https://syntology.ai/paper/2102.12612","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.12612"}},"official":null}},{"url":"/paper/neural-pharmacodynamic-state-space-modeling","slug":"neural-pharmacodynamic-state-space-modeling","title":"Neural Pharmacodynamic State Space Modeling","date":"2021-02-22","arxiv_id":"2102.11218","repositories_listed":2,"syntology":{"n":6,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 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; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/neural-pharmacodynamic-state-space-modeling#ran","syntology_url":"https://syntology.ai/paper/2102.11218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.11218"}},"official":{"repos":["clinicalml/ief","zeshanmh/ief"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/cross-domain-time-series-forecasting-with","slug":"cross-domain-time-series-forecasting-with","title":"Domain Adaptation for Time Series Forecasting via Attention Sharing","date":"2021-02-13","arxiv_id":"2102.06828","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/cross-domain-time-series-forecasting-with#ran","syntology_url":"https://syntology.ai/paper/2102.06828","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.06828"}},"official":null}},{"url":"/paper/mali-a-memory-efficient-and-reverse-accurate-1","slug":"mali-a-memory-efficient-and-reverse-accurate-1","title":"MALI: A memory efficient and reverse accurate integrator for Neural ODEs","date":"2021-02-09","arxiv_id":"2102.04668","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/mali-a-memory-efficient-and-reverse-accurate-1#ran","syntology_url":"https://syntology.ai/paper/2102.04668","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.04668"}},"official":{"repos":["juntang-zhuang/TorchDiffEqPack"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-sdes-as-infinite-dimensional-gans","slug":"neural-sdes-as-infinite-dimensional-gans","title":"Neural SDEs as Infinite-Dimensional GANs","date":"2021-02-06","arxiv_id":"2102.03657","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/neural-sdes-as-infinite-dimensional-gans#ran","syntology_url":"https://syntology.ai/paper/2102.03657","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.03657"}},"official":{"repos":["google-research/torchsde"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/federated-depression-detection-from-multi","slug":"federated-depression-detection-from-multi","title":"FedMood: Federated Learning on Mobile Health Data for Mood Detection","date":"2021-02-06","arxiv_id":"2102.09342","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/federated-depression-detection-from-multi#ran","syntology_url":"https://syntology.ai/paper/2102.09342","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2102.09342"}},"official":{"repos":["RingBDStack/Fed_mood"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/multi-time-attention-networks-for-irregularly-1","slug":"multi-time-attention-networks-for-irregularly-1","title":"Multi-Time Attention Networks for Irregularly Sampled Time Series","date":"2021-01-25","arxiv_id":"2101.10318","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":1,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"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","sample_list":"/paper/multi-time-attention-networks-for-irregularly-1#ran","syntology_url":"https://syntology.ai/paper/2101.10318","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.10318"}},"official":{"repos":["reml-lab/mTAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/interpretable-models-for-granger-causality-1","slug":"interpretable-models-for-granger-causality-1","title":"Interpretable Models for Granger Causality Using Self-explaining Neural Networks","date":"2021-01-19","arxiv_id":"2101.07600","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/interpretable-models-for-granger-causality-1#ran","syntology_url":"https://syntology.ai/paper/2101.07600","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.07600"}},"official":{"repos":["i6092467/GVAR"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/discrete-graph-structure-learning-for-1","slug":"discrete-graph-structure-learning-for-1","title":"Discrete Graph Structure Learning for Forecasting Multiple Time Series","date":"2021-01-18","arxiv_id":"2101.06861","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":1,"n_instrument":3,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/discrete-graph-structure-learning-for-1#ran","syntology_url":"https://syntology.ai/paper/2101.06861","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.06861"}},"official":{"repos":["chaoshangcs/GTS"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/do-we-really-need-deep-learning-models-for","slug":"do-we-really-need-deep-learning-models-for","title":"Do We Really Need Deep Learning Models for Time Series Forecasting?","date":"2021-01-06","arxiv_id":"2101.02118","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"1 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; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/do-we-really-need-deep-learning-models-for#ran","syntology_url":"https://syntology.ai/paper/2101.02118","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.02118"}},"official":{"repos":["Daniela-Shereen/GBRT-for-TSF"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/informer-beyond-efficient-transformer-for","slug":"informer-beyond-efficient-transformer-for","title":"Informer: Beyond Efficient Transformer for Long Sequence Time-Series Forecasting","date":"2020-12-14","arxiv_id":"2012.07436","repositories_listed":14,"syntology":{"n":76,"n_ran":62,"n_constructed":53,"n_ran_checked":62,"n_instrument":0,"n_unverified":14,"n_honours":0,"n_violates":1,"n_no_contract":61,"n_pointer_only":13,"phrase":"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","sample_list":"/paper/informer-beyond-efficient-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2012.07436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07436"}},"official":{"repos":["WenjieDu/PyPOTS"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed","named_in_paper"]}}},{"url":"/paper/intrinsic-persistent-homology-via-density","slug":"intrinsic-persistent-homology-via-density","title":"Intrinsic persistent homology via density-based metric learning","date":"2020-12-11","arxiv_id":"2012.07621","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/intrinsic-persistent-homology-via-density#ran","syntology_url":"https://syntology.ai/paper/2012.07621","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.07621"}},"official":{"repos":["ximenafernandez/intrinsicPH"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/classification-of-periodic-variable-stars","slug":"classification-of-periodic-variable-stars","title":"Classification of Periodic Variable Stars with Novel Cyclic-Permutation Invariant Neural Networks","date":"2020-11-02","arxiv_id":"2011.01243","repositories_listed":1,"syntology":{"n":7,"n_ran":7,"n_constructed":4,"n_ran_checked":4,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":4,"phrase":"7 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/classification-of-periodic-variable-stars#ran","syntology_url":"https://syntology.ai/paper/2011.01243","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.01243"}},"official":{"repos":["kmzzhang/periodicnetwork"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":4,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["community","official"]}}},{"url":"/paper/wearing-a-mask-compressed-representations-of","slug":"wearing-a-mask-compressed-representations-of","title":"Wearing a MASK: Compressed Representations of Variable-Length Sequences Using Recurrent Neural Tangent Kernels","date":"2020-10-27","arxiv_id":"2010.13975","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/wearing-a-mask-compressed-representations-of#ran","syntology_url":"https://syntology.ai/paper/2010.13975","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13975"}},"official":{"repos":["dlej/MASK"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/benchmarking-deep-learning-interpretability","slug":"benchmarking-deep-learning-interpretability","title":"Benchmarking Deep Learning Interpretability in Time Series Predictions","date":"2020-10-26","arxiv_id":"2010.13924","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"phrase":"3 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; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/benchmarking-deep-learning-interpretability#ran","syntology_url":"https://syntology.ai/paper/2010.13924","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.13924"}},"official":{"repos":["ayaabdelsalam91/TS-Interpretability-Benchmark"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official","unlocated"]}}},{"url":"/paper/a-biologically-plausible-neural-network-for-1","slug":"a-biologically-plausible-neural-network-for-1","title":"A biologically plausible neural network for Slow Feature Analysis","date":"2020-10-23","arxiv_id":"2010.12644","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-biologically-plausible-neural-network-for-1#ran","syntology_url":"https://syntology.ai/paper/2010.12644","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.12644"}},"official":{"repos":["flatironinstitute/bio-sfa"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/probabilistic-numeric-convolutional-neural-1","slug":"probabilistic-numeric-convolutional-neural-1","title":"Probabilistic Numeric Convolutional Neural Networks","date":"2020-10-21","arxiv_id":"2010.10876","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/probabilistic-numeric-convolutional-neural-1#ran","syntology_url":"https://syntology.ai/paper/2010.10876","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.10876"}},"official":null}},{"url":"/paper/conformal-prediction-interval-for-dynamic","slug":"conformal-prediction-interval-for-dynamic","title":"Conformal prediction interval for dynamic time-series","date":"2020-10-18","arxiv_id":"2010.09107","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conformal-prediction-interval-for-dynamic#ran","syntology_url":"https://syntology.ai/paper/2010.09107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09107"}},"official":{"repos":["hamrel-cxu/EnbPI"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-ordinary-differential-equations-for-1","slug":"neural-ordinary-differential-equations-for-1","title":"Neural Ordinary Differential Equations for Intervention Modeling","date":"2020-10-16","arxiv_id":"2010.08304","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-ordinary-differential-equations-for-1#ran","syntology_url":"https://syntology.ai/paper/2010.08304","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08304"}},"official":{"repos":["eogns282/IMODE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/differentiable-divergences-between-time","slug":"differentiable-divergences-between-time","title":"Differentiable Divergences Between Time Series","date":"2020-10-16","arxiv_id":"2010.08354","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/differentiable-divergences-between-time#ran","syntology_url":"https://syntology.ai/paper/2010.08354","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.08354"}},"official":{"repos":["google-research/soft-dtw-divergences"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/anomalybench-an-open-benchmark-for","slug":"anomalybench-an-open-benchmark-for","title":"Exathlon: A Benchmark for Explainable Anomaly Detection over Time Series","date":"2020-10-10","arxiv_id":"2010.05073","repositories_listed":1,"syntology":{"n":11,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/anomalybench-an-open-benchmark-for#ran","syntology_url":"https://syntology.ai/paper/2010.05073","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.05073"}},"official":{"repos":["exathlonbenchmark/exathlon"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/a-transformer-based-framework-for-1","slug":"a-transformer-based-framework-for-1","title":"A Transformer-based Framework for Multivariate Time Series Representation Learning","date":"2020-10-06","arxiv_id":"2010.02803","repositories_listed":6,"syntology":{"n":32,"n_ran":23,"n_constructed":0,"n_ran_checked":22,"n_instrument":1,"n_unverified":9,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":6,"phrase":"23 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 1 where Syntology's instrument failed) · 9 unverified","sample_list":"/paper/a-transformer-based-framework-for-1#ran","syntology_url":"https://syntology.ai/paper/2010.02803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.02803"}},"official":{"repos":["gzerveas/mvts_transformer"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":16,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/instance-based-counterfactual-explanations","slug":"instance-based-counterfactual-explanations","title":"Instance-based Counterfactual Explanations for Time Series Classification","date":"2020-09-28","arxiv_id":"2009.13211","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/instance-based-counterfactual-explanations#ran","syntology_url":"https://syntology.ai/paper/2009.13211","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13211"}},"official":{"repos":["e-delaney/Instance-Based_CFE_TSC"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/hey-that-s-not-an-ode-faster-ode-adjoints","slug":"hey-that-s-not-an-ode-faster-ode-adjoints","title":"\"Hey, that's not an ODE\": Faster ODE Adjoints via Seminorms","date":"2020-09-20","arxiv_id":"2009.09457","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":1,"n_honours":2,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hey-that-s-not-an-ode-faster-ode-adjoints#ran","syntology_url":"https://syntology.ai/paper/2009.09457","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.09457"}},"official":{"repos":["patrick-kidger/FasterNeuralDiffEq"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"url":"/paper/automatic-forecasting-using-gaussian","slug":"automatic-forecasting-using-gaussian","title":"Time series forecasting with Gaussian Processes needs priors","date":"2020-09-17","arxiv_id":"2009.08102","repositories_listed":1,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/automatic-forecasting-using-gaussian#ran","syntology_url":"https://syntology.ai/paper/2009.08102","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08102"}},"official":null}},{"url":"/paper/neural-cdes-for-long-time-series-via-the-log","slug":"neural-cdes-for-long-time-series-via-the-log","title":"Neural Rough Differential Equations for Long Time Series","date":"2020-09-17","arxiv_id":"2009.08295","repositories_listed":4,"syntology":{"n":6,"n_ran":5,"n_constructed":3,"n_ran_checked":3,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":6,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/neural-cdes-for-long-time-series-via-the-log#ran","syntology_url":"https://syntology.ai/paper/2009.08295","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08295"}},"official":{"repos":["jambo6/neuralCDEs-via-logODEs","jambo6/neuralRDEs","patrick-kidger/torchcde"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/automatic-differentiation-to-simultaneously","slug":"automatic-differentiation-to-simultaneously","title":"Automatic Differentiation to Simultaneously Identify Nonlinear Dynamics and Extract Noise Probability Distributions from Data","date":"2020-09-12","arxiv_id":"2009.08810","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/automatic-differentiation-to-simultaneously#ran","syntology_url":"https://syntology.ai/paper/2009.08810","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.08810"}},"official":{"repos":["dynamicslab/modified-SINDy"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/multivariate-time-series-anomaly-detection","slug":"multivariate-time-series-anomaly-detection","title":"Multivariate Time-series Anomaly Detection via Graph Attention Network","date":"2020-09-04","arxiv_id":"2009.02040","repositories_listed":2,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":2,"n_no_contract":6,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 2 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multivariate-time-series-anomaly-detection#ran","syntology_url":"https://syntology.ai/paper/2009.02040","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.02040"}},"official":null}},{"url":"/paper/hippo-recurrent-memory-with-optimal","slug":"hippo-recurrent-memory-with-optimal","title":"HiPPO: Recurrent Memory with Optimal Polynomial Projections","date":"2020-08-17","arxiv_id":"2008.07669","repositories_listed":2,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":8,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":5,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/hippo-recurrent-memory-with-optimal#ran","syntology_url":"https://syntology.ai/paper/2008.07669","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.07669"}},"official":{"repos":["HazyResearch/hippo-code"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":1,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/an-empirical-survey-of-data-augmentation-for","slug":"an-empirical-survey-of-data-augmentation-for","title":"An Empirical Survey of Data Augmentation for Time Series Classification with Neural Networks","date":"2020-07-31","arxiv_id":"2007.15951","repositories_listed":1,"syntology":{"n":19,"n_ran":14,"n_constructed":0,"n_ran_checked":14,"n_instrument":0,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 14 with no instrument failure: 0 honoured, 0 violated, 14 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/an-empirical-survey-of-data-augmentation-for#ran","syntology_url":"https://syntology.ai/paper/2007.15951","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15951"}},"official":{"repos":["uchidalab/time_series_augmentation"],"state":"official (archive's flag): 14 ran","n_ran":14,"n_constructed":0,"n_ran_no_instrument_failure":14,"n_unverified":5,"ran_from_kinds":["official"]}}},{"url":"/paper/fc-gaga-fully-connected-gated-graph","slug":"fc-gaga-fully-connected-gated-graph","title":"FC-GAGA: Fully Connected Gated Graph Architecture for Spatio-Temporal Traffic Forecasting","date":"2020-07-30","arxiv_id":"2007.15531","repositories_listed":1,"syntology":{"n":4,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/fc-gaga-fully-connected-gated-graph#ran","syntology_url":"https://syntology.ai/paper/2007.15531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.15531"}},"official":{"repos":["boreshkinai/fc-gaga"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/timexplain-a-framework-for-explaining-the","slug":"timexplain-a-framework-for-explaining-the","title":"timeXplain -- A Framework for Explaining the Predictions of Time Series Classifiers","date":"2020-07-15","arxiv_id":"2007.07606","repositories_listed":1,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":9,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":9,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/timexplain-a-framework-for-explaining-the#ran","syntology_url":"https://syntology.ai/paper/2007.07606","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.07606"}},"official":{"repos":["loadingbyte/timexplain"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-differential-equations-that-are-easy","slug":"learning-differential-equations-that-are-easy","title":"Learning Differential Equations that are Easy to Solve","date":"2020-07-09","arxiv_id":"2007.04504","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":1,"n_honours":2,"n_violates":2,"n_no_contract":0,"n_pointer_only":0,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 2 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/learning-differential-equations-that-are-easy#ran","syntology_url":"https://syntology.ai/paper/2007.04504","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.04504"}},"official":{"repos":["jacobjinkelly/easy-neural-ode"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/adaptive-graph-convolutional-recurrent","slug":"adaptive-graph-convolutional-recurrent","title":"Adaptive Graph Convolutional Recurrent Network for Traffic Forecasting","date":"2020-07-06","arxiv_id":"2007.02842","repositories_listed":3,"syntology":{"n":7,"n_ran":5,"n_constructed":5,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":1,"phrase":"5 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 5 samples that ran constructed an object rather than computing a result","sample_list":"/paper/adaptive-graph-convolutional-recurrent#ran","syntology_url":"https://syntology.ai/paper/2007.02842","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.02842"}},"official":{"repos":["LeiBAI/AGCRN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/computing-the-full-signature-kernel-as-the","slug":"computing-the-full-signature-kernel-as-the","title":"The Signature Kernel is the solution of a Goursat PDE","date":"2020-06-26","arxiv_id":"2006.14794","repositories_listed":4,"syntology":{"n":10,"n_ran":9,"n_constructed":0,"n_ran_checked":8,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/computing-the-full-signature-kernel-as-the#ran","syntology_url":"https://syntology.ai/paper/2006.14794","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.14794"}},"official":{"repos":["crispitagorico/SignatureKernel","crispitagorico/sigkernel"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/hidden-markov-nonlinear-ica-unsupervised","slug":"hidden-markov-nonlinear-ica-unsupervised","title":"Hidden Markov Nonlinear ICA: Unsupervised Learning from Nonstationary Time Series","date":"2020-06-22","arxiv_id":"2006.12107","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/hidden-markov-nonlinear-ica-unsupervised#ran","syntology_url":"https://syntology.ai/paper/2006.12107","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12107"}},"official":{"repos":["HHalva/hmnlica"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/aligning-time-series-on-incomparable-spaces","slug":"aligning-time-series-on-incomparable-spaces","title":"Aligning Time Series on Incomparable Spaces","date":"2020-06-22","arxiv_id":"2006.12648","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":1,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/aligning-time-series-on-incomparable-spaces#ran","syntology_url":"https://syntology.ai/paper/2006.12648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.12648"}},"official":{"repos":["samcohen16/Aligning-Time-Series"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/conditional-sig-wasserstein-gans-for-time","slug":"conditional-sig-wasserstein-gans-for-time","title":"Conditional Sig-Wasserstein GANs for Time Series Generation","date":"2020-06-09","arxiv_id":"2006.05421","repositories_listed":2,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/conditional-sig-wasserstein-gans-for-time#ran","syntology_url":"https://syntology.ai/paper/2006.05421","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05421"}},"official":{"repos":["SigCGANs/Conditional-Sig-Wasserstein-GANs"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/liquid-time-constant-networks","slug":"liquid-time-constant-networks","title":"Liquid Time-constant Networks","date":"2020-06-08","arxiv_id":"2006.04439","repositories_listed":4,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/liquid-time-constant-networks#ran","syntology_url":"https://syntology.ai/paper/2006.04439","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04439"}},"official":{"repos":["raminmh/liquid_time_constant_networks"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/theoretical-guarantees-for-learning","slug":"theoretical-guarantees-for-learning","title":"Neural Jump Ordinary Differential Equations: Consistent Continuous-Time Prediction and Filtering","date":"2020-06-08","arxiv_id":"2006.04727","repositories_listed":2,"syntology":{"n":21,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":11,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/theoretical-guarantees-for-learning#ran","syntology_url":"https://syntology.ai/paper/2006.04727","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.04727"}},"official":{"repos":["HerreraKrachTeichmann/ControlledODERNN","HerreraKrachTeichmann/NJODE"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generalised-signature-method-for-time","slug":"a-generalised-signature-method-for-time","title":"A Generalised Signature Method for Multivariate Time Series Feature Extraction","date":"2020-06-01","arxiv_id":"2006.00873","repositories_listed":1,"syntology":{"n":11,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/a-generalised-signature-method-for-time#ran","syntology_url":"https://syntology.ai/paper/2006.00873","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.00873"}},"official":{"repos":["jambo6/generalised-signature-method"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/generalised-interpretable-shapelets-for","slug":"generalised-interpretable-shapelets-for","title":"Generalised Interpretable Shapelets for Irregular Time Series","date":"2020-05-28","arxiv_id":"2005.13948","repositories_listed":2,"syntology":{"n":5,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/generalised-interpretable-shapelets-for#ran","syntology_url":"https://syntology.ai/paper/2005.13948","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13948"}},"official":{"repos":["patrick-kidger/generalised_shapelets","jambo6/generalised_shapelets"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/discretize-optimize-vs-optimize-discretize","slug":"discretize-optimize-vs-optimize-discretize","title":"Discretize-Optimize vs. Optimize-Discretize for Time-Series Regression and Continuous Normalizing Flows","date":"2020-05-27","arxiv_id":"2005.13420","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/discretize-optimize-vs-optimize-discretize#ran","syntology_url":"https://syntology.ai/paper/2005.13420","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.13420"}},"official":{"repos":["EmoryMLIP/DOvsOD_NeuralODEs"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/path-imputation-strategies-for-signature","slug":"path-imputation-strategies-for-signature","title":"Path Imputation Strategies for Signature Models of Irregular Time Series","date":"2020-05-25","arxiv_id":"2005.12359","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/path-imputation-strategies-for-signature#ran","syntology_url":"https://syntology.ai/paper/2005.12359","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.12359"}},"official":null}},{"url":"/paper/connecting-the-dots-multivariate-time-series","slug":"connecting-the-dots-multivariate-time-series","title":"Connecting the Dots: Multivariate Time Series Forecasting with Graph Neural Networks","date":"2020-05-24","arxiv_id":"2005.11650","repositories_listed":3,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/connecting-the-dots-multivariate-time-series#ran","syntology_url":"https://syntology.ai/paper/2005.11650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.11650"}},"official":{"repos":["nnzhan/MTGNN"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/multi-source-deep-domain-adaptation-with-weak","slug":"multi-source-deep-domain-adaptation-with-weak","title":"Multi-Source Deep Domain Adaptation with Weak Supervision for Time-Series Sensor Data","date":"2020-05-22","arxiv_id":"2005.10996","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/multi-source-deep-domain-adaptation-with-weak#ran","syntology_url":"https://syntology.ai/paper/2005.10996","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10996"}},"official":{"repos":["floft/codats"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/stochastic-super-resolution-for-downscaling","slug":"stochastic-super-resolution-for-downscaling","title":"Stochastic Super-Resolution for Downscaling Time-Evolving Atmospheric Fields with a Generative Adversarial Network","date":"2020-05-20","arxiv_id":"2005.10374","repositories_listed":1,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/stochastic-super-resolution-for-downscaling#ran","syntology_url":"https://syntology.ai/paper/2005.10374","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.10374"}},"official":{"repos":["jleinonen/downscaling-rnn-gan"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-controlled-differential-equations-for","slug":"neural-controlled-differential-equations-for","title":"Neural Controlled Differential Equations for Irregular Time Series","date":"2020-05-18","arxiv_id":"2005.08926","repositories_listed":5,"syntology":{"n":20,"n_ran":9,"n_constructed":0,"n_ran_checked":7,"n_instrument":2,"n_unverified":11,"n_honours":0,"n_violates":1,"n_no_contract":6,"n_pointer_only":2,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 1 violated, 6 with no contract checked; 2 where Syntology's instrument failed) · 11 unverified","sample_list":"/paper/neural-controlled-differential-equations-for#ran","syntology_url":"https://syntology.ai/paper/2005.08926","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.08926"}},"official":{"repos":["patrick-kidger/NeuralCDE"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":3,"ran_from_kinds":["found_in_text","listed","official"]}}},{"url":"/paper/if-you-like-it-gan-it-probabilistic","slug":"if-you-like-it-gan-it-probabilistic","title":"If You Like It, GAN It. Probabilistic Multivariate Times Series Forecast With GAN","date":"2020-05-03","arxiv_id":"2005.01181","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"2 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; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/if-you-like-it-gan-it-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2005.01181","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01181"}},"official":null}},{"url":"/paper/neural-forecasting-introduction-and","slug":"neural-forecasting-introduction-and","title":"Deep Learning for Time Series Forecasting: Tutorial and Literature Survey","date":"2020-04-21","arxiv_id":"2004.10240","repositories_listed":2,"syntology":{"n":7,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-forecasting-introduction-and#ran","syntology_url":"https://syntology.ai/paper/2004.10240","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.10240"}},"official":null}},{"url":"/paper/alps-active-learning-via-perturbations","slug":"alps-active-learning-via-perturbations","title":"SoQal: Selective Oracle Questioning for Consistency Based Active Learning of Cardiac Signals","date":"2020-04-20","arxiv_id":"2004.09557","repositories_listed":2,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":5,"n_instrument":5,"n_unverified":3,"n_honours":5,"n_violates":0,"n_no_contract":0,"n_pointer_only":13,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 5 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/alps-active-learning-via-perturbations#ran","syntology_url":"https://syntology.ai/paper/2004.09557","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.09557"}},"official":{"repos":["danikiyasseh/SoCal","danikiyasseh/SoQal"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/generative-ode-modeling-with-known-unknowns","slug":"generative-ode-modeling-with-known-unknowns","title":"Generative ODE Modeling with Known Unknowns","date":"2020-03-24","arxiv_id":"2003.10775","repositories_listed":3,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":0,"n_instrument":4,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/generative-ode-modeling-with-known-unknowns#ran","syntology_url":"https://syntology.ai/paper/2003.10775","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.10775"}},"official":{"repos":["orilinial/GOKU"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/an-evaluation-of-change-point-detection","slug":"an-evaluation-of-change-point-detection","title":"An Evaluation of Change Point Detection Algorithms","date":"2020-03-13","arxiv_id":"2003.06222","repositories_listed":3,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":0,"n_instrument":7,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 7 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/an-evaluation-of-change-point-detection#ran","syntology_url":"https://syntology.ai/paper/2003.06222","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.06222"}},"official":{"repos":["alan-turing-institute/AnnotateChange","alan-turing-institute/TCPD","alan-turing-institute/TCPDBench"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/adversarial-attacks-on-probabilistic","slug":"adversarial-attacks-on-probabilistic","title":"Adversarial Attacks on Probabilistic Autoregressive Forecasting Models","date":"2020-03-08","arxiv_id":"2003.03778","repositories_listed":1,"syntology":{"n":8,"n_ran":5,"n_constructed":0,"n_ran_checked":4,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/adversarial-attacks-on-probabilistic#ran","syntology_url":"https://syntology.ai/paper/2003.03778","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.03778"}},"official":{"repos":["eth-sri/probabilistic-forecasts-attacks"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/drocc-deep-robust-one-class-classification","slug":"drocc-deep-robust-one-class-classification","title":"DROCC: Deep Robust One-Class Classification","date":"2020-02-28","arxiv_id":"2002.12718","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":1,"n_ran_checked":1,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"phrase":"1 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified; the one sample that ran constructed an object rather than computing a result","sample_list":"/paper/drocc-deep-robust-one-class-classification#ran","syntology_url":"https://syntology.ai/paper/2002.12718","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12718"}},"official":{"repos":["Microsoft/EdgeML"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/rethinking-1d-cnn-for-time-series","slug":"rethinking-1d-cnn-for-time-series","title":"Omni-Scale CNNs: a simple and effective kernel size configuration for time series classification","date":"2020-02-24","arxiv_id":"2002.10061","repositories_listed":3,"syntology":{"n":11,"n_ran":7,"n_constructed":3,"n_ran_checked":5,"n_instrument":2,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":3,"n_pointer_only":3,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 0 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/rethinking-1d-cnn-for-time-series#ran","syntology_url":"https://syntology.ai/paper/2002.10061","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.10061"}},"official":{"repos":["Wensi-Tang/OS-CNN"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":4,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/causal-structure-learning-from-time-series","slug":"causal-structure-learning-from-time-series","title":"Causal structure learning from time series: Large regression coefficients may predict causal links better in practice than small p-values","date":"2020-02-21","arxiv_id":"2002.09573","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/causal-structure-learning-from-time-series#ran","syntology_url":"https://syntology.ai/paper/2002.09573","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.09573"}},"official":{"repos":["sweichwald/tidybench"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/deep-transformer-models-for-time-series","slug":"deep-transformer-models-for-time-series","title":"Deep Transformer Models for Time Series Forecasting: The Influenza Prevalence Case","date":"2020-01-23","arxiv_id":"2001.08317","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/deep-transformer-models-for-time-series#ran","syntology_url":"https://syntology.ai/paper/2001.08317","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2001.08317"}},"official":null}},{"url":"/paper/temporal-fusion-transformers-for","slug":"temporal-fusion-transformers-for","title":"Temporal Fusion Transformers for Interpretable Multi-horizon Time Series Forecasting","date":"2019-12-19","arxiv_id":"1912.09363","repositories_listed":36,"syntology":{"n":10,"n_ran":8,"n_constructed":0,"n_ran_checked":4,"n_instrument":4,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":5,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/temporal-fusion-transformers-for#ran","syntology_url":"https://syntology.ai/paper/1912.09363","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.09363"}},"official":null}},{"url":"/paper/ar-net-a-simple-auto-regressive-neural","slug":"ar-net-a-simple-auto-regressive-neural","title":"AR-Net: A simple Auto-Regressive Neural Network for time-series","date":"2019-11-27","arxiv_id":"1911.12436","repositories_listed":2,"syntology":{"n":18,"n_ran":18,"n_constructed":0,"n_ran_checked":18,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":18,"n_pointer_only":0,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 18 with no instrument failure: 0 honoured, 0 violated, 18 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/ar-net-a-simple-auto-regressive-neural#ran","syntology_url":"https://syntology.ai/paper/1911.12436","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.12436"}},"official":{"repos":["ourownstory/AR-Net"],"state":"official (archive's flag): 18 ran","n_ran":18,"n_constructed":0,"n_ran_no_instrument_failure":18,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/economy-statistical-recurrent-units-for-1","slug":"economy-statistical-recurrent-units-for-1","title":"Economy Statistical Recurrent Units For Inferring Nonlinear Granger Causality","date":"2019-11-22","arxiv_id":"1911.09879","repositories_listed":1,"syntology":{"n":1,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/economy-statistical-recurrent-units-for-1#ran","syntology_url":"https://syntology.ai/paper/1911.09879","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.09879"}},"official":{"repos":["sakhanna/SRU_for_GCI"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/satellite-image-time-series-classification","slug":"satellite-image-time-series-classification","title":"Satellite Image Time Series Classification with Pixel-Set Encoders and Temporal Self-Attention","date":"2019-11-18","arxiv_id":"1911.07757","repositories_listed":2,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":11,"n_instrument":3,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":0,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/satellite-image-time-series-classification#ran","syntology_url":"https://syntology.ai/paper/1911.07757","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.07757"}},"official":{"repos":["VSainteuf/pytorch-psetae"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/rocket-exceptionally-fast-and-accurate-time","slug":"rocket-exceptionally-fast-and-accurate-time","title":"ROCKET: Exceptionally fast and accurate time series classification using random convolutional kernels","date":"2019-10-29","arxiv_id":"1910.13051","repositories_listed":6,"syntology":{"n":3,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/rocket-exceptionally-fast-and-accurate-time#ran","syntology_url":"https://syntology.ai/paper/1910.13051","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.13051"}},"official":{"repos":["angus924/rocket"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"url":"/paper/u-time-a-fully-convolutional-network-for-time","slug":"u-time-a-fully-convolutional-network-for-time","title":"U-Time: A Fully Convolutional Network for Time Series Segmentation Applied to Sleep Staging","date":"2019-10-24","arxiv_id":"1910.11162","repositories_listed":5,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":0,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/u-time-a-fully-convolutional-network-for-time#ran","syntology_url":"https://syntology.ai/paper/1910.11162","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.11162"}},"official":null}}],"record_sha256":"eb62610b3030382bf179b6040f8742d779bf6c7443fd9378bdcbd8dd12bdcb9d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}