Abstract
In standard property testing, the task is to distinguish between objects that have a property \(\mathcal{P}\) and those that are ε-far from \(\mathcal{P}\), for some ε > 0. In this setting, it is perfectly acceptable for the tester to provide a negative answer for every input object that does not satisfy \(\mathcal{P}\). This implies that property testing in and of itself cannot be expected to yield any information whatsoever about the distance from the object to the property. We address this problem in this paper, restricting our attention to monotonicity testing. A function f:{1,..., n} ↦R is at distance ε f from being monotone if it can (and must) be modified at ε f n places to become monotone. For any fixed δ> 0, we compute, with probability at least 2/3, an interval [(1/2 − δ)ε, ε] that encloses ε f . The running time of our algorithm is O( ε f − − 1loglog ε f − − 1 log n ), which is optimal within a factor of loglog ε f − − 1 and represents a substantial improvement over previous work. We give a second algorithm with an expected running time of O( ε f − − 1log n logloglog n).
This work was supported in part by NSF grants CCR-998817, CCR-0306283, ARO Grant DAAH04-96-1-0181.
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
Batu, T., Rubinfeld, R., White, P.: Fast approximate PCPs for multidimensional bin-packing problems. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 245–256. Springer, Heidelberg (1999)
Dodis, Y., Goldreich, O., Lehman, E., Raskhodnikova, S., Ron, D., Samorodnitsky, A.: Improved testing algorithms for monotonicity. In: Hochbaum, D.S., Jansen, K., Rolim, J.D.P., Sinclair, A. (eds.) RANDOM 1999 and APPROX 1999. LNCS, vol. 1671, pp. 97–108. Springer, Heidelberg (1999)
Ergun, F., Kannan, S., Ravi, K.S., Rubinfeld, R., Viswanathan, M.: Spotcheckers. In: Proc. STOC, pp. 259–268 (1998)
Fischer, E.: The art of uninformed decisions: A primer to property testing. Bulletin of EATCS 75, 97–126 (2001)
Fischer, E., Lehman, E., Newman, I., Raskhodnikova, S., Rubinfeld, R., Samorodnitsky, A.: Monotonicity testing over general poset domains. In: Proc. STOC, pp. 474–483 (2002)
Goldreich, O.: Combinatorial property testing - A survey. Randomization Methods in Algorithm Design, 45–60 (1998)
Goldreich, O., Goldwasser, S., Lehman, E., Ron, D., Samordinsky, A.: Testing monotonicity. Combinatorica 20, 301–337 (2000)
Goldreich, O., Goldwasser, S., Ron, D.: Property testing and its connection to learning and approximation. J. ACM 45, 653–750 (1998)
Halevy, S., Kushilevitz, E.: Distribution-free property testing. In: Arora, S., Jansen, K., Rolim, J.D.P., Sahai, A. (eds.) RANDOM 2003 and APPROX 2003. LNCS, vol. 2764, pp. 302–317. Springer, Heidelberg (2003)
Parnas, M., Ron, D., Rubinfeld, R.: Tolerant property testing and distance approximation. In: ECCC 2004 (2004)
Ron, D.: Property testing. Handbook on Randomization II, 597–649 (2001)
Rubinfeld, R., Sudan, M.: Robust characterization of polynomials with application sto program testing. SIAM J. Comput. 25, 647–668 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ailon, N., Chazelle, B., Comandur, S., Liu, D. (2004). Estimating the Distance to a Monotone Function. In: Jansen, K., Khanna, S., Rolim, J.D.P., Ron, D. (eds) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques. RANDOM APPROX 2004 2004. Lecture Notes in Computer Science, vol 3122. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-27821-4_21
Download citation
DOI: https://doi.org/10.1007/978-3-540-27821-4_21
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-22894-3
Online ISBN: 978-3-540-27821-4
eBook Packages: Springer Book Archive