Theories

Two adaptive item-selection architectures: sequential maximum-information selection (COLO) versus whole-test shadow-test assembly (CBE)

Theory · All theories
Evidence · 8 claims (7 for, 1 mixed) · 2 studies (1 causal, 1 design), q2 · 0 of 2 report an effect size · 8 claims rest on one study

Description

The report contrasts two fundamentally different adaptive testing architectures operating under the Rasch model. COLO employs the Kingsbury and Zara algorithm, selecting one item at a time based on maximum Fisher information with content balancing by item count and SEM; "COLO selects one item at a time quickly but does not look ahead at the remaining assessment, which can lead to constraint conflicts." The CBE instead leverages "a modified shadow test approach (van der Linden & Reese, 1998) and weighted penalty model (Segall & Davey, 1995)", constructing a student-specific plan (SSP) that guarantees content and other constraints are fulfilled before items are ordered. Constraints are must-haves; guidelines are nice-to-haves the engine may violate to meet more important rules.

Design Implications

Context

Requirements

Constraints

Target Learners

Target Learning Objectives

Claims

Examples

Key Sources

Page metadata
Field Value
type theory
title Two adaptive item-selection architectures: sequential maximum-information selection (COLO) versus whole-test shadow-test assembly (CBE)
description The report contrasts two fundamentally different adaptive testing architectures operating under the Rasch model.
status review
generated by process:wiki-ingest on 2026-10-08
trust unverified — no one has confirmed this page's content
sources 1 — hu-2021

Frontmatter is the page's machine-readable record — see the Schema & Guide.