{"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/atss","slug":"atss","name":"ATSS","full_name":"Adaptive Training Sample Selection","full_name_withheld":false,"description_markdown":"**Adaptive Training Sample Selection**, or **ATSS**, is a method to automatically select positive and negative samples according to statistical characteristics of object. It bridges the gap between anchor-based and anchor-free detectors. \r\n\r\nFor each ground-truth box $g$ on the image, we first find out its candidate positive samples. As described in Line $3$ to $6$, on each pyramid level, we select $k$ anchor boxes whose center are closest to the center of $g$ based on L2 distance. Supposing there are $\\mathcal{L}$ feature pyramid levels, the ground-truth box $g$ will have $k\\times\\mathcal{L}$ candidate positive samples. After that, we compute the IoU between these candidates and the ground-truth $g$ as $\\mathcal{D}_g$ in Line $7$, whose mean and standard deviation are computed as $m_g$ and $v_g$ in Line $8$ and Line $9$. With these statistics, the IoU threshold for this ground-truth $g$ is obtained as $t_g=m_g+v_g$ in Line $10$. Finally, we select these candidates whose IoU are greater than or equal to the threshold $t_g$ as final positive samples in Line $11$ to $15$. \r\n\r\nNotably ATSS also limits the positive samples' center to the ground-truth box as shown in Line $12$. Besides, if an anchor box is assigned to multiple ground-truth boxes, the one with the highest IoU will be selected. The rest are negative samples.","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":"https://arxiv.org/abs/1912.02424v4","title":"Bridging the Gap Between Anchor-based and Anchor-free Detection via Adaptive Training Sample Selection","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/sfzhang15/ATSS/blob/79dfb28bd18c931dd75a3ca2c63d32f5e4b1626a/atss_core/modeling/rpn/atss/atss.py#L194","code_snippet_url_on_a_code_host":true,"categories":[{"area":"General","area_id":"general","collection":"Prioritized Sampling","url":"/methods/category/prioritized-sampling","pwc_aliases":[]}],"n_papers_tagged":16,"archive_num_papers":null,"papers_newest_first":[{"paper":"/paper/2408-02561","slug":"2408-02561","title":"HQOD: Harmonious Quantization for Object Detection","date":"2024-08-05","arxiv_id":"2408.02561","n_code_links":1,"syntology":null},{"paper":null,"slug":"generalized-mask-aware-iou-for-anchor","title":"Generalized Mask-aware IoU for Anchor Assignment for Real-time Instance Segmentation","date":"2023-12-28","arxiv_id":"2312.17031","n_code_links":0,"syntology":null},{"paper":"/paper/being-aware-of-localization-accuracy-by","slug":"being-aware-of-localization-accuracy-by","title":"Being Aware of Localization Accuracy By Generating Predicted-IoU-Guided Quality Scores","date":"2023-09-23","arxiv_id":"2309.13269","n_code_links":1,"syntology":null},{"paper":"/paper/how-to-train-an-accurate-and-efficient-object","slug":"how-to-train-an-accurate-and-efficient-object","title":"How to Train an Accurate and Efficient Object Detection Model on Any Dataset","date":"2022-11-30","arxiv_id":"2211.17170","n_code_links":1,"syntology":null},{"paper":"/paper/detrs-with-collaborative-hybrid-assignments","slug":"detrs-with-collaborative-hybrid-assignments","title":"DETRs with Collaborative Hybrid Assignments Training","date":"2022-11-22","arxiv_id":"2211.12860","n_code_links":6,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":null}},{"paper":null,"slug":"sample-hardness-based-gradient-loss-for-long","title":"Sample hardness based gradient loss for long-tailed cervical cell detection","date":"2022-08-07","arxiv_id":"2208.03779","n_code_links":0,"syntology":null},{"paper":"/paper/recursivemix-mixed-learning-with-history","slug":"recursivemix-mixed-learning-with-history","title":"RecursiveMix: Mixed Learning with History","date":"2022-03-14","arxiv_id":"2203.06844","n_code_links":1,"syntology":null},{"paper":"/paper/mask-aware-iou-for-anchor-assignment-in-real","slug":"mask-aware-iou-for-anchor-assignment-in-real","title":"Mask-aware IoU for Anchor Assignment in Real-time Instance Segmentation","date":"2021-10-19","arxiv_id":"2110.09734","n_code_links":1,"syntology":null},{"paper":"/paper/tood-task-aligned-one-stage-object-detection","slug":"tood-task-aligned-one-stage-object-detection","title":"TOOD: Task-aligned One-stage Object Detection","date":"2021-08-17","arxiv_id":"2108.07755","n_code_links":6,"syntology":{"ran":2,"of":4,"n_ran_checked":1,"n_instrument":1,"unverified":2,"pointer_only":3,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["fcjian/TOOD"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":1,"ran_from_kinds":["listed","official"]}}},{"paper":"/paper/disentangle-your-dense-object-detector","slug":"disentangle-your-dense-object-detector","title":"Disentangle Your Dense Object Detector","date":"2021-07-07","arxiv_id":"2107.02963","n_code_links":2,"syntology":null},{"paper":"/paper/control-distance-iou-and-control-distance-iou","slug":"control-distance-iou-and-control-distance-iou","title":"Control Distance IoU and Control Distance IoU Loss Function for Better Bounding Box Regression","date":"2021-03-22","arxiv_id":"2103.11696","n_code_links":1,"syntology":null},{"paper":null,"slug":"implicit-feature-pyramid-network-for-object","title":"Implicit Feature Pyramid Network for Object Detection","date":"2020-12-25","arxiv_id":"2012.13563","n_code_links":0,"syntology":null},{"paper":"/paper/generalized-focal-loss-v2-learning-reliable","slug":"generalized-focal-loss-v2-learning-reliable","title":"Generalized Focal Loss V2: Learning Reliable Localization Quality Estimation for Dense Object Detection","date":"2020-11-25","arxiv_id":"2011.12885","n_code_links":5,"syntology":null},{"paper":"/paper/relationnet-bridging-visual-representations","slug":"relationnet-bridging-visual-representations","title":"RelationNet++: Bridging Visual Representations for Object Detection via Transformer Decoder","date":"2020-10-29","arxiv_id":"2010.15831","n_code_links":4,"syntology":{"ran":4,"of":5,"n_ran_checked":4,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["microsoft/RelationNet2"],"state":"official (archive's flag): 4 ran","n_ran":4,"n_constructed":0,"n_ran_no_instrument_failure":4,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":"/paper/generalized-focal-loss-learning-qualified-and","slug":"generalized-focal-loss-learning-qualified-and","title":"Generalized Focal Loss: Learning Qualified and Distributed Bounding Boxes for Dense Object Detection","date":"2020-06-08","arxiv_id":"2006.04388","n_code_links":7,"syntology":{"ran":22,"of":24,"n_ran_checked":21,"n_instrument":1,"unverified":2,"pointer_only":2,"phrase":"22 ran (of which 0 constructed an object rather than computing a result; 21 with no instrument failure: 1 honoured, 0 violated, 20 with no contract checked; 1 where Syntology's instrument failed) · 2 unverified","official":{"repos":["implus/GFocal"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}},{"paper":"/paper/bridging-the-gap-between-anchor-based-and","slug":"bridging-the-gap-between-anchor-based-and","title":"Bridging the Gap Between Anchor-based and Anchor-free Detection via Adaptive Training Sample Selection","date":"2019-12-05","arxiv_id":"1912.02424","n_code_links":13,"syntology":{"ran":4,"of":4,"n_ran_checked":4,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"4 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 0 honoured, 0 violated, 4 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["sfzhang15/ATSS"],"state":"community repositories only","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["listed"]}}}],"papers_shown":16,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":16,"with_a_code_link":13,"where_syntology_ran_a_sample":5,"not_listed_spam_title":0,"listed":16,"listed_where_code_ran":5,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":0,"listed_with_a_run_with_no_instrument_failure":5,"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":5,"papers_where_code_ran_first_page":"/method/atss/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/atss/papers/ran/1","json":"/method/atss/papers/ran/1.json","rows":5}],"tasks":[{"task":"/task/object-detection","name":"Object Detection","papers":12},{"task":"/task/object-detection-1","name":"object-detection","papers":10},{"task":"/task/object","name":"Object","papers":6},{"task":"/task/instance-segmentation","name":"Instance Segmentation","papers":3},{"task":"/task/semantic-segmentation","name":"Semantic Segmentation","papers":3},{"task":"/task/regression-1","name":"regression","papers":3},{"task":"/task/decoder","name":"Decoder","papers":2},{"task":"/task/dense-object-detection","name":"Dense Object Detection","papers":2},{"task":"/task/real-time-instance-segmentation","name":"Real-time Instance Segmentation","papers":2},{"task":"/task/segmentation","name":"Segmentation","papers":2},{"task":"/task/2d-object-detection","name":"2D Object Detection","papers":1},{"task":null,"name":"CPU","papers":1},{"task":"/task/cell-detection","name":"Cell Detection","papers":1},{"task":"/task/classification-1","name":"Classification","papers":1},{"task":"/task/disentanglement","name":"Disentanglement","papers":1},{"task":null,"name":"GPU","papers":1},{"task":"/task/classification","name":"General Classification","papers":1},{"task":"/task/quantization","name":"Quantization","papers":1},{"task":"/task/video-understanding","name":"Video Understanding","papers":1},{"task":"/task/set-matching","name":"set matching","papers":1}],"tasks_shown":20,"n_tasks":20,"usage_by_year":[{"year":"2019","papers":1},{"year":"2020","papers":4},{"year":"2021","papers":4},{"year":"2022","papers":4},{"year":"2023","papers":2},{"year":"2024","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/atss"},"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=ATSS","read_at":"2026-10-05T00:52:40+00:00","query":"ATSS","kind":"paper","have":"no_code","tier":"paper_only","verified_implementation":false,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":{"arxiv_id":"2604.04029"},"resolution":"paper","resolved_name_differs":false,"absence_asserted":"for_this_paper_only","absence_unchecked":null,"no_code_is_about_this_method":false,"subject":"unknown","archive_paper_arxiv_id":null,"repositories":{"listed":null,"in_graph":0,"list_truncated":null,"strongest_link":null},"retrieve_with":null,"name_competition":{"verdict":"sole_bearer","may_be_wrong_sense":false,"bearers_found":1,"served":{"arxiv_id":"2604.04029","citations":null},"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing else in this corpus is named 'ATSS'. 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":"2604.04029","page":null,"syntology_url":null,"in_graph_layer":false,"samples":0},"line":"the paper matched by title, arXiv:2604.04029, held, no code (no_code; paper_only). The lookup matched a paper by its title, arXiv:2604.04029, not a method entry. The archive credits no paper with an arXiv id for this method, so whether this answer (about arXiv:2604.04029) is about this method is not checked; it does not say whether this method has code.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"a471ffcb1c83f5998861055946df53d8b1e6cc634748f250ac55b3702d6168bc","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}