2020 25th International Conference on Pattern Recognition (ICPR) 2021
DOI: 10.1109/icpr48806.2021.9412676
|View full text |Cite
|
Sign up to set email alerts
|

Active Sampling for Pairwise Comparisons via Approximate Message Passing and Information Gain Maximization

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
21
0

Year Published

2022
2022
2024
2024

Publication Types

Select...
3
2
2

Relationship

0
7

Authors

Journals

citations
Cited by 31 publications
(21 citation statements)
references
References 21 publications
0
21
0
Order By: Relevance
“…Unfortunately, the limitation is in the size of such matrix, since the number of possible comparisons is growing in 𝑂 (𝑁 2 ), 𝑁 being the number of stimuli: introducing efficiency for a subjective protocol. A lot of previous works have focused on active sampling solutions [3,7,17,18,31,42] and more recently with the work of [4,19,22,26,27,34,41]. Where the target is to select the most informative pairs and minimize experimental effort while maintaining accurate estimations and be robustness to bad annotator behavior (e.g.…”
Section: Subjective Methodologies For Perception Evaluationmentioning
confidence: 99%
“…Unfortunately, the limitation is in the size of such matrix, since the number of possible comparisons is growing in 𝑂 (𝑁 2 ), 𝑁 being the number of stimuli: introducing efficiency for a subjective protocol. A lot of previous works have focused on active sampling solutions [3,7,17,18,31,42] and more recently with the work of [4,19,22,26,27,34,41]. Where the target is to select the most informative pairs and minimize experimental effort while maintaining accurate estimations and be robustness to bad annotator behavior (e.g.…”
Section: Subjective Methodologies For Perception Evaluationmentioning
confidence: 99%
“…1) Active Sampling is a technique that chooses the pairs to compare based on which one gives the most amount of information [50]. This technique is basically a compromise between number of comparisons and accuracy of the ranking with respect to the ground truth (i.e.…”
Section: Annotation Set Creationmentioning
confidence: 99%
“…Moreover, active sampling allows to reduce this error much faster than random selection of pairs to compare. Several state-of-the-art techniques exist to perform this task, but ASAP [50] is the latest and fastest at the moment of writing. With this technique, we are guaranteed to reach at worse a 15% error within 1 3 n 2 comparisons.…”
Section: Annotation Set Creationmentioning
confidence: 99%
“…Active SAmpling for Pairwise comparisons (ASAP) 16 is a state‐of‐the‐art active sampling algorithm based on information gain, that finds the best pairs to compare in ranking experiments. The use of ASAP in this paper supports the annotators' work since this algorithm minimises the number of comparisons needed to obtain a complete ranking.…”
Section: Motivation and Backgroundmentioning
confidence: 99%
“…Past active sampling solutions reduced the computational complexity with a sub‐optimal approach, only updating the probabilities of the pairs selected for the subsequent comparison, which might not converge to the best optimum. Instead, the ASAP algorithm reduces the overhead by using approximate message passing , and it only computes the information gain of the most informative pairs updating the probabilities of all the pairs, thus making it efficient and correct 16 …”
Section: Motivation and Backgroundmentioning
confidence: 99%