Abstract
We study 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 has been known that adaptive choice of functionals forming information is not better than nonadaptive, and that the only gain may be obtained by using varying cardinality. We prove that the lower bounds from Traub (J. F. Traub, G. W. Wasilkowski, and H. Woźniakowski, "Information-Based Complexity," Academic Press, San Diego, 1988) et al. on the efficiency of varying cardinality are sharp. In particular, we show that information whose cardinality assumes at most two different values can significantly help in approximating any linear operator with infinite dimensional domain space.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
