{"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/tanh-activation/papers/63","list_of":"/method/tanh-activation","method":"Tanh Activation","archive":{"snapshot":"2025-07-28"},"syntology_read_at":"2026-09-28T10:30:06+00:00","order":"archive","order_definition":"date (newest first), then slug","page":63,"pages_in_order":64,"rows_per_page":100,"rows":[6201,6300],"of":6333,"counts":{"archive_papers_tagged":6333,"with_a_code_link":2134,"where_syntology_ran_a_sample":386,"not_listed_spam_title":0,"listed":6333,"listed_where_code_ran":386,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":324,"every_run_a_failure_of_syntologys_instrument":62,"listed_with_a_run_with_no_instrument_failure":324,"listed_every_run_a_failure_of_syntologys_instrument":62,"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/tanh-activation","prev":"/method/tanh-activation/papers/62","next":"/method/tanh-activation/papers/64","papers":[{"paper":null,"slug":"diversified-visual-attention-networks-for","title":"Diversified Visual Attention Networks for Fine-Grained Object Classification","date":"2016-06-28","arxiv_id":"1606.08572","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comprehensive-study-of-deep-bidirectional","title":"A Comprehensive Study of Deep Bidirectional LSTM RNNs for Acoustic Modeling in Speech Recognition","date":"2016-06-22","arxiv_id":"1606.06871","n_code_links":0,"syntology":null},{"paper":"/paper/drawing-and-recognizing-chinese-characters","slug":"drawing-and-recognizing-chinese-characters","title":"Drawing and Recognizing Chinese Characters with Recurrent Neural Network","date":"2016-06-21","arxiv_id":"1606.06539","n_code_links":1,"syntology":null},{"paper":null,"slug":"incremental-parsing-with-minimal-features","title":"Incremental Parsing with Minimal Features Using Bi-Directional LSTM","date":"2016-06-21","arxiv_id":"1606.06406","n_code_links":0,"syntology":null},{"paper":"/paper/neural-morphological-tagging-from-characters","slug":"neural-morphological-tagging-from-characters","title":"Neural Morphological Tagging from Characters for Morphologically Rich Languages","date":"2016-06-21","arxiv_id":"1606.06640","n_code_links":1,"syntology":null},{"paper":null,"slug":"detection-and-tracking-of-liquids-with-fully","title":"Detection and Tracking of Liquids with Fully Convolutional Networks","date":"2016-06-20","arxiv_id":"1606.06266","n_code_links":0,"syntology":null},{"paper":"/paper/stance-detection-with-bidirectional","slug":"stance-detection-with-bidirectional","title":"Stance Detection with Bidirectional Conditional Encoding","date":"2016-06-17","arxiv_id":"1606.05464","n_code_links":1,"syntology":null},{"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":null,"slug":"increasing-the-interpretability-of-recurrent","title":"Increasing the Interpretability of Recurrent Neural Networks Using Hidden Markov Models","date":"2016-06-16","arxiv_id":"1606.05320","n_code_links":0,"syntology":null},{"paper":null,"slug":"bidirectional-long-short-term-memory-for","title":"Bidirectional Long-Short Term Memory for Video Description","date":"2016-06-15","arxiv_id":"1606.04631","n_code_links":0,"syntology":null},{"paper":null,"slug":"multi-modal-hybrid-deep-neural-network-for","title":"Multi-Modal Hybrid Deep Neural Network for Speech Enhancement","date":"2016-06-15","arxiv_id":"1606.04750","n_code_links":0,"syntology":null},{"paper":"/paper/deep-recurrent-models-with-fast-forward","slug":"deep-recurrent-models-with-fast-forward","title":"Deep Recurrent Models with Fast-Forward Connections for Neural Machine Translation","date":"2016-06-14","arxiv_id":"1606.04199","n_code_links":1,"syntology":null},{"paper":"/paper/deep-reinforcement-learning-with-a","slug":"deep-reinforcement-learning-with-a","title":"Deep Reinforcement Learning with a Combinatorial Action Space for Predicting Popular Reddit Threads","date":"2016-06-12","arxiv_id":"1606.03667","n_code_links":1,"syntology":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":null,"slug":"mufuru-the-multi-function-recurrent-unit","title":"MuFuRU: The Multi-Function Recurrent Unit","date":"2016-06-09","arxiv_id":"1606.03002","n_code_links":0,"syntology":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/gated-word-character-recurrent-language-model","slug":"gated-word-character-recurrent-language-model","title":"Gated Word-Character Recurrent Language Model","date":"2016-06-06","arxiv_id":"1606.01700","n_code_links":5,"syntology":null},{"paper":null,"slug":"generating-natural-language-inference-chains","title":"Generating Natural Language Inference Chains","date":"2016-06-04","arxiv_id":"1606.01404","n_code_links":0,"syntology":null},{"paper":null,"slug":"end-to-end-lstm-based-dialog-control","title":"End-to-end LSTM-based dialog control optimized with supervised and reinforcement learning","date":"2016-06-03","arxiv_id":"1606.01269","n_code_links":0,"syntology":null},{"paper":null,"slug":"progressively-parsing-interactional-objects","title":"Progressively Parsing Interactional Objects for Fine Grained Action Detection","date":"2016-06-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"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":null,"slug":"automatic-open-knowledge-acquisition-via-long","title":"Automatic Open Knowledge Acquisition via Long Short-Term Memory Networks with Feedback Negative Sampling","date":"2016-05-25","arxiv_id":"1605.07918","n_code_links":0,"syntology":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":null,"slug":"lstm-with-working-memory","title":"LSTM with Working Memory","date":"2016-05-06","arxiv_id":"1605.01988","n_code_links":0,"syntology":null},{"paper":"/paper/modeling-rich-contexts-for-sentiment","slug":"modeling-rich-contexts-for-sentiment","title":"Modeling Rich Contexts for Sentiment Classification with LSTM","date":"2016-05-05","arxiv_id":"1605.01478","n_code_links":1,"syntology":null},{"paper":null,"slug":"libn3la-lightweight-package-for-neural-nlp","title":"LibN3L:A Lightweight Package for Neural NLP","date":"2016-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"bridging-lstm-architecture-and-the-neural","title":"Bridging LSTM Architecture and the Neural Dynamics during Reading","date":"2016-04-22","arxiv_id":"1604.06635","n_code_links":0,"syntology":null},{"paper":null,"slug":"dependency-parsing-with-lstms-an-empirical","title":"Dependency Parsing with LSTMs: An Empirical Evaluation","date":"2016-04-22","arxiv_id":"1604.06529","n_code_links":0,"syntology":null},{"paper":null,"slug":"chinese-song-iambics-generation-with-neural","title":"Chinese Song Iambics Generation with Neural Attention-based Model","date":"2016-04-21","arxiv_id":"1604.06274","n_code_links":0,"syntology":null},{"paper":null,"slug":"scan-attend-and-read-end-to-end-handwritten","title":"Scan, Attend and Read: End-to-End Handwritten Paragraph Recognition with MDLSTM Attention","date":"2016-04-12","arxiv_id":"1604.03286","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-gate-recurrent-neural-network","title":"Deep Gate Recurrent Neural Network","date":"2016-04-11","arxiv_id":"1604.02910","n_code_links":0,"syntology":null},{"paper":null,"slug":"learning-compact-recurrent-neural-networks","title":"Learning Compact Recurrent Neural Networks","date":"2016-04-09","arxiv_id":"1604.02594","n_code_links":0,"syntology":null},{"paper":null,"slug":"geometric-scene-parsing-with-hierarchical","title":"Geometric Scene Parsing with Hierarchical LSTM","date":"2016-04-07","arxiv_id":"1604.01931","n_code_links":0,"syntology":null},{"paper":"/paper/a-focused-dynamic-attention-model-for-visual","slug":"a-focused-dynamic-attention-model-for-visual","title":"A Focused Dynamic Attention Model for Visual Question Answering","date":"2016-04-06","arxiv_id":"1604.01485","n_code_links":0,"syntology":null},{"paper":"/paper/image-captioning-with-deep-bidirectional","slug":"image-captioning-with-deep-bidirectional","title":"Image Captioning with Deep Bidirectional LSTMs","date":"2016-04-04","arxiv_id":"1604.00790","n_code_links":1,"syntology":null},{"paper":"/paper/lstm-based-conversation-models","slug":"lstm-based-conversation-models","title":"LSTM based Conversation Models","date":"2016-03-31","arxiv_id":"1603.09457","n_code_links":1,"syntology":null},{"paper":null,"slug":"minimal-gated-unit-for-recurrent-neural","title":"Minimal Gated Unit for Recurrent Neural Networks","date":"2016-03-31","arxiv_id":"1603.09420","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhancing-sentence-relation-modeling-with","title":"Enhancing Sentence Relation Modeling with Auxiliary Character-level Embedding","date":"2016-03-30","arxiv_id":"1603.09405","n_code_links":0,"syntology":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":null,"slug":"investigation-into-the-effectiveness-of-long","title":"Investigation Into The Effectiveness Of Long Short Term Memory Networks For Stock Price Prediction","date":"2016-03-25","arxiv_id":"1603.07893","n_code_links":0,"syntology":null},{"paper":null,"slug":"co-occurrence-feature-learning-for-skeleton","title":"Co-occurrence Feature Learning for Skeleton based Action Recognition using Regularized Deep LSTM Networks","date":"2016-03-24","arxiv_id":"1603.07772","n_code_links":0,"syntology":null},{"paper":null,"slug":"semantic-object-parsing-with-graph-lstm","title":"Semantic Object Parsing with Graph LSTM","date":"2016-03-23","arxiv_id":"1603.07063","n_code_links":0,"syntology":null},{"paper":"/paper/semi-supervised-word-sense-disambiguation-1","slug":"semi-supervised-word-sense-disambiguation-1","title":"Semi-supervised Word Sense Disambiguation with Neural Models","date":"2016-03-22","arxiv_id":"1603.07012","n_code_links":0,"syntology":null},{"paper":"/paper/incorporating-copying-mechanism-in-sequence","slug":"incorporating-copying-mechanism-in-sequence","title":"Incorporating Copying Mechanism in Sequence-to-Sequence Learning","date":"2016-03-21","arxiv_id":"1603.06393","n_code_links":7,"syntology":null},{"paper":"/paper/segmentation-from-natural-language","slug":"segmentation-from-natural-language","title":"Segmentation from Natural Language Expressions","date":"2016-03-20","arxiv_id":"1603.06180","n_code_links":4,"syntology":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/low-rank-passthrough-neural-networks","slug":"low-rank-passthrough-neural-networks","title":"Low-rank passthrough neural networks","date":"2016-03-10","arxiv_id":"1603.03116","n_code_links":4,"syntology":null},{"paper":"/paper/a-latent-variable-recurrent-neural-network","slug":"a-latent-variable-recurrent-neural-network","title":"A Latent Variable Recurrent Neural Network for Discourse Relation Language Models","date":"2016-03-07","arxiv_id":"1603.01913","n_code_links":1,"syntology":null},{"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":null,"slug":"lie-access-neural-turing-machine","title":"Lie Access Neural Turing Machine","date":"2016-02-28","arxiv_id":"1602.08671","n_code_links":0,"syntology":null},{"paper":null,"slug":"contextual-lstm-clstm-models-for-large-scale","title":"Contextual LSTM (CLSTM) models for Large scale NLP tasks","date":"2016-02-19","arxiv_id":"1602.06291","n_code_links":0,"syntology":null},{"paper":null,"slug":"bi-directional-lstm-recurrent-neural-network","title":"Bi-directional LSTM Recurrent Neural Network for Chinese Word Segmentation","date":"2016-02-16","arxiv_id":"1602.04874","n_code_links":0,"syntology":null},{"paper":null,"slug":"look-listen-and-learn-a-multimodal-lstm-for","title":"Look, Listen and Learn - A Multimodal LSTM for Speaker Identification","date":"2016-02-13","arxiv_id":"1602.04364","n_code_links":0,"syntology":null},{"paper":"/paper/associative-long-short-term-memory","slug":"associative-long-short-term-memory","title":"Associative Long Short-Term Memory","date":"2016-02-09","arxiv_id":"1602.03032","n_code_links":3,"syntology":null},{"paper":null,"slug":"learning-efficient-algorithms-with","title":"Learning Efficient Algorithms with Hierarchical Attentive Memory","date":"2016-02-09","arxiv_id":"1602.03218","n_code_links":0,"syntology":null},{"paper":"/paper/supervised-and-semi-supervised-text","slug":"supervised-and-semi-supervised-text","title":"Supervised and Semi-Supervised Text Categorization using LSTM for Region Embeddings","date":"2016-02-07","arxiv_id":"1602.02373","n_code_links":0,"syntology":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":null,"slug":"investigating-gated-recurrent-neural-networks","title":"Investigating gated recurrent neural networks for speech synthesis","date":"2016-01-11","arxiv_id":"1601.02539","n_code_links":0,"syntology":null},{"paper":null,"slug":"leveraging-sentence-level-information-with","title":"Leveraging Sentence-level Information with Encoder LSTM for Semantic Slot Filling","date":"2016-01-07","arxiv_id":"1601.01530","n_code_links":0,"syntology":null},{"paper":"/paper/mutual-information-and-diverse-decoding","slug":"mutual-information-and-diverse-decoding","title":"Mutual Information and Diverse Decoding Improve Neural Machine Translation","date":"2016-01-04","arxiv_id":"1601.00372","n_code_links":1,"syntology":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":null,"slug":"an-empirical-comparison-of-neural","title":"An Empirical Comparison of Neural Architectures for Reinforcement Learning in Partially Observable Environments","date":"2015-12-17","arxiv_id":"1512.05509","n_code_links":0,"syntology":null},{"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/generating-news-headlines-with-recurrent","slug":"generating-news-headlines-with-recurrent","title":"Generating News Headlines with Recurrent Neural Networks","date":"2015-12-05","arxiv_id":"1512.01712","n_code_links":4,"syntology":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":null,"slug":"are-you-talking-to-a-machine-dataset-and-1","title":"Are You Talking to a Machine? Dataset and Methods for Multilingual Image Question","date":"2015-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"guiding-the-long-short-term-memory-model-for","title":"Guiding the Long-Short Term Memory Model for Image Caption Generation","date":"2015-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"lstm-neural-reordering-feature-for","title":"LSTM Neural Reordering Feature for Statistical Machine Translation","date":"2015-12-01","arxiv_id":"1512.00177","n_code_links":0,"syntology":null},{"paper":null,"slug":"sequence-to-sequence-video-to-text-1","title":"Sequence to Sequence - Video to Text","date":"2015-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/a-c-lstm-neural-network-for-text","slug":"a-c-lstm-neural-network-for-text","title":"A C-LSTM Neural Network for Text Classification","date":"2015-11-27","arxiv_id":"1511.08630","n_code_links":10,"syntology":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/regularizing-rnns-by-stabilizing-activations","slug":"regularizing-rnns-by-stabilizing-activations","title":"Regularizing RNNs by Stabilizing Activations","date":"2015-11-26","arxiv_id":"1511.08400","n_code_links":1,"syntology":null},{"paper":null,"slug":"towards-universal-paraphrastic-sentence","title":"Towards Universal Paraphrastic Sentence Embeddings","date":"2015-11-25","arxiv_id":"1511.08198","n_code_links":0,"syntology":null},{"paper":"/paper/a-hierarchical-deep-temporal-model-for-group","slug":"a-hierarchical-deep-temporal-model-for-group","title":"A Hierarchical Deep Temporal Model for Group Activity Recognition","date":"2015-11-19","arxiv_id":"1511.06040","n_code_links":1,"syntology":null},{"paper":null,"slug":"blending-lstms-into-cnns","title":"Blending LSTMs into CNNs","date":"2015-11-19","arxiv_id":"1511.06433","n_code_links":0,"syntology":null},{"paper":null,"slug":"comparative-study-of-deep-learning-software","title":"Comparative Study of Deep Learning Software Frameworks","date":"2015-11-19","arxiv_id":"1511.06435","n_code_links":0,"syntology":null},{"paper":"/paper/order-matters-sequence-to-sequence-for-sets","slug":"order-matters-sequence-to-sequence-for-sets","title":"Order Matters: Sequence to sequence for sets","date":"2015-11-19","arxiv_id":"1511.06391","n_code_links":9,"syntology":null},{"paper":"/paper/spatio-temporal-video-autoencoder-with","slug":"spatio-temporal-video-autoencoder-with","title":"Spatio-temporal video autoencoder with differentiable memory","date":"2015-11-19","arxiv_id":"1511.06309","n_code_links":1,"syntology":null},{"paper":null,"slug":"symbol-grounding-association-in-multimodal","title":"Symbol Grounding Association in Multimodal Sequences with Missing Elements","date":"2015-11-13","arxiv_id":"1511.04401","n_code_links":0,"syntology":null},{"paper":null,"slug":"larger-context-language-modelling","title":"Larger-Context Language Modelling","date":"2015-11-11","arxiv_id":"1511.03729","n_code_links":0,"syntology":null},{"paper":"/paper/visual7w-grounded-question-answering-in","slug":"visual7w-grounded-question-answering-in","title":"Visual7W: Grounded Question Answering in Images","date":"2015-11-11","arxiv_id":"1511.03416","n_code_links":0,"syntology":null},{"paper":"/paper/top-down-tree-long-short-term-memory-networks","slug":"top-down-tree-long-short-term-memory-networks","title":"Top-down Tree Long Short-Term Memory Networks","date":"2015-10-31","arxiv_id":"1511.00060","n_code_links":1,"syntology":null},{"paper":null,"slug":"generating-text-with-deep-reinforcement","title":"Generating Text with Deep Reinforcement Learning","date":"2015-10-30","arxiv_id":"1510.09202","n_code_links":0,"syntology":null},{"paper":null,"slug":"empirical-study-on-deep-learning-models-for","title":"Empirical Study on Deep Learning Models for Question Answering","date":"2015-10-26","arxiv_id":"1510.07526","n_code_links":0,"syntology":null},{"paper":null,"slug":"phenotyping-of-clinical-time-series-with-lstm","title":"Phenotyping of Clinical Time Series with LSTM Recurrent Neural Networks","date":"2015-10-26","arxiv_id":"1510.07641","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-and-contrasting-recurrent-neural","title":"Optimizing and Contrasting Recurrent Neural Network Architectures","date":"2015-10-16","arxiv_id":"1510.04953","n_code_links":0,"syntology":null},{"paper":"/paper/guiding-long-short-term-memory-for-image","slug":"guiding-long-short-term-memory-for-image","title":"Guiding Long-Short Term Memory for Image Caption Generation","date":"2015-09-16","arxiv_id":"1509.04942","n_code_links":1,"syntology":null},{"paper":"/paper/long-short-term-memory-neural-networks-for","slug":"long-short-term-memory-neural-networks-for","title":"Long Short-Term Memory Neural Networks for Chinese Word Segmentation","date":"2015-09-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/classifying-relations-via-long-short-term","slug":"classifying-relations-via-long-short-term","title":"Classifying Relations via Long Short Term Memory Networks along Shortest Dependency Path","date":"2015-08-15","arxiv_id":"1508.03720","n_code_links":0,"syntology":null},{"paper":"/paper/benchmarking-of-lstm-networks","slug":"benchmarking-of-lstm-networks","title":"Benchmarking of LSTM Networks","date":"2015-08-11","arxiv_id":"1508.02774","n_code_links":1,"syntology":null},{"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":null,"slug":"time-series-modeling-with-undecimated-fully","title":"Time-series modeling with undecimated fully convolutional neural networks","date":"2015-08-03","arxiv_id":"1508.00317","n_code_links":0,"syntology":null},{"paper":null,"slug":"fast-and-accurate-recurrent-neural-network","title":"Fast and Accurate Recurrent Neural Network Acoustic Models for Speech Recognition","date":"2015-07-24","arxiv_id":"1507.06947","n_code_links":0,"syntology":null},{"paper":"/paper/deep-recurrent-q-learning-for-partially","slug":"deep-recurrent-q-learning-for-partially","title":"Deep Recurrent Q-Learning for Partially Observable MDPs","date":"2015-07-23","arxiv_id":"1507.06527","n_code_links":5,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"0 ran · 2 unverified","official":null}},{"paper":"/paper/grid-long-short-term-memory","slug":"grid-long-short-term-memory","title":"Grid Long Short-Term Memory","date":"2015-07-06","arxiv_id":"1507.01526","n_code_links":1,"syntology":null},{"paper":"/paper/attention-based-models-for-speech-recognition","slug":"attention-based-models-for-speech-recognition","title":"Attention-Based Models for Speech Recognition","date":"2015-06-24","arxiv_id":"1506.07503","n_code_links":14,"syntology":null},{"paper":null,"slug":"a-deep-memory-based-architecture-for-sequence","title":"A Deep Memory-based Architecture for Sequence-to-Sequence Learning","date":"2015-06-22","arxiv_id":"1506.06442","n_code_links":0,"syntology":null}],"record_sha256":"6ad3393f0a2fdf48d1f57bcd1b75f85e276abda6a0973c90840c3b48401f952a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}