{"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/inductive-bias/papers/ran/3","list_of":"/task/inductive-bias","task":"Inductive Bias","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":3,"rows_per_page":100,"rows":[201,284],"of":284,"counts":{"archive_papers_tagged":1529,"with_a_code_link":716,"where_syntology_ran_a_sample":284,"not_listed_spam_title":0,"listed":1529,"listed_where_code_ran":284,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":244,"every_run_a_failure_of_syntologys_instrument":40,"listed_with_a_run_with_no_instrument_failure":244,"listed_every_run_a_failure_of_syntologys_instrument":40,"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/inductive-bias/papers/ran/1","prev":"/task/inductive-bias/papers/ran/2","next":null,"papers":[{"url":"/paper/co-training-an-unsupervised-constituency","slug":"co-training-an-unsupervised-constituency","title":"Co-training an Unsupervised Constituency Parser with Weak Supervision","date":"2021-10-05","arxiv_id":"2110.02283","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/co-training-an-unsupervised-constituency#ran","syntology_url":"https://syntology.ai/paper/2110.02283","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2110.02283"}},"official":{"repos":["Nickil21/weakly-supervised-parsing"],"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","unlocated"]}}},{"url":"/paper/the-grammar-learning-trajectories-of-neural","slug":"the-grammar-learning-trajectories-of-neural","title":"The Grammar-Learning Trajectories of Neural Language Models","date":"2021-09-13","arxiv_id":"2109.06096","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/the-grammar-learning-trajectories-of-neural#ran","syntology_url":"https://syntology.ai/paper/2109.06096","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.06096"}},"official":{"repos":["borgr/ordert"],"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/nnformer-interleaved-transformer-for","slug":"nnformer-interleaved-transformer-for","title":"nnFormer: Interleaved Transformer for Volumetric Segmentation","date":"2021-09-07","arxiv_id":"2109.03201","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/nnformer-interleaved-transformer-for#ran","syntology_url":"https://syntology.ai/paper/2109.03201","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.03201"}},"official":{"repos":["282857341/nnformer"],"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/learning-hierarchical-structures-with","slug":"learning-hierarchical-structures-with","title":"Learning Hierarchical Structures with Differentiable Nondeterministic Stacks","date":"2021-09-05","arxiv_id":"2109.01982","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-hierarchical-structures-with#ran","syntology_url":"https://syntology.ai/paper/2109.01982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2109.01982"}},"official":{"repos":["bdusell/nondeterministic-stack-rnn"],"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/rethinking-deep-image-prior-for-denoising","slug":"rethinking-deep-image-prior-for-denoising","title":"Rethinking Deep Image Prior for Denoising","date":"2021-08-29","arxiv_id":"2108.12841","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"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) · 1 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/rethinking-deep-image-prior-for-denoising#ran","syntology_url":"https://syntology.ai/paper/2108.12841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12841"}},"official":{"repos":["gistvision/dip-denosing"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/train-short-test-long-attention-with-linear","slug":"train-short-test-long-attention-with-linear","title":"Train Short, Test Long: Attention with Linear Biases Enables Input Length Extrapolation","date":"2021-08-27","arxiv_id":"2108.12409","repositories_listed":10,"syntology":{"n":16,"n_ran":16,"n_constructed":6,"n_ran_checked":14,"n_instrument":2,"n_unverified":0,"n_honours":4,"n_violates":0,"n_no_contract":10,"n_pointer_only":5,"phrase":"16 ran (of which 6 constructed an object rather than computing a result; 14 with no instrument failure: 4 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/train-short-test-long-attention-with-linear#ran","syntology_url":"https://syntology.ai/paper/2108.12409","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.12409"}},"official":{"repos":["ofirpress/attention_with_linear_biases"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/edge-augmented-graph-transformers-global-self","slug":"edge-augmented-graph-transformers-global-self","title":"Global Self-Attention as a Replacement for Graph Convolution","date":"2021-08-07","arxiv_id":"2108.03348","repositories_listed":3,"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/edge-augmented-graph-transformers-global-self#ran","syntology_url":"https://syntology.ai/paper/2108.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.03348"}},"official":{"repos":["shamim-hussain/egt","shamim-hussain/egt_pytorch","shamim-hussain/egt_triangular"],"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/s-2-mlpv2-improved-spatial-shift-mlp","slug":"s-2-mlpv2-improved-spatial-shift-mlp","title":"S$^2$-MLPv2: Improved Spatial-Shift MLP Architecture for Vision","date":"2021-08-02","arxiv_id":"2108.01072","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":2,"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/s-2-mlpv2-improved-spatial-shift-mlp#ran","syntology_url":"https://syntology.ai/paper/2108.01072","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2108.01072"}},"official":null}},{"url":"/paper/evaluating-relaxations-of-logic-for-neural","slug":"evaluating-relaxations-of-logic-for-neural","title":"Evaluating Relaxations of Logic for Neural Networks: A Comprehensive Study","date":"2021-07-28","arxiv_id":"2107.13646","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/evaluating-relaxations-of-logic-for-neural#ran","syntology_url":"https://syntology.ai/paper/2107.13646","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.13646"}},"official":{"repos":["utahnlp/neural-logic"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/h-transformer-1d-fast-one-dimensional","slug":"h-transformer-1d-fast-one-dimensional","title":"H-Transformer-1D: Fast One-Dimensional Hierarchical Attention for Sequences","date":"2021-07-25","arxiv_id":"2107.11906","repositories_listed":2,"syntology":{"n":10,"n_ran":9,"n_constructed":1,"n_ran_checked":6,"n_instrument":3,"n_unverified":1,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":1,"phrase":"9 ran (of which 1 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/h-transformer-1d-fast-one-dimensional#ran","syntology_url":"https://syntology.ai/paper/2107.11906","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.11906"}},"official":null}},{"url":"/paper/maximum-entropy-weighted-independent-set","slug":"maximum-entropy-weighted-independent-set","title":"Maximum Entropy Weighted Independent Set Pooling for Graph Neural Networks","date":"2021-07-03","arxiv_id":"2107.01410","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":1,"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 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) · 0 unverified","sample_list":"/paper/maximum-entropy-weighted-independent-set#ran","syntology_url":"https://syntology.ai/paper/2107.01410","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.01410"}},"official":{"repos":["mewispool/mewispool"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/the-causal-neural-connection-expressiveness","slug":"the-causal-neural-connection-expressiveness","title":"The Causal-Neural Connection: Expressiveness, Learnability, and Inference","date":"2021-07-02","arxiv_id":"2107.00793","repositories_listed":2,"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":0,"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/the-causal-neural-connection-expressiveness#ran","syntology_url":"https://syntology.ai/paper/2107.00793","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00793"}},"official":{"repos":["causalailab/neuralcausalmodels"],"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/generalization-and-robustness-implications-in","slug":"generalization-and-robustness-implications-in","title":"Generalization and Robustness Implications in Object-Centric Learning","date":"2021-07-01","arxiv_id":"2107.00637","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/generalization-and-robustness-implications-in#ran","syntology_url":"https://syntology.ai/paper/2107.00637","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2107.00637"}},"official":{"repos":["addtt/object-centric-library"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/resvit-residual-vision-transformers-for-multi","slug":"resvit-residual-vision-transformers-for-multi","title":"ResViT: Residual vision transformers for multi-modal medical image synthesis","date":"2021-06-30","arxiv_id":"2106.16031","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":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/resvit-residual-vision-transformers-for-multi#ran","syntology_url":"https://syntology.ai/paper/2106.16031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.16031"}},"official":{"repos":["icon-lab/ResViT"],"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/video-swin-transformer","slug":"video-swin-transformer","title":"Video Swin Transformer","date":"2021-06-24","arxiv_id":"2106.13230","repositories_listed":15,"syntology":{"n":32,"n_ran":19,"n_constructed":0,"n_ran_checked":14,"n_instrument":5,"n_unverified":13,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":7,"phrase":"19 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; 5 where Syntology's instrument failed) · 13 unverified","sample_list":"/paper/video-swin-transformer#ran","syntology_url":"https://syntology.ai/paper/2106.13230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.13230"}},"official":{"repos":["SwinTransformer/Video-Swin-Transformer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/charformer-fast-character-transformers-via","slug":"charformer-fast-character-transformers-via","title":"Charformer: Fast Character Transformers via Gradient-based Subword Tokenization","date":"2021-06-23","arxiv_id":"2106.12672","repositories_listed":2,"syntology":{"n":10,"n_ran":7,"n_constructed":3,"n_ran_checked":4,"n_instrument":3,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":3,"n_pointer_only":0,"phrase":"7 ran (of which 3 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/charformer-fast-character-transformers-via#ran","syntology_url":"https://syntology.ai/paper/2106.12672","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12672"}},"official":{"repos":["google-research/google-research"],"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/volume-rendering-of-neural-implicit-surfaces","slug":"volume-rendering-of-neural-implicit-surfaces","title":"Volume Rendering of Neural Implicit Surfaces","date":"2021-06-22","arxiv_id":"2106.12052","repositories_listed":3,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":6,"n_instrument":3,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":1,"phrase":"9 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; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/volume-rendering-of-neural-implicit-surfaces#ran","syntology_url":"https://syntology.ai/paper/2106.12052","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.12052"}},"official":null}},{"url":"/paper/how-to-train-your-vit-data-augmentation-and","slug":"how-to-train-your-vit-data-augmentation-and","title":"How to train your ViT? Data, Augmentation, and Regularization in Vision Transformers","date":"2021-06-18","arxiv_id":"2106.10270","repositories_listed":16,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":0,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-to-train-your-vit-data-augmentation-and#ran","syntology_url":"https://syntology.ai/paper/2106.10270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.10270"}},"official":{"repos":["google-research/big_vision","google-research/vision_transformer","rwightman/pytorch-image-models"],"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/coatnet-marrying-convolution-and-attention","slug":"coatnet-marrying-convolution-and-attention","title":"CoAtNet: Marrying Convolution and Attention for All Data Sizes","date":"2021-06-09","arxiv_id":"2106.04803","repositories_listed":14,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/coatnet-marrying-convolution-and-attention#ran","syntology_url":"https://syntology.ai/paper/2106.04803","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.04803"}},"official":null}},{"url":"/paper/vitae-vision-transformer-advanced-by","slug":"vitae-vision-transformer-advanced-by","title":"ViTAE: Vision Transformer Advanced by Exploring Intrinsic Inductive Bias","date":"2021-06-07","arxiv_id":"2106.03348","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/vitae-vision-transformer-advanced-by#ran","syntology_url":"https://syntology.ai/paper/2106.03348","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03348"}},"official":{"repos":["Annbless/ViTAE"],"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":["unlocated"]}}},{"url":"/paper/efficient-training-of-visual-transformers","slug":"efficient-training-of-visual-transformers","title":"Efficient Training of Visual Transformers with Small Datasets","date":"2021-06-07","arxiv_id":"2106.03746","repositories_listed":1,"syntology":{"n":19,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":3,"n_honours":1,"n_violates":1,"n_no_contract":10,"n_pointer_only":19,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 1 violated, 10 with no contract checked; 4 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/efficient-training-of-visual-transformers#ran","syntology_url":"https://syntology.ai/paper/2106.03746","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03746"}},"official":{"repos":["yhlleo/VTs-Drloc"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/on-inductive-biases-for-heterogeneous","slug":"on-inductive-biases-for-heterogeneous","title":"On Inductive Biases for Heterogeneous Treatment Effect Estimation","date":"2021-06-07","arxiv_id":"2106.03765","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/on-inductive-biases-for-heterogeneous#ran","syntology_url":"https://syntology.ai/paper/2106.03765","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03765"}},"official":{"repos":["AliciaCurth/CATENets"],"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/semi-riemannian-graph-convolutional-networks","slug":"semi-riemannian-graph-convolutional-networks","title":"Pseudo-Riemannian Graph Convolutional Networks","date":"2021-06-06","arxiv_id":"2106.03134","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":1,"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/semi-riemannian-graph-convolutional-networks#ran","syntology_url":"https://syntology.ai/paper/2106.03134","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.03134"}},"official":{"repos":["xiongbo010/qgcn"],"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/examining-the-inductive-bias-of-neural","slug":"examining-the-inductive-bias-of-neural","title":"Examining the Inductive Bias of Neural Language Models with Artificial Languages","date":"2021-06-02","arxiv_id":"2106.01044","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":0,"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/examining-the-inductive-bias-of-neural#ran","syntology_url":"https://syntology.ai/paper/2106.01044","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01044"}},"official":{"repos":["rycolab/artificial-languages"],"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/container-context-aggregation-network","slug":"container-context-aggregation-network","title":"Container: Context Aggregation Network","date":"2021-06-02","arxiv_id":"2106.01401","repositories_listed":4,"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":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) · 3 unverified","sample_list":"/paper/container-context-aggregation-network#ran","syntology_url":"https://syntology.ai/paper/2106.01401","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2106.01401"}},"official":{"repos":["allenai/container","gaopengcuhk/Container"],"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":["listed","official"]}}},{"url":"/paper/g-transformer-for-document-level-machine","slug":"g-transformer-for-document-level-machine","title":"G-Transformer for Document-level Machine Translation","date":"2021-05-31","arxiv_id":"2105.14761","repositories_listed":1,"syntology":{"n":2,"n_ran":2,"n_constructed":2,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"phrase":"2 ran (of which 2 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) · 0 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/g-transformer-for-document-level-machine#ran","syntology_url":"https://syntology.ai/paper/2105.14761","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.14761"}},"official":{"repos":["baoguangsheng/g-transformer"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":2,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/backdoor-attacks-on-self-supervised-learning","slug":"backdoor-attacks-on-self-supervised-learning","title":"Backdoor Attacks on Self-Supervised Learning","date":"2021-05-21","arxiv_id":"2105.10123","repositories_listed":2,"syntology":{"n":13,"n_ran":11,"n_constructed":0,"n_ran_checked":5,"n_instrument":6,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":4,"n_pointer_only":8,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/backdoor-attacks-on-self-supervised-learning#ran","syntology_url":"https://syntology.ai/paper/2105.10123","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.10123"}},"official":{"repos":["UMBCvision/SSL-Backdoor"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/learning-visible-connectivity-dynamics-for","slug":"learning-visible-connectivity-dynamics-for","title":"Learning Visible Connectivity Dynamics for Cloth Smoothing","date":"2021-05-21","arxiv_id":"2105.10389","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/learning-visible-connectivity-dynamics-for#ran","syntology_url":"https://syntology.ai/paper/2105.10389","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.10389"}},"official":{"repos":["Xingyu-Lin/VCD"],"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/medical-image-segmentation-using-squeeze-and","slug":"medical-image-segmentation-using-squeeze-and","title":"Medical Image Segmentation Using Squeeze-and-Expansion Transformers","date":"2021-05-20","arxiv_id":"2105.09511","repositories_listed":2,"syntology":{"n":20,"n_ran":13,"n_constructed":8,"n_ran_checked":11,"n_instrument":2,"n_unverified":7,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":20,"phrase":"13 ran (of which 8 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 2 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/medical-image-segmentation-using-squeeze-and#ran","syntology_url":"https://syntology.ai/paper/2105.09511","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2105.09511"}},"official":{"repos":["askerlee/segtran"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":8,"n_ran_no_instrument_failure":11,"n_unverified":7,"ran_from_kinds":["official"]}}},{"url":"/paper/amr-parsing-with-action-pointer-transformer","slug":"amr-parsing-with-action-pointer-transformer","title":"AMR Parsing with Action-Pointer Transformer","date":"2021-04-29","arxiv_id":"2104.14674","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":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) · 1 unverified","sample_list":"/paper/amr-parsing-with-action-pointer-transformer#ran","syntology_url":"https://syntology.ai/paper/2104.14674","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.14674"}},"official":null}},{"url":"/paper/on-the-inductive-bias-of-masked-language","slug":"on-the-inductive-bias-of-masked-language","title":"On the Inductive Bias of Masked Language Modeling: From Statistical to Syntactic Dependencies","date":"2021-04-12","arxiv_id":"2104.05694","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/on-the-inductive-bias-of-masked-language#ran","syntology_url":"https://syntology.ai/paper/2104.05694","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.05694"}},"official":{"repos":["tatsu-lab/mlm_inductive_bias"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/support-target-protocol-for-meta-learning","slug":"support-target-protocol-for-meta-learning","title":"Towards Enabling Meta-Learning from Target Models","date":"2021-04-08","arxiv_id":"2104.03736","repositories_listed":1,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":4,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":4,"n_pointer_only":2,"phrase":"6 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; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/support-target-protocol-for-meta-learning#ran","syntology_url":"https://syntology.ai/paper/2104.03736","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.03736"}},"official":{"repos":["njulus/ST"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/contrastive-syn-to-real-generalization-1","slug":"contrastive-syn-to-real-generalization-1","title":"Contrastive Syn-to-Real Generalization","date":"2021-04-06","arxiv_id":"2104.02290","repositories_listed":2,"syntology":{"n":4,"n_ran":3,"n_constructed":1,"n_ran_checked":3,"n_instrument":0,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/contrastive-syn-to-real-generalization-1#ran","syntology_url":"https://syntology.ai/paper/2104.02290","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2104.02290"}},"official":{"repos":["NVlabs/CSG"],"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":["listed","official"]}}},{"url":"/paper/picie-unsupervised-semantic-segmentation","slug":"picie-unsupervised-semantic-segmentation","title":"PiCIE: Unsupervised Semantic Segmentation using Invariance and Equivariance in Clustering","date":"2021-03-30","arxiv_id":"2103.17070","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":2,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":1,"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) · 2 unverified; every one of the 2 samples that ran constructed an object rather than computing a result","sample_list":"/paper/picie-unsupervised-semantic-segmentation#ran","syntology_url":"https://syntology.ai/paper/2103.17070","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.17070"}},"official":{"repos":["janghyuncho/PiCIE"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/rethinking-neural-operations-for-diverse","slug":"rethinking-neural-operations-for-diverse","title":"Rethinking Neural Operations for Diverse Tasks","date":"2021-03-29","arxiv_id":"2103.15798","repositories_listed":3,"syntology":{"n":34,"n_ran":22,"n_constructed":8,"n_ran_checked":17,"n_instrument":5,"n_unverified":12,"n_honours":3,"n_violates":0,"n_no_contract":14,"n_pointer_only":1,"phrase":"22 ran (of which 8 constructed an object rather than computing a result; 17 with no instrument failure: 3 honoured, 0 violated, 14 with no contract checked; 5 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/rethinking-neural-operations-for-diverse#ran","syntology_url":"https://syntology.ai/paper/2103.15798","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2103.15798"}},"official":{"repos":["mkhodak/relax","nick11roberts/XD"],"state":"official (archive's flag): 22 ran","n_ran":22,"n_constructed":8,"n_ran_no_instrument_failure":17,"n_unverified":11,"ran_from_kinds":["official"]}}},{"url":"/paper/sstvos-sparse-spatiotemporal-transformers-for","slug":"sstvos-sparse-spatiotemporal-transformers-for","title":"SSTVOS: Sparse Spatiotemporal Transformers for Video Object Segmentation","date":"2021-01-21","arxiv_id":"2101.08833","repositories_listed":1,"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":7,"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/sstvos-sparse-spatiotemporal-transformers-for#ran","syntology_url":"https://syntology.ai/paper/2101.08833","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.08833"}},"official":{"repos":["dukebw/SSTVOS"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":5,"n_ran_no_instrument_failure":5,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/lime-learning-inductive-bias-for-primitives-1","slug":"lime-learning-inductive-bias-for-primitives-1","title":"LIME: Learning Inductive Bias for Primitives of Mathematical Reasoning","date":"2021-01-15","arxiv_id":"2101.06223","repositories_listed":1,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":3,"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) · 1 unverified","sample_list":"/paper/lime-learning-inductive-bias-for-primitives-1#ran","syntology_url":"https://syntology.ai/paper/2101.06223","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2101.06223"}},"official":{"repos":["tonywu95/lime"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/a-generalization-of-transformer-networks-to","slug":"a-generalization-of-transformer-networks-to","title":"A Generalization of Transformer Networks to Graphs","date":"2020-12-17","arxiv_id":"2012.09699","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/a-generalization-of-transformer-networks-to#ran","syntology_url":"https://syntology.ai/paper/2012.09699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09699"}},"official":{"repos":["graphdeeplearning/graphtransformer"],"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":["official"]}}},{"url":"/paper/taming-transformers-for-high-resolution-image","slug":"taming-transformers-for-high-resolution-image","title":"Taming Transformers for High-Resolution Image Synthesis","date":"2020-12-17","arxiv_id":"2012.09841","repositories_listed":13,"syntology":{"n":6,"n_ran":6,"n_constructed":0,"n_ran_checked":2,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":4,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 1 violated, 0 with no contract checked; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/taming-transformers-for-high-resolution-image#ran","syntology_url":"https://syntology.ai/paper/2012.09841","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.09841"}},"official":{"repos":["CompVis/taming-transformers"],"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":["listed","official","unlocated"]}}},{"url":"/paper/inductive-bias-and-language-expressivity-in","slug":"inductive-bias-and-language-expressivity-in","title":"Inductive Bias and Language Expressivity in Emergent Communication","date":"2020-12-04","arxiv_id":"2012.02875","repositories_listed":1,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":2,"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; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/inductive-bias-and-language-expressivity-in#ran","syntology_url":"https://syntology.ai/paper/2012.02875","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2012.02875"}},"official":{"repos":["Shawn-Guo-CN/GameBias-EmeCom2020"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/learning-to-represent-action-values-as-a-1","slug":"learning-to-represent-action-values-as-a-1","title":"Learning to Represent Action Values as a Hypergraph on the Action Vertices","date":"2020-10-28","arxiv_id":"2010.14680","repositories_listed":1,"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/learning-to-represent-action-values-as-a-1#ran","syntology_url":"https://syntology.ai/paper/2010.14680","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.14680"}},"official":{"repos":["atavakol/action-hypergraph-networks"],"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/parameter-norm-growth-during-training-of","slug":"parameter-norm-growth-during-training-of","title":"Effects of Parameter Norm Growth During Transformer Training: Inductive Bias from Gradient Descent","date":"2020-10-19","arxiv_id":"2010.09697","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":1,"n_instrument":5,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/parameter-norm-growth-during-training-of#ran","syntology_url":"https://syntology.ai/paper/2010.09697","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2010.09697"}},"official":{"repos":["viking-sudo-rm/norm-growth"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/grappa-grammar-augmented-pre-training-for","slug":"grappa-grammar-augmented-pre-training-for","title":"GraPPa: Grammar-Augmented Pre-Training for Table Semantic Parsing","date":"2020-09-29","arxiv_id":"2009.13845","repositories_listed":1,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":0,"n_instrument":6,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":7,"phrase":"6 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; 6 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/grappa-grammar-augmented-pre-training-for#ran","syntology_url":"https://syntology.ai/paper/2009.13845","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2009.13845"}},"official":null}},{"url":"/paper/self-sampling-for-neural-point-cloud","slug":"self-sampling-for-neural-point-cloud","title":"Self-Sampling for Neural Point Cloud Consolidation","date":"2020-08-14","arxiv_id":"2008.06471","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/self-sampling-for-neural-point-cloud#ran","syntology_url":"https://syntology.ai/paper/2008.06471","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2008.06471"}},"official":{"repos":["galmetzer/self-sample"],"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/learning-to-plan-with-uncertain-topological","slug":"learning-to-plan-with-uncertain-topological","title":"Learning to plan with uncertain topological maps","date":"2020-07-10","arxiv_id":"2007.05270","repositories_listed":1,"syntology":{"n":4,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":3,"n_pointer_only":1,"phrase":"4 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; 1 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/learning-to-plan-with-uncertain-topological#ran","syntology_url":"https://syntology.ai/paper/2007.05270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.05270"}},"official":null}},{"url":"/paper/statistical-mechanics-of-generalization-in","slug":"statistical-mechanics-of-generalization-in","title":"Spectral Bias and Task-Model Alignment Explain Generalization in Kernel Regression and Infinitely Wide Neural Networks","date":"2020-06-23","arxiv_id":"2006.13198","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/statistical-mechanics-of-generalization-in#ran","syntology_url":"https://syntology.ai/paper/2006.13198","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.13198"}},"official":{"repos":["Pehlevan-Group/kernel-generalization"],"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/improving-image-captioning-with-better-use-of-1","slug":"improving-image-captioning-with-better-use-of-1","title":"Improving Image Captioning with Better Use of Captions","date":"2020-06-21","arxiv_id":"2006.11807","repositories_listed":1,"syntology":{"n":2,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/improving-image-captioning-with-better-use-of-1#ran","syntology_url":"https://syntology.ai/paper/2006.11807","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.11807"}},"official":{"repos":["Gitsamshi/WeakVRD-Captioning"],"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/neural-anisotropy-directions","slug":"neural-anisotropy-directions","title":"Neural Anisotropy Directions","date":"2020-06-17","arxiv_id":"2006.09717","repositories_listed":2,"syntology":{"n":9,"n_ran":4,"n_constructed":2,"n_ran_checked":2,"n_instrument":2,"n_unverified":5,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"4 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; 2 where Syntology's instrument failed) · 5 unverified","sample_list":"/paper/neural-anisotropy-directions#ran","syntology_url":"https://syntology.ai/paper/2006.09717","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09717"}},"official":{"repos":["LTS4/neural-anisotropy-directions"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/categorical-normalizing-flows-via-continuous","slug":"categorical-normalizing-flows-via-continuous","title":"Categorical Normalizing Flows via Continuous Transformations","date":"2020-06-17","arxiv_id":"2006.09790","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/categorical-normalizing-flows-via-continuous#ran","syntology_url":"https://syntology.ai/paper/2006.09790","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.09790"}},"official":{"repos":["phlippe/CategoricalNF"],"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/counterexample-guided-learning-of-monotonic","slug":"counterexample-guided-learning-of-monotonic","title":"Counterexample-Guided Learning of Monotonic Neural Networks","date":"2020-06-16","arxiv_id":"2006.08852","repositories_listed":1,"syntology":{"n":18,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/counterexample-guided-learning-of-monotonic#ran","syntology_url":"https://syntology.ai/paper/2006.08852","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08852"}},"official":{"repos":["AishwaryaSivaraman/COMET"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":6,"ran_from_kinds":["official"]}}},{"url":"/paper/neural-networks-fail-to-learn-periodic","slug":"neural-networks-fail-to-learn-periodic","title":"Neural Networks Fail to Learn Periodic Functions and How to Fix It","date":"2020-06-15","arxiv_id":"2006.08195","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":2,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":0,"phrase":"3 ran (of which 2 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/neural-networks-fail-to-learn-periodic#ran","syntology_url":"https://syntology.ai/paper/2006.08195","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.08195"}},"official":{"repos":["AdenosHermes/NeurIPS_2020_Snake"],"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/how-interpretable-and-trustworthy-are-gams","slug":"how-interpretable-and-trustworthy-are-gams","title":"How Interpretable and Trustworthy are GAMs?","date":"2020-06-11","arxiv_id":"2006.06466","repositories_listed":2,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":3,"n_instrument":0,"n_unverified":0,"n_honours":3,"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; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/how-interpretable-and-trustworthy-are-gams#ran","syntology_url":"https://syntology.ai/paper/2006.06466","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.06466"}},"official":{"repos":["zzzace2000/GAMs"],"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/learning-the-geometry-of-wave-based-imaging","slug":"learning-the-geometry-of-wave-based-imaging","title":"Learning the geometry of wave-based imaging","date":"2020-06-10","arxiv_id":"2006.05854","repositories_listed":1,"syntology":{"n":9,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/learning-the-geometry-of-wave-based-imaging#ran","syntology_url":"https://syntology.ai/paper/2006.05854","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2006.05854"}},"official":null}},{"url":"/paper/expbert-representation-engineering-with","slug":"expbert-representation-engineering-with","title":"ExpBERT: Representation Engineering with Natural Language Explanations","date":"2020-05-05","arxiv_id":"2005.01932","repositories_listed":2,"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/expbert-representation-engineering-with#ran","syntology_url":"https://syntology.ai/paper/2005.01932","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.01932"}},"official":{"repos":["MurtyShikhar/ExpBERT","worksheets.codalab.org/worksheets/0x609d2d6a66194592a7f44fbb67ba9f49"],"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/revisiting-unsupervised-relation-extraction","slug":"revisiting-unsupervised-relation-extraction","title":"Revisiting Unsupervised Relation Extraction","date":"2020-04-30","arxiv_id":"2005.00087","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/revisiting-unsupervised-relation-extraction#ran","syntology_url":"https://syntology.ai/paper/2005.00087","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2005.00087"}},"official":{"repos":["ttthy/ure"],"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":["found_in_text"]}}},{"url":"/paper/vign-variational-integrator-graph-networks","slug":"vign-variational-integrator-graph-networks","title":"Variational Integrator Graph Networks for Learning Energy Conserving Dynamical Systems","date":"2020-04-28","arxiv_id":"2004.13688","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/vign-variational-integrator-graph-networks#ran","syntology_url":"https://syntology.ai/paper/2004.13688","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2004.13688"}},"official":null}},{"url":"/paper/learning-to-encode-position-for-transformer","slug":"learning-to-encode-position-for-transformer","title":"Learning to Encode Position for Transformer with Continuous Dynamical Model","date":"2020-03-13","arxiv_id":"2003.09229","repositories_listed":1,"syntology":{"n":6,"n_ran":3,"n_constructed":2,"n_ran_checked":1,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":6,"phrase":"3 ran (of which 2 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) · 3 unverified","sample_list":"/paper/learning-to-encode-position-for-transformer#ran","syntology_url":"https://syntology.ai/paper/2003.09229","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.09229"}},"official":null}},{"url":"/paper/pushnet-efficient-and-adaptive-neural-message","slug":"pushnet-efficient-and-adaptive-neural-message","title":"PushNet: Efficient and Adaptive Neural Message Passing","date":"2020-03-04","arxiv_id":"2003.02228","repositories_listed":1,"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/pushnet-efficient-and-adaptive-neural-message#ran","syntology_url":"https://syntology.ai/paper/2003.02228","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2003.02228"}},"official":{"repos":["buschju/pushnet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/neurips-2019-disentanglement-challenge-1","slug":"neurips-2019-disentanglement-challenge-1","title":"NeurIPS 2019 Disentanglement Challenge: Improved Disentanglement through Learned Aggregation of Convolutional Feature Maps","date":"2020-02-27","arxiv_id":"2002.12356","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":2,"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/neurips-2019-disentanglement-challenge-1#ran","syntology_url":"https://syntology.ai/paper/2002.12356","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.12356"}},"official":{"repos":["mseitzer/neurips2019-disentanglement-challenge"],"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/an-inductive-bias-for-distances-neural-nets-1","slug":"an-inductive-bias-for-distances-neural-nets-1","title":"An Inductive Bias for Distances: Neural Nets that Respect the Triangle Inequality","date":"2020-02-14","arxiv_id":"2002.05825","repositories_listed":2,"syntology":{"n":5,"n_ran":5,"n_constructed":3,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":5,"phrase":"5 ran (of which 3 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) · 0 unverified","sample_list":"/paper/an-inductive-bias-for-distances-neural-nets-1#ran","syntology_url":"https://syntology.ai/paper/2002.05825","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2002.05825"}},"official":{"repos":["spitis/deepnorms"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":3,"n_ran_no_instrument_failure":5,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/less-confusion-more-transferable-minimum","slug":"less-confusion-more-transferable-minimum","title":"Minimum Class Confusion for Versatile Domain Adaptation","date":"2019-12-08","arxiv_id":"1912.03699","repositories_listed":3,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":1,"n_instrument":0,"n_unverified":3,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/less-confusion-more-transferable-minimum#ran","syntology_url":"https://syntology.ai/paper/1912.03699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03699"}},"official":{"repos":["thuml/Versatile-Domain-Adaptation"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/inductive-relation-prediction-on-knowledge","slug":"inductive-relation-prediction-on-knowledge","title":"Inductive Relation Prediction by Subgraph Reasoning","date":"2019-11-16","arxiv_id":"1911.06962","repositories_listed":10,"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/inductive-relation-prediction-on-knowledge#ran","syntology_url":"https://syntology.ai/paper/1911.06962","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.06962"}},"official":{"repos":["kkteru/grail"],"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/meta-learning-with-warped-gradient-descent","slug":"meta-learning-with-warped-gradient-descent","title":"Meta-Learning with Warped Gradient Descent","date":"2019-08-30","arxiv_id":"1909.00025","repositories_listed":1,"syntology":{"n":16,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"12 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 0 honoured, 0 violated, 12 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/meta-learning-with-warped-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/1909.00025","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.00025"}},"official":{"repos":["flennerhag/warpgrad"],"state":"official (archive's flag): 12 ran","n_ran":12,"n_constructed":0,"n_ran_no_instrument_failure":12,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/on-the-transfer-of-inductive-bias-from","slug":"on-the-transfer-of-inductive-bias-from","title":"On the Transfer of Inductive Bias from Simulation to the Real World: a New Disentanglement Dataset","date":"2019-06-07","arxiv_id":"1906.03292","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":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/on-the-transfer-of-inductive-bias-from#ran","syntology_url":"https://syntology.ai/paper/1906.03292","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.03292"}},"official":{"repos":["rr-learning/disentanglement_dataset"],"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/190600271","slug":"190600271","title":"GLAD: Learning Sparse Graph Recovery","date":"2019-06-01","arxiv_id":"1906.00271","repositories_listed":1,"syntology":{"n":4,"n_ran":1,"n_constructed":0,"n_ran_checked":0,"n_instrument":1,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":4,"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) · 3 unverified","sample_list":"/paper/190600271#ran","syntology_url":"https://syntology.ai/paper/1906.00271","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00271"}},"official":{"repos":["Harshs27/GLAD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/subspace-networks-for-few-shot-classification","slug":"subspace-networks-for-few-shot-classification","title":"Regression Networks for Meta-Learning Few-Shot Classification","date":"2019-05-31","arxiv_id":"1905.13613","repositories_listed":1,"syntology":{"n":11,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":2,"phrase":"7 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; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/subspace-networks-for-few-shot-classification#ran","syntology_url":"https://syntology.ai/paper/1905.13613","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13613"}},"official":{"repos":["ArnoutDevos/RegressionNet"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/semantically-conditioned-dialog-response","slug":"semantically-conditioned-dialog-response","title":"Semantically Conditioned Dialog Response Generation via Hierarchical Disentangled Self-Attention","date":"2019-05-30","arxiv_id":"1905.12866","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 1 unverified","sample_list":"/paper/semantically-conditioned-dialog-response#ran","syntology_url":"https://syntology.ai/paper/1905.12866","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.12866"}},"official":{"repos":["budzianowski/multiwoz","wenhuchen/HDSA-Dialog"],"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","unlocated"]}}},{"url":"/paper/190513077","slug":"190513077","title":"A Hierarchical Probabilistic U-Net for Modeling Multi-Scale Ambiguities","date":"2019-05-30","arxiv_id":"1905.13077","repositories_listed":4,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":1,"n_honours":1,"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; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/190513077#ran","syntology_url":"https://syntology.ai/paper/1905.13077","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.13077"}},"official":null}},{"url":"/paper/physics-as-inverse-graphics-joint","slug":"physics-as-inverse-graphics-joint","title":"Physics-as-Inverse-Graphics: Unsupervised Physical Parameter Estimation from Video","date":"2019-05-27","arxiv_id":"1905.11169","repositories_listed":1,"syntology":{"n":13,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":7,"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) · 7 unverified","sample_list":"/paper/physics-as-inverse-graphics-joint#ran","syntology_url":"https://syntology.ai/paper/1905.11169","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11169"}},"official":null}},{"url":"/paper/bivariate-beta-lstm","slug":"bivariate-beta-lstm","title":"Bivariate Beta-LSTM","date":"2019-05-25","arxiv_id":"1905.10521","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/bivariate-beta-lstm#ran","syntology_url":"https://syntology.ai/paper/1905.10521","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.10521"}},"official":{"repos":["gtshs2/BetaLSTM"],"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/knowledge-graph-convolutional-networks-for","slug":"knowledge-graph-convolutional-networks-for","title":"Knowledge-aware Graph Neural Networks with Label Smoothness Regularization for Recommender Systems","date":"2019-05-11","arxiv_id":"1905.04413","repositories_listed":6,"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/knowledge-graph-convolutional-networks-for#ran","syntology_url":"https://syntology.ai/paper/1905.04413","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.04413"}},"official":null}},{"url":"/paper/explainable-and-explicit-visual-reasoning","slug":"explainable-and-explicit-visual-reasoning","title":"Explainable and Explicit Visual Reasoning over Scene Graphs","date":"2018-12-05","arxiv_id":"1812.01855","repositories_listed":2,"syntology":{"n":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_honours":0,"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; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/explainable-and-explicit-visual-reasoning#ran","syntology_url":"https://syntology.ai/paper/1812.01855","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01855"}},"official":{"repos":["shijx12/XNM-Net"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["official"]}}},{"url":"/paper/the-effect-of-heterogeneous-data-for","slug":"the-effect-of-heterogeneous-data-for","title":"The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech","date":"2018-11-29","arxiv_id":"1811.12254","repositories_listed":1,"syntology":{"n":9,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/the-effect-of-heterogeneous-data-for#ran","syntology_url":"https://syntology.ai/paper/1811.12254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.12254"}},"official":null}},{"url":"/paper/a-hierarchical-multi-task-approach-for","slug":"a-hierarchical-multi-task-approach-for","title":"A Hierarchical Multi-task Approach for Learning Embeddings from Semantic Tasks","date":"2018-11-14","arxiv_id":"1811.06031","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/a-hierarchical-multi-task-approach-for#ran","syntology_url":"https://syntology.ai/paper/1811.06031","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.06031"}},"official":null}},{"url":"/paper/bias-and-generalization-in-deep-generative","slug":"bias-and-generalization-in-deep-generative","title":"Bias and Generalization in Deep Generative Models: An Empirical Study","date":"2018-11-08","arxiv_id":"1811.03259","repositories_listed":2,"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/bias-and-generalization-in-deep-generative#ran","syntology_url":"https://syntology.ai/paper/1811.03259","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1811.03259"}},"official":{"repos":["ermongroup/BiasAndGeneralization"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":["unlocated"]}}},{"url":"/paper/ordered-neurons-integrating-tree-structures","slug":"ordered-neurons-integrating-tree-structures","title":"Ordered Neurons: Integrating Tree Structures into Recurrent Neural Networks","date":"2018-10-22","arxiv_id":"1810.09536","repositories_listed":7,"syntology":{"n":12,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":1,"n_honours":1,"n_violates":0,"n_no_contract":8,"n_pointer_only":2,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/ordered-neurons-integrating-tree-structures#ran","syntology_url":"https://syntology.ai/paper/1810.09536","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.09536"}},"official":{"repos":["yikangshen/Ordered-Neurons"],"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":["listed","official"]}}},{"url":"/paper/multi-task-learning-as-multi-objective","slug":"multi-task-learning-as-multi-objective","title":"Multi-Task Learning as Multi-Objective Optimization","date":"2018-10-10","arxiv_id":"1810.04650","repositories_listed":7,"syntology":{"n":19,"n_ran":17,"n_constructed":0,"n_ran_checked":15,"n_instrument":2,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":15,"n_pointer_only":1,"phrase":"17 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 0 honoured, 0 violated, 15 with no contract checked; 2 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/multi-task-learning-as-multi-objective#ran","syntology_url":"https://syntology.ai/paper/1810.04650","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1810.04650"}},"official":{"repos":["IntelVCL/MultiObjectiveOptimization"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/universal-transformers","slug":"universal-transformers","title":"Universal Transformers","date":"2018-07-10","arxiv_id":"1807.03819","repositories_listed":8,"syntology":{"n":25,"n_ran":17,"n_constructed":8,"n_ran_checked":17,"n_instrument":0,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":16,"n_pointer_only":24,"phrase":"17 ran (of which 8 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/universal-transformers#ran","syntology_url":"https://syntology.ai/paper/1807.03819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.03819"}},"official":{"repos":["tensorflow/tensor2tensor"],"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/deep-variational-reinforcement-learning-for","slug":"deep-variational-reinforcement-learning-for","title":"Deep Variational Reinforcement Learning for POMDPs","date":"2018-06-06","arxiv_id":"1806.02426","repositories_listed":1,"syntology":{"n":9,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/deep-variational-reinforcement-learning-for#ran","syntology_url":"https://syntology.ai/paper/1806.02426","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.02426"}},"official":{"repos":["maximilianigl/DVRL"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/graph-networks-as-learnable-physics-engines","slug":"graph-networks-as-learnable-physics-engines","title":"Graph networks as learnable physics engines for inference and control","date":"2018-06-04","arxiv_id":"1806.01242","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/graph-networks-as-learnable-physics-engines#ran","syntology_url":"https://syntology.ai/paper/1806.01242","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01242"}},"official":null}},{"url":"/paper/relational-inductive-biases-deep-learning-and","slug":"relational-inductive-biases-deep-learning-and","title":"Relational inductive biases, deep learning, and graph networks","date":"2018-06-04","arxiv_id":"1806.01261","repositories_listed":31,"syntology":{"n":51,"n_ran":39,"n_constructed":5,"n_ran_checked":39,"n_instrument":0,"n_unverified":12,"n_honours":4,"n_violates":0,"n_no_contract":35,"n_pointer_only":15,"phrase":"39 ran (of which 5 constructed an object rather than computing a result; 39 with no instrument failure: 4 honoured, 0 violated, 35 with no contract checked; 0 where Syntology's instrument failed) · 12 unverified","sample_list":"/paper/relational-inductive-biases-deep-learning-and#ran","syntology_url":"https://syntology.ai/paper/1806.01261","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.01261"}},"official":{"repos":["deepmind/graph_nets"],"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/explicit-inductive-bias-for-transfer-learning","slug":"explicit-inductive-bias-for-transfer-learning","title":"Explicit Inductive Bias for Transfer Learning with Convolutional Networks","date":"2018-02-05","arxiv_id":"1802.01483","repositories_listed":3,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/explicit-inductive-bias-for-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1802.01483","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.01483"}},"official":null}},{"url":"/paper/deep-image-prior","slug":"deep-image-prior","title":"Deep Image Prior","date":"2017-11-29","arxiv_id":"1711.10925","repositories_listed":14,"syntology":{"n":6,"n_ran":5,"n_constructed":0,"n_ran_checked":0,"n_instrument":5,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":0,"n_pointer_only":6,"phrase":"5 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; 5 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/deep-image-prior#ran","syntology_url":"https://syntology.ai/paper/1711.10925","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1711.10925"}},"official":null}},{"url":"/paper/prototypical-networks-for-few-shot-learning","slug":"prototypical-networks-for-few-shot-learning","title":"Prototypical Networks for Few-shot Learning","date":"2017-03-15","arxiv_id":"1703.05175","repositories_listed":43,"syntology":{"n":64,"n_ran":50,"n_constructed":14,"n_ran_checked":29,"n_instrument":21,"n_unverified":14,"n_honours":5,"n_violates":0,"n_no_contract":24,"n_pointer_only":19,"phrase":"50 ran (of which 14 constructed an object rather than computing a result; 29 with no instrument failure: 5 honoured, 0 violated, 24 with no contract checked; 21 where Syntology's instrument failed) · 14 unverified","sample_list":"/paper/prototypical-networks-for-few-shot-learning#ran","syntology_url":"https://syntology.ai/paper/1703.05175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.05175"}},"official":{"repos":["jakesnell/prototypical-networks"],"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","unlocated"]}}}],"record_sha256":"1f645089764593150cc290b9f184886725d8e29196751e36de89f9e9c7672f37","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}