{"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/variational-dropout","slug":"variational-dropout","name":"Variational Dropout","full_name":"Variational Dropout","full_name_withheld":false,"description_markdown":"**Variational Dropout** is a regularization technique based on [dropout](https://paperswithcode.com/method/dropout), but uses a variational inference grounded approach. In Variational Dropout, we repeat the same dropout mask at each time step for both inputs, outputs, and recurrent layers (drop the same network units at each time step). This is in contrast to ordinary Dropout where different dropout masks are sampled at each time step for the inputs and outputs alone.","description_state":"present","introduced_year":null,"introduced_by":{"title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","paper":"/paper/a-theoretically-grounded-application-of","first_author":"Yarin Gal","n_authors":2,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/a-theoretically-grounded-application-of"},"source":{"url":"http://arxiv.org/abs/1512.05287v5","title":"A Theoretically Grounded Application of Dropout in Recurrent Neural Networks","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/salesforce/awd-lstm-lm/blob/32fcb42562aeb5c7e6c9dec3f2a3baaaf68a5cb5/weight_drop.py#L5","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Regularization","url":"/methods/category/regularization","pwc_aliases":[]}],"n_papers_tagged":141,"archive_num_papers":141,"papers_newest_first":[{"paper":"/paper/rlbenchnet-the-right-network-for-the-right","slug":"rlbenchnet-the-right-network-for-the-right","title":"RLBenchNet: The Right Network for the Right Reinforcement Learning Task","date":"2025-05-21","arxiv_id":"2505.15040","n_code_links":1,"syntology":null},{"paper":null,"slug":"advanced-deep-learning-techniques-for","title":"Advanced Deep Learning Techniques for Analyzing Earnings Call Transcripts: Methodologies and Applications","date":"2025-02-27","arxiv_id":"2503.01886","n_code_links":0,"syntology":null},{"paper":null,"slug":"barnn-a-bayesian-autoregressive-and-recurrent","title":"BARNN: A Bayesian Autoregressive and Recurrent Neural Network","date":"2025-01-30","arxiv_id":"2501.18665","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-combined-encoder-and-transformer-approach","title":"A Combined Encoder and Transformer Approach for Coherent and High-Quality Text Generation","date":"2024-11-19","arxiv_id":"2411.12157","n_code_links":0,"syntology":null},{"paper":null,"slug":"no-argument-left-behind-overlapping-chunks","title":"No Argument Left Behind: Overlapping Chunks for Faster Processing of Arbitrarily Long Legal Texts","date":"2024-10-24","arxiv_id":"2410.19184","n_code_links":0,"syntology":null},{"paper":null,"slug":"large-body-language-models","title":"Large Body Language Models","date":"2024-10-21","arxiv_id":"2410.16533","n_code_links":0,"syntology":null},{"paper":"/paper/rico-reddit-ideological-communities","slug":"rico-reddit-ideological-communities","title":"RICo: Reddit ideological communities","date":"2024-06-05","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"transformers-for-supervised-online-continual","title":"Transformers for Supervised Online Continual Learning","date":"2024-03-03","arxiv_id":"2403.01554","n_code_links":0,"syntology":null},{"paper":"/paper/unimem-towards-a-unified-view-of-long-context","slug":"unimem-towards-a-unified-view-of-long-context","title":"UniMem: Towards a Unified View of Long-Context Large Language Models","date":"2024-02-05","arxiv_id":"2402.03009","n_code_links":1,"syntology":null},{"paper":"/paper/exploring-multi-level-threats-in-telegram","slug":"exploring-multi-level-threats-in-telegram","title":"Exploring Multi-Level Threats in Telegram Data with AI-Human Annotation: A Preliminary Study","date":"2023-12-15","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"illicit-darkweb-classification-via-natural","title":"Illicit Darkweb Classification via Natural-language Processing: Classifying Illicit Content of Webpages based on Textual Information","date":"2023-12-08","arxiv_id":"2312.04944","n_code_links":0,"syntology":null},{"paper":"/paper/memory-efficient-stochastic-methods-for","slug":"memory-efficient-stochastic-methods-for","title":"Memory-efficient Stochastic methods for Memory-based Transformers","date":"2023-11-14","arxiv_id":"2311.08123","n_code_links":1,"syntology":null},{"paper":"/paper/trams-training-free-memory-selection-for-long","slug":"trams-training-free-memory-selection-for-long","title":"TRAMS: Training-free Memory Selection for Long-range Language Modeling","date":"2023-10-24","arxiv_id":"2310.15494","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":["lwaekfjlk/trams"],"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/approximating-two-layer-feedforward-networks","slug":"approximating-two-layer-feedforward-networks","title":"Approximating Two-Layer Feedforward Networks for Efficient Transformers","date":"2023-10-16","arxiv_id":"2310.10837","n_code_links":2,"syntology":{"ran":3,"of":4,"n_ran_checked":1,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["robertcsordas/moe","robertcsordas/moe_layer"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/memory-gym-partially-observable-challenges-to","slug":"memory-gym-partially-observable-challenges-to","title":"Memory Gym: Towards Endless Tasks to Benchmark Memory Capabilities of Agents","date":"2023-09-29","arxiv_id":"2309.17207","n_code_links":1,"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":{"repos":["marcometer/endless-memory-gym"],"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"]}}},{"paper":"/paper/random-access-infinite-context-length-for","slug":"random-access-infinite-context-length-for","title":"Random-Access Infinite Context Length for Transformers","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/rcmha-relative-convolutional-multi-head","slug":"rcmha-relative-convolutional-multi-head","title":"RCMHA: Relative Convolutional Multi-Head Attention for Natural Language Modelling","date":"2023-08-07","arxiv_id":"2308.03429","n_code_links":1,"syntology":null},{"paper":"/paper/landmark-attention-random-access-infinite","slug":"landmark-attention-random-access-infinite","title":"Landmark Attention: Random-Access Infinite Context Length for Transformers","date":"2023-05-25","arxiv_id":"2305.16300","n_code_links":2,"syntology":{"ran":11,"of":13,"n_ran_checked":5,"n_instrument":6,"unverified":2,"pointer_only":0,"phrase":"11 ran (of which 5 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 6 where Syntology's instrument failed) · 2 unverified","official":{"repos":["epfml/landmark-attention"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["community","listed","official"]}}},{"paper":null,"slug":"sparsified-model-zoo-twins-investigating","title":"Sparsified Model Zoo Twins: Investigating Populations of Sparsified Neural Network Models","date":"2023-04-26","arxiv_id":"2304.13718","n_code_links":0,"syntology":null},{"paper":"/paper/transformer-based-world-models-are-happy-with","slug":"transformer-based-world-models-are-happy-with","title":"Transformer-based World Models Are Happy With 100k Interactions","date":"2023-03-13","arxiv_id":"2303.07109","n_code_links":1,"syntology":{"ran":16,"of":25,"n_ran_checked":8,"n_instrument":8,"unverified":9,"pointer_only":0,"phrase":"16 ran (of which 6 constructed an object rather than computing a result; 8 with no instrument failure: 1 honoured, 1 violated, 6 with no contract checked; 8 where Syntology's instrument failed) · 9 unverified","official":{"repos":["jrobine/twm"],"state":"official (archive's flag): 16 ran","n_ran":16,"n_constructed":6,"n_ran_no_instrument_failure":8,"n_unverified":9,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"gtr-ctrl-instrument-and-genre-conditioning","title":"GTR-CTRL: Instrument and Genre Conditioning for Guitar-Focused Music Generation with Transformers","date":"2023-02-10","arxiv_id":"2302.05393","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-comparative-analysis-of-different-pitch","title":"An Comparative Analysis of Different Pitch and Metrical Grid Encoding Methods in the Task of Sequential Music Generation","date":"2023-01-31","arxiv_id":"2301.13383","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-sparsely-activated-transformers","title":"Efficient Sparsely Activated Transformers","date":"2022-08-31","arxiv_id":"2208.14580","n_code_links":0,"syntology":null},{"paper":"/paper/adan-adaptive-nesterov-momentum-algorithm-for","slug":"adan-adaptive-nesterov-momentum-algorithm-for","title":"Adan: Adaptive Nesterov Momentum Algorithm for Faster Optimizing Deep Models","date":"2022-08-13","arxiv_id":"2208.06677","n_code_links":9,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"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","official":{"repos":["sail-sg/adan"],"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/recurrent-memory-transformer","slug":"recurrent-memory-transformer","title":"Recurrent Memory Transformer","date":"2022-07-14","arxiv_id":"2207.06881","n_code_links":3,"syntology":{"ran":6,"of":13,"n_ran_checked":5,"n_instrument":1,"unverified":7,"pointer_only":2,"phrase":"6 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 1 violated, 3 with no contract checked; 1 where Syntology's instrument failed) · 7 unverified","official":{"repos":["booydar/lm-rmt","booydar/transformer-xl"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":3,"n_ran_no_instrument_failure":3,"n_unverified":6,"ran_from_kinds":["community","official","unlocated"]}}},{"paper":null,"slug":"explainable-and-high-performance-hate-and","title":"Explainable and High-Performance Hate and Offensive Speech Detection","date":"2022-06-26","arxiv_id":"2206.12983","n_code_links":0,"syntology":null},{"paper":"/paper/emotion-aware-transformer-encoder-for-1","slug":"emotion-aware-transformer-encoder-for-1","title":"Emotion-Aware Transformer Encoder for Empathetic Dialogue Generation","date":"2022-04-24","arxiv_id":"2204.11320","n_code_links":1,"syntology":null},{"paper":"/paper/sintra-learning-an-inspiration-model-from-a","slug":"sintra-learning-an-inspiration-model-from-a","title":"SinTra: Learning an inspiration model from a single multi-track music segment","date":"2022-04-21","arxiv_id":"2204.09917","n_code_links":1,"syntology":null},{"paper":"/paper/litetransformersearch-training-free-on-device","slug":"litetransformersearch-training-free-on-device","title":"LiteTransformerSearch: Training-free Neural Architecture Search for Efficient Language Models","date":"2022-03-04","arxiv_id":"2203.02094","n_code_links":1,"syntology":{"ran":5,"of":5,"n_ran_checked":4,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["microsoft/archai"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"reconsidering-the-past-optimizing-hidden-1","title":"Reconsidering the Past: Optimizing Hidden States in Language Models","date":"2021-12-16","arxiv_id":"2112.08653","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comparative-study-of-transformers-on-word","title":"A Comparative Study of Transformers on Word Sense Disambiguation","date":"2021-11-30","arxiv_id":"2111.15417","n_code_links":0,"syntology":null},{"paper":null,"slug":"how-much-do-language-models-copy-from-their","title":"How much do language models copy from their training data? Evaluating linguistic novelty in text generation using RAVEN","date":"2021-11-18","arxiv_id":"2111.09509","n_code_links":0,"syntology":null},{"paper":"/paper/iiitt-dravidian-codemix-fire2021","slug":"iiitt-dravidian-codemix-fire2021","title":"IIITT@Dravidian-CodeMix-FIRE2021: Transliterate or translate? Sentiment analysis of code-mixed text in Dravidian languages","date":"2021-11-15","arxiv_id":"2111.07906","n_code_links":1,"syntology":null},{"paper":"/paper/synthesizing-collective-communication","slug":"synthesizing-collective-communication","title":"TACCL: Guiding Collective Algorithm Synthesis using Communication Sketches","date":"2021-11-08","arxiv_id":"2111.04867","n_code_links":2,"syntology":null},{"paper":null,"slug":"language-modelling-via-learning-to-rank","title":"Language Modelling via Learning to Rank","date":"2021-10-13","arxiv_id":"2110.06961","n_code_links":0,"syntology":null},{"paper":"/paper/a-study-of-the-robustness-of-raw-waveform","slug":"a-study-of-the-robustness-of-raw-waveform","title":"A study of the robustness of raw waveform based speaker embeddings under mismatched conditions","date":"2021-10-08","arxiv_id":"2110.04265","n_code_links":1,"syntology":null},{"paper":"/paper/layer-wise-pruning-of-transformer-attention","slug":"layer-wise-pruning-of-transformer-attention","title":"Layer-wise Pruning of Transformer Attention Heads for Efficient Language Modeling","date":"2021-10-07","arxiv_id":"2110.03252","n_code_links":1,"syntology":null},{"paper":null,"slug":"neural-variational-dropout-processes","title":"Neural Variational Dropout Processes","date":"2021-09-29","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/offensive-language-identification-in-low","slug":"offensive-language-identification-in-low","title":"Offensive Language Identification in Low-resourced Code-mixed Dravidian languages using Pseudo-labeling","date":"2021-08-27","arxiv_id":"2108.12177","n_code_links":1,"syntology":null},{"paper":"/paper/sn-computer-science-towards-offensive","slug":"sn-computer-science-towards-offensive","title":"Towards Offensive Language Identification for Tamil Code-Mixed YouTube Comments and Posts","date":"2021-08-24","arxiv_id":"2108.10939","n_code_links":1,"syntology":null},{"paper":"/paper/learning-sparse-analytic-filters-for-piano","slug":"learning-sparse-analytic-filters-for-piano","title":"Learning Sparse Analytic Filters for Piano Transcription","date":"2021-08-23","arxiv_id":"2108.10382","n_code_links":2,"syntology":null},{"paper":"/paper/fnetar-mixing-tokens-with-autoregressive","slug":"fnetar-mixing-tokens-with-autoregressive","title":"FNetAR: Mixing Tokens with Autoregressive Fourier Transforms","date":"2021-07-22","arxiv_id":"2107.10932","n_code_links":1,"syntology":null},{"paper":null,"slug":"learning-ulmfit-and-self-distillation-with","title":"Learning ULMFiT and Self-Distillation with Calibration for Medical Dialogue System","date":"2021-07-20","arxiv_id":"2107.09625","n_code_links":0,"syntology":null},{"paper":"/paper/transformers-with-multi-modal-features-and","slug":"transformers-with-multi-modal-features-and","title":"Transformers with multi-modal features and post-fusion context for e-commerce session-based recommendation","date":"2021-07-11","arxiv_id":"2107.05124","n_code_links":0,"syntology":null},{"paper":null,"slug":"asr-adaptation-for-e-commerce-chatbots-using","title":"ASR Adaptation for E-commerce Chatbots using Cross-Utterance Context and Multi-Task Language Modeling","date":"2021-06-15","arxiv_id":"2106.09532","n_code_links":0,"syntology":null},{"paper":"/paper/the-flip-side-of-the-reweighted-coin-duality","slug":"the-flip-side-of-the-reweighted-coin-duality","title":"The Flip Side of the Reweighted Coin: Duality of Adaptive Dropout and Regularization","date":"2021-06-14","arxiv_id":"2106.07769","n_code_links":1,"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":["dlej/adaptive-dropout"],"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"]}}},{"paper":null,"slug":"towards-a-better-tradeoff-between","title":"Towards a Better Tradeoff between Effectiveness and Efficiency in Pre-Ranking: A Learnable Feature Selection based Approach","date":"2021-05-17","arxiv_id":"2105.07706","n_code_links":0,"syntology":null},{"paper":null,"slug":"what-s-the-context-long-context-nlm","title":"Adapting Long Context NLM for ASR Rescoring in Conversational Agents","date":"2021-04-21","arxiv_id":"2104.11070","n_code_links":0,"syntology":null},{"paper":"/paper/whose-heritage-classification-of-unesco-world","slug":"whose-heritage-classification-of-unesco-world","title":"WHOSe Heritage: Classification of UNESCO World Heritage \"Outstanding Universal Value\" Documents with Soft Labels","date":"2021-04-12","arxiv_id":"2104.05547","n_code_links":1,"syntology":null},{"paper":"/paper/fastmoe-a-fast-mixture-of-expert-training","slug":"fastmoe-a-fast-mixture-of-expert-training","title":"FastMoE: A Fast Mixture-of-Expert Training System","date":"2021-03-24","arxiv_id":"2103.13262","n_code_links":3,"syntology":{"ran":5,"of":6,"n_ran_checked":4,"n_instrument":1,"unverified":1,"pointer_only":1,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["davidmrau/mixture-of-experts","laekov/fastmoe"],"state":"official (archive's flag): 5 ran","n_ran":5,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/l3cubemahasent-a-marathi-tweet-based","slug":"l3cubemahasent-a-marathi-tweet-based","title":"L3CubeMahaSent: A Marathi Tweet-based Sentiment Analysis Dataset","date":"2021-03-21","arxiv_id":"2103.11408","n_code_links":1,"syntology":null},{"paper":null,"slug":"improving-bayesian-inference-in-deep-neural","title":"Structured Dropout Variational Inference for Bayesian Neural Networks","date":"2021-02-16","arxiv_id":"2102.07927","n_code_links":0,"syntology":null},{"paper":"/paper/indicnlp-kgp-at-dravidianlangtech-eacl2021","slug":"indicnlp-kgp-at-dravidianlangtech-eacl2021","title":"indicnlp@kgp at DravidianLangTech-EACL2021: Offensive Language Identification in Dravidian Languages","date":"2021-02-14","arxiv_id":"2102.07150","n_code_links":1,"syntology":null},{"paper":"/paper/indicnlp-kgp-at-dravidianlangtech-eacl2021-1","slug":"indicnlp-kgp-at-dravidianlangtech-eacl2021-1","title":"indicnlp@ kgp at DravidianLangTech-EACL2021: Offensive Language Identification in Dravidian Languages","date":"2021-02-14","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"train-your-classifier-first-cascade-neural","title":"Train your classifier first: Cascade Neural Networks Training from upper layers to lower layers","date":"2021-02-09","arxiv_id":"2102.04697","n_code_links":0,"syntology":null},{"paper":null,"slug":"adaptive-semiparametric-language-models","title":"Adaptive Semiparametric Language Models","date":"2021-02-04","arxiv_id":"2102.02557","n_code_links":0,"syntology":null},{"paper":"/paper/pitfalls-of-static-language-modelling","slug":"pitfalls-of-static-language-modelling","title":"Mind the Gap: Assessing Temporal Generalization in Neural Language Models","date":"2021-02-03","arxiv_id":"2102.01951","n_code_links":1,"syntology":null},{"paper":null,"slug":"experimental-evaluation-of-deep-learning","title":"Experimental Evaluation of Deep Learning models for Marathi Text Classification","date":"2021-01-13","arxiv_id":"2101.04899","n_code_links":0,"syntology":null},{"paper":"/paper/ladiff-ulmfit-a-layer-differentiated-training","slug":"ladiff-ulmfit-a-layer-differentiated-training","title":"LaDiff ULMFiT: A Layer Differentiated training approach for ULMFiT","date":"2021-01-13","arxiv_id":"2101.04965","n_code_links":1,"syntology":null},{"paper":null,"slug":"post-training-weighted-quantization-of-neural","title":"Post-Training Weighted Quantization of Neural Networks for Language Models","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/subformer-a-parameter-reduced-transformer","slug":"subformer-a-parameter-reduced-transformer","title":"Subformer: A Parameter Reduced Transformer","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/hinglishnlp-at-semeval-2020-task-9-fine-tuned","slug":"hinglishnlp-at-semeval-2020-task-9-fine-tuned","title":"HinglishNLP at SemEval-2020 Task 9: Fine-tuned Language Models for Hinglish Sentiment Detection","date":"2020-12-01","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":null,"slug":"hitachi-at-semeval-2020-task-8-simple-but","title":"Hitachi at SemEval-2020 Task 8: Simple but Effective Modality Ensemble for Meme Emotion Recognition","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"smash-at-semeval-2020-task-7-optimizing-the","title":"Smash at SemEval-2020 Task 7: Optimizing the Hyperparameters of ERNIE 2.0 for Humor Ranking and Rating","date":"2020-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"palomino-ochoa-at-semeval-2020-task-9-robust","title":"Palomino-Ochoa at SemEval-2020 Task 9: Robust System based on Transformer for Code-Mixed Sentiment Classification","date":"2020-11-18","arxiv_id":"2011.09448","n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-rnn-transducer-with-normalized","title":"Improving RNN transducer with normalized jointer network","date":"2020-11-03","arxiv_id":"2011.01576","n_code_links":0,"syntology":null},{"paper":null,"slug":"developing-real-time-streaming-transformer","title":"Developing Real-time Streaming Transformer Transducer for Speech Recognition on Large-scale Dataset","date":"2020-10-22","arxiv_id":"2010.11395","n_code_links":0,"syntology":null},{"paper":null,"slug":"transferable-graph-optimizers-for-ml","title":"Transferable Graph Optimizers for ML Compilers","date":"2020-10-21","arxiv_id":"2010.12438","n_code_links":0,"syntology":null},{"paper":null,"slug":"memformer-the-memory-augmented-transformer-1","title":"Memformer: A Memory-Augmented Transformer for Sequence Modeling","date":"2020-10-14","arxiv_id":"2010.06891","n_code_links":0,"syntology":null},{"paper":"/paper/pagsusuri-ng-rnn-based-transfer-learning","slug":"pagsusuri-ng-rnn-based-transfer-learning","title":"Pagsusuri ng RNN-based Transfer Learning Technique sa Low-Resource Language","date":"2020-10-13","arxiv_id":"2010.06447","n_code_links":2,"syntology":null},{"paper":null,"slug":"gauravarora-hasoc-dravidian-codemix-fire2020","title":"Gauravarora@HASOC-Dravidian-CodeMix-FIRE2020: Pre-training ULMFiT on Synthetically Generated Code-Mixed Data for Hate Speech Detection","date":"2020-10-05","arxiv_id":"2010.02094","n_code_links":0,"syntology":null},{"paper":null,"slug":"fine-tuning-pre-trained-contextual-embeddings","title":"Fine-tuning Pre-trained Contextual Embeddings for Citation Content Analysis in Scholarly Publication","date":"2020-09-12","arxiv_id":"2009.05836","n_code_links":0,"syntology":null},{"paper":"/paper/pay-attention-when-required","slug":"pay-attention-when-required","title":"Pay Attention when Required","date":"2020-09-09","arxiv_id":"2009.04534","n_code_links":2,"syntology":null},{"paper":"/paper/hinglishnlp-fine-tuned-language-models-for","slug":"hinglishnlp-fine-tuned-language-models-for","title":"HinglishNLP: Fine-tuned Language Models for Hinglish Sentiment Detection","date":"2020-08-22","arxiv_id":"2008.09820","n_code_links":2,"syntology":null},{"paper":"/paper/the-jazz-transformer-on-the-front-line","slug":"the-jazz-transformer-on-the-front-line","title":"The Jazz Transformer on the Front Line: Exploring the Shortcomings of AI-composed Music through Quantitative Measures","date":"2020-08-04","arxiv_id":"2008.01307","n_code_links":2,"syntology":{"ran":13,"of":14,"n_ran_checked":13,"n_instrument":0,"unverified":1,"pointer_only":0,"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) · 1 unverified","official":{"repos":["slSeanWU/MusDr","slSeanWU/jazz_transformer"],"state":"official (archive's flag): 13 ran","n_ran":13,"n_constructed":0,"n_ran_no_instrument_failure":13,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/language-modelling-for-source-code-with","slug":"language-modelling-for-source-code-with","title":"Language Modelling for Source Code with Transformer-XL","date":"2020-07-31","arxiv_id":"2007.15813","n_code_links":1,"syntology":null},{"paper":"/paper/composer-style-classification-of-piano-sheet","slug":"composer-style-classification-of-piano-sheet","title":"Composer Style Classification of Piano Sheet Music Images Using Language Model Pretraining","date":"2020-07-29","arxiv_id":"2007.14587","n_code_links":1,"syntology":null},{"paper":null,"slug":"vinnas-variational-inference-based-neural","title":"VINNAS: Variational Inference-based Neural Network Architecture Search","date":"2020-07-12","arxiv_id":"2007.06103","n_code_links":0,"syntology":null},{"paper":"/paper/do-transformers-need-deep-long-range-memory-1","slug":"do-transformers-need-deep-long-range-memory-1","title":"Do Transformers Need Deep Long-Range Memory","date":"2020-07-07","arxiv_id":"2007.03356","n_code_links":1,"syntology":null},{"paper":null,"slug":"do-transformers-need-deep-long-range-memory","title":"Do Transformers Need Deep Long-Range Memory?","date":"2020-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"probing-for-referential-information-in","title":"Probing for Referential Information in Language Models","date":"2020-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"mind-the-facts-knowledge-boosted-coherent","title":"Mind The Facts: Knowledge-Boosted Coherent Abstractive Text Summarization","date":"2020-06-27","arxiv_id":"2006.15435","n_code_links":0,"syntology":null},{"paper":null,"slug":"exploring-transformers-for-large-scale-speech","title":"Exploring Transformers for Large-Scale Speech Recognition","date":"2020-05-19","arxiv_id":"2005.09684","n_code_links":0,"syntology":null},{"paper":null,"slug":"evaluation-metrics-for-headline-generation","title":"Evaluation Metrics for Headline Generation Using Deep Pre-Trained Embeddings","date":"2020-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"improving-neural-language-generation-with","title":"Improving Neural Language Generation with Spectrum Control","date":"2020-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/offensive-language-detection-in-arabic-using","slug":"offensive-language-detection-in-arabic-using","title":"Offensive language detection in Arabic using ULMFiT","date":"2020-05-01","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"text-categorization-for-conflict-event","title":"Text Categorization for Conflict Event Annotation","date":"2020-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/segabert-pre-training-of-segment-aware-bert","slug":"segabert-pre-training-of-segment-aware-bert","title":"Segatron: Segment-Aware Transformer for Language Modeling and Understanding","date":"2020-04-30","arxiv_id":"2004.14996","n_code_links":1,"syntology":null},{"paper":"/paper/bayesian-sparsification-methods-for-deep","slug":"bayesian-sparsification-methods-for-deep","title":"Bayesian Sparsification Methods for Deep Complex-valued Networks","date":"2020-03-25","arxiv_id":"2003.11413","n_code_links":1,"syntology":null},{"paper":null,"slug":"finnish-language-modeling-with-deep","title":"Finnish Language Modeling with Deep Transformer Models","date":"2020-03-14","arxiv_id":"2003.11562","n_code_links":0,"syntology":null},{"paper":"/paper/adaptive-neural-connections-for-sparsity","slug":"adaptive-neural-connections-for-sparsity","title":"Adaptive Neural Connections for Sparsity Learning","date":"2020-03-05","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/inferring-the-source-of-official-texts-can","slug":"inferring-the-source-of-official-texts-can","title":"Inferring the source of official texts: can SVM beat ULMFiT?","date":"2020-03-02","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/maxup-a-simple-way-to-improve-generalization","slug":"maxup-a-simple-way-to-improve-generalization","title":"MaxUp: A Simple Way to Improve Generalization of Neural Network Training","date":"2020-02-20","arxiv_id":"2002.09024","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"0 ran · 1 unverified","official":null}},{"paper":null,"slug":"localized-flood-detectionwith-minimal-labeled","title":"Localized Flood DetectionWith Minimal Labeled Social Media Data Using Transfer Learning","date":"2020-02-10","arxiv_id":"2003.04973","n_code_links":0,"syntology":null},{"paper":"/paper/variational-dropout-sparsification-for","slug":"variational-dropout-sparsification-for","title":"Variational Dropout Sparsification for Particle Identification speed-up","date":"2020-01-21","arxiv_id":"2001.07493","n_code_links":1,"syntology":null},{"paper":"/paper/delving-deeper-into-the-decoder-for-video","slug":"delving-deeper-into-the-decoder-for-video","title":"Delving Deeper into the Decoder for Video Captioning","date":"2020-01-16","arxiv_id":"2001.05614","n_code_links":1,"syntology":{"ran":0,"of":2,"n_ran_checked":0,"n_instrument":0,"unverified":2,"pointer_only":0,"phrase":"0 ran · 2 unverified","official":{"repos":["WingsBrokenAngel/delving-deeper-into-the-decoder-for-video-captioning"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":2,"ran_from_kinds":[]}}},{"paper":null,"slug":"natural-language-processing-of-mimic-iii","title":"Natural language processing of MIMIC-III clinical notes for identifying diagnosis and procedures with neural networks","date":"2019-12-28","arxiv_id":"1912.12397","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-comparative-study-of-pretrained-language","title":"A Comparative Study of Pretrained Language Models on Thai Social Text Categorization","date":"2019-12-03","arxiv_id":"1912.01580","n_code_links":0,"syntology":null},{"paper":"/paper/neural-academic-paper-generation","slug":"neural-academic-paper-generation","title":"Neural Academic Paper Generation","date":"2019-12-02","arxiv_id":"1912.01982","n_code_links":1,"syntology":null},{"paper":"/paper/define-deep-factorized-input-word-embeddings-1","slug":"define-deep-factorized-input-word-embeddings-1","title":"DeFINE: DEep Factorized INput Token Embeddings for Neural Sequence Modeling","date":"2019-11-27","arxiv_id":"1911.12385","n_code_links":1,"syntology":null}],"papers_shown":100,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":141,"with_a_code_link":73,"where_syntology_ran_a_sample":22,"not_listed_spam_title":0,"listed":141,"listed_where_code_ran":22,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":20,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":20,"listed_every_run_a_failure_of_syntologys_instrument":2,"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"},"papers_where_code_ran":22,"papers_where_code_ran_first_page":"/method/variational-dropout/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"archive","page":2,"of":2,"url":"/method/variational-dropout/papers/2","json":"/method/variational-dropout/papers/2.json","rows":41},{"order":"ran","page":1,"of":1,"url":"/method/variational-dropout/papers/ran/1","json":"/method/variational-dropout/papers/ran/1.json","rows":22}],"tasks":[{"task":"/task/language-modelling","name":"Language Modelling","papers":62},{"task":"/task/language-modeling","name":"Language Modeling","papers":46},{"task":"/task/text-classification","name":"Text Classification","papers":17},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":16},{"task":"/task/classification","name":"General Classification","papers":15},{"task":"/task/sentiment-analysis","name":"Sentiment Analysis","papers":13},{"task":"/task/text-classification-1","name":"text-classification","papers":12},{"task":"/task/decoder","name":"Decoder","papers":9},{"task":"/task/classification-1","name":"Classification","papers":8},{"task":"/task/machine-translation","name":"Machine Translation","papers":8},{"task":"/task/translation","name":"Translation","papers":8},{"task":"/task/speech-recognition","name":"Speech Recognition","papers":7},{"task":"/task/sentence","name":"Sentence","papers":6},{"task":"/task/word-embeddings","name":"Word Embeddings","papers":6},{"task":"/task/speech-recognition-1","name":"speech-recognition","papers":6},{"task":"/task/image-classification","name":"Image Classification","papers":5},{"task":"/task/variational-inference","name":"Variational Inference","papers":5},{"task":"/task/automatic-speech-recognition-2","name":"Automatic Speech Recognition","papers":4},{"task":"/task/automatic-speech-recognition","name":"Automatic Speech Recognition (ASR)","papers":4},{"task":"/task/decision-making","name":"Decision Making","papers":4}],"tasks_shown":20,"n_tasks":144,"usage_by_year":[{"year":"2015","papers":1},{"year":"2016","papers":2},{"year":"2017","papers":7},{"year":"2018","papers":6},{"year":"2019","papers":29},{"year":"2020","papers":35},{"year":"2021","papers":32},{"year":"2022","papers":7},{"year":"2023","papers":13},{"year":"2024","papers":6},{"year":"2025","papers":3}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/variational-dropout"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Variational%20Dropout","read_at":"2026-10-05T01:03:33+00:00","query":"Variational Dropout","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1512.05287","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Variational Dropout' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["Meta-Variational Dropout (MetaVD)","Neural Variational Dropout Processes","Rep-Dropout","Loop Dropout","late dropout","DROPOUT-GRPO","early dropout","Rubric Dropout"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"71ca5d3ee9af7356f35a039c0a721ebb7458eb231dc28d17837f26aebca0a554","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}