{"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/transfer-learning/papers/ran/7","list_of":"/task/transfer-learning","task":"Transfer Learning","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":7,"pages_in_order":7,"rows_per_page":100,"rows":[601,692],"of":692,"counts":{"archive_papers_tagged":10307,"with_a_code_link":3502,"where_syntology_ran_a_sample":692,"not_listed_spam_title":0,"listed":10307,"listed_where_code_ran":692,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":563,"every_run_a_failure_of_syntologys_instrument":129,"listed_with_a_run_with_no_instrument_failure":563,"listed_every_run_a_failure_of_syntologys_instrument":129,"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/transfer-learning/papers/ran/1","prev":"/task/transfer-learning/papers/ran/6","next":null,"papers":[{"url":"/paper/dreaming-to-distill-data-free-knowledge","slug":"dreaming-to-distill-data-free-knowledge","title":"Dreaming to Distill: Data-free Knowledge Transfer via DeepInversion","date":"2019-12-18","arxiv_id":"1912.08795","repositories_listed":2,"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":2,"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/dreaming-to-distill-data-free-knowledge#ran","syntology_url":"https://syntology.ai/paper/1912.08795","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.08795"}},"official":{"repos":["NVlabs/DeepInversion"],"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/a-new-benchmark-for-evaluation-of-cross","slug":"a-new-benchmark-for-evaluation-of-cross","title":"A Broader Study of Cross-Domain Few-Shot Learning","date":"2019-12-16","arxiv_id":"1912.07200","repositories_listed":2,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":5,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":5,"n_pointer_only":3,"phrase":"6 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; 1 where Syntology's instrument failed) · 1 unverified","sample_list":"/paper/a-new-benchmark-for-evaluation-of-cross#ran","syntology_url":"https://syntology.ai/paper/1912.07200","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.07200"}},"official":null}},{"url":"/paper/closure-assessing-systematic-generalization","slug":"closure-assessing-systematic-generalization","title":"CLOSURE: Assessing Systematic Generalization of CLEVR Models","date":"2019-12-12","arxiv_id":"1912.05783","repositories_listed":3,"syntology":{"n":10,"n_ran":10,"n_constructed":0,"n_ran_checked":7,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":0,"n_no_contract":5,"n_pointer_only":2,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 2 honoured, 0 violated, 5 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/closure-assessing-systematic-generalization#ran","syntology_url":"https://syntology.ai/paper/1912.05783","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05783"}},"official":{"repos":["rizar/CLOSURE"],"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/minegan-effective-knowledge-transfer-from","slug":"minegan-effective-knowledge-transfer-from","title":"MineGAN: effective knowledge transfer from GANs to target domains with few images","date":"2019-12-11","arxiv_id":"1912.05270","repositories_listed":2,"syntology":{"n":20,"n_ran":17,"n_constructed":0,"n_ran_checked":14,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":6,"phrase":"17 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; 3 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/minegan-effective-knowledge-transfer-from#ran","syntology_url":"https://syntology.ai/paper/1912.05270","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.05270"}},"official":null}},{"url":"/paper/winning-the-lottery-with-continuous-1","slug":"winning-the-lottery-with-continuous-1","title":"Winning the Lottery with Continuous Sparsification","date":"2019-12-10","arxiv_id":"1912.04427","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/winning-the-lottery-with-continuous-1#ran","syntology_url":"https://syntology.ai/paper/1912.04427","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.04427"}},"official":{"repos":["lolemacs/continuous-sparsification"],"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/machine-unlearning","slug":"machine-unlearning","title":"Machine Unlearning","date":"2019-12-09","arxiv_id":"1912.03817","repositories_listed":2,"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/machine-unlearning#ran","syntology_url":"https://syntology.ai/paper/1912.03817","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1912.03817"}},"official":{"repos":["cleverhans-lab/machine-unlearning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/smart-robust-and-efficient-fine-tuning-for","slug":"smart-robust-and-efficient-fine-tuning-for","title":"SMART: Robust and Efficient Fine-Tuning for Pre-trained Natural Language Models through Principled Regularized Optimization","date":"2019-11-08","arxiv_id":"1911.03437","repositories_listed":6,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":5,"n_instrument":3,"n_unverified":0,"n_honours":2,"n_violates":1,"n_no_contract":2,"n_pointer_only":1,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 2 honoured, 1 violated, 2 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/smart-robust-and-efficient-fine-tuning-for#ran","syntology_url":"https://syntology.ai/paper/1911.03437","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1911.03437"}},"official":{"repos":["namisan/mt-dnn"],"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","unlocated"]}}},{"url":"/paper/exploring-the-limits-of-transfer-learning","slug":"exploring-the-limits-of-transfer-learning","title":"Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformer","date":"2019-10-23","arxiv_id":"1910.10683","repositories_listed":57,"syntology":{"n":31,"n_ran":21,"n_constructed":0,"n_ran_checked":20,"n_instrument":1,"n_unverified":10,"n_honours":1,"n_violates":0,"n_no_contract":19,"n_pointer_only":0,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 20 with no instrument failure: 1 honoured, 0 violated, 19 with no contract checked; 1 where Syntology's instrument failed) · 10 unverified","sample_list":"/paper/exploring-the-limits-of-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1910.10683","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10683"}},"official":null}},{"url":"/paper/contrastive-representation-distillation-1","slug":"contrastive-representation-distillation-1","title":"Contrastive Representation Distillation","date":"2019-10-23","arxiv_id":"1910.10699","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/contrastive-representation-distillation-1#ran","syntology_url":"https://syntology.ai/paper/1910.10699","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.10699"}},"official":{"repos":["HobbitLong/RepDistiller"],"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/decoupling-representation-and-classifier-for","slug":"decoupling-representation-and-classifier-for","title":"Decoupling Representation and Classifier for Long-Tailed Recognition","date":"2019-10-21","arxiv_id":"1910.09217","repositories_listed":4,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/decoupling-representation-and-classifier-for#ran","syntology_url":"https://syntology.ai/paper/1910.09217","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.09217"}},"official":{"repos":["facebookresearch/classifier-balancing"],"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/model-fusion-via-optimal-transport","slug":"model-fusion-via-optimal-transport","title":"Model Fusion via Optimal Transport","date":"2019-10-12","arxiv_id":"1910.05653","repositories_listed":2,"syntology":{"n":2,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":0,"n_honours":1,"n_violates":1,"n_no_contract":0,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/model-fusion-via-optimal-transport#ran","syntology_url":"https://syntology.ai/paper/1910.05653","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.05653"}},"official":{"repos":["sidak/otfusion"],"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/transformers-state-of-the-art-natural","slug":"transformers-state-of-the-art-natural","title":"HuggingFace's Transformers: State-of-the-art Natural Language Processing","date":"2019-10-09","arxiv_id":"1910.03771","repositories_listed":9,"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/transformers-state-of-the-art-natural#ran","syntology_url":"https://syntology.ai/paper/1910.03771","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03771"}},"official":{"repos":["huggingface/transformers"],"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/fedmd-heterogenous-federated-learning-via","slug":"fedmd-heterogenous-federated-learning-via","title":"FedMD: Heterogenous Federated Learning via Model Distillation","date":"2019-10-08","arxiv_id":"1910.03581","repositories_listed":7,"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/fedmd-heterogenous-federated-learning-via#ran","syntology_url":"https://syntology.ai/paper/1910.03581","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03581"}},"official":null}},{"url":"/paper/exploiting-structural-and-semantic-context","slug":"exploiting-structural-and-semantic-context","title":"Commonsense Knowledge Base Completion with Structural and Semantic Context","date":"2019-10-07","arxiv_id":"1910.02915","repositories_listed":1,"syntology":{"n":12,"n_ran":10,"n_constructed":0,"n_ran_checked":10,"n_instrument":0,"n_unverified":2,"n_honours":1,"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; 10 with no instrument failure: 1 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/exploiting-structural-and-semantic-context#ran","syntology_url":"https://syntology.ai/paper/1910.02915","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.02915"}},"official":null}},{"url":"/paper/meta-transfer-learning-through-hard-tasks","slug":"meta-transfer-learning-through-hard-tasks","title":"Meta-Transfer Learning through Hard Tasks","date":"2019-10-07","arxiv_id":"1910.03648","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/meta-transfer-learning-through-hard-tasks#ran","syntology_url":"https://syntology.ai/paper/1910.03648","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03648"}},"official":{"repos":["yaoyao-liu/meta-transfer-learning"],"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/fine-grained-sentiment-classification-using","slug":"fine-grained-sentiment-classification-using","title":"Fine-grained Sentiment Classification using BERT","date":"2019-10-04","arxiv_id":"1910.03474","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/fine-grained-sentiment-classification-using#ran","syntology_url":"https://syntology.ai/paper/1910.03474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.03474"}},"official":null}},{"url":"/paper/harnessing-the-power-of-infinitely-wide-deep-1","slug":"harnessing-the-power-of-infinitely-wide-deep-1","title":"Harnessing the Power of Infinitely Wide Deep Nets on Small-data Tasks","date":"2019-10-03","arxiv_id":"1910.01663","repositories_listed":4,"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":1,"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/harnessing-the-power-of-infinitely-wide-deep-1#ran","syntology_url":"https://syntology.ai/paper/1910.01663","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01663"}},"official":{"repos":["LeoYu/neural-tangent-kernel-UCI"],"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/robust-few-shot-learning-with-adversarially-1","slug":"robust-few-shot-learning-with-adversarially-1","title":"Adversarially Robust Few-Shot Learning: A Meta-Learning Approach","date":"2019-10-02","arxiv_id":"1910.00982","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/robust-few-shot-learning-with-adversarially-1#ran","syntology_url":"https://syntology.ai/paper/1910.00982","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00982"}},"official":{"repos":["goldblum/AdversarialQuerying"],"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/distilbert-a-distilled-version-of-bert","slug":"distilbert-a-distilled-version-of-bert","title":"DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lighter","date":"2019-10-02","arxiv_id":"1910.01108","repositories_listed":37,"syntology":{"n":27,"n_ran":21,"n_constructed":5,"n_ran_checked":13,"n_instrument":8,"n_unverified":6,"n_honours":3,"n_violates":1,"n_no_contract":9,"n_pointer_only":2,"phrase":"21 ran (of which 5 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 1 violated, 9 with no contract checked; 8 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/distilbert-a-distilled-version-of-bert#ran","syntology_url":"https://syntology.ai/paper/1910.01108","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.01108"}},"official":{"repos":["huggingface/swift-coreml-transformers","huggingface/transformers"],"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":["listed","official"]}}},{"url":"/paper/multilingual-end-to-end-speech-translation","slug":"multilingual-end-to-end-speech-translation","title":"Multilingual End-to-End Speech Translation","date":"2019-10-01","arxiv_id":"1910.00254","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/multilingual-end-to-end-speech-translation#ran","syntology_url":"https://syntology.ai/paper/1910.00254","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1910.00254"}},"official":{"repos":["espnet/espnet"],"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-model-transferability-from-attribution","slug":"deep-model-transferability-from-attribution","title":"Deep Model Transferability from Attribution Maps","date":"2019-09-26","arxiv_id":"1909.11902","repositories_listed":2,"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/deep-model-transferability-from-attribution#ran","syntology_url":"https://syntology.ai/paper/1909.11902","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.11902"}},"official":{"repos":["zju-vipa/TransferbilityFromAttributionMaps"],"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/musicnn-pre-trained-convolutional-neural","slug":"musicnn-pre-trained-convolutional-neural","title":"musicnn: Pre-trained convolutional neural networks for music audio tagging","date":"2019-09-14","arxiv_id":"1909.06654","repositories_listed":4,"syntology":{"n":8,"n_ran":7,"n_constructed":0,"n_ran_checked":6,"n_instrument":1,"n_unverified":1,"n_honours":0,"n_violates":0,"n_no_contract":6,"n_pointer_only":0,"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) · 1 unverified","sample_list":"/paper/musicnn-pre-trained-convolutional-neural#ran","syntology_url":"https://syntology.ai/paper/1909.06654","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1909.06654"}},"official":{"repos":["jordipons/musicnn","jordipons/sklearn-audio-transfer-learning"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":1,"ran_from_kinds":["named_in_paper","official"]}}},{"url":"/paper/adapt-or-get-left-behind-domain-adaptation","slug":"adapt-or-get-left-behind-domain-adaptation","title":"Adapt or Get Left Behind: Domain Adaptation through BERT Language Model Finetuning for Aspect-Target Sentiment Classification","date":"2019-08-30","arxiv_id":"1908.11860","repositories_listed":3,"syntology":{"n":7,"n_ran":6,"n_constructed":0,"n_ran_checked":6,"n_instrument":0,"n_unverified":1,"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) · 1 unverified","sample_list":"/paper/adapt-or-get-left-behind-domain-adaptation#ran","syntology_url":"https://syntology.ai/paper/1908.11860","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.11860"}},"official":{"repos":["deepopinion/domain-adapted-atsc"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/midas-a-dialog-act-annotation-scheme-for-open","slug":"midas-a-dialog-act-annotation-scheme-for-open","title":"MIDAS: A Dialog Act Annotation Scheme for Open Domain Human Machine Spoken Conversations","date":"2019-08-27","arxiv_id":"1908.10023","repositories_listed":1,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":1,"n_instrument":4,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":0,"n_pointer_only":1,"phrase":"5 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; 4 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/midas-a-dialog-act-annotation-scheme-for-open#ran","syntology_url":"https://syntology.ai/paper/1908.10023","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10023"}},"official":{"repos":["DianDYu/MIDAS_dialog_act"],"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","unlocated"]}}},{"url":"/paper/sentence-bert-sentence-embeddings-using","slug":"sentence-bert-sentence-embeddings-using","title":"Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks","date":"2019-08-27","arxiv_id":"1908.10084","repositories_listed":64,"syntology":{"n":58,"n_ran":33,"n_constructed":9,"n_ran_checked":30,"n_instrument":3,"n_unverified":25,"n_honours":1,"n_violates":0,"n_no_contract":29,"n_pointer_only":11,"phrase":"33 ran (of which 9 constructed an object rather than computing a result; 30 with no instrument failure: 1 honoured, 0 violated, 29 with no contract checked; 3 where Syntology's instrument failed) · 25 unverified","sample_list":"/paper/sentence-bert-sentence-embeddings-using#ran","syntology_url":"https://syntology.ai/paper/1908.10084","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.10084"}},"official":{"repos":["UKPLab/sentence-transformers"],"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/learning-to-discover-novel-visual-categories","slug":"learning-to-discover-novel-visual-categories","title":"Learning to Discover Novel Visual Categories via Deep Transfer Clustering","date":"2019-08-26","arxiv_id":"1908.09884","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-to-discover-novel-visual-categories#ran","syntology_url":"https://syntology.ai/paper/1908.09884","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.09884"}},"official":{"repos":["k-han/DTC"],"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/190807836","slug":"190807836","title":"PubLayNet: largest dataset ever for document layout analysis","date":"2019-08-16","arxiv_id":"1908.07836","repositories_listed":6,"syntology":{"n":13,"n_ran":10,"n_constructed":0,"n_ran_checked":8,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":8,"n_pointer_only":13,"phrase":"10 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/190807836#ran","syntology_url":"https://syntology.ai/paper/1908.07836","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1908.07836"}},"official":{"repos":["ibm-aur-nlp/PubLayNet"],"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":["listed","official"]}}},{"url":"/paper/attentive-multi-task-deep-reinforcement","slug":"attentive-multi-task-deep-reinforcement","title":"Attentive Multi-Task Deep Reinforcement Learning","date":"2019-07-05","arxiv_id":"1907.02874","repositories_listed":1,"syntology":{"n":7,"n_ran":4,"n_constructed":0,"n_ran_checked":2,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":7,"phrase":"4 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; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/attentive-multi-task-deep-reinforcement#ran","syntology_url":"https://syntology.ai/paper/1907.02874","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1907.02874"}},"official":{"repos":["braemt/attentive-multi-task-deep-reinforcement-learning"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"url":"/paper/evaluating-protein-transfer-learning-with","slug":"evaluating-protein-transfer-learning-with","title":"Evaluating Protein Transfer Learning with TAPE","date":"2019-06-19","arxiv_id":"1906.08230","repositories_listed":5,"syntology":{"n":18,"n_ran":16,"n_constructed":0,"n_ran_checked":12,"n_instrument":4,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":12,"n_pointer_only":0,"phrase":"16 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; 4 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/evaluating-protein-transfer-learning-with#ran","syntology_url":"https://syntology.ai/paper/1906.08230","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.08230"}},"official":{"repos":["songlab-cal/tape"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/a-simple-and-effective-approach-to-automatic","slug":"a-simple-and-effective-approach-to-automatic","title":"A Simple and Effective Approach to Automatic Post-Editing with Transfer Learning","date":"2019-06-14","arxiv_id":"1906.06253","repositories_listed":1,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/a-simple-and-effective-approach-to-automatic#ran","syntology_url":"https://syntology.ai/paper/1906.06253","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.06253"}},"official":{"repos":["deep-spin/OpenNMT-APE"],"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/transfer-learning-in-biomedical-natural","slug":"transfer-learning-in-biomedical-natural","title":"Transfer Learning in Biomedical Natural Language Processing: An Evaluation of BERT and ELMo on Ten Benchmarking Datasets","date":"2019-06-13","arxiv_id":"1906.05474","repositories_listed":4,"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/transfer-learning-in-biomedical-natural#ran","syntology_url":"https://syntology.ai/paper/1906.05474","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.05474"}},"official":{"repos":["ncbi-nlp/BLUE_Benchmark","ncbi-nlp/NCBI_BERT"],"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/learning-classifier-synthesis-for-generalized","slug":"learning-classifier-synthesis-for-generalized","title":"Learning Adaptive Classifiers Synthesis for Generalized Few-Shot Learning","date":"2019-06-07","arxiv_id":"1906.02944","repositories_listed":2,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":3,"n_instrument":1,"n_unverified":2,"n_honours":1,"n_violates":0,"n_no_contract":2,"n_pointer_only":3,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 1 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/learning-classifier-synthesis-for-generalized#ran","syntology_url":"https://syntology.ai/paper/1906.02944","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.02944"}},"official":{"repos":["Sha-Lab/CASTLE"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["official"]}}},{"url":"/paper/190600695","slug":"190600695","title":"Continual learning with hypernetworks","date":"2019-06-03","arxiv_id":"1906.00695","repositories_listed":9,"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/190600695#ran","syntology_url":"https://syntology.ai/paper/1906.00695","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1906.00695"}},"official":{"repos":["chrhenning/hypercl"],"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/efficientnet-rethinking-model-scaling-for","slug":"efficientnet-rethinking-model-scaling-for","title":"EfficientNet: Rethinking Model Scaling for Convolutional Neural Networks","date":"2019-05-28","arxiv_id":"1905.11946","repositories_listed":144,"syntology":{"n":302,"n_ran":198,"n_constructed":73,"n_ran_checked":157,"n_instrument":41,"n_unverified":104,"n_honours":26,"n_violates":2,"n_no_contract":129,"n_pointer_only":113,"phrase":"198 ran (of which 73 constructed an object rather than computing a result; 157 with no instrument failure: 26 honoured, 2 violated, 129 with no contract checked; 41 where Syntology's instrument failed) · 104 unverified","sample_list":"/paper/efficientnet-rethinking-model-scaling-for#ran","syntology_url":"https://syntology.ai/paper/1905.11946","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.11946"}},"official":{"repos":["tensorflow/tpu"],"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","unlocated"]}}},{"url":"/paper/zero-shot-knowledge-transfer-via-adversarial","slug":"zero-shot-knowledge-transfer-via-adversarial","title":"Zero-shot Knowledge Transfer via Adversarial Belief Matching","date":"2019-05-23","arxiv_id":"1905.09768","repositories_listed":7,"syntology":{"n":5,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":0,"n_honours":5,"n_violates":0,"n_no_contract":0,"n_pointer_only":0,"phrase":"5 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; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/zero-shot-knowledge-transfer-via-adversarial#ran","syntology_url":"https://syntology.ai/paper/1905.09768","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09768"}},"official":{"repos":["polo5/ZeroShotKnowledgeTransfer"],"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/data-efficient-image-recognition-with","slug":"data-efficient-image-recognition-with","title":"Data-Efficient Image Recognition with Contrastive Predictive Coding","date":"2019-05-22","arxiv_id":"1905.09272","repositories_listed":4,"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/data-efficient-image-recognition-with#ran","syntology_url":"https://syntology.ai/paper/1905.09272","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.09272"}},"official":null}},{"url":"/paper/sparse-transfer-learning-via-winning-lottery","slug":"sparse-transfer-learning-via-winning-lottery","title":"Sparse Transfer Learning via Winning Lottery Tickets","date":"2019-05-19","arxiv_id":"1905.07785","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/sparse-transfer-learning-via-winning-lottery#ran","syntology_url":"https://syntology.ai/paper/1905.07785","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.07785"}},"official":{"repos":["rahulsmehta/sparsity-experiments"],"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/learning-what-and-where-to-transfer","slug":"learning-what-and-where-to-transfer","title":"Learning What and Where to Transfer","date":"2019-05-15","arxiv_id":"1905.05901","repositories_listed":4,"syntology":{"n":11,"n_ran":8,"n_constructed":0,"n_ran_checked":6,"n_instrument":2,"n_unverified":3,"n_honours":0,"n_violates":1,"n_no_contract":5,"n_pointer_only":2,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/learning-what-and-where-to-transfer#ran","syntology_url":"https://syntology.ai/paper/1905.05901","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.05901"}},"official":{"repos":["alinlab/L2T-ww"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":3,"ran_from_kinds":["listed","official","unlocated"]}}},{"url":"/paper/large-scale-weakly-supervised-pre-training","slug":"large-scale-weakly-supervised-pre-training","title":"Large-scale weakly-supervised pre-training for video action recognition","date":"2019-05-02","arxiv_id":"1905.00561","repositories_listed":3,"syntology":{"n":21,"n_ran":12,"n_constructed":0,"n_ran_checked":12,"n_instrument":0,"n_unverified":9,"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) · 9 unverified","sample_list":"/paper/large-scale-weakly-supervised-pre-training#ran","syntology_url":"https://syntology.ai/paper/1905.00561","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1905.00561"}},"official":null}},{"url":"/paper/unsupervised-data-augmentation-1","slug":"unsupervised-data-augmentation-1","title":"Unsupervised Data Augmentation for Consistency Training","date":"2019-04-29","arxiv_id":"1904.12848","repositories_listed":20,"syntology":{"n":52,"n_ran":30,"n_constructed":3,"n_ran_checked":22,"n_instrument":8,"n_unverified":22,"n_honours":0,"n_violates":0,"n_no_contract":22,"n_pointer_only":17,"phrase":"30 ran (of which 3 constructed an object rather than computing a result; 22 with no instrument failure: 0 honoured, 0 violated, 22 with no contract checked; 8 where Syntology's instrument failed) · 22 unverified","sample_list":"/paper/unsupervised-data-augmentation-1#ran","syntology_url":"https://syntology.ai/paper/1904.12848","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12848"}},"official":{"repos":["google-research/uda"],"state":"official (archive's flag): 10 ran","n_ran":10,"n_constructed":0,"n_ran_no_instrument_failure":10,"n_unverified":14,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/inductive-graph-pattern-learning-for","slug":"inductive-graph-pattern-learning-for","title":"Inductive Matrix Completion Based on Graph Neural Networks","date":"2019-04-26","arxiv_id":"1904.12058","repositories_listed":3,"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/inductive-graph-pattern-learning-for#ran","syntology_url":"https://syntology.ai/paper/1904.12058","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.12058"}},"official":{"repos":["muhanzhang/IGMC"],"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/scene-graph-prediction-with-limited-labels","slug":"scene-graph-prediction-with-limited-labels","title":"Scene Graph Prediction with Limited Labels","date":"2019-04-25","arxiv_id":"1904.11622","repositories_listed":1,"syntology":{"n":6,"n_ran":4,"n_constructed":0,"n_ran_checked":4,"n_instrument":0,"n_unverified":2,"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) · 2 unverified","sample_list":"/paper/scene-graph-prediction-with-limited-labels#ran","syntology_url":"https://syntology.ai/paper/1904.11622","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.11622"}},"official":null}},{"url":"/paper/socialiqa-commonsense-reasoning-about-social","slug":"socialiqa-commonsense-reasoning-about-social","title":"SocialIQA: Commonsense Reasoning about Social Interactions","date":"2019-04-22","arxiv_id":"1904.09728","repositories_listed":1,"syntology":{"n":10,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/socialiqa-commonsense-reasoning-about-social#ran","syntology_url":"https://syntology.ai/paper/1904.09728","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1904.09728"}},"official":null}},{"url":"/paper/a-simple-baseline-for-bayesian-uncertainty-in","slug":"a-simple-baseline-for-bayesian-uncertainty-in","title":"A Simple Baseline for Bayesian Uncertainty in Deep Learning","date":"2019-02-07","arxiv_id":"1902.02476","repositories_listed":8,"syntology":{"n":17,"n_ran":11,"n_constructed":0,"n_ran_checked":10,"n_instrument":1,"n_unverified":6,"n_honours":0,"n_violates":0,"n_no_contract":10,"n_pointer_only":9,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 10 with no instrument failure: 0 honoured, 0 violated, 10 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","sample_list":"/paper/a-simple-baseline-for-bayesian-uncertainty-in#ran","syntology_url":"https://syntology.ai/paper/1902.02476","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.02476"}},"official":{"repos":["wjmaddox/swa_gaussian"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":7,"n_unverified":6,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/parameter-efficient-transfer-learning-for-nlp","slug":"parameter-efficient-transfer-learning-for-nlp","title":"Parameter-Efficient Transfer Learning for NLP","date":"2019-02-02","arxiv_id":"1902.00751","repositories_listed":17,"syntology":{"n":22,"n_ran":14,"n_constructed":3,"n_ran_checked":14,"n_instrument":0,"n_unverified":8,"n_honours":0,"n_violates":0,"n_no_contract":14,"n_pointer_only":3,"phrase":"14 ran (of which 3 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) · 8 unverified","sample_list":"/paper/parameter-efficient-transfer-learning-for-nlp#ran","syntology_url":"https://syntology.ai/paper/1902.00751","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1902.00751"}},"official":{"repos":["google-research/adapter-bert"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"url":"/paper/transfertransfo-a-transfer-learning-approach","slug":"transfertransfo-a-transfer-learning-approach","title":"TransferTransfo: A Transfer Learning Approach for Neural Network Based Conversational Agents","date":"2019-01-23","arxiv_id":"1901.08149","repositories_listed":23,"syntology":{"n":26,"n_ran":18,"n_constructed":0,"n_ran_checked":11,"n_instrument":7,"n_unverified":8,"n_honours":1,"n_violates":0,"n_no_contract":10,"n_pointer_only":7,"phrase":"18 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; 7 where Syntology's instrument failed) · 8 unverified","sample_list":"/paper/transfertransfo-a-transfer-learning-approach#ran","syntology_url":"https://syntology.ai/paper/1901.08149","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.08149"}},"official":null}},{"url":"/paper/transfer-learning-from-language-models-to","slug":"transfer-learning-from-language-models-to","title":"Transfer learning from language models to image caption generators: Better models may not transfer better","date":"2019-01-01","arxiv_id":"1901.01216","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":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) · 1 unverified","sample_list":"/paper/transfer-learning-from-language-models-to#ran","syntology_url":"https://syntology.ai/paper/1901.01216","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1901.01216"}},"official":{"repos":["mtanti/mtanti-phd"],"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/high-quality-monocular-depth-estimation-via","slug":"high-quality-monocular-depth-estimation-via","title":"High Quality Monocular Depth Estimation via Transfer Learning","date":"2018-12-31","arxiv_id":"1812.11941","repositories_listed":45,"syntology":{"n":23,"n_ran":19,"n_constructed":0,"n_ran_checked":16,"n_instrument":3,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":14,"n_pointer_only":4,"phrase":"19 ran (of which 0 constructed an object rather than computing a result; 16 with no instrument failure: 2 honoured, 0 violated, 14 with no contract checked; 3 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/high-quality-monocular-depth-estimation-via#ran","syntology_url":"https://syntology.ai/paper/1812.11941","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.11941"}},"official":{"repos":["ialhashim/DenseDepth"],"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/feature-matters-a-stage-by-stage-approach-for","slug":"feature-matters-a-stage-by-stage-approach-for","title":"An Embarrassingly Simple Approach for Knowledge Distillation","date":"2018-12-05","arxiv_id":"1812.01819","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/feature-matters-a-stage-by-stage-approach-for#ran","syntology_url":"https://syntology.ai/paper/1812.01819","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01819"}},"official":null}},{"url":"/paper/bag-of-tricks-for-image-classification-with","slug":"bag-of-tricks-for-image-classification-with","title":"Bag of Tricks for Image Classification with Convolutional Neural Networks","date":"2018-12-04","arxiv_id":"1812.01187","repositories_listed":28,"syntology":{"n":15,"n_ran":11,"n_constructed":0,"n_ran_checked":9,"n_instrument":2,"n_unverified":4,"n_honours":2,"n_violates":0,"n_no_contract":7,"n_pointer_only":5,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 2 honoured, 0 violated, 7 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/bag-of-tricks-for-image-classification-with#ran","syntology_url":"https://syntology.ai/paper/1812.01187","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01187"}},"official":{"repos":["dmlc/gluon-cv"],"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/transferring-knowledge-across-learning","slug":"transferring-knowledge-across-learning","title":"Transferring Knowledge across Learning Processes","date":"2018-12-03","arxiv_id":"1812.01054","repositories_listed":4,"syntology":{"n":14,"n_ran":11,"n_constructed":0,"n_ran_checked":11,"n_instrument":0,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":11,"n_pointer_only":0,"phrase":"11 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 0 honoured, 0 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","sample_list":"/paper/transferring-knowledge-across-learning#ran","syntology_url":"https://syntology.ai/paper/1812.01054","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1812.01054"}},"official":{"repos":["amzn/xfer"],"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-recurrent-neural-networks-for-ecg-signal","slug":"deep-recurrent-neural-networks-for-ecg-signal","title":"Deep Recurrent Neural Networks for ECG Signal Denoising","date":"2018-07-30","arxiv_id":"1807.11551","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/deep-recurrent-neural-networks-for-ecg-signal#ran","syntology_url":"https://syntology.ai/paper/1807.11551","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1807.11551"}},"official":null}},{"url":"/paper/textworld-a-learning-environment-for-text","slug":"textworld-a-learning-environment-for-text","title":"TextWorld: A Learning Environment for Text-based Games","date":"2018-06-29","arxiv_id":"1806.11532","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/textworld-a-learning-environment-for-text#ran","syntology_url":"https://syntology.ai/paper/1806.11532","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.11532"}},"official":null}},{"url":"/paper/deepaffinity-interpretable-deep-learning-of","slug":"deepaffinity-interpretable-deep-learning-of","title":"DeepAffinity: Interpretable Deep Learning of Compound-Protein Affinity through Unified Recurrent and Convolutional Neural Networks","date":"2018-06-20","arxiv_id":"1806.07537","repositories_listed":2,"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":2,"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/deepaffinity-interpretable-deep-learning-of#ran","syntology_url":"https://syntology.ai/paper/1806.07537","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.07537"}},"official":{"repos":["Shen-Lab/DeepAffinity"],"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/the-natural-language-decathlon-multitask","slug":"the-natural-language-decathlon-multitask","title":"The Natural Language Decathlon: Multitask Learning as Question Answering","date":"2018-06-20","arxiv_id":"1806.08730","repositories_listed":6,"syntology":{"n":13,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":13,"n_pointer_only":4,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 0 honoured, 0 violated, 13 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/the-natural-language-decathlon-multitask#ran","syntology_url":"https://syntology.ai/paper/1806.08730","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1806.08730"}},"official":{"repos":["salesforce/decaNLP"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":9,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"url":"/paper/adapted-deep-embeddings-a-synthesis-of-1","slug":"adapted-deep-embeddings-a-synthesis-of-1","title":"Adapted Deep Embeddings: A Synthesis of Methods for $k$-Shot Inductive Transfer Learning","date":"2018-05-22","arxiv_id":"1805.08402","repositories_listed":2,"syntology":{"n":15,"n_ran":13,"n_constructed":0,"n_ran_checked":13,"n_instrument":0,"n_unverified":2,"n_honours":1,"n_violates":1,"n_no_contract":11,"n_pointer_only":0,"phrase":"13 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/adapted-deep-embeddings-a-synthesis-of-1#ran","syntology_url":"https://syntology.ai/paper/1805.08402","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.08402"}},"official":{"repos":["tylersco/adapted_deep_embeddings"],"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":["listed","official"]}}},{"url":"/paper/a-la-carte-embedding-cheap-but-effective","slug":"a-la-carte-embedding-cheap-but-effective","title":"A La Carte Embedding: Cheap but Effective Induction of Semantic Feature Vectors","date":"2018-05-14","arxiv_id":"1805.05388","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":0,"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/a-la-carte-embedding-cheap-but-effective#ran","syntology_url":"https://syntology.ai/paper/1805.05388","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1805.05388"}},"official":{"repos":["NLPrinceton/ALaCarte"],"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/taskonomy-disentangling-task-transfer","slug":"taskonomy-disentangling-task-transfer","title":"Taskonomy: Disentangling Task Transfer Learning","date":"2018-04-23","arxiv_id":"1804.08328","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/taskonomy-disentangling-task-transfer#ran","syntology_url":"https://syntology.ai/paper/1804.08328","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.08328"}},"official":{"repos":["StanfordVL/taskonomy"],"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/glue-a-multi-task-benchmark-and-analysis","slug":"glue-a-multi-task-benchmark-and-analysis","title":"GLUE: A Multi-Task Benchmark and Analysis Platform for Natural Language Understanding","date":"2018-04-20","arxiv_id":"1804.07461","repositories_listed":11,"syntology":{"n":14,"n_ran":14,"n_constructed":0,"n_ran_checked":12,"n_instrument":2,"n_unverified":0,"n_honours":1,"n_violates":0,"n_no_contract":11,"n_pointer_only":1,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 12 with no instrument failure: 1 honoured, 0 violated, 11 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/glue-a-multi-task-benchmark-and-analysis#ran","syntology_url":"https://syntology.ai/paper/1804.07461","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.07461"}},"official":null}},{"url":"/paper/deep-transfer-learning-in-the-assessment-of","slug":"deep-transfer-learning-in-the-assessment-of","title":"Deep transfer learning in the assessment of the quality of protein models","date":"2018-04-17","arxiv_id":"1804.06281","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/deep-transfer-learning-in-the-assessment-of#ran","syntology_url":"https://syntology.ai/paper/1804.06281","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.06281"}},"official":{"repos":["ElofssonLab/ProQ4"],"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/houdini-lifelong-learning-as-program","slug":"houdini-lifelong-learning-as-program","title":"HOUDINI: Lifelong Learning as Program Synthesis","date":"2018-03-31","arxiv_id":"1804.00218","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":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/houdini-lifelong-learning-as-program#ran","syntology_url":"https://syntology.ai/paper/1804.00218","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00218"}},"official":{"repos":["capergroup/houdini"],"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/learning-general-purpose-distributed-sentence","slug":"learning-general-purpose-distributed-sentence","title":"Learning General Purpose Distributed Sentence Representations via Large Scale Multi-task Learning","date":"2018-03-30","arxiv_id":"1804.00079","repositories_listed":4,"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/learning-general-purpose-distributed-sentence#ran","syntology_url":"https://syntology.ai/paper/1804.00079","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1804.00079"}},"official":{"repos":["facebookresearch/SentEval","Maluuba/gensen"],"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/universal-sentence-encoder","slug":"universal-sentence-encoder","title":"Universal Sentence Encoder","date":"2018-03-29","arxiv_id":"1803.11175","repositories_listed":24,"syntology":{"n":22,"n_ran":18,"n_constructed":0,"n_ran_checked":17,"n_instrument":1,"n_unverified":4,"n_honours":0,"n_violates":0,"n_no_contract":17,"n_pointer_only":1,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 17 with no instrument failure: 0 honoured, 0 violated, 17 with no contract checked; 1 where Syntology's instrument failed) · 4 unverified","sample_list":"/paper/universal-sentence-encoder#ran","syntology_url":"https://syntology.ai/paper/1803.11175","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.11175"}},"official":null}},{"url":"/paper/efficient-parametrization-of-multi-domain","slug":"efficient-parametrization-of-multi-domain","title":"Efficient parametrization of multi-domain deep neural networks","date":"2018-03-27","arxiv_id":"1803.10082","repositories_listed":3,"syntology":{"n":3,"n_ran":3,"n_constructed":0,"n_ran_checked":2,"n_instrument":1,"n_unverified":0,"n_honours":0,"n_violates":0,"n_no_contract":2,"n_pointer_only":2,"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) · 0 unverified","sample_list":"/paper/efficient-parametrization-of-multi-domain#ran","syntology_url":"https://syntology.ai/paper/1803.10082","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1803.10082"}},"official":null}},{"url":"/paper/subspace-network-deep-multi-task-censored","slug":"subspace-network-deep-multi-task-censored","title":"Subspace Network: Deep Multi-Task Censored Regression for Modeling Neurodegenerative Diseases","date":"2018-02-19","arxiv_id":"1802.06516","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/subspace-network-deep-multi-task-censored#ran","syntology_url":"https://syntology.ai/paper/1802.06516","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06516"}},"official":{"repos":["illidanlab/subspace-net"],"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-adversarially-fair-and-transferable","slug":"learning-adversarially-fair-and-transferable","title":"Learning Adversarially Fair and Transferable Representations","date":"2018-02-17","arxiv_id":"1802.06309","repositories_listed":7,"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/learning-adversarially-fair-and-transferable#ran","syntology_url":"https://syntology.ai/paper/1802.06309","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.06309"}},"official":{"repos":["VectorInstitute/laftr"],"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/paraphrasing-complex-network-network","slug":"paraphrasing-complex-network-network","title":"Paraphrasing Complex Network: Network Compression via Factor Transfer","date":"2018-02-14","arxiv_id":"1802.04977","repositories_listed":2,"syntology":{"n":4,"n_ran":2,"n_constructed":0,"n_ran_checked":1,"n_instrument":1,"n_unverified":2,"n_honours":0,"n_violates":0,"n_no_contract":1,"n_pointer_only":1,"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) · 2 unverified","sample_list":"/paper/paraphrasing-complex-network-network#ran","syntology_url":"https://syntology.ai/paper/1802.04977","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.04977"}},"official":{"repos":["Jangho-Kim/Factor-Transfer-pytorch"],"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/scalable-meta-learning-for-bayesian","slug":"scalable-meta-learning-for-bayesian","title":"Practical Transfer Learning for Bayesian Optimization","date":"2018-02-06","arxiv_id":"1802.02219","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":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/scalable-meta-learning-for-bayesian#ran","syntology_url":"https://syntology.ai/paper/1802.02219","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1802.02219"}},"official":{"repos":["automl/transfer-hpo-framework"],"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/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/document-image-classification-with-intra","slug":"document-image-classification-with-intra","title":"Document Image Classification with Intra-Domain Transfer Learning and Stacked Generalization of Deep Convolutional Neural Networks","date":"2018-01-29","arxiv_id":"1801.09321","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/document-image-classification-with-intra#ran","syntology_url":"https://syntology.ai/paper/1801.09321","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.09321"}},"official":null}},{"url":"/paper/universal-language-model-fine-tuning-for-text","slug":"universal-language-model-fine-tuning-for-text","title":"Universal Language Model Fine-tuning for Text Classification","date":"2018-01-18","arxiv_id":"1801.06146","repositories_listed":66,"syntology":{"n":5,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":3,"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) · 3 unverified","sample_list":"/paper/universal-language-model-fine-tuning-for-text#ran","syntology_url":"https://syntology.ai/paper/1801.06146","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.06146"}},"official":{"repos":["fastai/fastai"],"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-learning-for-electromyographic-hand","slug":"deep-learning-for-electromyographic-hand","title":"Deep Learning for Electromyographic Hand Gesture Signal Classification Using Transfer Learning","date":"2018-01-10","arxiv_id":"1801.07756","repositories_listed":4,"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":2,"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/deep-learning-for-electromyographic-hand#ran","syntology_url":"https://syntology.ai/paper/1801.07756","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1801.07756"}},"official":{"repos":["Giguelingueling/MyoArmbandDataset"],"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/representation-learning-by-learning-to-count","slug":"representation-learning-by-learning-to-count","title":"Representation Learning by Learning to Count","date":"2017-08-22","arxiv_id":"1708.06734","repositories_listed":2,"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/representation-learning-by-learning-to-count#ran","syntology_url":"https://syntology.ai/paper/1708.06734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.06734"}},"official":null}},{"url":"/paper/using-millions-of-emoji-occurrences-to-learn","slug":"using-millions-of-emoji-occurrences-to-learn","title":"Using millions of emoji occurrences to learn any-domain representations for detecting sentiment, emotion and sarcasm","date":"2017-08-01","arxiv_id":"1708.00524","repositories_listed":7,"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/using-millions-of-emoji-occurrences-to-learn#ran","syntology_url":"https://syntology.ai/paper/1708.00524","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1708.00524"}},"official":{"repos":["bfelbo/deepmoji"],"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-hashing-network-for-unsupervised-domain","slug":"deep-hashing-network-for-unsupervised-domain","title":"Deep Hashing Network for Unsupervised Domain Adaptation","date":"2017-06-22","arxiv_id":"1706.07522","repositories_listed":7,"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/deep-hashing-network-for-unsupervised-domain#ran","syntology_url":"https://syntology.ai/paper/1706.07522","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1706.07522"}},"official":{"repos":["hemanthdv/da-hash"],"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/supervised-learning-of-universal-sentence","slug":"supervised-learning-of-universal-sentence","title":"Supervised Learning of Universal Sentence Representations from Natural Language Inference Data","date":"2017-05-05","arxiv_id":"1705.02364","repositories_listed":23,"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":7,"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/supervised-learning-of-universal-sentence#ran","syntology_url":"https://syntology.ai/paper/1705.02364","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1705.02364"}},"official":{"repos":["facebookresearch/InferSent","facebookresearch/SentEval"],"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":["listed","official"]}}},{"url":"/paper/transfer-learning-for-music-classification","slug":"transfer-learning-for-music-classification","title":"Transfer learning for music classification and regression tasks","date":"2017-03-27","arxiv_id":"1703.09179","repositories_listed":3,"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/transfer-learning-for-music-classification#ran","syntology_url":"https://syntology.ai/paper/1703.09179","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.09179"}},"official":{"repos":["keunwoochoi/transfer_learning_music"],"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":["official"]}}},{"url":"/paper/transfer-learning-for-sequence-tagging-with","slug":"transfer-learning-for-sequence-tagging-with","title":"Transfer Learning for Sequence Tagging with Hierarchical Recurrent Networks","date":"2017-03-18","arxiv_id":"1703.06345","repositories_listed":4,"syntology":{"n":8,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":0,"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) · 0 unverified","sample_list":"/paper/transfer-learning-for-sequence-tagging-with#ran","syntology_url":"https://syntology.ai/paper/1703.06345","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1703.06345"}},"official":{"repos":["kimiyoung/transfer"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":0,"ran_from_kinds":["official"]}}},{"url":"/paper/borrowing-treasures-from-the-wealthy-deep","slug":"borrowing-treasures-from-the-wealthy-deep","title":"Borrowing Treasures from the Wealthy: Deep Transfer Learning through Selective Joint Fine-tuning","date":"2017-02-28","arxiv_id":"1702.08690","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/borrowing-treasures-from-the-wealthy-deep#ran","syntology_url":"https://syntology.ai/paper/1702.08690","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.08690"}},"official":{"repos":["ZYYSzj/Selective-Joint-Fine-tuning"],"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/question-answering-through-transfer-learning","slug":"question-answering-through-transfer-learning","title":"Question Answering through Transfer Learning from Large Fine-grained Supervision Data","date":"2017-02-07","arxiv_id":"1702.02171","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/question-answering-through-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1702.02171","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1702.02171"}},"official":null}},{"url":"/paper/pathnet-evolution-channels-gradient-descent","slug":"pathnet-evolution-channels-gradient-descent","title":"PathNet: Evolution Channels Gradient Descent in Super Neural Networks","date":"2017-01-30","arxiv_id":"1701.08734","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":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) · 1 unverified","sample_list":"/paper/pathnet-evolution-channels-gradient-descent#ran","syntology_url":"https://syntology.ai/paper/1701.08734","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1701.08734"}},"official":null}},{"url":"/paper/pruning-convolutional-neural-networks-for","slug":"pruning-convolutional-neural-networks-for","title":"Pruning Convolutional Neural Networks for Resource Efficient Inference","date":"2016-11-19","arxiv_id":"1611.06440","repositories_listed":8,"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/pruning-convolutional-neural-networks-for#ran","syntology_url":"https://syntology.ai/paper/1611.06440","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.06440"}},"official":null}},{"url":"/paper/incremental-sequence-learning","slug":"incremental-sequence-learning","title":"Incremental Sequence Learning","date":"2016-11-09","arxiv_id":"1611.03068","repositories_listed":1,"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":1,"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/incremental-sequence-learning#ran","syntology_url":"https://syntology.ai/paper/1611.03068","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1611.03068"}},"official":{"repos":["edwin-de-jong/incremental-sequence-learning"],"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/semi-supervised-knowledge-transfer-for-deep","slug":"semi-supervised-knowledge-transfer-for-deep","title":"Semi-supervised Knowledge Transfer for Deep Learning from Private Training Data","date":"2016-10-18","arxiv_id":"1610.05755","repositories_listed":8,"syntology":{"n":9,"n_ran":9,"n_constructed":0,"n_ran_checked":3,"n_instrument":6,"n_unverified":0,"n_honours":3,"n_violates":0,"n_no_contract":0,"n_pointer_only":9,"phrase":"9 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; 6 where Syntology's instrument failed) · 0 unverified","sample_list":"/paper/semi-supervised-knowledge-transfer-for-deep#ran","syntology_url":"https://syntology.ai/paper/1610.05755","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1610.05755"}},"official":{"repos":["tensorflow/privacy"],"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/unsupervised-learning-of-visual-1","slug":"unsupervised-learning-of-visual-1","title":"Unsupervised Learning of Visual Representations by Solving Jigsaw Puzzles","date":"2016-03-30","arxiv_id":"1603.09246","repositories_listed":9,"syntology":{"n":13,"n_ran":10,"n_constructed":6,"n_ran_checked":7,"n_instrument":3,"n_unverified":3,"n_honours":0,"n_violates":0,"n_no_contract":7,"n_pointer_only":7,"phrase":"10 ran (of which 6 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) · 3 unverified","sample_list":"/paper/unsupervised-learning-of-visual-1#ran","syntology_url":"https://syntology.ai/paper/1603.09246","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1603.09246"}},"official":null}},{"url":"/paper/natural-language-object-retrieval","slug":"natural-language-object-retrieval","title":"Natural Language Object Retrieval","date":"2015-11-13","arxiv_id":"1511.04164","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/natural-language-object-retrieval#ran","syntology_url":"https://syntology.ai/paper/1511.04164","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1511.04164"}},"official":null}},{"url":"/paper/transfer-learning-from-deep-features-for","slug":"transfer-learning-from-deep-features-for","title":"Transfer Learning from Deep Features for Remote Sensing and Poverty Mapping","date":"2015-10-01","arxiv_id":"1510.00098","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/transfer-learning-from-deep-features-for#ran","syntology_url":"https://syntology.ai/paper/1510.00098","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1510.00098"}},"official":null}},{"url":"/paper/invariant-models-for-causal-transfer-learning","slug":"invariant-models-for-causal-transfer-learning","title":"Invariant Models for Causal Transfer Learning","date":"2015-07-19","arxiv_id":"1507.05333","repositories_listed":1,"syntology":{"n":12,"n_ran":8,"n_constructed":0,"n_ran_checked":8,"n_instrument":0,"n_unverified":4,"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) · 4 unverified","sample_list":"/paper/invariant-models-for-causal-transfer-learning#ran","syntology_url":"https://syntology.ai/paper/1507.05333","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1507.05333"}},"official":{"repos":["mrojascarulla/causal_transfer_learning"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"url":"/paper/compression-artifacts-reduction-by-a-deep","slug":"compression-artifacts-reduction-by-a-deep","title":"Compression Artifacts Reduction by a Deep Convolutional Network","date":"2015-04-27","arxiv_id":"1504.06993","repositories_listed":4,"syntology":{"n":12,"n_ran":7,"n_constructed":0,"n_ran_checked":7,"n_instrument":0,"n_unverified":5,"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) · 5 unverified","sample_list":"/paper/compression-artifacts-reduction-by-a-deep#ran","syntology_url":"https://syntology.ai/paper/1504.06993","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1504.06993"}},"official":null}},{"url":"/paper/unsupervised-domain-adaptation-by","slug":"unsupervised-domain-adaptation-by","title":"Unsupervised Domain Adaptation by Backpropagation","date":"2014-09-26","arxiv_id":"1409.7495","repositories_listed":22,"syntology":{"n":41,"n_ran":34,"n_constructed":11,"n_ran_checked":22,"n_instrument":12,"n_unverified":7,"n_honours":6,"n_violates":1,"n_no_contract":15,"n_pointer_only":14,"phrase":"34 ran (of which 11 constructed an object rather than computing a result; 22 with no instrument failure: 6 honoured, 1 violated, 15 with no contract checked; 12 where Syntology's instrument failed) · 7 unverified","sample_list":"/paper/unsupervised-domain-adaptation-by#ran","syntology_url":"https://syntology.ai/paper/1409.7495","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1409.7495"}},"official":null}},{"url":"/paper/decaf-a-deep-convolutional-activation-feature","slug":"decaf-a-deep-convolutional-activation-feature","title":"DeCAF: A Deep Convolutional Activation Feature for Generic Visual Recognition","date":"2013-10-06","arxiv_id":"1310.1531","repositories_listed":8,"syntology":{"n":7,"n_ran":5,"n_constructed":0,"n_ran_checked":5,"n_instrument":0,"n_unverified":2,"n_honours":0,"n_violates":1,"n_no_contract":4,"n_pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 1 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","sample_list":"/paper/decaf-a-deep-convolutional-activation-feature#ran","syntology_url":"https://syntology.ai/paper/1310.1531","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1310.1531"}},"official":null}},{"url":"/paper/the-arcade-learning-environment-an-evaluation","slug":"the-arcade-learning-environment-an-evaluation","title":"The Arcade Learning Environment: An Evaluation Platform for General Agents","date":"2012-07-19","arxiv_id":"1207.4708","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/the-arcade-learning-environment-an-evaluation#ran","syntology_url":"https://syntology.ai/paper/1207.4708","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"1207.4708"}},"official":null}}],"record_sha256":"4d77dcb9e4cd7bc4eb1d62000819c3138ba575d7afcb305e933083e19c484c76","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}