paper-with-me

Papers

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

2020-04-12 · Aliaksei Mikhailiuk, Clifford Wilmot, Maria Perez-Ortiz, Dingcheng Yue, Rafal Mantiuk

Pairwise comparison data arise in many domains with subjective assessment experiments, for example in image and video quality assessment. In these experiments observers are asked to express a preference between two conditions. However, many pairwise comparison protocols require a large number of comparisons to infer accurate scores, which may be unfeasible when each comparison is time-consuming (e.g. videos) or expensive (e.g. medical imaging). This motivates the use of an active sampling algorithm that chooses only the most informative pairs for comparison. In this paper we propose ASAP, an active sampling algorithm based on approximate message passing and expected information gain maximization. Unlike most existing methods, which rely on partial updates of the posterior distribution, we are able to perform full updates and therefore much improve the accuracy of the inferred scores. The algorithm relies on three techniques for reducing computational cost: inference based on approximate message passing, selective evaluations of the information gain, and selecting pairs in a batch that forms a minimum spanning tree of the inverse of information gain. We demonstrate, with real and synthetic data, that ASAP offers the highest accuracy of inferred scores compared to the existing methods. We also provide an open-source GPU implementation of ASAP for large-scale experiments.

📄 PDF Abstract BibTeX arXiv:2004.05691

Code (1)

gfxdisp/asap 공식 구현 pytorch

Tasks

GPUVideo Quality Assessment

Similar Papers 제목 키워드 기반

Approximate Ranking from Pairwise Comparisons

2018-01-04 · Reinhard Heckel, Max Simchowitz, Kannan Ramchandran, Martin J. Wainwright

A common problem in machine learning is to rank a set of n items based on pairwise comparisons. Here ranking refers to partitioning the items into sets of pre-specified sizes according to their scores, which includes ide…

Adaptive Sampling for Heterogeneous Rank Aggregation from Noisy Pairwise Comparisons

2021-10-08 · Yue Wu, Tao Jin, Hao Lou, Pan Xu 외

In heterogeneous rank aggregation problems, users often exhibit various accuracy levels when comparing pairs of items. Thus a uniform querying strategy over users may not be optimal. To address this issue, we propose an …

The Sample Complexity of Best-$k$ Items Selection from Pairwise Comparisons

2020-07-06 · ICML 2020 1 · Wenbo Ren, Jia Liu, Ness B. Shroff

This paper studies the sample complexity (aka number of comparisons) bounds for the active best-$k$ items selection from pairwise comparisons. From a given set of items, the learner can make pairwise comparisons on every…

Active Learning

ALBU: An approximate Loopy Belief message passing algorithm for LDA to improve performance on small data sets

2021-10-01 · Rebecca M. C. Taylor, Johan A. du Preez

Variational Bayes (VB) applied to latent Dirichlet allocation (LDA) has become the most popular algorithm for aspect modeling. While sufficiently successful in text topic extraction from large corpora, VB is less success…

EZ-Sort: Efficient Pairwise Comparison via Zero-Shot CLIP-Based Pre-Ordering and Human-in-the-Loop Sorting

2025-08-29 · Yujin Park, Haejun Chung, Ikbeom Jang arxiv

Pairwise comparison is often favored over absolute rating or ordinal classification in subjective or difficult annotation tasks due to its improved reliability. However, exhaustive comparisons require a massive number of…

Image Quality AssessmentOrdinal ClassificationAge Estimation