Abstract:
We consider the limiting description of control in a Gaussian one-armed bandit problem, which is a mathematical model for optimizing batch processing of big data in the presence of two alternative methods with known efficiency of the first method. We establish that this description is given by a second-order partial differential equation in which the variance of one-step income is known. This means that in the case of big data, the variance can be arbitrarily accurate estimated at a short initial stage of processing, and then the obtained estimate is used by the control strategy.
Keywords:one-armed bandit, Bayesian and minimax approaches, invariant description, batch processing.