This survey is concerned with the power of random information for approximation in the (deterministic) worst-case setting, with special emphasis on information that is obtained independently and identically distributed (iid) from a given distribution on a class of admissible information. We present a general result based on a weighted least squares method and derive consequences for special cases. Improvements are available if the information is "Gaussian" or if we consider iid function values for Sobolev spaces. We include open questions to guide future research on the power of random information in the context of information-based complexity.Comment: 61 page
AbstractWe study approximation of linear functionals on separable Banach spaces equipped with a Gaus...
AbstractWe shall study maximal errors of approximating linear problems. As possible classes of infor...
Computational complexity has two goals: finding the inherent cost of some problem, and finding optim...
AbstractWe study the worst case complexity of solving problems for which information is partial and ...
Abstract. We study approximating multivariate functions from a reproducing ker-nel Hilbert space wit...
AbstractBasic questions of information-based complexity are strongly related to n-widths and s-numbe...
AbstractWe study multivariate approximation with the error measured in L∞ and weighted L2 norms. We ...
AbstractWe study algorithms for the approximation of functions, the error is measured in an L2 norm....
Abstract In this paper, we present selected old and new results on the optimal solution of linear pr...
This electronic version was submitted by the student author. The certified thesis is available in th...
AbstractA new setting for analyzing problems in information-based complexity is formulated and discu...
AbstractWe present general results on the average case complexity of approximating linear operators ...
Computational complexity has two goals: finding the inherent cost of some problem, and finding optim...
We study optimal algorithms and optimal information in an average case model for linear problems in ...
AbstractWe study the probabilistic setting of information-based complexity for bounded domains and d...
AbstractWe study approximation of linear functionals on separable Banach spaces equipped with a Gaus...
AbstractWe shall study maximal errors of approximating linear problems. As possible classes of infor...
Computational complexity has two goals: finding the inherent cost of some problem, and finding optim...
AbstractWe study the worst case complexity of solving problems for which information is partial and ...
Abstract. We study approximating multivariate functions from a reproducing ker-nel Hilbert space wit...
AbstractBasic questions of information-based complexity are strongly related to n-widths and s-numbe...
AbstractWe study multivariate approximation with the error measured in L∞ and weighted L2 norms. We ...
AbstractWe study algorithms for the approximation of functions, the error is measured in an L2 norm....
Abstract In this paper, we present selected old and new results on the optimal solution of linear pr...
This electronic version was submitted by the student author. The certified thesis is available in th...
AbstractA new setting for analyzing problems in information-based complexity is formulated and discu...
AbstractWe present general results on the average case complexity of approximating linear operators ...
Computational complexity has two goals: finding the inherent cost of some problem, and finding optim...
We study optimal algorithms and optimal information in an average case model for linear problems in ...
AbstractWe study the probabilistic setting of information-based complexity for bounded domains and d...
AbstractWe study approximation of linear functionals on separable Banach spaces equipped with a Gaus...
AbstractWe shall study maximal errors of approximating linear problems. As possible classes of infor...
Computational complexity has two goals: finding the inherent cost of some problem, and finding optim...