{"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":"/paper/repmlpnet-hierarchical-vision-mlp-with-re","title":"RepMLPNet: Hierarchical Vision MLP with Re-parameterized Locality","arxiv_id":"2112.11081","date":"2021-12-21","proceeding":"CVPR 2022 1","authors":["Xiaohan Ding","Honghao Chen","Xiangyu Zhang","Jungong Han","Guiguang Ding"],"abstract":"Compared to convolutional layers, fully-connected (FC) layers are better at modeling the long-range dependencies but worse at capturing the local patterns, hence usually less favored for image recognition. In this paper, we propose a methodology, Locality Injection, to incorporate local priors into an FC layer via merging the trained parameters of a parallel conv kernel into the FC kernel. Locality Injection can be viewed as a novel Structural Re-parameterization method since it equivalently converts the structures via transforming the parameters. Based on that, we propose a multi-layer-perceptron (MLP) block named RepMLP Block, which uses three FC layers to extract features, and a novel architecture named RepMLPNet. The hierarchical design distinguishes RepMLPNet from the other concurrently proposed vision MLPs. As it produces feature maps of different levels, it qualifies as a backbone model for downstream tasks like semantic segmentation. Our results reveal that 1) Locality Injection is a general methodology for MLP models; 2) RepMLPNet has favorable accuracy-efficiency trade-off compared to the other MLPs; 3) RepMLPNet is the first MLP that seamlessly transfer to Cityscapes semantic segmentation. The code and models are available at https://github.com/DingXiaoH/RepMLP.","url_abs":"https://arxiv.org/abs/2112.11081v2","url_pdf":"https://arxiv.org/pdf/2112.11081v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"repmlpnet-hierarchical-vision-mlp-with-re","repo_url":"https://github.com/DingXiaoH/RepMLP","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"repmlpnet-hierarchical-vision-mlp-with-re","repo_url":"https://github.com/liuruiyang98/Jittor-MLP","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":null},{"paper_slug":"repmlpnet-hierarchical-vision-mlp-with-re","repo_url":"https://github.com/MS-Mind/MS-Code-02/tree/main/configs/repmlp","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"mindspore","reach":null},{"paper_slug":"repmlpnet-hierarchical-vision-mlp-with-re","repo_url":"https://github.com/towhee-io/towhee","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"image-classification","task_name":"Image Classification"},{"task_slug":"semantic-segmentation","task_name":"Semantic Segmentation"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/image-classification-on-imagenet","task":"Image Classification","dataset":"ImageNet","model":"RepMLPNet-L256","rank_in_archive_order":606,"of":1060,"metrics":{"Top 1 Accuracy":"81.8%"},"uses_additional_data":false},{"leaderboard":"/sota/semantic-segmentation-on-cityscapes-val","task":"Semantic Segmentation","dataset":"Cityscapes val","model":"RepMLPNet-D256","rank_in_archive_order":70,"of":99,"metrics":{"mIoU":"76.27"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2112.11081","atlas_url":"https://app.syntology.ai/?focus=2112.11081","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2112.11081"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2112.11081"},"returns":"the samples harvested from this paper, each with its run record; it does not verify the paper"},{"tool":"get_code","arguments_in":"samples[].code_sha256","returns":"one stored sample by its code_sha256; not shown on this site"}]},"developers":"https://syntology.ai/developers","held":true,"reason":"in_graph_layer","checked_against":null,"agent_calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2112.11081"},"call":"get_harvested_code_for_paper(arxiv_id=\"2112.11081\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2112.11081"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2112.11081\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2112.11081"},"call":"get_concepts_for_paper(arxiv_id=\"2112.11081\")"}],"by_repo":[{"repo":"DingXiaoH/RepMLP","kind":"official","samples":3,"ran":2,"instrument":2,"unverified":1,"placed_by_identical_code":3},{"repo":"liuruiyang98/Jittor-MLP","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2108.01072"],"harvested_for_calls":[{"arxiv_id":"2108.01072","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2108.01072"},"call":"get_harvested_code_for_paper(arxiv_id=\"2108.01072\")"}]},{"repo":"MS-Mind/MS-Code-02","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2206.10589"],"harvested_for_calls":[{"arxiv_id":"2206.10589","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.10589"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.10589\")"}]},{"repo":"towhee-io/towhee","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":12,"harvested_for":["1512.03385","2103.03206","2103.08784","2103.14030","2104.11227","2201.03545","2201.04676","2201.04850","2201.08377","2203.16518","2204.01697","2206.10436"],"harvested_for_calls":[{"arxiv_id":"1512.03385","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.03385"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.03385\")"},{"arxiv_id":"2103.03206","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.03206"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.03206\")"},{"arxiv_id":"2103.08784","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.08784"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.08784\")"},{"arxiv_id":"2103.14030","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2103.14030"},"call":"get_harvested_code_for_paper(arxiv_id=\"2103.14030\")"},{"arxiv_id":"2104.11227","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2104.11227"},"call":"get_harvested_code_for_paper(arxiv_id=\"2104.11227\")"},{"arxiv_id":"2201.03545","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.03545"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.03545\")"},{"arxiv_id":"2201.04676","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.04676"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.04676\")"},{"arxiv_id":"2201.04850","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.04850"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.04850\")"},{"arxiv_id":"2201.08377","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2201.08377"},"call":"get_harvested_code_for_paper(arxiv_id=\"2201.08377\")"},{"arxiv_id":"2203.16518","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2203.16518"},"call":"get_harvested_code_for_paper(arxiv_id=\"2203.16518\")"},{"arxiv_id":"2204.01697","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.01697"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.01697\")"},{"arxiv_id":"2206.10436","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2206.10436"},"call":"get_harvested_code_for_paper(arxiv_id=\"2206.10436\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code","read_at":"2026-10-05T00:36:11+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","ran_record":{"url":"https://syntology.ai/api/ran/2112.11081.json","schema":"syntology.ran_record/1","counts_crosswalk":{"n_samples":"syntology.counts.lifted","n_ran":"syntology.counts.executed","n_ran_checked":"syntology.counts.checked","n_instrument":"syntology.counts.instrument_failures","n_unverified":"syntology.counts.no_recorded_run"},"note":"live record, measured at request time; may be newer than this page's graph read","badge":"https://syntology.ai/api/ran/2112.11081.svg"},"claim":"Per-sample execution status on synthesized fixtures; not a correctness claim about the paper. Samples come from repositories linked to the paper, official or community; repo_kind says which.","repos":[{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/liuruiyang98/Jittor-MLP","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/MS-Mind/MS-Code-02/tree/main/configs/repmlp","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/DingXiaoH/RepMLP","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/towhee-io/towhee","reach":null}],"summary":{"ran_draft_wrong":2,"unverified":1},"n_samples":3,"n_ran":2,"n_constructed":0,"n_ran_checked":0,"n_instrument":2,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":true,"key_notes":{"n_ran_checked":"legacy name, kept unchanged so existing readers do not break: it counts the samples that ran with no instrument failure (honoured, violated, and ran with no contract checked); it does not mean a contract was checked, and the pages print it as 'K with no instrument failure', not 'K checked'","n_constructed":"a sub-count of the samples that ran, never subtracted from them and never a failure: an executed sample whose run returned an instance of its own class (fixture_out_type equals the entry name): the run built an object and did not compute a result (Syntology's RAN record, counts.constructed)"},"by_repo_kind":{"official":{"samples":3,"ran":2,"n_ran_checked":0,"n_instrument":2,"repositories":1}},"repo_kind_vocabulary":{"official":"The archive marks this repository official for the paper","named_in_paper":"The archive records that the paper mentions this repository; it is not marked official","listed":"In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper","found_in_text":"Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted","community":"Not in the archive's code links for this paper; a community repository Syntology harvested"},"n_pointer_only_for_licence":3,"inline_ok_is":"inline_ok is true only when both licence gates allow Syntology to serve this code's text: this paper's link (inline_ok_link, from the licence of this paper's copy) and the stored copy of the same code that Syntology serves, which may have been first harvested from another repository. withheld_clause is Syntology's own wording of which gate keeps the text a pointer and why, and is null when inline_ok is true. This site shows no code text either way; n_pointer_only_for_licence counts samples with inline_ok false (both gates), n_pointer_only_link_allows those of them whose inline_ok_link is true","n_pointer_only_link_allows":0,"fixture_fields_is":{"signature_and_fixture_out_type":"the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right","level_recorded_at":"when Syntology's graph wrote the sample's verification level, not when the code executed; absent where the level was written before the date was kept, and never filled in with the build date","present_on":"samples that ran only; a key is absent, never empty, where the graph records nothing"},"n_ran_with_level_date":2,"n_ran_without_level_date":0,"n_ran_signature_not_shown":0,"levels_written_between":{"first":"2026-09-22","last":"2026-09-22","is":"the first and last UTC dates on which Syntology's graph wrote a verification level for a sample on this page that ran, not when the code executed"},"code_page_min_papers":5,"code_page_is":"a page for the entry name across every paper's harvested code; the name is a string, not an identity","samples":[{"code_sha256":"7186655759897af6","code_sha256_prefix":"7186655759897af6","entry":"conv_bn","repo":null,"repo_kind":"official","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"in_channels:int/0/int, out_channels:int/0/int, kernel_size:int/0/int, stride:int/0/int, padding:int/0/int, groups:int/0/int","fixture_out_type":"Sequential","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/conv-bn","census":null,"placed_by_identical_code":{"repo":"DingXiaoH/RepMLP","path":"repmlpnet.py","file_url":"https://github.com/DingXiaoH/RepMLP/blob/HEAD/repmlpnet.py","papers":["2105.01883"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"7186655759897af6"}},{"code_sha256":"18483b4d73618baa","code_sha256_prefix":"18483b4d73618baa","entry":"conv_bn_relu","repo":null,"repo_kind":"official","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"ran_draft_wrong","verification_level":1,"contract_check":"OUTPUT_MISDECLARED","metamorphic_tier":"deterministic","behaviour_fingerprint":false,"signature":"in_channels:int/0/int, out_channels:int/0/int, kernel_size:int/0/int, stride:int/0/int, padding:int/0/int, groups:int/0/int","fixture_out_type":"Sequential","level_recorded_at":"2026-09-22T14:31:46.068493+00:00","code_page":"/code/conv-bn-relu","census":null,"placed_by_identical_code":{"repo":"DingXiaoH/RepMLP","path":"repmlpnet.py","file_url":"https://github.com/DingXiaoH/RepMLP/blob/HEAD/repmlpnet.py","papers":["2105.01883"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"18483b4d73618baa"}},{"code_sha256":"c1e5b17d52a4eaa8","code_sha256_prefix":"c1e5b17d52a4eaa8","entry":"fuse_bn","repo":null,"repo_kind":"official","path":null,"file_url":null,"link_basis":"identical_code_first_harvested_elsewhere","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":null,"census":null,"placed_by_identical_code":{"repo":"DingXiaoH/RepMLP","path":"repmlpnet.py","file_url":"https://github.com/DingXiaoH/RepMLP/blob/HEAD/repmlpnet.py","papers":["2105.01883"],"is":"identical code Syntology harvested from this repository for another paper; this paper's link records no repository, path or licence of its own"},"licence":null,"inline_ok":false,"inline_ok_link":false,"withheld_clause":"this paper's copy of the code was not recorded (its link names no repository or source path), so no licence was read for it","mcp_get_code":{"code_sha256":"c1e5b17d52a4eaa8"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"cc70086f2e5aa45a72ac222ce0c44a46f541531e3b8bd85537717911e0a541d9","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}