{"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/deebert","slug":"deebert","name":"DeeBERT","full_name":"DeeBERT","full_name_withheld":false,"description_markdown":"**DeeBERT** is a method for accelerating [BERT](https://paperswithcode.com/method/bert) inference. It inserts extra classification layers (which are referred to as off-ramps) between each [transformer](https://paperswithcode.com/method/transformer) layer of BERT. All transformer layers and off-ramps are jointly fine-tuned on a given downstream dataset. At inference time, after a sample goes through a transformer layer, it is passed to the following off-ramp. If the off-ramp is confident of the prediction, the result is returned; otherwise, the sample is sent to the next transformer layer.","description_state":"present","introduced_year":null,"introduced_by":{"title":"DeeBERT: Dynamic Early Exiting for Accelerating BERT Inference","paper":"/paper/deebert-dynamic-early-exiting-for","first_author":"Ji Xin","n_authors":5,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/deebert-dynamic-early-exiting-for"},"source":{"url":"https://arxiv.org/abs/2004.12993v1","title":"DeeBERT: Dynamic Early Exiting for Accelerating BERT Inference","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":"Autoencoding Transformers","url":"/methods/category/autoencoding-transformers","pwc_aliases":[]},{"area":"Natural Language Processing","area_id":"natural-language-processing","collection":"Transformers","url":"/methods/category/transformers","pwc_aliases":[]}],"n_papers_tagged":3,"archive_num_papers":3,"papers_newest_first":[{"paper":"/paper/splitee-early-exit-in-deep-neural-networks","slug":"splitee-early-exit-in-deep-neural-networks","title":"SplitEE: Early Exit in Deep Neural Networks with Split Computing","date":"2023-09-17","arxiv_id":"2309.09195","n_code_links":1,"syntology":null},{"paper":"/paper/romebert-robust-training-of-multi-exit-bert","slug":"romebert-robust-training-of-multi-exit-bert","title":"RomeBERT: Robust Training of Multi-Exit BERT","date":"2021-01-24","arxiv_id":"2101.09755","n_code_links":1,"syntology":null},{"paper":"/paper/deebert-dynamic-early-exiting-for","slug":"deebert-dynamic-early-exiting-for","title":"DeeBERT: Dynamic Early Exiting for Accelerating BERT Inference","date":"2020-04-27","arxiv_id":"2004.12993","n_code_links":3,"syntology":{"ran":5,"of":6,"n_ran_checked":5,"n_instrument":0,"unverified":1,"pointer_only":5,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["castorini/deebert"],"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":["listed","official"]}}}],"papers_shown":3,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":3,"with_a_code_link":3,"where_syntology_ran_a_sample":1,"not_listed_spam_title":0,"listed":3,"listed_where_code_ran":1,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":1,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":1,"listed_every_run_a_failure_of_syntologys_instrument":0,"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/deebert/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/deebert/papers/ran/1","json":"/method/deebert/papers/ran/1.json","rows":1}],"tasks":[{"task":"/task/natural-language-inference","name":"Natural Language Inference","papers":1},{"task":"/task/natural-language-understanding","name":"Natural Language Understanding","papers":1},{"task":"/task/paraphrase-identification","name":"Paraphrase Identification","papers":1}],"tasks_shown":3,"n_tasks":3,"usage_by_year":[{"year":"2020","papers":1},{"year":"2021","papers":1},{"year":"2023","papers":1}],"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/deebert"},"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=DeeBERT","read_at":"2026-10-05T00:54:34+00:00","query":"DeeBERT","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":"DeeBERT","origin_arxiv_id":"2004.12993"},"resolution":"exact","resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"same_paper","archive_paper_arxiv_id":"2004.12993","repositories":{"listed":3,"in_graph":3,"list_truncated":false,"strongest_link":"official"},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2004.12993","citations":554},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'DeeBERT'. That is a statement about this corpus and not about the field: short names are reused, and a sense we never collected cannot show up here. Confirm `served.arxiv_id` if you had a specific paper in mind."},"name_competition_text":null,"near_matches":null,"code_nearby":[],"code_nearby_caption":null,"origin_paper":{"arxiv_id":"2004.12993","page":"/paper/deebert-dynamic-early-exiting-for","syntology_url":"https://syntology.ai/paper/2004.12993","in_graph_layer":true,"samples":6,"ran":5,"n_ran_checked":5,"n_instrument":0,"unverified":1,"phrase":"5 ran (of which 3 constructed an object rather than computing a result; 5 with no instrument failure: 1 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"repository known, no verified implementation (declared_code; repositories: 3 listed of 3 in the graph, strongest link: official). This answer is about arXiv:2004.12993, the paper the archive credits with this method.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"161b1aeec9e4aeb2f85f5478ac6bbd31d4bbb056bc23bb062de30fd0f8716bbf","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}