{"about":{"site":"https://codewithpapers.app","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.","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"},"url":"/paper/learning-open-set-network-with-discriminative-1","title":"Learning Open Set Network with Discriminative Reciprocal Points","arxiv_id":"2011.00178","date":"2020-10-31","proceeding":"ECCV 2020 8","authors":["Guangyao Chen","Limeng Qiao","Yemin Shi","Peixi Peng","Jia Li","Tiejun Huang","ShiLiang Pu","Yonghong Tian"],"abstract":"Open set recognition is an emerging research area that aims to simultaneously classify samples from predefined classes and identify the rest as 'unknown'. In this process, one of the key challenges is to reduce the risk of generalizing the inherent characteristics of numerous unknown samples learned from a small amount of known data. In this paper, we propose a new concept, Reciprocal Point, which is the potential representation of the extra-class space corresponding to each known category. The sample can be classified to known or unknown by the otherness with reciprocal points. To tackle the open set problem, we offer a novel open space risk regularization term. Based on the bounded space constructed by reciprocal points, the risk of unknown is reduced through multi-category interaction. The novel learning framework called Reciprocal Point Learning (RPL), which can indirectly introduce the unknown information into the learner with only known classes, so as to learn more compact and discriminative representations. Moreover, we further construct a new large-scale challenging aircraft dataset for open set recognition: Aircraft 300 (Air-300). Extensive experiments on multiple benchmark datasets indicate that our framework is significantly superior to other existing approaches and achieves state-of-the-art performance on standard open set benchmarks.","url_abs":"https://arxiv.org/abs/2011.00178v1","url_pdf":"https://arxiv.org/pdf/2011.00178v1.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-open-set-network-with-discriminative-1","repo_url":"https://github.com/KevLuo/OpenSet_ReciprocalPoints","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"open-set-learning","task_name":"Open Set Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"atlas_url":"https://app.syntology.ai/?focus=2011.00178","mcp":{"get_harvested_code_for_paper":{"arxiv_id":"2011.00178"}},"developers":"https://syntology.ai/developers","read_at":"2026-09-24T18:15:14+00:00","read_at_is":"when the build read Syntology's graph, not when any sample ran","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/KevLuo/OpenSet_ReciprocalPoints","reach":null}],"summary":{"ran_fixture":1,"ran_honours":1,"unverified":1},"by_repo_kind":{"listed":{"samples":3,"ran":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,"samples":[{"code_sha256_prefix":"70f7fba46a9201d2","entry":"abridged_auc_softmax","repo":"KevLuo/OpenSet_ReciprocalPoints","repo_kind":"listed","path":"rpl/evaluate.py","file_url":"https://github.com/KevLuo/OpenSet_ReciprocalPoints/blob/HEAD/rpl/evaluate.py","link_basis":"first_harvest_node","language":"python","status":"ran_fixture","verification_level":1,"contract_check":"RAISES","metamorphic_tier":"invariant","behaviour_fingerprint":true,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"70f7fba46a9201d2"}},{"code_sha256_prefix":"7c88af8f191c2596","entry":"calc_auroc","repo":"KevLuo/OpenSet_ReciprocalPoints","repo_kind":"listed","path":"rpl/evaluate.py","file_url":"https://github.com/KevLuo/OpenSet_ReciprocalPoints/blob/HEAD/rpl/evaluate.py","link_basis":"first_harvest_node","language":"python","status":"ran_honours","verification_level":1,"contract_check":"HONOURS","metamorphic_tier":"well_formed","behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"7c88af8f191c2596"}},{"code_sha256_prefix":"be0d609f998363a2","entry":"collect_rpl_max","repo":"KevLuo/OpenSet_ReciprocalPoints","repo_kind":"listed","path":"rpl/evaluate.py","file_url":"https://github.com/KevLuo/OpenSet_ReciprocalPoints/blob/HEAD/rpl/evaluate.py","link_basis":"first_harvest_node","language":"python","status":"unverified","verification_level":0,"contract_check":null,"metamorphic_tier":null,"behaviour_fingerprint":false,"licence":"NONE","inline_ok":false,"mcp_get_code":{"code_sha256":"be0d609f998363a2"}}]},"arxiv_metadata":null,"syntology_extracted_results":null}