A. Blum
- AHK89.D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. Technical Report UCB/CSD 89/528, University of California Berkeley Computer Science Division, 1989. Google Scholar
Digital Library
- Ang86.Dana Angluin. Learning regular sets from queries and counter-examples. Technical Report YALEU/DCS/TR-464, Yale University Department of Computer Science, March 1986.Google Scholar
- Ang88.D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988. Google ScholarCross Ref
- HKLW88.David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth. Equivalence of models for polynomial learnability. In Proceedings of the 1988 Workshop on Computational Learning Theory, pages 42- 55, Cambridge, MA, August 1988. Morgan- Kaufmann. Google ScholarDigital Library
- Kea89.Michael Kearns. The Computational Complexity of Machine Learning. PhD thesis, Harvard University Center for Research in Computing Technology, May 1989. Technical Report TR-13-89. Google ScholarDigital Library
- KLPV87.Michael Kearns, Ming Li, Leonard Pitt, and Leslie Valiant. Recent results on boolean concept learning. In Proceedings of the Fourth International Workshop on Machine Learning, pages 337-352, University of California, Irvine, June 1987.Google ScholarCross Ref
- Lit87.Nick Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1987. Google ScholarDigital Library
- Lit89.Nick Littlestone. Mistake bounds and logarithmic linear-threshold learning algorithms. PhD thesis, U. C. Santa Cruz, March 1989. Google ScholarDigital Library
- Lit90.Nick Littlestone. private communication. 1990.Google Scholar
- Riv87.Ronald L. Rivest. Learning decision lists. Machine Learning, 2(3):229-246, 1987. Google ScholarDigital Library
- Val84.Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134- 1142, November 1984. Google ScholarDigital Library
Index Terms
- Learning boolean functions in an infinite attribute space
Recommendations
Boolean functions with two distinct Walsh coefficients
Are there other Boolean functions having two distinct Walsh coefficients except affine Boolean functions and maximal nonlinear (i.e. bent) Boolean functions__ __ This paper proves that all Boolean functions with exactly two distinct Walsh coefficients ...
On the Symmetric Negabent Boolean Functions
INDOCRYPT '09: Proceedings of the 10th International Conference on Cryptology in India: Progress in CryptologyWe study the negabent Boolean functions which are symmetric. The Boolean function which has equal absolute spectral values under the nega-Hadamard transform is called a negabent function. For a bent function, the absolute spectral values are the same ...
Learning Boolean Functions in an Infinite Attribute Space
This paper presents a theoretical model for learning Boolean functions in domains having a large, potentially infinite number of attributes. The model allows an algorithm to employ a rich vocabulary to describe the objects it encounters in the world ...
Comments