{"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/learning-to-sample","title":"Learning to Sample","arxiv_id":"1812.01659","date":"2018-12-04","proceeding":"CVPR 2019 6","authors":["Oren Dovrat","Itai Lang","Shai Avidan"],"abstract":"Processing large point clouds is a challenging task. Therefore, the data is\noften sampled to a size that can be processed more easily. The question is how\nto sample the data? A popular sampling technique is Farthest Point Sampling\n(FPS). However, FPS is agnostic to a downstream application (classification,\nretrieval, etc.). The underlying assumption seems to be that minimizing the\nfarthest point distance, as done by FPS, is a good proxy to other objective\nfunctions.\n  We show that it is better to learn how to sample. To do that, we propose a\ndeep network to simplify 3D point clouds. The network, termed S-NET, takes a\npoint cloud and produces a smaller point cloud that is optimized for a\nparticular task. The simplified point cloud is not guaranteed to be a subset of\nthe original point cloud. Therefore, we match it to a subset of the original\npoints in a post-processing step. We contrast our approach with FPS by\nexperimenting on two standard data sets and show significantly better results\nfor a variety of applications. Our code is publicly available at:\nhttps://github.com/orendv/learning_to_sample","url_abs":"http://arxiv.org/abs/1812.01659v2","url_pdf":"http://arxiv.org/pdf/1812.01659v2.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":"learning-to-sample","repo_url":"https://github.com/orendv/learning_to_sample","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":null}],"tasks":[{"task_slug":"3d-point-cloud-classification","task_name":"3D Point Cloud Classification"},{"task_slug":"3d-point-cloud-reconstruction","task_name":"3D Point Cloud Reconstruction"},{"task_slug":"retrieval","task_name":"Retrieval"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"orendv/learning_to_sample","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"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"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"b29d649791c0006c997bcb64809489eb024bdecd88e057a82f5ea96c22c71f8d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}