A topic in the Open Knowledge Graph — a free, open map of 15,290 topics and the order to learn them in.

Computerized Adaptive Testing and Dynamic Assessment

Research Depth 111 in the knowledge graph ☐ I know this ☆ Set as goal
1topic build on this
739prerequisites beneath it
See this on the map →
Item Response Functions and Item Characteristic CurvesTwo-Parameter Logistic IRT Model (2PL)→→Algorithms for Computerized Adaptive Testing
cat adaptive-testing item-bank efficiency

Core Idea

Computerized adaptive testing selects items based on continuously updated ability estimates, presenting harder items after correct responses and easier items after incorrect responses. This substantially reduces test length while maintaining measurement precision. CAT requires large calibrated item banks, sophisticated selection algorithms, and IRT parameter estimates.

How It's Best Learned

Simulate CAT selection algorithms or participate in actual CAT assessments. Understand item exposure control and stopping rule design.

Common Misconceptions

CAT always reduces testing time. Poor stopping rules can result in lengthy tests. CAT requires perfect item bank calibration; biased or poorly calibrated items propagate through the adaptive algorithm.

Explainer

Your prerequisites on item response functions and the two-parameter logistic model established that each test item has a characteristic curve — a function that maps a person's latent ability (θ) to the probability of a correct response, shaped by the item's difficulty (b) and discrimination (a). The key insight now is that this model makes items *individually informative at particular ability levels*: a very hard item tells you almost nothing about a low-ability examinee (they'll get it wrong regardless), and an easy item tells you almost nothing about a high-ability examinee (they'll get it right regardless). Computerized adaptive testing (CAT) exploits this property: instead of giving everyone the same fixed set of items, it continuously selects items that are maximally informative for each individual's *current* ability estimate.

The algorithm works as a feedback loop. The test begins with an item of moderate difficulty (or a routing item to establish a rough starting estimate). After the examinee responds, the system updates its estimate of θ using maximum likelihood estimation or Bayesian methods applied to the IRT model. It then selects the next item from a calibrated item bank — a large pool of items with known IRT parameters — choosing the item that provides the most Fisher information at the current θ estimate. Correct response → estimate moves up → next item is harder. Incorrect response → estimate moves down → next item is easier. This process converges on an accurate estimate far faster than a fixed-length test because every item is optimally targeted.

The efficiency gains are substantial but conditional. CAT typically achieves the same measurement precision as a fixed-length test using roughly 50–60% as many items — a major advantage in high-stakes testing (fewer fatigue effects) and screening contexts (shorter administration time). However, this efficiency depends entirely on the quality of the item bank. Item bank calibration — the process of estimating IRT parameters for each item in the pool — requires large samples (often 300–1,000 responses per item) and must be periodically refreshed. Biased or poorly calibrated items cause the algorithm to misestimate θ from the first error, and subsequent selections compound the problem rather than correcting it.

Two additional design problems define CAT in practice. Stopping rules determine when the test ends: you can stop after a fixed number of items, when the standard error of the θ estimate drops below a threshold, or when a classification decision (pass/fail) reaches sufficient certainty. Weak stopping rules can produce unnecessarily long tests or premature termination with low precision. Item exposure control is a security concern: without constraints, the algorithm selects the most discriminating items for nearly every examinee, causing a small subset of items to be overexposed — memorized and shared — while most of the item bank sits unused. Modern CAT systems use exposure control algorithms (like the Sympson-Hetter method) that probabilistically cap item selection rates, trading a small amount of efficiency for test security.

Practice Questions 5 questions

Prerequisite Chain

Understanding Zero → The Number Zero → Counting to Five → Counting to 10 → Counting to 20 → Counting a Set of Objects Up to 20 → Cardinality: The Last Number Counted → Matching Numerals to Quantities → Subitizing Small Quantities → Addition Within 10 → Number Bonds to 10 → Addition Within 20 → Doubles and Near Doubles → Doubles Facts Within 10 → Near Doubles Facts Within 20 → Mental Math Strategies for Addition → Mental Math: Adding and Subtracting Tens → Addition Within 100 → Repeated Addition as Multiplication → Multiplication as Equal Groups → Multiplication: Arrays → Basic Multiplication Facts (0s, 1s, 2s, 5s, 10s) → Multiplication Facts Within 100 → Division as Equal Sharing → Division as Grouping (Measurement Division) → Division: Grouping (Repeated Subtraction) Model → Division: Fair Sharing Model → Division as Equal Sharing → Division as Grouping → Basic Division Facts → Division Facts Within 100 → Multiplication and Division Fact Families → Relationship Between Multiplication and Division → Division Facts as Inverse of Multiplication → Remainders and Quotients in Division → Division Word Problems → Multi-Step Word Problems → Solving Multi-Step Word Problems → Multiplication Word Problems → Division Word Problems → Introduction to Long Division → Factors and Multiples → Prime and Composite Numbers → Equivalent Fractions → Relating Fractions and Decimals → Decimal Place Value → Integers and the Number Line → Comparing and Ordering Integers → Absolute Value → Adding Integers → Subtracting Integers → Multiplying Integers → Dividing Integers → Unit Rates → Proportions → Percent Concept → Converting Between Fractions, Decimals, and Percents → Operations with Rational Numbers → Two-Step Equations → Solving Multi-Step Equations → Equations with Variables on Both Sides → Angle Pairs: Complementary, Supplementary, and Vertical → Parallel Lines and Transversals → Corresponding Angles → Alternate Interior Angles → Triangle Angle Sum Theorem → Exterior Angle Theorem → Triangle Inequality Theorem → Similar Triangles: AA Similarity → Similar Triangles: SSS and SAS Similarity → Proportions in Similar Triangles → Right Triangle Trigonometry Introduction → Sine, Cosine, and Tangent Ratios → Trigonometric Ratios Review → Radian Measure → Converting Between Degrees and Radians → The Unit Circle → Graphing Sine and Cosine → Graphing Tangent and Reciprocal Trigonometric Functions → Derivatives of Trigonometric Functions → Antiderivatives → Indefinite Integrals → Basic Integration Rules → Riemann Sums → Definite Integral Definition → Fundamental Theorem of Calculus Part 1 → Fundamental Theorem of Calculus Part 2 → U-Substitution → Partial Fraction Decomposition for Integration → Improper Integrals - Convergence → Integral Test → P-Series → Comparison Test → Limit Comparison Test → Series Convergence Test Strategy → Power Series → Radius and Interval of Convergence → Taylor Series → Moment Generating Functions → Characteristic Functions → Convergence in Distribution → Stationary Distributions → Convergence of Markov Chains → Convergence in Probability → Almost Sure Convergence → Relationships Between Modes of Convergence → Weak Law of Large Numbers → Strong Law of Large Numbers → Central Limit Theorem (Rigorous via Characteristic Functions) → Maximum Likelihood Estimation (Theory) → Two-Parameter Logistic IRT Model (2PL) → Computerized Adaptive Testing and Dynamic Assessment

Longest path: 112 steps · 739 total prerequisite topics

Prerequisites (2)

Leads To (1)