{"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/searching-efficient-3d-architectures-with","title":"Searching Efficient 3D Architectures with Sparse Point-Voxel Convolution","arxiv_id":"2007.16100","date":"2020-07-31","proceeding":"ECCV 2020 8","authors":["Haotian Tang","Zhijian Liu","Shengyu Zhao","Yujun Lin","Ji Lin","Hanrui Wang","Song Han"],"abstract":"Self-driving cars need to understand 3D scenes efficiently and accurately in order to drive safely. Given the limited hardware resources, existing 3D perception models are not able to recognize small instances (e.g., pedestrians, cyclists) very well due to the low-resolution voxelization and aggressive downsampling. To this end, we propose Sparse Point-Voxel Convolution (SPVConv), a lightweight 3D module that equips the vanilla Sparse Convolution with the high-resolution point-based branch. With negligible overhead, this point-based branch is able to preserve the fine details even from large outdoor scenes. To explore the spectrum of efficient 3D models, we first define a flexible architecture design space based on SPVConv, and we then present 3D Neural Architecture Search (3D-NAS) to search the optimal network architecture over this diverse design space efficiently and effectively. Experimental results validate that the resulting SPVNAS model is fast and accurate: it outperforms the state-of-the-art MinkowskiNet by 3.3%, ranking 1st on the competitive SemanticKITTI leaderboard. It also achieves 8x computation reduction and 3x measured speedup over MinkowskiNet with higher accuracy. Finally, we transfer our method to 3D object detection, and it achieves consistent improvements over the one-stage detection baseline on KITTI.","url_abs":"https://arxiv.org/abs/2007.16100v2","url_pdf":"https://arxiv.org/pdf/2007.16100v2.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":"searching-efficient-3d-architectures-with","repo_url":"https://github.com/mit-han-lab/spvnas","is_official":1,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"searching-efficient-3d-architectures-with","repo_url":"https://github.com/chenfengxu714/image2point","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok","spdx":"BSD-2-Clause"}},{"paper_slug":"searching-efficient-3d-architectures-with","repo_url":"https://github.com/mit-han-lab/torchsparse","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null},{"paper_slug":"searching-efficient-3d-architectures-with","repo_url":"https://github.com/pjlab-adg/openpcseg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"searching-efficient-3d-architectures-with","repo_url":"https://github.com/pjlab-adg/pcseg","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"searching-efficient-3d-architectures-with","repo_url":"https://github.com/Pointcept/Pointcept","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":0,"framework":"pytorch","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"3d-object-detection","task_name":"3D Object Detection"},{"task_slug":"3d-semantic-segmentation","task_name":"3D Semantic Segmentation"},{"task_slug":"lidar-semantic-segmentation","task_name":"LIDAR Semantic Segmentation"},{"task_slug":"architecture-search","task_name":"Neural Architecture Search"},{"task_slug":"object-detection","task_name":"Object Detection"},{"task_slug":"robust-3d-semantic-segmentation","task_name":"Robust 3D Semantic Segmentation"},{"task_slug":"self-driving-cars","task_name":"Self-Driving Cars"},{"task_slug":"object-detection-1","task_name":"object-detection"}],"methods":[{"method_slug":"convolution","method_name":"Convolution"}],"datasets_introduced":[],"methods_introduced":[],"results":[{"leaderboard":"/sota/3d-semantic-segmentation-on-semantickitti","task":"3D Semantic Segmentation","dataset":"SemanticKITTI","model":"SPVNAS","rank_in_archive_order":14,"of":45,"metrics":{"test mIoU":"66.4%","val mIoU":"64.7%"},"uses_additional_data":false},{"leaderboard":"/sota/3d-semantic-segmentation-on-wildscenes","task":"3D Semantic Segmentation","dataset":"WildScenes","model":"SPVCNN","rank_in_archive_order":2,"of":4,"metrics":{"mIoU":"36.78"},"uses_additional_data":false},{"leaderboard":"/sota/lidar-semantic-segmentation-on-nuscenes","task":"LIDAR Semantic Segmentation","dataset":"nuScenes","model":"SPVCNN++","rank_in_archive_order":6,"of":36,"metrics":{"test mIoU":"0.811"},"uses_additional_data":false},{"leaderboard":"/sota/lidar-semantic-segmentation-on-nuscenes","task":"LIDAR Semantic Segmentation","dataset":"nuScenes","model":"SPVNAS","rank_in_archive_order":16,"of":36,"metrics":{"test mIoU":"0.77"},"uses_additional_data":false},{"leaderboard":"/sota/robust-3d-semantic-segmentation-on","task":"Robust 3D Semantic Segmentation","dataset":"SemanticKITTI-C","model":"SPVCNN-34","rank_in_archive_order":1,"of":22,"metrics":{"mean Corruption Error (mCE)":"99.16%"},"uses_additional_data":false},{"leaderboard":"/sota/robust-3d-semantic-segmentation-on","task":"Robust 3D Semantic Segmentation","dataset":"SemanticKITTI-C","model":"SPVCNN-18","rank_in_archive_order":4,"of":22,"metrics":{"mean Corruption Error (mCE)":"100.30%"},"uses_additional_data":false},{"leaderboard":"/sota/robust-3d-semantic-segmentation-on-wod-c","task":"Robust 3D Semantic Segmentation","dataset":"WOD-C","model":"SPVCNN-34","rank_in_archive_order":2,"of":5,"metrics":{"mean Corruption Error (mCE)":"98.72%"},"uses_additional_data":false},{"leaderboard":"/sota/robust-3d-semantic-segmentation-on-wod-c","task":"Robust 3D Semantic Segmentation","dataset":"WOD-C","model":"SPVCNN-18","rank_in_archive_order":4,"of":5,"metrics":{"mean Corruption Error (mCE)":"103.60%"},"uses_additional_data":false},{"leaderboard":"/sota/robust-3d-semantic-segmentation-on-nuscenes-c","task":"Robust 3D Semantic Segmentation","dataset":"nuScenes-C","model":"SPVCNN-34","rank_in_archive_order":3,"of":12,"metrics":{"mean Corruption Error (mCE)":"97.45%"},"uses_additional_data":false},{"leaderboard":"/sota/robust-3d-semantic-segmentation-on-nuscenes-c","task":"Robust 3D Semantic Segmentation","dataset":"nuScenes-C","model":"SPVCNN-18","rank_in_archive_order":7,"of":12,"metrics":{"mean Corruption Error (mCE)":"106.65%"},"uses_additional_data":false}],"syntology":{"syntology_url":"https://syntology.ai/paper/2007.16100","atlas_url":"https://app.syntology.ai/?focus=2007.16100","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2007.16100"},"calls":[{"tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2007.16100"},"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":"2007.16100"},"call":"get_harvested_code_for_paper(arxiv_id=\"2007.16100\")"},{"tool":"get_code","arguments_in":{"code_sha256":"syntology.samples[].code_sha256"},"call":"get_code(code_sha256=\"…\")"},{"tool":"get_citation_path","arguments":{"paper_1":"2007.16100"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2007.16100\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2007.16100"},"call":"get_concepts_for_paper(arxiv_id=\"2007.16100\")"}],"by_repo":[{"repo":"mit-han-lab/spvnas","kind":"official","samples":3,"ran":2,"instrument":0,"unverified":1},{"repo":"chenfengxu714/image2point","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2106.04180"],"harvested_for_calls":[{"arxiv_id":"2106.04180","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2106.04180"},"call":"get_harvested_code_for_paper(arxiv_id=\"2106.04180\")"}]},{"repo":"mit-han-lab/torchsparse","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2204.10319"],"harvested_for_calls":[{"arxiv_id":"2204.10319","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2204.10319"},"call":"get_harvested_code_for_paper(arxiv_id=\"2204.10319\")"}]},{"repo":"pjlab-adg/openpcseg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"pjlab-adg/pcseg","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2309.05573"],"harvested_for_calls":[{"arxiv_id":"2309.05573","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2309.05573"},"call":"get_harvested_code_for_paper(arxiv_id=\"2309.05573\")"}]},{"repo":"Pointcept/Pointcept","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["2503.16429"],"harvested_for_calls":[{"arxiv_id":"2503.16429","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2503.16429"},"call":"get_harvested_code_for_paper(arxiv_id=\"2503.16429\")"}]}],"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/2007.16100.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/2007.16100.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/mit-han-lab/torchsparse","reach":null},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/chenfengxu714/image2point","reach":{"status":"ok","spdx":"BSD-2-Clause"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pjlab-adg/openpcseg","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/pjlab-adg/pcseg","reach":{"status":"ok"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/Pointcept/Pointcept","reach":{"status":"ok","spdx":"MIT"}},{"provenance":"external:paperswithcode_snapshot_2025-07-28","url":"https://github.com/mit-han-lab/spvnas","reach":{"status":"ok","spdx":"MIT"}}],"summary":{"ran":2,"unverified":1},"n_samples":3,"n_ran":2,"n_constructed":0,"n_ran_checked":2,"n_instrument":0,"n_unverified":1,"n_instrument_is":"failures of Syntology's instrument, not of the code","every_run_is_an_instrument_failure":false,"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":2,"n_instrument":0,"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":0,"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-25","last":"2026-09-25","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":"0b71a9bb5beea7b9","code_sha256_prefix":"0b71a9bb5beea7b9","entry":"create_label_map","repo":"mit-han-lab/spvnas","repo_kind":"official","path":"visualize.py","file_url":"https://github.com/mit-han-lab/spvnas/blob/HEAD/visualize.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"num_classes:int/0/int","fixture_out_type":"ndarray","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","retrieve_with":{"tool":"get_code","code_sha256":"0b71a9bb5beea7b9"},"code_page":null,"census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"0b71a9bb5beea7b9"}},{"code_sha256":"5353e04b2b5c5a26","code_sha256_prefix":"5353e04b2b5c5a26","entry":"make_divisible","repo":"mit-han-lab/spvnas","repo_kind":"official","path":"core/modules/dynamic_sparseop.py","file_url":"https://github.com/mit-han-lab/spvnas/blob/HEAD/core/modules/dynamic_sparseop.py","link_basis":"first_harvest_node","language":"python","status":"ran","verification_level":1,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":true,"signature":"x:int/0/int","fixture_out_type":"int","level_recorded_at":"2026-09-25T09:36:09.529386+00:00","retrieve_with":{"tool":"get_code","code_sha256":"5353e04b2b5c5a26"},"code_page":"/code/make-divisible","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"5353e04b2b5c5a26"}},{"code_sha256":"82545d97082ff5f4","code_sha256_prefix":"82545d97082ff5f4","entry":"download_url","repo":"mit-han-lab/spvnas","repo_kind":"official","path":"model_zoo.py","file_url":"https://github.com/mit-han-lab/spvnas/blob/HEAD/model_zoo.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"code_page":"/code/download-url","census":null,"licence":"MIT","inline_ok":true,"inline_ok_link":true,"withheld_clause":null,"mcp_get_code":{"code_sha256":"82545d97082ff5f4"}}]},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"5e31bb6d054eba379d61687501ec3ef85f98992d3101d2a88f51c910cb286a6d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}