Estimating the Average of a Lipschitz-Continuous Function from One Sample

We study the problem of estimating the average of a Lipschitz continuous function f defined over a metric space, by querying f at only a single point. More specifically, we explore the role of randomness in drawing this sample. Our goal is to find a distribution minimizing the expected estimation error against an adversarially chosen Lipschitz continuous function. Our work falls into the broad class of estimating aggregate statistics of a function from a small number of carefully chosen samples. The general problem has a wide range of practical applications in areas such as sensor networks, social sciences and numerical analysis. However, traditional work in numerical analysis has focused on asymptotic bounds, whereas we are interested in the best algorithm. For arbitrary discrete metric spaces of bounded doubling dimension, we obtain a PTAS for this problem. In the special case when the points lie on a line, the running time improves to an FPTAS. For Lipschitz-continuous functions over [0, 1], we calculate the precise achievable error as 1 - √3-2, which improves upon the 1/4 which is best possible for deterministic algorithms.

[1]  H. Wozniakowski.  Average case complexity of linear multivariate problems , 1993, math/9307234.

[2]  H. Wo,et al.  Average Case Complexity of Linear Multivariate Problems Part I: Theory , 1991 .

[3]  Erich Novak.  Stochastic properties of quadrature formulas , 1988 .

[4]  I. P. Mysovskih.  Approximate Calculation of Integrals , 1969 .

[5]  A. Stroud,et al.  Approximate Calculation of Integrals , 1962 .

[6]  H. Woxniakowski.  Information-Based Complexity , 1988 .

[7]  Jakub Onufry Wojtaszczyk.  Multivariate integration in Cinfinity([0, 1]d) is not strongly tractable , 2003, J. Complex..

[8]  Kamesh Munagala,et al.  Local Search Heuristics for k-Median and Facility Location Problems , 2004, SIAM J. Comput..

[9]  Martin Grötschel,et al.  The ellipsoid method and its consequences in combinatorial optimization , 1981, Comb..

[10]  Kamesh Munagala,et al.  Local search heuristic for k-median and facility location problems , 2001, STOC '01.

[11]  Peter Mathé,et al.  The Optimal Error of Monte Carlo Integration , 1995, J. Complex..

[12]  Erik D. Demaine,et al.  Optimally Adaptive Integration of Univariate Lipschitz Functions , 2006, LATIN.

[13]  Joseph F. Traub,et al.  Complexity and information , 1999, Lezioni Lincee.

[14]  Henryk Wozniakowski.  Average case complexity of linear multivariate problems II. Applications , 1992, J. Complex..

[15]  Robert Krauthgamer,et al.  Bounded geometries, fractals, and low-distortion embeddings , 2003, 44th Annual IEEE Symposium on Foundations of Computer Science, 2003. Proceedings..

[16]  Abhimanyu Das,et al.  Sensor Selection for Minimizing Worst-Case Prediction Error , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

[17]  Henryk Wozniakowski,et al.  Average case complexity of linear multivariate problems I. Theory , 1992, J. Complex..

[18]  Rajeev Motwani,et al.  Randomized Algorithms , 1995, SIGA.