Learning functions represented as multiplicity automata

Journal of the ACM

Volumn 47, Issue 3, 2000, Pages 506-530

  Beimel, Amos ^a,b,c,d,e   Bergadano, Francesco ^a,b,c,d,e   Bshouty, Nader H ^a,b,c,d,e   Kushilevitz, Eyal ^a,b,c,d,e   Varricchio, Stefano ^a,b,c,d,e   Kushilevitz, E ^a,b,c,d,e  

^a HARVARD UNIVERSITY   (United States)

^b UNIVERSITY OF TURIN   (Italy)

^c UNIVERSITY OF CALGARY   (Canada)

^d TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^e UNIVERSITY OF L'AQUILA   (Italy)

Author keywords

Computational learning; DNF; Learning disjoint; Learning polynomials; Multiplicity automata

Indexed keywords

LEARNING FUNCTIONS; LEARNING POLYNOMIALS; MULTIPLICITY AUTOMATA;

ALGORITHMS; AUTOMATA THEORY; COMPUTATIONAL METHODS; FUNCTIONS; MATHEMATICAL MODELS; POLYNOMIALS; THEOREM PROVING;

LEARNING SYSTEMS;

EID: 2342490453     PISSN: 00045411     EISSN: None     Source Type: Journal    
DOI: 10.1145/337244.337257     Document Type: Article

References (60)

1. AIZENSTEIN, H., AND PITT, L. 1991. Exact learning of read-twice DNF formulas. In Proceedings of the 32nd Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 170-179.
2. AIZENSTEIN, H., AND PITT, L. 1992. Exact learning of read-k disjoint DNF and not-so-disjoint DNF. In Proceedings of 5th Annual ACM Workshop on Computational Learning Theory (Pittsburgh, Pa., July 27-29). ACM, New York, pp. 71-76.
3. ANGLUIN, D. 1987a. Learning k-term DNF formulas using queries and counterexamples. Tech. Rep. YALEU/DCS/RR-559. Dept. Computer Science; Yale University.
4. ANGLUIN, D. 1987b. Learning regular sets from queries and counterexamples. Inf. Comput. 75, 87-106.
5. ANGLUIN, D. 1988. Queries and concept learning. Mach. Learn. 2, 4, 319-342.
6. ANGLUIN, D., HELLERSTEIN, L., AND KARPINSKI, M. 1993. Learning read-once formulas with queries. J. ACM 40, 185-210.
7. AUER, P. 1993. On-line learning of rectangles in noisy environments. In Proceedings of 6th Annual ACM Conference on Computational Learning Theory, (Santa Cruz, Calif., July 26-28). ACM, New York, pp. 253-261.
8. BEIMEL, A., BERGADANO, F., BSHOUTY, N. H., KUSHILEVITZ, E., AND VARRICCHIO, S. 1996. On the applications of multiplicity automata in learning. In Proceedings of the 37th Annual IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 349-358.
9. BEIMEL, A., AND KUSHILEVITZ, E. 1998. Learning boxes in high dimension. Algorithmica, 22, 76-90.
10. BEN-OR, M., AND TIWARI, P. 1988. A deterministic algorithm for sparse multivariate polynomial interpolation. In Proceedings of the 20th Annual ACM Symposium on Theory of Computing (Chicago, 111., May 2-4). ACM, New York, pp. 301-309.
11. BERGADANO, F., CATALANO, D., AND VARRICCHIO, S. 1996. Learning sat-k-DNF formulas from membership queries. In Proceedings of the 28th Annual ACM Symposium on the Theory of Computing (Philadelphia, Pa., May 22-24). ACM, New York, pp. 126-130.
12. BERGADANO, F., AND VARRICCHIO, S. 1996a. Learning behaviors of automata from multiplicity and equivalence queries. SIAM J. Comput. 25, 6, 1268-1280.
13. BERGADANO, F., AND VARRICCHIO, S. 1996b. Learning behaviors of automata from shortest counterexamples. In EuroCOLT '95, Lecture Notes in Artificial Intelligence, vol. 904. Springer-Verlag, New York, pp. 380-391.
14. BERSTEL, J., AND REUTENAUER, C. 1988. Rational Series and Their Languages. In EATCS monograph on Theoretical Computer Science, vol. 12. Springer-Verlag, New York.
15. SLUM, A., KHARDON, R., KUSHILEVITZ, E., PITT, L., AND ROTH, D. 1994. On learning read-k-satisfy-j DNF. In Proceedings of 7th Annual ACM Conference on Computational Learning Theory (New Brunswick, N.J., July 12-15). ACM, New York, pp. 110-117.
16. BLUM, A., AND RUDICH, S. 1995. Fast learning of k-term DNF formulas with queries. J. Comput. Syst. Sci. 51, 3, 367-373.
17. BREIMAN, L., FRIEDMAN, J. H., OLSHEN, R. A., AND STONE, C. J. 1984. Classification and Regression Trees. Wadsworth International Group.
18. BSHOUTY, N. H. 1995a. Exact learning via the monotone theory. Inf. Comput. 123, 1, 146-153.
19. BSHOUTY, N. H. 1995b. A note on learning multivariate polynomials under the uniform distribution. In Proceedings of 8th Annual. ACM Conference on Computational Learning Theory (Santa Cruz, Calif., July 5-8). ACM, New York, pp. 79-82.
20. BSHOUTY, N. H. 1997. Simple learning algorithms using divide and conquer. Comput. Complex. 6, 174-194.
21. BSHOUTY, N. H., AND MANSOUR, Y. 1995. Simple learning algorithms for decision trees and multivariate polynomials. In Proceedings of the 36th Annual IEEE Symposium on Foundations of Computer Science. IEEE, New York, pp. 304-311.
22. BSHOUTY, N. H., TAMON, C., AND WILSON, D. K. 1998. Learning matrix functions over rings. Algorithmica 22, 91-111.
23. CARLYLE, J. W., AND PAZ, A. 1971. Realization by stochastic finite automaton. J. Comput. Syst. Sci. 5, 26-40.
24. CHEN, Z., AND MAASS, W. 1992. On-line learning of rectangles. In Proceedings of 5th Annual ACM Workshop on Computational Learning Theory, (Pittsburgh, Pa., July 27-29). ACM, New York, pp. 16-28.
25. CLAUSEN, M., DRESS, A., GRABMEIER, J., AND KARPINSKI, M. 1991. On zero-testing and interpolation of k-sparse multivariate polynomials over finite fields. Theoret. Comput. Sci. 84, 2, 151-164.
26. CORMEN, T. H., LEISERSON, C. E., RIVEST, R. L. 1990. Introduction to algorithms. MIT Press, Cambridge, Mass., AND McGraw-Hill, New York.
27. EILENBERG, S. 1974. Automata, Languages and Machines, vol. A. Academic Press, Orlando, Fla.
28. FLIESS, M. 1974. Matrices de Hankel. J. Math. Pures Appl., 53, 197-222. (Erratum in vol. 54, 1975.)
29. GOLDBERG, P. W., GOLDMAN, S. A., AND MATHIAS, H. D. 1994. Learning unions of boxes with membership and equivalence queries. In Proceedings of 7th Annual ACM Conference on Computational Learning Theory (New Brunswick, N.J., July 12-15) ACM, New York, pp. 148-207.
30. GRIGORIEV, D. Y., KARPINSKI, M., AND SINGER, M. F. 1990. Fast parallel algorithms for sparse multivariate polynomial interpolation over finite fields. SIAM J. Comput. 19, 6, 1059-1063.
31. HANCOCK, T. R. 1991. Learning 2μ. DNF formulas and kμ. decision trees. In Proceedings of 4th Animal ACM Workshop on Computational Learning Theory (Santa Cruz, Calif., Aug. 5-7). ACM, New York, pp. 199-209.
32. HUANG, M. A., AND RAO, A. J. 1996. Interpolation of sparse multivariate polynomials over large finite fields with applications. In Proceedings of the 7th Annual ACM-SIAM Symposium on Discrete Algorithms. ACM, New York, pp. 508-517.
33. JACKSON, J. C. 1997. An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J. Comput. Syst. Sci. 55, 3, 414-440.
34. KEARNS, M. J., AND VALIANT, L. G. 1994. Cryptographic limitations on learning Boolean formulae and finite automata. J. ACM 41, 1 (Jan.), 67-95.
35. KEARNS, M. J., AND VAZIRANI, U. V. 1994. An Introduction to Computational Learning Theory. MIT Press, Cambridge, Mass.
36. KHARITONOY, M. 1993. Cryptographic hardness of distribution-specific learning. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (San Diego, Calif., May 16-18). ACM, New York, pp. 372-381.
37. KNUTH, D. E. 1998. The Art of Computer Programming. Vol. 2: Seminumerical Algorithms. Addison-Wesley, Reading, Mass.
38. KUSHILEVITZ, E. 1997. A simple algorithm for learning O(log n)-term DNF. In Inform. Process. Lett. 61, 6, 289-292.
39. KUSHILEVITZ, E., AND MANSOUR, Y. 1993. Learning decision trees using the Fourier spectrum. SIAM J. Comput. 22, 6, 1331-1348.
40. KUSHILEVITZ, E., AND NISAN, N. 1997. Communication Complexity. Cambridge University Press, Cambridge, Mass.
41. LANG, K. J. 1992. Random DFA's can be approximately learned from sparse uniform examples. In Proceedings of 5th Annual ACM Workshop on Computational Learning Theory (Pittsburgh, Pa., July 27-29). ACM, New York, pp. 45-52.
42. LENGAUER, T. 1990. VLSI theory. In Handbook of Theoretical Computer Science, vol. A, chap. 16, J. van Leeuwen, ed. Elsevier, Amsterdam, The Netherlands and The MIT Press, Cambridge, Mass., pp. 835-868.
43. MAASS, W., AND TURAN, G. 1989. On the complexity of learning from counterexamples. In Proceedings of the 30th Animal IEEE Symposium on Foundations of Computer Science. IEEE Computer Society Press, Los Alamitos, Calif., pp. 262-273.
44. MAASS, W., AND TURAN, G. 1994. Algorithms and lower bounds for on-line learning of geometrical concepts. Mach. Learning 14, 251-269.
45. MAASS, W., AND WARMUTH, M. K. 1998. Efficient learning with virtual threshold gates. Inf. Comput. 141, 1, 66-83.
46. OHNISHI, H., SEKI, H., AND KASAMI, T. 1994. A polynomial time learning algorithm for recognizable series. IEICE Trans. Inf. Syst. E77-D, (10) (5), 1077-1085.
47. PILLAIPAKKAMNATT, K., AND RAGHAVAN, V. 1995. Read-twice DNF formulas are properly learnable. Inf. Comput. 122, 2, 236-267.
48. QUINLAN, J. R. 1986. Induction of decision trees. Mach. Learn. 1, 81-106.
49. QUINLAN, J. R. 1993. C4.5: Programs for machine learning. Morgan-Kaufmann.
50. RIVEST, R. L., AND SCHAPIRE, R. E. 1993. Inference of finite automata using homing sequences. Inf. Comput. 103, 299-347.
51. ROTH, R. M., AND BENEDEK, G. M. 1991. Interpolation and approximation of sparse multivariate polynomials over GF(2). SIAM J. Comput. 20, 2, 291-314.
52. SCHAPIRE, R. E., AND SELLIE, L. M. 1996. Learning sparse multivariate polynomials over a field with queries and counterexamples. J. Comput. Syst. Sci. 52, 2, 201-213.
53. SCHWARTZ, J. T. 1980. Fast probabilistic algorithms for verification of polynomial identities. J. ACM 27, 701-717.
54. SHÜTZENBERGER, M. P. 1961. On the definition of a family of automata. Inf. Control 4, 245-270.
55. TRAKHTENBROT, B. A., AND BARZDIN, Y. M. 1973. Finite Automata: Behavior and Synthesis. North-Holland, Amsterdam, The Netherlands.
56. VALIANT, L. G. 1984. A theory of the learnable. Commun. ACM 27, 11 (Nov.), 1134-1142.
57. VALIANT, L. G. 1985. Learning disjunctions of conjunctions. In Proceedings of the International Joint Conference of Artificial Intelligence. Morgan-Kaufmann, Los Angeles, Calif., pp. 560-566.
58. ZIPPEL, R. E. 1979. Probabilistic algorithms for sparse polynomials. In Proceedings of the International Symposium on Symbolic and Algebraic Manipulation (EUROSAM '79). Lecture Notes in Computer Science, vol. 72. Springer-Verlag, New York, pp. 216-226.
59. ZIPPEL, R. E. 1990. Interpolating polynomials from their values. J. Symbolic Comput. 9, 375-403.
60. ZIPPEL, R. E. 1993. Efficient Polynomial Computation. Kluwer Academic Publishers, Hingham, Mass.