Efficient Learning with Equivalence Queries of Conjunctions of Modulo Functions

A modulo m function takes value 0 when the weighted sum of the input variables is congruent to 0 mod m and takes value 1 otherwise. In this work we show a polynomial time algorithm for learning with equivalence queries the class of conjunctions of modulo p functions on n variables, for any fixed prime p. The result is also extended to learning with bounded adversarial noise.

[1]  Peter Auer,et al.  On-line learning of rectangles in noisy environments , 1993, COLT '93.

[2]  Zhixiang Chen,et al.  On learning counting functions with queries , 1994, COLT '94.

[3]  Avrim Blum,et al.  On learning embedded symmetric concepts , 1993, COLT '93.

[4]  Hans Ulrich Simon,et al.  On learning ring-sum-expansions , 1990, COLT '90.

[5]  D. Angluin.  Queries and Concept Learning , 1988 .

[6]  N. Littlestone.  Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).

[7]  Manfred K. Warmuth,et al.  Learning integer lattices , 1990, COLT '90.

[8]  Nicolò Cesa-Bianchi,et al.  On-line learning with malicious noise and the closure algorithm , 1994, Annals of Mathematics and Artificial Intelligence.