{"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/bort","slug":"bort","name":"Bort","full_name":"Bort","full_name_withheld":false,"description_markdown":"**Bort** is a parametric architectural variant of the [BERT](https://paperswithcode.com/method/bert) architecture. It extracts an optimal subset of architectural parameters for the BERT architecture through a [neural architecture search](https://paperswithcode.com/method/neural-architecture-search) approach; in particular, a fully polynomial-time approximation scheme (FPTAS). This optimal subset - “Bort” - is demonstrably smaller, having an effective size of $5.5 \\%$ the original BERT-large architecture, and $16\\%$ of the net size. Bort is also able to be pretrained in $288$ GPU hours, which is $1.2\\%$ less than the time required to pretrain the highest-performing BERT parametric architecture variant, RoBERTa-large ([RoBERTa](https://paperswithcode.com/method/roberta)), and about $33\\%","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":"https://arxiv.org/abs/2010.10499v2","title":"Optimal Subarchitecture Extraction For BERT","url_on_a_paper_host":true},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Language Models","url":"/methods/category/language-models","pwc_aliases":[]}],"n_papers_tagged":5,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/bort-towards-explainable-neural-networks-with","slug":"bort-towards-explainable-neural-networks-with","title":"Bort: Towards Explainable Neural Networks with Bounded Orthogonal Constraint","date":"2022-12-18","arxiv_id":"2212.09062","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["zbr17/bort"],"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/bort-back-and-denoising-reconstruction-for-1","slug":"bort-back-and-denoising-reconstruction-for-1","title":"BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog","date":"2022-05-05","arxiv_id":"2205.02471","n_code_links":1,"syntology":null},{"paper":null,"slug":"robbertje-a-distilled-dutch-bert-model","title":"RobBERTje: a Distilled Dutch BERT Model","date":"2022-04-28","arxiv_id":"2204.13511","n_code_links":0,"syntology":null},{"paper":null,"slug":"bort-back-and-denoising-reconstruction-for","title":"BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog","date":"2021-11-16","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/optimal-subarchitecture-extraction-for-bert","slug":"optimal-subarchitecture-extraction-for-bert","title":"Optimal Subarchitecture Extraction For BERT","date":"2020-10-20","arxiv_id":"2010.10499","n_code_links":3,"syntology":null}],"papers_shown":5,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":5,"with_a_code_link":3,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":5,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":0,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":0,"listed_every_run_a_failure_of_syntologys_instrument":1,"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":1,"papers_where_code_ran_first_page":"/method/bort/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/bort/papers/ran/1","json":"/method/bort/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/denoising","name":"Denoising","papers":2},{"task":null,"name":"CPU","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/lightweight-deployment","name":"Lightweight Deployment","papers":1},{"task":"/task/natural-language-understanding","name":"Natural Language Understanding","papers":1},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":1},{"task":"/task/model","name":"model","papers":1}],"tasks_shown":7,"n_tasks":7,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2022","papers":3}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/bort"},"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=Bort","read_at":"2026-10-05T00:53:14+00:00","query":"Bort","kind":"method","have":"declared_code","tier":"repo_known","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"method":"Bort","origin_arxiv_id":"2212.09062"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":2,"in_graph":2,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"outranked","may_be_wrong_sense":true,"bearers_found":3,"served":{"arxiv_id":"2212.09062","citations":8},"leading_other_bearer":{"arxiv_id":"2205.02471","title":"BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog","citations":36,"named_by":["title_prefix"],"bearer_name":"BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog","ask_with":"have('2205.02471')"},"n_other_bearers_listed":2,"note":"'Bort' is ALSO the name of the paper 'BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog' (arXiv:2205.02471, 36 citations), which is cited FAR more than the paper this answer is about (8). This answer may be about the wrong Bort. If you meant the better-known one, ask again with that entry of `also_named`."},"name_competition_text":"The same name also belongs to the paper “BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog” (arXiv:2205.02471, 36 citations), which the lookup finds cited far more than the paper this answer is about (8 citations), so this answer may be about a different sense of the name.","near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2212.09062","page":"/paper/bort-towards-explainable-neural-networks-with","syntology_url":"https://syntology.ai/paper/2212.09062","in_graph_layer":true,"samples":1,"ran":1,"n_ran_checked":0,"n_instrument":1,"unverified":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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 2 listed of 2 in the graph, strongest link: official). The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2212.09062) is about this method is not checked.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"aba842a1d563fd78bda65a7f57e51876e33f4f769ebedfd081240de8339faf7b","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}