{"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":"/method/sigmoid-activation/papers/ran/5","list_of":"/method/sigmoid-activation","method":"Sigmoid Activation","archive":{"snapshot":"2025-07-28"},"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 isolate this method inside it.","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":5,"pages_in_order":5,"rows_per_page":100,"rows":[401,461],"of":461,"counts":{"archive_papers_tagged":7112,"with_a_code_link":2470,"where_syntology_ran_a_sample":461,"not_listed_spam_title":0,"listed":7112,"listed_where_code_ran":461,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":386,"every_run_a_failure_of_syntologys_instrument":75,"listed_with_a_run_with_no_instrument_failure":386,"listed_every_run_a_failure_of_syntologys_instrument":75,"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":"/method/sigmoid-activation/papers/ran/1","prev":"/method/sigmoid-activation/papers/ran/4","next":null,"papers":[{"paper":"/paper/3d-anisotropic-hybrid-network-transferring","slug":"3d-anisotropic-hybrid-network-transferring","title":"3D Anisotropic Hybrid Network: Transferring Convolutional Features from 2D Images to 3D Anisotropic Volumes","date":"2017-11-23","arxiv_id":"1711.08580","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","official":null}},{"paper":"/paper/exploiting-temporal-information-for-3d-pose","slug":"exploiting-temporal-information-for-3d-pose","title":"Exploiting temporal information for 3D pose estimation","date":"2017-11-23","arxiv_id":"1711.08585","n_code_links":1,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","official":null}},{"paper":"/paper/learning-deep-compositional-grammatical","slug":"learning-deep-compositional-grammatical","title":"AOGNets: Compositional Grammatical Architectures for Deep Learning","date":"2017-11-15","arxiv_id":"1711.05847","n_code_links":4,"syntology":{"ran":3,"of":8,"n_ran_checked":3,"n_instrument":0,"unverified":5,"pointer_only":1,"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) · 5 unverified","official":{"repos":["iVMCL/AOGNets"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":["listed"]}}},{"paper":"/paper/breaking-the-softmax-bottleneck-a-high-rank","slug":"breaking-the-softmax-bottleneck-a-high-rank","title":"Breaking the Softmax Bottleneck: A High-Rank RNN Language Model","date":"2017-11-10","arxiv_id":"1711.03953","n_code_links":9,"syntology":{"ran":12,"of":23,"n_ran_checked":11,"n_instrument":1,"unverified":11,"pointer_only":1,"phrase":"12 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; 1 where Syntology's instrument failed) · 11 unverified","official":{"repos":["zihangdai/mos"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/lip2audspec-speech-reconstruction-from-silent","slug":"lip2audspec-speech-reconstruction-from-silent","title":"Lip2AudSpec: Speech reconstruction from silent lip movements video","date":"2017-10-26","arxiv_id":"1710.09798","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["hassanhub/LipReading"],"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"]}}},{"paper":"/paper/sling-a-framework-for-frame-semantic-parsing","slug":"sling-a-framework-for-frame-semantic-parsing","title":"SLING: A framework for frame semantic parsing","date":"2017-10-19","arxiv_id":"1710.07032","n_code_links":2,"syntology":{"ran":5,"of":5,"n_ran_checked":4,"n_instrument":1,"unverified":0,"pointer_only":0,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["google/sling"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/searching-for-activation-functions","slug":"searching-for-activation-functions","title":"Searching for Activation Functions","date":"2017-10-16","arxiv_id":"1710.05941","n_code_links":22,"syntology":{"ran":13,"of":20,"n_ran_checked":8,"n_instrument":5,"unverified":7,"pointer_only":4,"phrase":"13 ran (of which 1 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 7 unverified","official":null}},{"paper":"/paper/to-prune-or-not-to-prune-exploring-the","slug":"to-prune-or-not-to-prune-exploring-the","title":"To prune, or not to prune: exploring the efficacy of pruning for model compression","date":"2017-10-05","arxiv_id":"1710.01878","n_code_links":4,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","official":null}},{"paper":"/paper/simple-recurrent-units-for-highly","slug":"simple-recurrent-units-for-highly","title":"Simple Recurrent Units for Highly Parallelizable Recurrence","date":"2017-09-08","arxiv_id":"1709.02755","n_code_links":11,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 1 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["asappresearch/sru"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/squeeze-and-excitation-networks","slug":"squeeze-and-excitation-networks","title":"Squeeze-and-Excitation Networks","date":"2017-09-05","arxiv_id":"1709.01507","n_code_links":85,"syntology":{"ran":2,"of":9,"n_ran_checked":0,"n_instrument":2,"unverified":7,"pointer_only":6,"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) · 7 unverified","official":{"repos":["hujie-frank/SENet"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/regularizing-and-optimizing-lstm-language","slug":"regularizing-and-optimizing-lstm-language","title":"Regularizing and Optimizing LSTM Language Models","date":"2017-08-07","arxiv_id":"1708.02182","n_code_links":45,"syntology":{"ran":6,"of":7,"n_ran_checked":2,"n_instrument":4,"unverified":1,"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","official":{"repos":["salesforce/awd-lstm-lm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/learned-in-translation-contextualized-word","slug":"learned-in-translation-contextualized-word","title":"Learned in Translation: Contextualized Word Vectors","date":"2017-08-01","arxiv_id":"1708.00107","n_code_links":5,"syntology":{"ran":3,"of":3,"n_ran_checked":2,"n_instrument":1,"unverified":0,"pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 2 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["salesforce/cove"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/teacher-student-curriculum-learning","slug":"teacher-student-curriculum-learning","title":"Teacher-Student Curriculum Learning","date":"2017-07-01","arxiv_id":"1707.00183","n_code_links":3,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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","official":{"repos":["tambetm/TSCL"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/explaining-recurrent-neural-network","slug":"explaining-recurrent-neural-network","title":"Explaining Recurrent Neural Network Predictions in Sentiment Analysis","date":"2017-06-22","arxiv_id":"1706.07206","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["ArrasL/LRP_for_LSTM"],"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"]}}},{"paper":"/paper/deep-learning-for-precipitation-nowcasting-a","slug":"deep-learning-for-precipitation-nowcasting-a","title":"Deep Learning for Precipitation Nowcasting: A Benchmark and A New Model","date":"2017-06-12","arxiv_id":"1706.03458","n_code_links":4,"syntology":{"ran":9,"of":10,"n_ran_checked":1,"n_instrument":8,"unverified":1,"pointer_only":5,"phrase":"9 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; 8 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":"/paper/unpaired-image-to-image-translation-using","slug":"unpaired-image-to-image-translation-using","title":"Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks","date":"2017-03-30","arxiv_id":"1703.10593","n_code_links":190,"syntology":{"ran":14,"of":31,"n_ran_checked":9,"n_instrument":5,"unverified":17,"pointer_only":6,"phrase":"14 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 1 honoured, 0 violated, 8 with no contract checked; 5 where Syntology's instrument failed) · 17 unverified","official":{"repos":["junyanz/CycleGAN","junyanz/pytorch-CycleGAN-and-pix2pix"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/tacotron-towards-end-to-end-speech-synthesis","slug":"tacotron-towards-end-to-end-speech-synthesis","title":"Tacotron: Towards End-to-End Speech Synthesis","date":"2017-03-29","arxiv_id":"1703.10135","n_code_links":30,"syntology":{"ran":16,"of":25,"n_ran_checked":13,"n_instrument":3,"unverified":9,"pointer_only":6,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 1 violated, 9 with no contract checked; 3 where Syntology's instrument failed) · 9 unverified","official":null}},{"paper":"/paper/encoding-sentences-with-graph-convolutional","slug":"encoding-sentences-with-graph-convolutional","title":"Encoding Sentences with Graph Convolutional Networks for Semantic Role Labeling","date":"2017-03-14","arxiv_id":"1703.04826","n_code_links":2,"syntology":{"ran":4,"of":7,"n_ran_checked":4,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["diegma/neural-dep-srl"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/machine-learning-on-sequential-data-using-a","slug":"machine-learning-on-sequential-data-using-a","title":"Machine Learning on Sequential Data Using a Recurrent Weighted Average","date":"2017-03-03","arxiv_id":"1703.01253","n_code_links":2,"syntology":{"ran":6,"of":6,"n_ran_checked":1,"n_instrument":5,"unverified":0,"pointer_only":6,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 5 where Syntology's instrument failed) · 0 unverified","official":{"repos":["jostmey/rwa"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/bilateral-multi-perspective-matching-for","slug":"bilateral-multi-perspective-matching-for","title":"Bilateral Multi-Perspective Matching for Natural Language Sentences","date":"2017-02-13","arxiv_id":"1702.03814","n_code_links":10,"syntology":{"ran":1,"of":4,"n_ran_checked":0,"n_instrument":1,"unverified":3,"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) · 3 unverified","official":null}},{"paper":"/paper/representations-of-language-in-a-model-of","slug":"representations-of-language-in-a-model-of","title":"Representations of language in a model of visually grounded speech signal","date":"2017-02-07","arxiv_id":"1702.01991","n_code_links":2,"syntology":{"ran":2,"of":5,"n_ran_checked":2,"n_instrument":0,"unverified":3,"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) · 3 unverified","official":{"repos":["gchrupala/visually-grounded-speech"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/outrageously-large-neural-networks-the","slug":"outrageously-large-neural-networks-the","title":"Outrageously Large Neural Networks: The Sparsely-Gated Mixture-of-Experts Layer","date":"2017-01-23","arxiv_id":"1701.06538","n_code_links":4,"syntology":{"ran":4,"of":6,"n_ran_checked":4,"n_instrument":0,"unverified":2,"pointer_only":6,"phrase":"4 ran (of which 4 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified; every one of the 4 samples that ran constructed an object rather than computing a result","official":null}},{"paper":"/paper/predicting-human-eye-fixations-via-an-lstm","slug":"predicting-human-eye-fixations-via-an-lstm","title":"Predicting Human Eye Fixations via an LSTM-based Saliency Attentive Model","date":"2016-11-29","arxiv_id":"1611.09571","n_code_links":2,"syntology":{"ran":9,"of":11,"n_ran_checked":8,"n_instrument":1,"unverified":2,"pointer_only":1,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["marcellacornia/sam"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/learning-python-code-suggestion-with-a-sparse","slug":"learning-python-code-suggestion-with-a-sparse","title":"Learning Python Code Suggestion with a Sparse Pointer Network","date":"2016-11-24","arxiv_id":"1611.08307","n_code_links":5,"syntology":{"ran":7,"of":9,"n_ran_checked":3,"n_instrument":4,"unverified":2,"pointer_only":0,"phrase":"7 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; 4 where Syntology's instrument failed) · 2 unverified","official":{"repos":["uclmr/pycodesuggest"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":2,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/image-to-image-translation-with-conditional","slug":"image-to-image-translation-with-conditional","title":"Image-to-Image Translation with Conditional Adversarial Networks","date":"2016-11-21","arxiv_id":"1611.07004","n_code_links":192,"syntology":{"ran":74,"of":122,"n_ran_checked":68,"n_instrument":6,"unverified":48,"pointer_only":10,"phrase":"74 ran (of which 0 constructed an object rather than computing a result; 68 with no instrument failure: 4 honoured, 4 violated, 60 with no contract checked; 6 where Syntology's instrument failed) · 48 unverified","official":null}},{"paper":"/paper/quasi-recurrent-neural-networks","slug":"quasi-recurrent-neural-networks","title":"Quasi-Recurrent Neural Networks","date":"2016-11-05","arxiv_id":"1611.01576","n_code_links":7,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/pointer-sentinel-mixture-models","slug":"pointer-sentinel-mixture-models","title":"Pointer Sentinel Mixture Models","date":"2016-09-26","arxiv_id":"1609.07843","n_code_links":10,"syntology":{"ran":3,"of":9,"n_ran_checked":2,"n_instrument":1,"unverified":6,"pointer_only":1,"phrase":"3 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 1 where Syntology's instrument failed) · 6 unverified","official":null}},{"paper":"/paper/googles-neural-machine-translation-system","slug":"googles-neural-machine-translation-system","title":"Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translation","date":"2016-09-26","arxiv_id":"1609.08144","n_code_links":28,"syntology":{"ran":34,"of":46,"n_ran_checked":26,"n_instrument":8,"unverified":12,"pointer_only":13,"phrase":"34 ran (of which 4 constructed an object rather than computing a result; 26 with no instrument failure: 1 honoured, 2 violated, 23 with no contract checked; 8 where Syntology's instrument failed) · 12 unverified","official":null}},{"paper":"/paper/photo-realistic-single-image-super-resolution","slug":"photo-realistic-single-image-super-resolution","title":"Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network","date":"2016-09-15","arxiv_id":"1609.04802","n_code_links":140,"syntology":{"ran":55,"of":72,"n_ran_checked":45,"n_instrument":10,"unverified":17,"pointer_only":14,"phrase":"55 ran (of which 0 constructed an object rather than computing a result; 45 with no instrument failure: 3 honoured, 3 violated, 39 with no contract checked; 10 where Syntology's instrument failed) · 17 unverified","official":null}},{"paper":"/paper/making-deep-neural-networks-robust-to-label","slug":"making-deep-neural-networks-robust-to-label","title":"Making Deep Neural Networks Robust to Label Noise: a Loss Correction Approach","date":"2016-09-13","arxiv_id":"1609.03683","n_code_links":2,"syntology":{"ran":2,"of":2,"n_ran_checked":0,"n_instrument":2,"unverified":0,"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","official":{"repos":["giorgiop/loss-correction"],"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"]}}},{"paper":"/paper/attention-based-recurrent-neural-network","slug":"attention-based-recurrent-neural-network","title":"Attention-Based Recurrent Neural Network Models for Joint Intent Detection and Slot Filling","date":"2016-09-06","arxiv_id":"1609.01454","n_code_links":6,"syntology":{"ran":4,"of":5,"n_ran_checked":2,"n_instrument":2,"unverified":1,"pointer_only":2,"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) · 1 unverified","official":null}},{"paper":"/paper/recurrent-highway-networks","slug":"recurrent-highway-networks","title":"Recurrent Highway Networks","date":"2016-07-12","arxiv_id":"1607.03474","n_code_links":6,"syntology":{"ran":1,"of":5,"n_ran_checked":0,"n_instrument":1,"unverified":4,"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) · 4 unverified","official":{"repos":["julian121266/RecurrentHighwayNetworks"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":3,"ran_from_kinds":["listed"]}}},{"paper":"/paper/conditional-image-generation-with-pixelcnn","slug":"conditional-image-generation-with-pixelcnn","title":"Conditional Image Generation with PixelCNN Decoders","date":"2016-06-16","arxiv_id":"1606.05328","n_code_links":14,"syntology":{"ran":8,"of":14,"n_ran_checked":6,"n_instrument":2,"unverified":6,"pointer_only":3,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 2 honoured, 0 violated, 4 with no contract checked; 2 where Syntology's instrument failed) · 6 unverified","official":null}},{"paper":"/paper/infogan-interpretable-representation-learning","slug":"infogan-interpretable-representation-learning","title":"InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Nets","date":"2016-06-12","arxiv_id":"1606.03657","n_code_links":38,"syntology":{"ran":5,"of":6,"n_ran_checked":1,"n_instrument":4,"unverified":1,"pointer_only":0,"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) · 1 unverified","official":null}},{"paper":"/paper/sequence-to-sequence-learning-as-beam-search","slug":"sequence-to-sequence-learning-as-beam-search","title":"Sequence-to-Sequence Learning as Beam-Search Optimization","date":"2016-06-09","arxiv_id":"1606.02960","n_code_links":6,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"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","official":{"repos":["harvardnlp/BSO"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/adversarially-learned-inference","slug":"adversarially-learned-inference","title":"Adversarially Learned Inference","date":"2016-06-02","arxiv_id":"1606.00704","n_code_links":9,"syntology":{"ran":3,"of":4,"n_ran_checked":2,"n_instrument":1,"unverified":1,"pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["IshmaelBelghazi/ALI"],"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"]}}},{"paper":"/paper/aspect-level-sentiment-classification-with-1","slug":"aspect-level-sentiment-classification-with-1","title":"Aspect Level Sentiment Classification with Deep Memory Network","date":"2016-05-28","arxiv_id":"1605.08900","n_code_links":8,"syntology":{"ran":1,"of":2,"n_ran_checked":0,"n_instrument":1,"unverified":1,"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","official":null}},{"paper":"/paper/data-programming-creating-large-training-sets","slug":"data-programming-creating-large-training-sets","title":"Data Programming: Creating Large Training Sets, Quickly","date":"2016-05-25","arxiv_id":"1605.07723","n_code_links":4,"syntology":{"ran":6,"of":8,"n_ran_checked":6,"n_instrument":0,"unverified":2,"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","official":null}},{"paper":"/paper/programming-with-a-differentiable-forth","slug":"programming-with-a-differentiable-forth","title":"Programming with a Differentiable Forth Interpreter","date":"2016-05-21","arxiv_id":"1605.06640","n_code_links":1,"syntology":{"ran":9,"of":12,"n_ran_checked":9,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 9 with no instrument failure: 0 honoured, 0 violated, 9 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/recurrent-batch-normalization","slug":"recurrent-batch-normalization","title":"Recurrent Batch Normalization","date":"2016-03-30","arxiv_id":"1603.09025","n_code_links":3,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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","official":null}},{"paper":"/paper/simple-and-accurate-dependency-parsing-using","slug":"simple-and-accurate-dependency-parsing-using","title":"Simple and Accurate Dependency Parsing Using Bidirectional LSTM Feature Representations","date":"2016-03-14","arxiv_id":"1603.04351","n_code_links":1,"syntology":{"ran":3,"of":7,"n_ran_checked":3,"n_instrument":0,"unverified":4,"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) · 4 unverified","official":{"repos":["elikip/bist-parser"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":"/paper/end-to-end-sequence-labeling-via-bi","slug":"end-to-end-sequence-labeling-via-bi","title":"End-to-end Sequence Labeling via Bi-directional LSTM-CNNs-CRF","date":"2016-03-04","arxiv_id":"1603.01354","n_code_links":25,"syntology":{"ran":24,"of":24,"n_ran_checked":22,"n_instrument":2,"unverified":0,"pointer_only":3,"phrase":"24 ran (of which 0 constructed an object rather than computing a result; 22 with no instrument failure: 2 honoured, 0 violated, 20 with no contract checked; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/asynchronous-methods-for-deep-reinforcement","slug":"asynchronous-methods-for-deep-reinforcement","title":"Asynchronous Methods for Deep Reinforcement Learning","date":"2016-02-04","arxiv_id":"1602.01783","n_code_links":70,"syntology":{"ran":60,"of":95,"n_ran_checked":51,"n_instrument":9,"unverified":35,"pointer_only":20,"phrase":"60 ran (of which 20 constructed an object rather than computing a result; 51 with no instrument failure: 2 honoured, 1 violated, 48 with no contract checked; 9 where Syntology's instrument failed) · 35 unverified","official":null}},{"paper":"/paper/pixel-recurrent-neural-networks","slug":"pixel-recurrent-neural-networks","title":"Pixel Recurrent Neural Networks","date":"2016-01-25","arxiv_id":"1601.06759","n_code_links":20,"syntology":{"ran":19,"of":29,"n_ran_checked":17,"n_instrument":2,"unverified":10,"pointer_only":18,"phrase":"19 ran (of which 8 constructed an object rather than computing a result; 17 with no instrument failure: 1 honoured, 0 violated, 16 with no contract checked; 2 where Syntology's instrument failed) · 10 unverified","official":null}},{"paper":"/paper/learning-natural-language-inference-with-lstm","slug":"learning-natural-language-inference-with-lstm","title":"Learning Natural Language Inference with LSTM","date":"2015-12-30","arxiv_id":"1512.08849","n_code_links":4,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"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","official":{"repos":["shuohangwang/SeqMatchSeq"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/a-theoretically-grounded-application-of","slug":"a-theoretically-grounded-application-of","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","date":"2015-12-16","arxiv_id":"1512.05287","n_code_links":14,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":"/paper/effective-lstms-for-target-dependent","slug":"effective-lstms-for-target-dependent","title":"Effective LSTMs for Target-Dependent Sentiment Classification","date":"2015-12-03","arxiv_id":"1512.01100","n_code_links":10,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 2 unverified","official":null}},{"paper":"/paper/named-entity-recognition-with-bidirectional","slug":"named-entity-recognition-with-bidirectional","title":"Named Entity Recognition with Bidirectional LSTM-CNNs","date":"2015-11-26","arxiv_id":"1511.08308","n_code_links":14,"syntology":{"ran":9,"of":9,"n_ran_checked":7,"n_instrument":2,"unverified":0,"pointer_only":4,"phrase":"9 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; 2 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/character-aware-neural-language-models","slug":"character-aware-neural-language-models","title":"Character-Aware Neural Language Models","date":"2015-08-26","arxiv_id":"1508.06615","n_code_links":14,"syntology":{"ran":7,"of":11,"n_ran_checked":5,"n_instrument":2,"unverified":4,"pointer_only":1,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["yoonkim/lstm-char-cnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/bidirectional-lstm-crf-models-for-sequence","slug":"bidirectional-lstm-crf-models-for-sequence","title":"Bidirectional LSTM-CRF Models for Sequence Tagging","date":"2015-08-09","arxiv_id":"1508.01991","n_code_links":25,"syntology":{"ran":8,"of":8,"n_ran_checked":8,"n_instrument":0,"unverified":0,"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","official":null}},{"paper":"/paper/semantically-conditioned-lstm-based-natural","slug":"semantically-conditioned-lstm-based-natural","title":"Semantically Conditioned LSTM-based Natural Language Generation for Spoken Dialogue Systems","date":"2015-08-07","arxiv_id":"1508.01745","n_code_links":2,"syntology":{"ran":7,"of":7,"n_ran_checked":4,"n_instrument":3,"unverified":0,"pointer_only":3,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 4 honoured, 0 violated, 0 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":null}},{"paper":"/paper/convolutional-lstm-network-a-machine-learning","slug":"convolutional-lstm-network-a-machine-learning","title":"Convolutional LSTM Network: A Machine Learning Approach for Precipitation Nowcasting","date":"2015-06-13","arxiv_id":"1506.04214","n_code_links":23,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":2,"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) · 1 unverified","official":null}},{"paper":"/paper/teaching-machines-to-read-and-comprehend","slug":"teaching-machines-to-read-and-comprehend","title":"Teaching Machines to Read and Comprehend","date":"2015-06-10","arxiv_id":"1506.03340","n_code_links":12,"syntology":{"ran":1,"of":2,"n_ran_checked":1,"n_instrument":0,"unverified":1,"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","official":{"repos":["deepmind/rc-data"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/pointer-networks","slug":"pointer-networks","title":"Pointer Networks","date":"2015-06-09","arxiv_id":"1506.03134","n_code_links":21,"syntology":{"ran":18,"of":23,"n_ran_checked":13,"n_instrument":5,"unverified":5,"pointer_only":9,"phrase":"18 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 1 violated, 9 with no contract checked; 5 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":"/paper/transition-based-dependency-parsing-with-2","slug":"transition-based-dependency-parsing-with-2","title":"Transition-Based Dependency Parsing with Stack Long Short-Term Memory","date":"2015-05-29","arxiv_id":"1505.08075","n_code_links":7,"syntology":{"ran":7,"of":14,"n_ran_checked":6,"n_instrument":1,"unverified":7,"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) · 7 unverified","official":{"repos":["clab/lstm-parser"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/improved-semantic-representations-from-tree","slug":"improved-semantic-representations-from-tree","title":"Improved Semantic Representations From Tree-Structured Long Short-Term Memory Networks","date":"2015-02-28","arxiv_id":"1503.00075","n_code_links":16,"syntology":{"ran":12,"of":15,"n_ran_checked":6,"n_instrument":6,"unverified":3,"pointer_only":6,"phrase":"12 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; 6 where Syntology's instrument failed) · 3 unverified","official":{"repos":["stanfordnlp/treelstm"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/unsupervised-learning-of-video","slug":"unsupervised-learning-of-video","title":"Unsupervised Learning of Video Representations using LSTMs","date":"2015-02-16","arxiv_id":"1502.04681","n_code_links":12,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":2,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 2 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["emansim/unsupervised-videos"],"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"]}}},{"paper":"/paper/empirical-evaluation-of-gated-recurrent","slug":"empirical-evaluation-of-gated-recurrent","title":"Empirical Evaluation of Gated Recurrent Neural Networks on Sequence Modeling","date":"2014-12-11","arxiv_id":"1412.3555","n_code_links":14,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"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","official":{"repos":["jych/librnn"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/neural-turing-machines","slug":"neural-turing-machines","title":"Neural Turing Machines","date":"2014-10-20","arxiv_id":"1410.5401","n_code_links":34,"syntology":{"ran":5,"of":8,"n_ran_checked":4,"n_instrument":1,"unverified":3,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 2 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":"/paper/learning-to-execute","slug":"learning-to-execute","title":"Learning to Execute","date":"2014-10-17","arxiv_id":"1410.4615","n_code_links":6,"syntology":{"ran":1,"of":3,"n_ran_checked":1,"n_instrument":0,"unverified":2,"pointer_only":3,"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) · 2 unverified","official":{"repos":["wojciechz/learning_to_execute"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/sequence-to-sequence-learning-with-neural","slug":"sequence-to-sequence-learning-with-neural","title":"Sequence to Sequence Learning with Neural Networks","date":"2014-09-10","arxiv_id":"1409.3215","n_code_links":74,"syntology":{"ran":21,"of":25,"n_ran_checked":13,"n_instrument":8,"unverified":4,"pointer_only":9,"phrase":"21 ran (of which 0 constructed an object rather than computing a result; 13 with no instrument failure: 3 honoured, 0 violated, 10 with no contract checked; 8 where Syntology's instrument failed) · 4 unverified","official":null}}],"record_sha256":"9598aa4b13cc4e7f347e91ff92e3d8996e567a901a1d4bb243df642918d8d981","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}