AbstractWhen observations can be made without noise, it is known that adaptive information is no more powerful than nonadaptive information for approximation of linear problems with Gaussian measure. When the noise is additive, independent of the true value, and normal, once again adaption does not help (Theorem 1 in Section 4). However, when those conditions are not satisfied, Examples 1 and 2 of Section 4 show that adaptive information can be much more powerful than nonadaptive information. Finally if orthogonal observations are used with the sample size as well as the number of repetitions fixed, and only the directions of observations are chosen adaptively, then once again adaption does not help (Theorem 2 in Section 5). The issue is an...
The connections between information pooling and adaptability as well as superefficiency are consider...
The connections between information pooling and adaptability as well as superefficiency are consider...
AbstractThe connections between information pooling and adaptability as well as superefficiency are ...
We study adaptive information for approximation of linear problems in a separable Hilbert space equi...
AbstractWe study adaptive information of varying cardinality for linear problems defined on a separa...
AbstractWe study the worst case complexity of solving problems for which information is partial and ...
AbstractAdaptive information is not more powerful than nonadaptive information for solving linear pr...
Information based complexity is a unified treatment of problems where only partial or approximate in...
AbstractWe compare sequential and non-sequential designs for estimating linear functionals in the st...
We study a fundamental question concerning adversarial noise models in statistical problems where th...
AbstractWe study the worst case complexity of solving problems for which information is partial and ...
AbstractWe present general results on the average case complexity of approximating linear operators ...
The connections between information pooling and adaptability as well as superefficiency are consider...
Suppose we can sequentially acquire arbitrary linear measurements of an n-dimensional vector x resul...
AbstractThe connections between information pooling and adaptability as well as superefficiency are ...
The connections between information pooling and adaptability as well as superefficiency are consider...
The connections between information pooling and adaptability as well as superefficiency are consider...
AbstractThe connections between information pooling and adaptability as well as superefficiency are ...
We study adaptive information for approximation of linear problems in a separable Hilbert space equi...
AbstractWe study adaptive information of varying cardinality for linear problems defined on a separa...
AbstractWe study the worst case complexity of solving problems for which information is partial and ...
AbstractAdaptive information is not more powerful than nonadaptive information for solving linear pr...
Information based complexity is a unified treatment of problems where only partial or approximate in...
AbstractWe compare sequential and non-sequential designs for estimating linear functionals in the st...
We study a fundamental question concerning adversarial noise models in statistical problems where th...
AbstractWe study the worst case complexity of solving problems for which information is partial and ...
AbstractWe present general results on the average case complexity of approximating linear operators ...
The connections between information pooling and adaptability as well as superefficiency are consider...
Suppose we can sequentially acquire arbitrary linear measurements of an n-dimensional vector x resul...
AbstractThe connections between information pooling and adaptability as well as superefficiency are ...
The connections between information pooling and adaptability as well as superefficiency are consider...
The connections between information pooling and adaptability as well as superefficiency are consider...
AbstractThe connections between information pooling and adaptability as well as superefficiency are ...