Methods › Natural Language Processing › Language Models › Bort
Bort
archive 2025-07-28 Description, source and code snippet are the archive's method entry.
Bort is a parametric architectural variant of the BERT architecture. It extracts an optimal subset of architectural parameters for the BERT architecture through a 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), and about $33\%
In Syntology 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.
From the lookup's note on this name: 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. For arXiv:2205.02471: its page on this site · ask the lookup about it.
Origin paper of this answer, arXiv:2212.09062 (its page on this site · its page on Syntology): Syntology's run record for its harvested code, 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 (of 1 harvested sample) · 1 pointer-only (licence). The instrument figure counts failures of Syntology's instrument, not of the code. Ran means executed on a synthesized input, not that the code is correct.
Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.
Papers archive 2025-07-28
archive papers tagged: 5 · with a code link: 3 · where Syntology ran a sample: 1 (0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument) Syntology
Show: all tagged papersonly where code ran (1 of 5 tagged: 0 with a run with no instrument failure, 1 where every run was a failure of Syntology's instrument)
Page 1 of 1: papers 1 to 5 of 5, newest first by the archive's date (ties by slug), in archive order.
Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.
-
Bort: Towards Explainable Neural Networks with Bounded Orthogonal Constraint 18 Dec 2022 · 1 repository · arXiv:2212.09062Syntology official (archive's flag): 1 ran · 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 (of 1 harvested sample) · 1 pointer-only (licence)
-
BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog 5 May 2022 · 1 repository · arXiv:2205.02471
-
RobBERTje: a Distilled Dutch BERT Model 28 Apr 2022 · 0 repositories · arXiv:2204.13511
-
BORT: Back and Denoising Reconstruction for End-to-End Task-Oriented Dialog 16 Nov 2021 · 0 repositories
-
Optimal Subarchitecture Extraction For BERT 20 Oct 2020 · 3 repositories · arXiv:2010.10499
Tasks archive 2025-07-28
7 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.
| Task | Papers |
|---|---|
| Denoising | 2 |
| CPU | 1 |
| GPU | 1 |
| Lightweight Deployment | 1 |
| Natural Language Understanding | 1 |
| Neural Architecture Search | 1 |
| model | 1 |
Usage over time archive 2025-07-28
Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).
Categories archive 2025-07-28
Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections