Learning polynomials with queries: The highly noisy case

SIAM Journal on Discrete Mathematics

Volumn 13, Issue 4, 2000, Pages 535-570

  Goldreich, Oded ^a   Rubinfeld, Ronitt ^b   Sudan, Madhu ^c  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

^b NEC LABORATORIES AMERICA   (United States)

^c MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Error correcting codes; Multivariate polynomials; Noisy reconstruction

Indexed keywords

EID: 0006238804     PISSN: 08954801     EISSN: None     Source Type: Journal    
DOI: 10.1137/S0895480198344540     Document Type: Article

References (48)

1. D. ANGLUIN AND P. LAIRD, Learning from noisy examples, Machine Learning, 2 (1988), pp. 343-370.
2. D. ANGLUIN AND M. KRIĶIS, Learning with malicious membership queries and exceptions, in Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, New Brunswick, NJ, ACM Press, New York, 1994, pp. 57-66.
3. S. AR, R. J. LIPTON, R. RUBINFELD, AND M. SUDAN, Reconstructing algebraic functions from mixed data, SIAM J. Comput., 28 (1999), pp. 487-510.
4. S. ARORA AND M. SUDAN, Improved low degree testing and its applications, in Proceedings of the 29th Annual ACM Symposium on Theory of Computing, El Paso, TX, 1997, ACM Press, New York, pp. 485-495.
5. D BEAVER AND J. FEIGENBAUM, Hiding instances in multioracle queries, in 7th Annual Symposium on Theoretical Aspects of Computer Science, Rouen, France, Lecture Notes in Comput. Sci., 415, Springer, New York, 1990, pp. 37-48.
6. A. BLUM AND P. CHALASANI, Learning switching concepts, in Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, ACM Press, Pittsburgh, PA, 1992, pp. 231-242.
7. A. BLUM, M. FURST, M. KEARNS, AND R J. LIPTON, Cryptographic primitives based on hard learning problems, in Advances in Cryptology - CRYPTO '93, D. R. Stinson, ed., Lecture Notes in Comput. Sci. 773, Springer-Verlag, New York, pp. 278-291.
8. M. BLUM, M. LUBY, AND R. RUBINFELD, Self-testing/correcting with applications to numerical problems, J. Comput. System Sci., 47 (1993), pp. 549-595.
9. R. CLEVE AND M. LUBY, A Note on Self-Testing/Correcting Methods for Trigonometric Functions, International Computer Science Institute Technical Report TR-90-032, ICSI, Berkeley, CA, 1990.
10. R. A. DEMILLO AND R. J. LIPTON, A probabilistic remark on algebraic program testing, Inform. Process. Lett., 7 (1978), pp. 193-195.
11. P. ELIAS, List decoding for noisy channels, in 1957-IRE WESCON Convention Record, Part 2, IRE-IEEE Press, New York, 1957, pp. 94-104.
12. Y. FREUND AND D. RON, Learning to model sequences generated by switching distributions, in Proceedings of the Eighth Annual Conference on Computational Learning Theory, ACM Press, Santa Cruz, CA, 1995, pp. 41-50.
13. S. A. GOLDMAN, M. J. KEARNS, AND R. E. SCHAPIRE, Exact identification of read-once formulas using fixed points of amplification functions, SIAM J. Comput., 22 (1993), pp. 705-726.
14. P GEMMELL, R. J. LIPTON, R. RUBINFELD, M. SUDAN, AND A. WIGDERSON, Self-testing/correcting for polynomials and for approximate functions, in Proceedings of the 23rd Annual ACM Symposium on Theory of Computing, New Orleans, LA, ACM Press, New York, 1991, pp. 32-42.
15. P. GEMMELL AND M. SUDAN, Highly resilient correctors for polynomials, Inform. Process. Lett., 43 (1992), pp. 169-174.
16. O. GOLDREICH, Foundations of Cryptography - Fragments of a Book, Weizmann Institute of Science, Rehovot, Israel, 1995. Available from the ECCC, http://www.eccc.unitrier.de/eccc/.
17. O. GOLDREICH AND L. A. LEVIN, A hard-core predicate for all one-way functions, in Proceedings of the 21st Annual ACM Symposium on Theory of Computing, Seattle, WA, ACM Press, New York, 1989, pp. 25-32.
18. O. GOLDREICH, R. RUBINFELD, AND M. SUDAN, Learning polynomials with queries: The highly noisy case, in 36th Annual Symposium on Foundations of Computer Science, IEEE, Milwaukee, WI, IEEE, New York, 1995, pp. 294-303.
19. V. GURUSWAMI AND M. SUDAN, Improved decoding of Reed-Solomon and algebraic-geometric codes, IEEE Trans. Inform. Theory, 45 (1999), pp. 1757-1767.
20. M. KEARNS, Efficient noise-tolerant learning from statistical queries, J. ACM, 45 (1998), pp. 983-1006.
21. M. KEARNS AND M. LI, Learning in the presence of malicious errors, SIAM J. Comput., 22 (1993), pp. 807-837
22. M. KEARNS, Y. MANSOUR, D. RON, R. RUBINFELD, R. E. SCHAPIRE, AND L. SELLIE, On the learnability of discrete distributions (extended abstract), in Proceedings of the 26th Annual ACM Symposium on the Theory of Computing, Montreal, Canada, ACM Press, New York, 1994, pp. 273-282.
23. M. J. KEARNS, R. E. SCHAPIRE, AND L. M. SELLIE, Toward efficient agnostic learning (extended abstract), in Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, Pittsburgh, PA, ACM Press, New York, 1992.
24. P. KOIRAN, Efficient learning of continuous neural networks, in Proceedings of the 7th Annual ACM Conference on Computational Learning Theory, New Brunswick, NJ, ACM Press, New York, 1994, pp.348-355.
25. E. KUSHILEVITZ AND Y. MANSOUR, Learning decision trees using the Fourier spectrum, SIAM J. Comput., 22 (1993), pp. 1331-1348.
26. P. D. LAÏRD, Learning From Good and Bad Data, Kluwer Academic Publishers, Boston, 1988.
27. L A. LEVIN, Randomness and non-determinism, J. Symbolic Logic, 58 (1993), pp. 1102-1103.
28. R. J. LIPTON, New directions in testing, in Distributed Computing and Cryptography: Proceedings of a DIMACS Workshop, J. Feigenbaum and M. Merritt, eds., AMS, Providence, RI, 1991, pp. 191-202.
29. W. MAASS, Efficient agnostic PAC-learning with simple hypotheses, in Proceedings of the 7th Annual ACM Conference on Computational Learning Theory, New Brunswick, NJ, ACM Press, New York, 1994, pp. 67-75.
30. W. MAASS, Agnostic PAC-learning of functions on analog neural nets, in Proceedings of the 6th Conference on Advances in Neural Information Processing Systems, J. D. Cowan, G. Tesauro, and J. Alspector, eds., Morgan Kaufmann, San Mateo, CA, 1994, pp. 311-318.
31. F. J. MACWILLIAMS AND N. J. A. SLOANE, The Theory of Error-Correcting Codes, North-Holland, Amsterdam, 1981.
32. Y. MANSOUR, Randomized interpolation and approximation of sparse polynomials, SIAM J. Comput., 24 (1995), pp. 357-368.
33. D. RON AND R. RUBINFELD, Learning fallible deterministic finite automata, Machine Learning 18 (1995), pp. 149-185.
34. R. RUBINFELD, On the robustness of functional equations, SIAM J. Comput., 28 (1999), pp. 1972-1997.
35. R. RUBINFELD AND M. SUDAN, Robust characterizations of polynomials with applications to program testing, SIAM J. Comput., 25 (1996), pp. 252-271.
36. Y. SAKAKIBARA, On learning from queries and counterexamples in the presence of noise, Inform. Process. Lett., 37 (1991), pp. 279-284.
37. Y. SAKAKIBARA AND R. SIROMONEY, A noise model on learning sets of strings, in Proceedings of the 5th Annual ACM Workshop on Computational Learning Theory, ACM Press, Pittsburgh, PA, ACM Press, New York, 1992, pp. 295-302.
38. J. T. SCHWARTZ, Fast probabilistic algorithms for verification of polynomial identities, J. ACM, 27 (1980), pp. 701-717.
39. R. SLOAN, Types of noise in data for concept learning (extended abstract), in Proceedings of the 1988 Workshop on Computational Learning Theory, Cambridge, MA, Morgan Kaufmann, San Mateo, CA, 1988, pp. 91-96.
40. M. SUDAN, Decoding of Reed Solomon codes beyond the error-correction bound, J. Complexity, 13 (1997), pp. 180-193.
41. M. SUDAN, L. TREVISAN, AND S. VADHAN, Pseudorandom generators without the XOR lemma, in Proceedings of the 31st Annual ACM Symposium on Theory of Computing, Atlanta, GA, ACM Press, New York, 1999, pp. 537-546.
42. L. G. VALIANT, Learning disjunctions of conjunctions, in Proceedings of the 9th International Joint Conference on Artificial Intelligence, Los Angeles, 1985, Morgan Kauffman Publishers, San Mateo, CA, 1985, pp. 560-566.
43. U. V. VAZIRANI AND V. V. VAZIRANI, Efficient and secure pseudo-random number generation, in Proceedings of the 25th IEEE Symposium on Foundations of Computer Science, Singer Island, FL, 1984, IEEE, New York, 1984, pp. 458-463.
44. H. WASSERMAN, Reconstructing randomly sampled multivariate polynomials from highly noisy data, in Proceedings of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms, San Francisco, CA, ACM Press, New York, SIAM, Philadelphia, 1998, pp. 59-67.
45. L. R. WELCH AND E. R. BERLEKAMP, Error Correction of Algebraic Block Codes, US patent 4,633,470, December 30, 1986.
46. R. E. ZIPPEL, Probabilistic algorithms for sparse polynomials, in Proceedings of EUROSAM '79: International Symposium on Symbolic and Algebraic Manipulation, E. Ng, ed., Lecture Notes in Comput. Sci., 72, Springer, New York, 1979, pp. 216-226.
47. R. E. ZIPPEL, Interpolating polynomials from their values, J. Symbolic Comput., 9 (1990), pp. 375-403.
48. R. E. ZIPPEL, Effective Polynomial Computation, Kluwer Academic Publishers, Boston, 1993.