{"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/gpt-neo","slug":"gpt-neo","name":"GPT-Neo","full_name":"GPT-Neo","full_name_withheld":false,"description_markdown":"An implementation of model & data parallel [GPT3-like](https://paperswithcode.com/method/gpt-3) models using the [mesh-tensorflow](https://github.com/tensorflow/mesh) library.\r\n\r\nSource: [EleutherAI/GPT-Neo](https://github.com/EleutherAI/gpt-neo)","description_state":"present","introduced_year":null,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Transformers","url":"/methods/category/transformers","pwc_aliases":[]}],"n_papers_tagged":38,"archive_num_papers":38,"papers_newest_first":[{"paper":null,"slug":"irepair-an-intent-aware-approach-to-repair","title":"IRepair: An Intent-Aware Approach to Repair Data-Driven Errors in Large Language Models","date":"2025-02-10","arxiv_id":"2502.07072","n_code_links":0,"syntology":null},{"paper":"/paper/robust-hybrid-classical-quantum-transfer","slug":"robust-hybrid-classical-quantum-transfer","title":"Robust Hybrid Classical-Quantum Transfer Learning Model for Text Classification Using GPT-Neo 125M with LoRA & SMOTE Enhancement","date":"2025-01-12","arxiv_id":"2501.10435","n_code_links":1,"syntology":null},{"paper":null,"slug":"llm-vocabulary-compression-for-low-compute","title":"LLM Vocabulary Compression for Low-Compute Environments","date":"2024-11-10","arxiv_id":"2411.06371","n_code_links":0,"syntology":null},{"paper":"/paper/berttime-stories-investigating-the-role-of","slug":"berttime-stories-investigating-the-role-of","title":"BERTtime Stories: Investigating the Role of Synthetic Story Data in Language pre-training","date":"2024-10-20","arxiv_id":"2410.15365","n_code_links":1,"syntology":null},{"paper":null,"slug":"reconstruction-of-differentially-private-text","title":"Reconstruction of Differentially Private Text Sanitization via Large Language Models","date":"2024-10-16","arxiv_id":"2410.12443","n_code_links":0,"syntology":null},{"paper":"/paper/the-unreasonable-ineffectiveness-of-nucleus","slug":"the-unreasonable-ineffectiveness-of-nucleus","title":"The Unreasonable Ineffectiveness of Nucleus Sampling on Mitigating Text Memorization","date":"2024-08-29","arxiv_id":"2408.16345","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":6,"n_instrument":2,"unverified":3,"pointer_only":11,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 1 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 3 unverified","official":{"repos":["lukaborec/memorization-nucleus-sampling"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"wpn-an-unlearning-method-based-on-n-pair","title":"WPN: An Unlearning Method Based on N-pair Contrastive Learning in Language Models","date":"2024-08-18","arxiv_id":"2408.09459","n_code_links":0,"syntology":null},{"paper":"/paper/towards-robust-and-cost-efficient-knowledge","slug":"towards-robust-and-cost-efficient-knowledge","title":"Towards Robust and Parameter-Efficient Knowledge Unlearning for LLMs","date":"2024-08-13","arxiv_id":"2408.06621","n_code_links":1,"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":{"repos":["csm9493/efficient-llm-unlearning"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"semantic-membership-inference-attack-against","title":"Semantic Membership Inference Attack against Large Language Models","date":"2024-06-14","arxiv_id":"2406.10218","n_code_links":0,"syntology":null},{"paper":"/paper/investigating-wit-creativity-and","slug":"investigating-wit-creativity-and","title":"Investigating Wit, Creativity, and Detectability of Large Language Models in Domain-Specific Writing Style Adaptation of Reddit's Showerthoughts","date":"2024-05-02","arxiv_id":"2405.01660","n_code_links":1,"syntology":null},{"paper":null,"slug":"more-than-correlation-do-large-language","title":"More than Correlation: Do Large Language Models Learn Causal Representations of Space?","date":"2023-12-26","arxiv_id":"2312.16257","n_code_links":0,"syntology":null},{"paper":"/paper/fairness-aware-structured-pruning-in","slug":"fairness-aware-structured-pruning-in","title":"Fairness-Aware Structured Pruning in Transformers","date":"2023-12-24","arxiv_id":"2312.15398","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":["chandar-lab/fasp"],"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":"scalable-extraction-of-training-data-from","title":"Scalable Extraction of Training Data from (Production) Language Models","date":"2023-11-28","arxiv_id":"2311.17035","n_code_links":0,"syntology":null},{"paper":"/paper/heaps-law-in-gpt-neo-large-language-model","slug":"heaps-law-in-gpt-neo-large-language-model","title":"Heaps' Law in GPT-Neo Large Language Model Emulated Corpora","date":"2023-11-10","arxiv_id":"2311.06377","n_code_links":1,"syntology":null},{"paper":"/paper/watermarking-llms-with-weight-quantization","slug":"watermarking-llms-with-weight-quantization","title":"Watermarking LLMs with Weight Quantization","date":"2023-10-17","arxiv_id":"2310.11237","n_code_links":1,"syntology":{"ran":1,"of":10,"n_ran_checked":1,"n_instrument":0,"unverified":9,"pointer_only":10,"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) · 9 unverified","official":{"repos":["twilight92z/quantize-watermark"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":9,"ran_from_kinds":["official"]}}},{"paper":"/paper/tart-a-plug-and-play-transformer-module-for","slug":"tart-a-plug-and-play-transformer-module-for","title":"TART: A plug-and-play Transformer module for task-agnostic reasoning","date":"2023-09-21","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/fine-tuning-large-language-models-for","slug":"fine-tuning-large-language-models-for","title":"Fine-Tuning Large Language Models for Answering Programming Questions with Code Snippets","date":"2023-06-26","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"exposing-bias-in-online-communities-through","title":"Exposing Bias in Online Communities through Large-Scale Language Models","date":"2023-06-04","arxiv_id":"2306.02294","n_code_links":0,"syntology":null},{"paper":"/paper/test-time-training-on-nearest-neighbors-for","slug":"test-time-training-on-nearest-neighbors-for","title":"Test-Time Training on Nearest Neighbors for Large Language Models","date":"2023-05-29","arxiv_id":"2305.18466","n_code_links":1,"syntology":{"ran":3,"of":5,"n_ran_checked":3,"n_instrument":0,"unverified":2,"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) · 2 unverified","official":{"repos":["socialfoundations/tttlm"],"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":["official"]}}},{"paper":"/paper/controlling-the-extraction-of-memorized-data","slug":"controlling-the-extraction-of-memorized-data","title":"Controlling the Extraction of Memorized Data from Large Language Models via Prompt-Tuning","date":"2023-05-19","arxiv_id":"2305.11759","n_code_links":1,"syntology":null},{"paper":"/paper/tinystories-how-small-can-language-models-be","slug":"tinystories-how-small-can-language-models-be","title":"TinyStories: How Small Can Language Models Be and Still Speak Coherent English?","date":"2023-05-12","arxiv_id":"2305.07759","n_code_links":8,"syntology":{"ran":10,"of":18,"n_ran_checked":7,"n_instrument":3,"unverified":8,"pointer_only":0,"phrase":"10 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 0 honoured, 0 violated, 7 with no contract checked; 3 where Syntology's instrument failed) · 8 unverified","official":null}},{"paper":"/paper/on-the-risks-of-stealing-the-decoding","slug":"on-the-risks-of-stealing-the-decoding","title":"Stealing the Decoding Algorithms of Language Models","date":"2023-03-08","arxiv_id":"2303.04729","n_code_links":1,"syntology":null},{"paper":"/paper/bag-of-tricks-for-training-data-extraction","slug":"bag-of-tricks-for-training-data-extraction","title":"Bag of Tricks for Training Data Extraction from Language Models","date":"2023-02-09","arxiv_id":"2302.04460","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["weichen-yu/lm-extraction"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":null,"slug":"why-does-surprisal-from-larger-transformer","title":"Why Does Surprisal From Larger Transformer-Based Language Models Provide a Poorer Fit to Human Reading Times?","date":"2022-12-23","arxiv_id":"2212.12131","n_code_links":0,"syntology":null},{"paper":null,"slug":"explicit-knowledge-transfer-for-weakly","title":"Explicit Knowledge Transfer for Weakly-Supervised Code Generation","date":"2022-11-30","arxiv_id":"2211.16740","n_code_links":0,"syntology":null},{"paper":"/paper/gpt-neo-for-commonsense-reasoning-a","slug":"gpt-neo-for-commonsense-reasoning-a","title":"GPT-Neo for commonsense reasoning -- a theoretical and practical lens","date":"2022-11-28","arxiv_id":"2211.15593","n_code_links":1,"syntology":null},{"paper":null,"slug":"understanding-bloom-an-empirical-study-on","title":"Understanding BLOOM: An empirical study on diverse NLP tasks","date":"2022-11-27","arxiv_id":"2211.14865","n_code_links":0,"syntology":null},{"paper":"/paper/collateral-facilitation-in-humans-and","slug":"collateral-facilitation-in-humans-and","title":"Collateral facilitation in humans and language models","date":"2022-11-09","arxiv_id":"2211.05198","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":["jmichaelov/collateral-facilitation"],"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":null,"slug":"chain-of-explanation-new-prompting-method-to","title":"Chain of Explanation: New Prompting Method to Generate Higher Quality Natural Language Explanation for Implicit Hate Speech","date":"2022-09-11","arxiv_id":"2209.04889","n_code_links":0,"syntology":null},{"paper":"/paper/materials-transformers-language-models-for","slug":"materials-transformers-language-models-for","title":"Materials Transformers Language Models for Generative Materials Design: a benchmark study","date":"2022-06-27","arxiv_id":"2206.13578","n_code_links":1,"syntology":null},{"paper":"/paper/fault-aware-neural-code-rankers","slug":"fault-aware-neural-code-rankers","title":"Fault-Aware Neural Code Rankers","date":"2022-06-04","arxiv_id":"2206.03865","n_code_links":1,"syntology":{"ran":4,"of":5,"n_ran_checked":2,"n_instrument":2,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 1 constructed an object rather than computing a result; 2 with no instrument failure: 1 honoured, 0 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["microsoft/coderanker"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":1,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/what-gpt-knows-about-who-is-who-1","slug":"what-gpt-knows-about-who-is-who-1","title":"What GPT Knows About Who is Who","date":"2022-05-16","arxiv_id":"2205.07407","n_code_links":1,"syntology":null},{"paper":"/paper/gpt-neox-20b-an-open-source-autoregressive-1","slug":"gpt-neox-20b-an-open-source-autoregressive-1","title":"GPT-NeoX-20B: An Open-Source Autoregressive Language Model","date":"2022-04-14","arxiv_id":"2204.06745","n_code_links":11,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"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) · 1 unverified","official":{"repos":["eleutherai/gpt-neox"],"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-systematic-evaluation-of-large-language","slug":"a-systematic-evaluation-of-large-language","title":"A Systematic Evaluation of Large Language Models of Code","date":"2022-02-26","arxiv_id":"2202.13169","n_code_links":3,"syntology":{"ran":2,"of":3,"n_ran_checked":1,"n_instrument":1,"unverified":1,"pointer_only":0,"phrase":"2 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; 1 where Syntology's instrument failed) · 1 unverified","official":{"repos":["eleutherai/gpt-neox","vhellendoorn/code-lms"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/controlling-conditional-language-models-with","slug":"controlling-conditional-language-models-with","title":"Controlling Conditional Language Models without Catastrophic Forgetting","date":"2021-12-01","arxiv_id":"2112.00791","n_code_links":2,"syntology":{"ran":7,"of":8,"n_ran_checked":5,"n_instrument":2,"unverified":1,"pointer_only":4,"phrase":"7 ran (of which 1 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 1 unverified","official":{"repos":["naver/gdc"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":1,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"jurassic-is-almost-all-you-need-few-shot","title":"Jurassic is (almost) All You Need: Few-Shot Meaning-to-Text Generation for Open-Domain Dialogue","date":"2021-10-15","arxiv_id":"2110.08094","n_code_links":0,"syntology":null},{"paper":"/paper/teaching-autoregressive-language-models","slug":"teaching-autoregressive-language-models","title":"Teaching Autoregressive Language Models Complex Tasks By Demonstration","date":"2021-09-05","arxiv_id":"2109.02102","n_code_links":1,"syntology":null},{"paper":"/paper/measuring-coding-challenge-competence-with","slug":"measuring-coding-challenge-competence-with","title":"Measuring Coding Challenge Competence With APPS","date":"2021-05-20","arxiv_id":"2105.09938","n_code_links":3,"syntology":{"ran":7,"of":11,"n_ran_checked":5,"n_instrument":2,"unverified":4,"pointer_only":2,"phrase":"7 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["hendrycks/apps"],"state":"official (archive's flag): 7 ran","n_ran":7,"n_constructed":0,"n_ran_no_instrument_failure":5,"n_unverified":4,"ran_from_kinds":["official"]}}}],"papers_shown":38,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":38,"with_a_code_link":24,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":38,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":9,"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":11,"papers_where_code_ran_first_page":"/method/gpt-neo/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":"ran","page":1,"of":1,"url":"/method/gpt-neo/papers/ran/1","json":"/method/gpt-neo/papers/ran/1.json","rows":11}],"tasks":[{"task":"/task/language-modelling","name":"Language Modelling","papers":10},{"task":"/task/text-generation","name":"Text Generation","papers":9},{"task":"/task/language-modeling","name":"Language Modeling","papers":8},{"task":"/task/code-generation","name":"Code Generation","papers":5},{"task":"/task/memorization","name":"Memorization","papers":3},{"task":"/task/prompt-engineering","name":"Prompt Engineering","papers":3},{"task":"/task/large-language-model","name":"Large Language Model","papers":2},{"task":"/task/question-answering","name":"Question Answering","papers":2},{"task":"/task/text-classification","name":"Text Classification","papers":2},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":2},{"task":"/task/text-classification-1","name":"text-classification","papers":2},{"task":"/task/abstractive-text-summarization","name":"Abstractive Text Summarization","papers":1},{"task":"/task/all","name":"All","papers":1},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":1},{"task":"/task/chatbot","name":"Chatbot","papers":1},{"task":"/task/contrastive-learning","name":"Contrastive Learning","papers":1},{"task":"/task/coreference-resolution","name":"Coreference Resolution","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/diagnostic","name":"Diagnostic","papers":1},{"task":"/task/fairness","name":"Fairness","papers":1}],"tasks_shown":20,"n_tasks":42,"usage_by_year":[{"year":"2021","papers":4},{"year":"2022","papers":11},{"year":"2023","papers":13},{"year":"2024","papers":8},{"year":"2025","papers":2}],"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/gpt-neo"},"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=GPT-Neo","read_at":"2026-10-05T00:57:10+00:00","query":"GPT-Neo","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":null,"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 'GPT-Neo' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["GPT","NEO","H-GPT","GPT-D","MS-GPT","RF-GPT","GPT-RE","GPT-ST"],"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":"34da0cebc783915774a2813464a819d0c1663757d6c556606a2d8ff7d0733cf8","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}