Tutorials › Response-Adaptive Randomization › Building an Estimator-Driven Allocation Target

Doubly Adaptive Biased Coin Designs · Tutorial 142 of 501

Building an Estimator-Driven Allocation Target

Learn to specify a target map’s inputs, output, and assumptions, then calculate plug-in allocation shares and diagnose when those shares may be unreliable.

Advanced 9 min read

What You'll Learn

  • Distinguish estimated response parameters, design constants, and target allocation shares.
  • Specify a target map whose outputs are nonnegative shares summing to one.
  • Calculate two-arm and multi-arm plug-in targets from hypothetical estimates.
  • Explain when a plug-in target converges to its population-parameter target.
  • Identify domain, estimation, and numerical problems that can make a target misleading.
  • Distinguish a desired allocation share from the probability assigned to the next patient.

From Response Estimates to Desired Shares

An estimator-driven allocation target is a rule for translating current estimates of treatment response into desired proportions of the trial assigned to each arm. This translation is a distinct design choice: estimated responses do not, by themselves, determine allocation shares. A target map must specify how the estimates are to be used, along with any fixed design inputs such as weights or tuning constants.

The map’s output describes a target composition, not necessarily the assignment probability for the next patient. In an adaptive design, a separate allocation rule may use the current arm counts and that target to determine the next assignment probability. Here the focus is the target map: its inputs, output, and interpretation, without prescribing that separate rule or choosing a particular optimality criterion.

Definition: Let \(\theta\) denote the vector of treatment-response parameters relevant to a prespecified design, and let \(\hat{\theta}_n\) be their estimates using information available after \(n\) patients. Let \(d\) denote fixed design inputs. An estimator-driven target map is a specified function \(T\) that returns desired allocation shares: $$ \hat{\boldsymbol{\rho}}_n=T(\hat{\theta}_n;d) =(\hat{\rho}_{n,1},\ldots,\hat{\rho}_{n,K}). $$ For \(K\) treatment arms, valid shares satisfy \(\hat{\rho}_{n,i}\geq 0\) for every arm and \(\sum_{i=1}^{K}\hat{\rho}_{n,i}=1\).

The response parameters might be success probabilities, mean outcomes, or parameters from a prespecified response model. The map’s fixed inputs might include exponents, arm-specific constants, or other quantities chosen as part of the design. The map must say exactly which estimates and constants it uses and how they produce shares. Calling a target “response-adaptive” without specifying that translation leaves the allocation objective operationally incomplete.

Inputs, Output, and Assumptions

A clear specification begins with the estimand. State what each component of \(\theta\) means, including the outcome definition, measurement scale, and population or patient group to which it refers. Then state how \(\hat{\theta}_n\) is obtained and which observations it uses. If, for example, a component is a binary-response probability, specify which outcome counts as a success. Otherwise, even a correctly calculated estimate may not correspond to the response quantity intended by the design.

Next specify the map itself, including all fixed constants and its domain. The map must be defined for the estimates it could receive during the design, not merely for a preferred final estimate. Its output must be a valid vector of shares. If the formula uses nonnegative weights, the normalization must have a positive denominator; if it uses a transformation such as a logarithm, its inputs must lie in that transformation’s domain. Any exceptional cases need an explicit handling rule.

The map is a design specification, not a model for estimating responses. Its use therefore relies on the response estimates having a defensible interpretation under the chosen study design and response model. In particular, the outcome must be recorded as specified, the estimator must match the parameter being targeted, and relevant modeling assumptions must be checked for that estimator. A map cannot repair biased, unstable, or poorly defined input estimates.

The particular optimality criterion, if any, is a separate design decision. Earlier material on optimal allocation targets shows that different goals can lead to different targets. Once a target has been chosen, the map expresses how estimates feed into it; the mere use of estimated responses does not establish that the resulting shares are ethically preferable, more precise, or optimal.

Plug-In Targets and a Basic Justification

The plug-in construction evaluates a prespecified target function at the estimated rather than unknown response parameters. If \(T(\theta;d)\) is the target that would be calculated from the true parameter vector, the current estimated target is \(T(\hat{\theta}_n;d)\). This is a definition of the estimator-driven target; it is not a guarantee that the estimates, or the target, are already accurate.

A simple normalization explains how many maps produce valid shares. Suppose the map first assigns each arm a nonnegative weight \(w_i(\hat{\theta}_n;d)\), with at least one weight positive, and then divides each weight by the total. The resulting shares are nonnegative, and their sum is one:

$$ \hat{\rho}_{n,i} =\frac{w_i(\hat{\theta}_n;d)} {\sum_{j=1}^{K}w_j(\hat{\theta}_n;d)}, \qquad \sum_{i=1}^{K}\hat{\rho}_{n,i} =\frac{\sum_{i=1}^{K}w_i(\hat{\theta}_n;d)} {\sum_{j=1}^{K}w_j(\hat{\theta}_n;d)} =1. $$

This algebra verifies the share constraint when its stated conditions hold; it does not justify the choice of weights. For example, a designer could choose weights to express a previously selected allocation goal, but the normalization alone supplies no ethical or statistical rationale for those weights.

There is also a useful large-sample justification for plug-in evaluation. Suppose the estimator is consistent, so \(\hat{\theta}_n\) converges in probability to \(\theta\), and suppose \(T(\cdot;d)\) is continuous at \(\theta\) for the fixed design input \(d\). Then the continuous mapping theorem gives:

$$ \hat{\theta}_n \xrightarrow{P} \theta \quad\text{and continuity of }T\text{ at }\theta \quad\Longrightarrow\quad T(\hat{\theta}_n;d)\xrightarrow{P}T(\theta;d). $$

Thus, under these assumptions, the estimated target approaches the target evaluated at the true response parameters. This conclusion is conditional on consistency and continuity; it does not say that early targets are stable, that the estimator is unbiased at every sample size, or that the chosen map is desirable. Nor does convergence of the target alone establish properties of a separate sequential assignment rule.

Worked Example: A Two-Arm Exponential Map

Suppose a hypothetical trial estimates binary-response probabilities as \(\hat{p}_1=0.62\) and \(\hat{p}_2=0.42\). For illustration, the prespecified map assigns shares proportional to \(\exp(\kappa\hat{p}_i)\), with fixed \(\kappa=2\). Assume both estimates are computed for the same defined response outcome and lie in the probability range from zero to one. The map is defined for these inputs, and its exponential weights are positive.

The target shares are:

$$ \hat{\rho}_1 =\frac{\exp(2(0.62))} {\exp(2(0.62))+\exp(2(0.42))} =\frac{1}{1+\exp(-0.40)} \approx 0.5987, \qquad \hat{\rho}_2=1-\hat{\rho}_1\approx 0.4013. $$

The simplification divides the numerator and denominator by \(\exp(0.84)\); the final values use the unrounded exponential evaluation. The map therefore sets a desired share of approximately 59.87% for arm 1 and 40.13% for arm 2. These are target shares, not a claim that the next patient must have those assignment probabilities. The example illustrates a specified transformation, not a general optimality result.

Worked Example: Normalizing Three Estimated-Response Weights

Consider a hypothetical three-arm design whose prespecified map uses estimated response scores \(\hat{\theta}=(1.00,1.30,1.10)\), fixed arm constants \(a=(1.00,1.20,0.80)\), and the weights \(w_i=a_i\exp(\hat{\theta}_i)\). Assume the scores are defined on the scale required by this illustrative map and the constants are fixed in advance. Each weight is positive, so their sum is a valid normalizing denominator.

The unnormalized weights, calculated from the stated inputs, are:

$$ w_1=1.00\exp(1.00)\approx2.718282,\qquad w_2=1.20\exp(1.30)\approx4.403156,\qquad w_3=0.80\exp(1.10)\approx2.403333. $$

Their unrounded total is approximately \(9.524771\). Dividing each unrounded weight by that total gives:

$$ \hat{\rho}_1\approx0.2854,\qquad \hat{\rho}_2\approx0.4623,\qquad \hat{\rho}_3\approx0.2523, \qquad \sum_{i=1}^{3}\hat{\rho}_i=1. $$

The displayed four-decimal shares sum to 1.0000. As usual, the reported shares are rounded; the normalization and calculations use the unrounded weights. The constants and exponential transformation define this hypothetical target map. They are not inferred from the estimates, and their use does not by itself establish a scientific justification for this particular target.

Worked Example: A Power Map for Two Estimated Probabilities

Suppose a second hypothetical design estimates response probabilities \(\hat{p}_1=0.64\) and \(\hat{p}_2=0.36\). Its prespecified illustrative map uses square-root weights, \(w_i=\hat{p}_i^{1/2}\). The inputs are valid probabilities, and both are positive, so the square roots and normalization are defined.

The weights are \(\sqrt{0.64}=0.80\) and \(\sqrt{0.36}=0.60\). Their total is \(0.80+0.60=1.40\), so:

$$ \hat{\rho}_1=\frac{0.80}{1.40}\approx0.5714, \qquad \hat{\rho}_2=\frac{0.60}{1.40}\approx0.4286. $$

The map’s output is therefore approximately 57.14% for arm 1 and 42.86% for arm 2. This differs from simply assigning shares equal to the estimated probabilities, which would give 64% and 36%. The square-root transformation is a design choice; these calculations alone do not show that either set of shares is optimal.

Diagnostics, Alternatives, and Limitations

A target map should be checked both as a mathematical function and as part of a statistical design. Useful checks include:

  • Input definition: Confirm that each estimated parameter has an unambiguous outcome, scale, and arm interpretation, and that the estimator matches that definition.
  • Domain: Verify that every possible input used by the map is allowed by its formula. A map involving a logarithm or square root, for example, may fail at some boundary values.
  • Output: Check that shares are nonnegative and sum to one, and that normalization denominators cannot be zero for inputs the design permits.
  • Numerics: Evaluate using adequate numerical precision, then round only for reporting. Rounding intermediate weights can change displayed shares, as can happen when arms have similar weights.
  • Estimation behavior: Inspect whether response estimates are based on enough information to be meaningful and whether the specified response model is plausible. A formally valid map can still yield unstable targets from unstable estimates.

One practical diagnostic is to evaluate the map at a range of plausible response estimates, not only at a single preferred estimate. This can reveal whether small estimate changes produce target changes that are important for the design. It does not require choosing a different map, but it makes the consequences of the chosen transformation visible. If a map is undefined for plausible inputs, the design needs an explicit remedy rather than an implicit assumption that the problematic inputs will never occur.

The main alternative at the target level is to specify fixed shares that do not depend on estimated responses. A fixed target avoids variation in the target caused by changing estimates, but it does not respond to estimated response differences. An estimator-driven target makes that dependence explicit, while inheriting uncertainty and possible model error from its inputs. A further design choice is whether to use a direct transformation of estimates, such as a power or exponential map, or to encode estimates and constants in weights before normalization. Either approach must be stated fully; neither is automatically superior.

A common mistake is to treat a target map as if it were itself a complete randomization procedure. For example, seeing \(\hat{\rho}_1=0.60\) and concluding that the next patient must have assignment probability 0.60 for arm 1 confuses the target composition with the next-patient allocation probability. The correction is to report what the map actually returns—a desired share—and specify separately how the design uses that share to make assignments. Another mistake is to assume that a map becomes optimal merely because it uses current response estimates. Optimality requires a stated criterion and a justification under that criterion.

Key takeaway: Specify an estimator-driven target by naming its response parameters, estimators, fixed design inputs, formula, domain, and valid-share output. The map translates estimates into desired allocation proportions; it neither guarantees good estimates nor determines, by itself, the next patient’s assignment probability.

Check Your Understanding

Answer each question, then compare your reasoning with the solutions.

  1. A map returns three nonnegative weights \(2\), \(3\), and \(5\), then normalizes them. What are the target shares?
  2. Why does an estimator-driven target require a stated response estimand and estimator, rather than only a formula for the shares?
  3. For two arms, a map uses weights \(\hat{p}_1^2\) and \(\hat{p}_2^2\). If the estimates are \(0.5\) and \(0.5\), calculate the target shares.
  4. State the conditions under which consistency of \(\hat{\theta}_n\) implies convergence of \(T(\hat{\theta}_n;d)\) to \(T(\theta;d)\).
  5. A student says, “The target share for arm 1 is 70%, so the next patient has a 70% probability of assignment to arm 1.” What is the error?

Solutions. (1) The total weight is \(2+3+5=10\); the shares are \(2/10=0.20\), \(3/10=0.30\), and \(5/10=0.50\). They are nonnegative and sum to one. (2) The estimand identifies what response quantity the map is meant to use, and the estimator states how that quantity is calculated from data. Without these, the map’s inputs may be ambiguous or may not estimate the intended parameters. (3) Both weights equal \(0.5^2=0.25\); their total is \(0.50\), so each share is \(0.25/0.50=0.50\). (4) The estimator must converge in probability to \(\theta\), and the fixed-input map \(T(\cdot;d)\) must be continuous at \(\theta\); then the continuous mapping theorem gives convergence of the plug-in target. (5) The student has confused a desired target share with a next-patient assignment probability. A separate allocation rule determines how the target is used for the next assignment.

Clinical Biostats