In game-theoretic statistics we often have an e-process that we’re using to collect evidence against the null. We might want to ensure that this process never decreases. But most e-processes are not nondecreasing. And while it’s tempting to just consider the running maximum of an e-process, the result is not an e-process. In fact, the running maximum can have expectation tending to infinity under the null; see Appendix D in this paper for an example.

Adjusters solve this problem. They take the running maximum and shift it so that the result is an e-process. Formally, an adjuster is a function such that

They relate to e-processes as follows: For any test supermartingale (meaning a supermartingale with initial value 1) there exists a test supermartingale such that almost surely, where . This together with the optional stopping theorem imply that is an e-process. Using results which upper bound e-processes in terms of supermartingales, the same conclusion holds if take to be an e-process.

Adjusters originated here, here, and here. Examples are for any , ,

with , or

See here for credit for all of these, and an overview.

One way to think about the definition of an adjuster is as follows. Suppose we define the function . By a change of variables, write

Now, , so the adjuster can be seen as adjusting downwards by a multiplicative factor of . And this function must act like a density on the log scale of . Different adjusters will spread out this mass differently. Moreover, admissible adjusters are precisely those such that , implying that . So as long as the adjuster spreads all its mass out, it is admissible.

Reading