An algorithm, called forward improvement iteration, is presented by which an optimal stopping time can be computed. Using an iterative step, this algorithm computes a sequence B⁰ = Bⁱ = B2 =... of ...

We describe the cyclic coordinate-exchange algorithm for constructing D-optimal and linear-optimal experimental designs. The algorithm uses a variant of the Gauss-Southwell cyclic coordinate-descent ...

The algorithm's efficient polynomial complexity allows it to scale with system size, which is essential as quantum computers become more powerful.

We leverage insights from machine learning to optimize the tradeoff between bias and variance when estimating economic models using pooled datasets. Specifically, we develop a simple algorithm that ...