Randomized complexity of mean computation and the adaption problem

Abstract

Recently the adaption problem of Information-Based Complexity (IBC) for linear problems in the randomized setting was solved in Heinrich (2024) [8]. Several papers treating further aspects of this problem followed. However, all examples obtained so far were vector-valued. In this paper we settle the scalar-valued case. We study the complexity of mean computation in finite dimensional sequence spaces with mixed LpN norms. We determine the n-th minimal errors in the randomized adaptive and non-adaptive settings. It turns out that among the problems considered there are examples where adaptive and non-adaptive n-th minimal errors deviate by a power of n. The gap can be (up to log factors) of the order n1/4. We also show how to turn such results into infinite dimensional examples with suitable deviation for all n simultaneously.