On the power of random information
classification
🧮 math.NA
math.PR
keywords
informationrandomoptimalproblemsqualityresultssomealmost
read the original abstract
We study approximation and integration problems and compare the quality of optimal information with the quality of random information. For some problems random information is almost optimal and for some other problems random information is much worse than optimal information. We prove new results and give a short survey of known results.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.