1983 Reports
Local Average Error
An average case setting for linear problems has been studied in a series of recent papers. Optimal algorithms and optimal information were obtained for certain probability measures. In this paper the local average error of algorithms and local average radius of information are defined. Using these concepts, optimal information and optimal algorithms can be found for nonlinear problems and arbitrary Borel measures.
Subjects
Files
-
cucs-070-83.pdf
application/pdf
1.03 MB
Download File
More About This Work
- Academic Units
- Computer Science
- Publisher
- Department of Computer Science, Columbia University
- Series
- Columbia University Computer Science Technical Reports, CUCS-070-83
- Published Here
- October 25, 2011