Methods › General › Prioritized Sampling › ATSS

Adaptive Training Sample Selection

ATSS

16 papers tagged archive 2025-07-28

archive 2025-07-28 Description, source and code snippet are the archive's method entry.

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.

For 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 ℒ feature pyramid levels, the ground-truth box g will have k×ℒ candidate positive samples. After that, we compute the IoU between these candidates and the ground-truth g as 𝒟_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.

Notably 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.

Source: Bridging the Gap Between Anchor-based and Anchor-free...See Code · sfzhang15/ATSS

In Syntology 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.

Syntology's have check for this name (free, it answers coverage only), read 2026-10-05; ask it again live. A level is the served verification level of that one answer; nothing here is summed across methods.

Papers archive 2025-07-28

archive papers tagged: 16 · with a code link: 13 · where Syntology ran a sample: 5 (5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument) Syntology

Show: all tagged papersonly where code ran (5 of 16 tagged: 5 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument)

Page 1 of 1: papers 1 to 16 of 16, newest first by the archive's date (ties by slug), in archive order.

Repository counts are the archive's code-links table. A Syntology line states what Syntology ran from that paper's harvested code, as “N ran (of which C constructed an object rather than computing a result; K with no instrument failure: H honoured, V violated, P with no contract checked; I where Syntology's instrument failed) · U unverified”; the instrument figure counts failures of Syntology's instrument, not of the code. It is per sample and not a correctness claim. When the archive marks a repository official for the paper, the line starts with that repository's state (the archive's flag, not a verdict on who wrote the code; “community repositories only” when every sample that ran came from a community repository, “official: no sample here; runs from other or unrecorded repositories” when some came from a repository the paper names or has in its text, or from none recorded); hover it for the repositories the samples that ran came from.

Tasks archive 2025-07-28

20 tasks the archive attaches to papers tagged with this method, by distinct papers. A task without a page in the catalog is plain text.

TaskPapers
Object Detection12
object-detection10
Object6
Instance Segmentation3
Semantic Segmentation3
regression3
Decoder2
Dense Object Detection2
Real-time Instance Segmentation2
Segmentation2
2D Object Detection1
CPU1
Cell Detection1
Classification1
Disentanglement1
GPU1
General Classification1
Quantization1
Video Understanding1
set matching1

Usage over time archive 2025-07-28

Papers per year tagged with ATSS: 2019 to 2024, peak 4 4 0 2019: 1 paper 2019 2020: 4 papers 2020 2021: 4 papers 2021 2022: 4 papers 2022 2023: 2 papers 2023 2024: 1 paper 2024
Papers per year the archive tags with this method, by the paper's archive date (16 dated). Bars are counts, not a trend claim.

Components: the archive holds no method-to-method composition, so PwC's Components table cannot be rebuilt; the Papers list carries no Results column for the same reason (the archive does not join its leaderboard rows to method tags).

Categories archive 2025-07-28

Prioritized Sampling

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections