{"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/netadapt","slug":"netadapt","name":"NetAdapt","full_name":"NetAdapt","full_name_withheld":false,"description_markdown":"**NetAdapt** is a network shrinking algorithm to adapt a pretrained network to a mobile platform given a real resource budget. NetAdapt can incorporate direct metrics, such as latency and energy, into the optimization to maximize the adaptation performance based on the characteristics of the platform. By using empirical measurements, NetAdapt can be applied to any platform as long as we can measure the desired metrics, without any knowledge of the underlying implementation of the platform. \r\n\r\nWhile many existing algorithms simplify networks based on the number of MACs or weights, optimizing those indirect metrics may not necessarily reduce the direct metrics, such as latency and energy consumption. To solve this problem, NetAdapt incorporates direct metrics into its adaptation algorithm. These direct metrics are evaluated using *empirical measurements*, so that detailed knowledge of the platform and toolchain is not required. NetAdapt automatically and progressively simplifies a pre-trained network until the resource budget is met while maximizing the accuracy.","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":"http://arxiv.org/abs/1804.03230v2","title":"NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applications","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/denru01/netadapt","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Network Shrinking","url":"/methods/category/network-shrinking","pwc_aliases":[]}],"n_papers_tagged":3,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/sar-atr-under-limited-training-data-via","slug":"sar-atr-under-limited-training-data-via","title":"SAR ATR under Limited Training Data Via MobileNetV3","date":"2023-06-27","arxiv_id":"2306.15287","n_code_links":1,"syntology":null},{"paper":"/paper/searching-for-mobilenetv3","slug":"searching-for-mobilenetv3","title":"Searching for MobileNetV3","date":"2019-05-06","arxiv_id":"1905.02244","n_code_links":67,"syntology":{"ran":86,"of":105,"n_ran_checked":75,"n_instrument":11,"unverified":19,"pointer_only":46,"phrase":"86 ran (of which 22 constructed an object rather than computing a result; 75 with no instrument failure: 9 honoured, 2 violated, 64 with no contract checked; 11 where Syntology's instrument failed) · 19 unverified","official":null}},{"paper":"/paper/netadapt-platform-aware-neural-network","slug":"netadapt-platform-aware-neural-network","title":"NetAdapt: Platform-Aware Neural Network Adaptation for Mobile Applications","date":"2018-04-09","arxiv_id":"1804.03230","n_code_links":4,"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":null}}],"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":2,"not_listed_spam_title":0,"listed":3,"listed_where_code_ran":2,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":2,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":2,"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":2,"papers_where_code_ran_first_page":"/method/netadapt/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/netadapt/papers/ran/1","json":"/method/netadapt/papers/ran/1.json","rows":2}],"tasks":[{"task":"/task/image-classification","name":"Image Classification","papers":2},{"task":null,"name":"CPU","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/decoder","name":"Decoder","papers":1},{"task":"/task/dichotomous-image-segmentation","name":"Dichotomous Image Segmentation","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/architecture-search","name":"Neural Architecture Search","papers":1},{"task":"/task/object-detection","name":"Object Detection","papers":1},{"task":"/task/segmentation","name":"Segmentation","papers":1},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":1},{"task":"/task/image-classification","name":"image-classification","papers":1}],"tasks_shown":11,"n_tasks":11,"usage_by_year":[{"year":"2018","papers":1},{"year":"2019","papers":1},{"year":"2023","papers":1}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/netadapt"},"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=NetAdapt","read_at":"2026-10-05T00:59:34+00:00","query":"NetAdapt","kind":"paper","have":"unverified_code","tier":"harvested","verified_implementation":false,"level":1,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"1804.03230"},"resolution":"paper","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":4,"in_graph":4,"list_truncated":false,"strongest_link":"mentioned_in_github"},"retrieve_with":"get_harvested_code_for_paper(arxiv_id='1804.03230')","name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"1804.03230","citations":580},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'NetAdapt'. 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":"1804.03230","page":"/paper/netadapt-platform-aware-neural-network","syntology_url":"https://syntology.ai/paper/1804.03230","in_graph_layer":true,"samples":1,"ran":1,"n_ran_checked":1,"n_instrument":0,"unverified":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","instrument_means":"failures of Syntology's instrument, not of the code"},"line":"harvested code stored, below machine verification (unverified_code; harvested), served level V1. Repositories: 4 listed of 4 in the graph, strongest link: mentioned on GitHub. The lookup matched a paper by its title, arXiv:1804.03230, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:1804.03230) is about this method is not checked.","level_legend":{"state":"quoted","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","card_sha256":"479785a84658dd682a11b10237b3620d651d7f87799f5dc7add970aaa83f6d39","note":"Syntology's served verification levels, quoted verbatim from its MCP server card; a row is split where the card separates clauses with a double hyphen, and the separator is not reproduced","levels":[{"level":"V0","quoted":["imports"]},{"level":"V1","quoted":["executes against a synthesized fixture and returns a value of the recorded type"]},{"level":"V2","quoted":["two implementations GENERATED from the paper's signature and spec agree numerically (1e-6) on fixture inputs","neither of the two ever read the authors' own code, so V2 measures how unambiguously the paper specifies the method, not fidelity to the authors' implementation (measured 2026-09-11, commit 75eaa77: cross_checked_by is a second LLM on 2,628 of 2,831 served samples)"]},{"level":"V3","quoted":["paper-derived property tests pass on both of those same two generations."]}],"no_rung":"No rung on this ladder compares the served code against the authors' implementation, so treat every level as evidence about runnability and internal agreement, not about matching the paper's results."}},"syntology_have_state":"loaded","record_sha256":"e62f42d38f3ab55e4b36ac4759935c4ccd2948897f0f38c438e72a34e071031d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}