Article

Free access

Learning boolean functions in an infinite attribute space

Author:

A. BlumAuthors Info & Claims

STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of Computing

Pages 64 - 72

https://doi.org/10.1145/100216.100224

Published: 01 April 1990 Publication History

PDF eReader

References

[1]

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.

Digital Library

Google Scholar

[2]

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

[3]

D. Angluin. Queries and concept learning. Machine Learning, 2(4):319-342, 1988.

Crossref

Google Scholar

[4]

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.

Digital Library

Google Scholar

[5]

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.

Digital Library

Google Scholar

[6]

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.

Crossref

Google Scholar

[7]

Nick Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1987.

Digital Library

Google Scholar

[8]

Nick Littlestone. Mistake bounds and logarithmic linear-threshold learning algorithms. PhD thesis, U. C. Santa Cruz, March 1989.

Digital Library

Google Scholar

[9]

Nick Littlestone. private communication. 1990.

Google Scholar

[10]

Ronald L. Rivest. Learning decision lists. Machine Learning, 2(3):229-246, 1987.

Digital Library

Google Scholar

[11]

Leslie G. Valiant. A theory of the learnable. Communications of the ACM, 27(11):1134- 1142, November 1984.

Digital Library

Google Scholar

Cited By

View all

Cao XVempala SOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Contrastive momentsProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3669293(72540-72582)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3669293
Zeng SShen JKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Attribute-efficient PAC learning of low-degree polynomial threshold functions with nasty noiseProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3620115(40719-40748)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3620115
Zhang CShen JAwasthi PLarochelle HRanzato MHadsell RBalcan MLin H(2020)Efficient active learning of sparse halfspaces with arbitrary bounded noiseProceedings of the 34th International Conference on Neural Information Processing Systems10.5555/3495724.3496327(7184-7197)Online publication date: 6-Dec-2020
https://dl.acm.org/doi/10.5555/3495724.3496327
Show More Cited By

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 Cryptology

We 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

Information & Contributors

Information

Published In

STOC '90: Proceedings of the twenty-second annual ACM symposium on Theory of Computing

April 1990

574 pages

ISBN:0897913612

DOI:10.1145/100216

Editor:
Harriet Ortiz

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 April 1990

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC90

Sponsor:

SIGACT

STOC90: 22nd Annual ACM Symposium on Theory of Computing

May 13 - 17, 1990

Maryland, Baltimore, USA

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

19
Total Citations
View Citations
587
Total Downloads

Downloads (Last 12 months)85
Downloads (Last 6 weeks)18

Reflects downloads up to 17 Oct 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Cao XVempala SOh ANaumann TGloberson ASaenko KHardt MLevine S(2023)Contrastive momentsProceedings of the 37th International Conference on Neural Information Processing Systems10.5555/3666122.3669293(72540-72582)Online publication date: 10-Dec-2023
https://dl.acm.org/doi/10.5555/3666122.3669293
Zeng SShen JKrause ABrunskill ECho KEngelhardt BSabato SScarlett J(2023)Attribute-efficient PAC learning of low-degree polynomial threshold functions with nasty noiseProceedings of the 40th International Conference on Machine Learning10.5555/3618408.3620115(40719-40748)Online publication date: 23-Jul-2023
https://dl.acm.org/doi/10.5555/3618408.3620115
Zhang CShen JAwasthi PLarochelle HRanzato MHadsell RBalcan MLin H(2020)Efficient active learning of sparse halfspaces with arbitrary bounded noiseProceedings of the 34th International Conference on Neural Information Processing Systems10.5555/3495724.3496327(7184-7197)Online publication date: 6-Dec-2020
https://dl.acm.org/doi/10.5555/3495724.3496327
Blum ARoth A(2013)Fast Private Data Release Algorithms for Sparse QueriesApproximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques10.1007/978-3-642-40328-6_28(395-410)Online publication date: 2013
https://doi.org/10.1007/978-3-642-40328-6_28
Shen JShepherd JCui BTan K(2009)A novel framework for efficient automated singer identification in large music databasesACM Transactions on Information Systems10.1145/1508850.150885627:3(1-31)Online publication date: 19-May-2009
https://dl.acm.org/doi/10.1145/1508850.1508856
Klivans AServedio R(2006)Toward Attribute Efficient Learning of Decision Lists and ParitiesThe Journal of Machine Learning Research10.5555/1248547.12485677(587-602)Online publication date: 1-Dec-2006
https://dl.acm.org/doi/10.5555/1248547.1248567
Ben-David SKushilevitz EMansour Y(2005)Online learning versus offline learningComputational Learning Theory10.1007/3-540-59119-2_167(38-52)Online publication date: 1-Jun-2005
https://doi.org/10.1007/3-540-59119-2_167
Klivans AServedio R(2004)Toward Attribute Efficient Learning of Decision Lists and ParitiesLearning Theory10.1007/978-3-540-27819-1_16(224-238)Online publication date: 2004
https://doi.org/10.1007/978-3-540-27819-1_16
Ben-David SEiron N(1998)Self-Directed Learning and Its Relation to the VC-Dimension and to Teacher-Directed LearningMachine Language10.1023/A:100751073215133:1(87-104)Online publication date: 1-Oct-1998
https://dl.acm.org/doi/10.1023/A%3A1007510732151
Ben-David SKushilevitz EMansour Y(1997)Online Learning versus Offline LearningMachine Language10.1023/A:100746590757129:1(45-63)Online publication date: 1-Oct-1997
https://dl.acm.org/doi/10.1023/A%3A1007465907571
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

Boolean functions with two distinct Walsh coefficients

On the Symmetric Negabent Boolean Functions