Academic Commons

Reports

Local Average Error

Wasilkowski, Grzegorz W.

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.

Files

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
Academic Commons provides global access to research and scholarship produced at Columbia University, Barnard College, Teachers College, Union Theological Seminary and Jewish Theological Seminary. Academic Commons is managed by the Columbia University Libraries.