A note on varying cardinality in the average case setting
The author studies how much information with varying cardinality can be better than information with fixed cardinality for approximating linear operators in the average case setting with Gaussian measure. It is proved that the lower bounds from \textit{J. F. Traub}, \textit{G. W. Wasilkowski} and \textit{H. Woźniakowski}, Information-based complexity (1988; Zbl 0654.94004)] et al. on the efficiency of varying cardinality are sharp.
scientific article; zbMATH DE number 614376