# A reduced basis decomposition approach to efficient data collection in pairwise comparison studies

## TL;DR

This paper introduces a faster method for designing pairwise comparison studies, making large-scale and real-time assessments computationally feasible.

## Contribution

A scalable reduced basis decomposition method for efficient experimental design in pairwise comparison studies.

## Key findings

- The method achieves computational savings of two to three orders of magnitude.
- Speedup factors exceeding 100 were observed for studies with 64 or more objects.
- Real-time design updates for classroom peer assessment reduced computation time from 15 min to 15 s.

## Abstract

Comparative judgement studies elicit quality assessments of objects through pairwise comparisons, typically analysed using the Bradley–Terry model. A challenge in these studies is experimental design, specifically, determining the optimal pairs to compare to maximize statistical efficiency. Constructing static experimental designs for these studies requires spectral decomposition of a covariance matrix over pairs of pairs, which becomes computationally infeasible for studies with a large number of objects. We propose a scalable method based on reduced basis decomposition that bypasses explicit construction of this matrix, achieving computational savings of two to three orders of magnitude. We establish eigenvalue bounds guaranteeing approximation quality and characterise the rank structure of the design matrix. Simulations demonstrate speedup factors exceeding 100 for studies with 64 or more objects, with negligible approximation error. We apply the method to construct designs for a 452-region spatial study in under 7 min, which was not previously possible, and enable real-time design updates for classroom peer assessment, reducing computation time from 15 min to 15 s.