Abstract
We consider the problem of approximately integrating a Lipschitz function f (with a known Lipschitz constant) over an interval. The goal is to achieve an error of at most ε using as few samples of f as possible. We use the adaptive framework: on all problem instances an adaptive algorithm should perform almost as well as the best possible algorithm tuned for the particular problem instance. We distinguish between DOPT and ROPT, the performances of the best possible deterministic and randomized algorithms, respectively. We give a deterministic algorithm that uses O(DOPT(f,ε) · log(ε − 1/DOPT(f,ε))) samples and show that an asymptotically better algorithm is impossible. However, any deterministic algorithm requires Ω(ROPT(f,ε)2) samples on some problem instance. By combining a deterministic adaptive algorithm and Monte Carlo sampling with variance reduction, we give an algorithm that uses at most O(ROPT(f,ε)4/3 + ROPT(f,ε) ·log(1/ε)) samples. We also show that any algorithm requires Ω(ROPT(f,ε)4/3 + ROPT(f,ε) ·log(1/ε)) samples in expectation on some problem instance (f,ε), which proves that our algorithm is optimal.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Werschulz, A.G.: An overview of information-based complexity. Technical Report CUCS- 022-02, Computer Science Department, Columbia University (2002)
Barabesi, L., Marcheselli, M.: A modified monte carlo integration. International Mathematical Journal 3(5), 555–565 (2003)
Davis, P.J., Rabinowitz, P.: Methods of Numerical Integration, 2nd edn. Academic Press, San Diego (1984)
Traub, J., Wasilkowski, G., Woźniakowski, H.: Information-Based Complexity. Academic Press, New York (1988)
Demaine, E.D., López-Ortiz, A., Munro, J.I.: Adaptive set intersections, unions, and differences. In: Proceedings of the 11th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, California, pp. 743–752 (2000)
Fagin, R., Lotem, A., Naor, M.: Optimal aggregation algorithms for middleware. Journal of Computer and System Sciences 66(4), 614–656 (2003)
Biedl, T., Brejova, B., Demaine, E.D., Hamel, A.M., López-Ortiz, A., Vinař, T.: Finding hidden independent sets in interval graphs. Theoretical Computer Science 310(1–3), 287–307 (2004)
Hansen, P., Jaumard, B., Lu, S.H.: On the number of iterations of piyavskii’s global optimization algorithm. Mathematics of Operations Research 16(2), 334–350 (1991)
Piyavskii, S.: An algorithm for finding the absolute extremum of a function. USSR Computational Mathematics and Mathematical Physics 12, 57–67 (1972)
Baran, I., Demaine, E.D.: Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve. In: Proceedings of the 20th Annual ACMSymposium on Computational Geometry, Brooklyn, NY (2004) (to appear)
Baran, I.: Adaptive algorithms for problems involving black-box lipschitz functions. Master’s thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts (2004), http://www.mit.edu/~ibaran/papers/mthesis.pdf,ps
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Baran, I., Demaine, E.D., Katz, D.A. (2006). Optimally Adaptive Integration of Univariate Lipschitz Functions. In: Correa, J.R., Hevia, A., Kiwi, M. (eds) LATIN 2006: Theoretical Informatics. LATIN 2006. Lecture Notes in Computer Science, vol 3887. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11682462_17
Download citation
DOI: https://doi.org/10.1007/11682462_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-32755-4
Online ISBN: 978-3-540-32756-1
eBook Packages: Computer ScienceComputer Science (R0)