Worst case complexity of problems with random information noise

Journal of Complexity

Volumn 12, Issue 4, 1996, Pages 416-439

  Plaskota, Leszek ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0030497285     PISSN: 0885064X     EISSN: None     Source Type: Journal    
DOI: 10.1006/jcom.1996.0026     Document Type: Article

References (20)

1. BLUM, L., SHUB, M., AND SMALE, S. (1989), On a theory of computation and complexity over the real numbers. NP-completeness, recursive functions, and universal machines, Bull. Amer. Math. Soc. (N.S.) 21, 1-46.
2. DONOHO, D. L. (1994a), Statistical estimation and optimal recovery, Ann. Statist. 22, 238-270.
3. DONOHO, D. L. (1994b), Asymptotic minimax risk for sup-norm loss: Solution via optimal recovery, Probab. Theory Related Fields 99, 145-170.
4. DONOHO, D. L., JOHNSTONE, I. M., KERKYACHARIAN, G., AND PICARD, D. (1995), Wavelet shrinkage: Asymptopia? J. Roy. Statist. Soc. Ser. B 57, 301-369.
5. GOLUBEV, G. K., AND NUSSBAUM, M. (1990), A risk bound in Sobolev class regression, Ann. Statist. 18, 758-778.
6. HEINRICH, S. (1993), Random approximation in numerical analysis, in "Proc. of the Functional Analysis Conf., Essen, 1991" (Bierstedt et al., Eds.), pp. 123-171, Dekker, New York.
7. IBRAGIMOV, I. A., AND HASMINSKI, R. Z. (1984), On the nonparametric estimation of the value of a linear functional in Gaussian white noise, Theory Probab. Appl. 29, 19-32 [In Russian]
8. KOROSTELEV, A. P. (1993), An asymptotically minimax regression estimator in the uniform norm up to a constant, Theory Probab. Appl. 38, 875-882. [In Russian]
9. NEMIROVSKI, A. S., AND YUDIN, D. B. (1983), "Problem Complexity and Method Efficiency in Optimization," Wiley, New York.
10. NOVAK, E. (1988), "Deterministic and Stochastic Error Bounds in Numerical Analysis," Lecture Notes in Math., Vol. 1349, Springer, Berlin.
11. NOVAK, E. (1995), The real number model in numerical analysis, J. Complexity 11, 57-73.
12. 2, Ann. Statist. 13, 984-997.
13. PLASKOTA, L. (1996a), "Noisy Information and Computational Complexity," Cambridge Univ. Press, Cambridge.
14. PLASKOTA, L. (1996b), How to benefit from noise, J. Complexity 12, 175-184.
15. SPECKMAN, P. (1985), Spline smoothing and optimal reates of convergence in nonparametric regression models, Ann. Statist. 13, 970-983.
16. TRAUB, J. F., AND WOŹNIAKOWSKI, H. (1980), "A General Theory of Optimal Algorithms," Academic Press, New York.
17. TRAUB, J. F., WASILKOWSKI, G. W., AND WOŹNIAKOWSKI, H. (1988), "Information-Based Complexity," Academic Press, New York.
18. TRIEBEL, H. (1992), "Theory of Function Spaces II," Birkhäser-Verlag, Basel.
19. WASILKOWSKI, G. W. (1986), Information of varying cardinality, J. Complexity 2, 204-228.
20. WERSCHULZ, A. (1991), "The Computational Complexity of Differential and Integral Equations," Oxford Univ. Press, Oxford.