Article

Free access

Uniform-distribution attribute noise learnability

Authors:

Nader H. Bshouty,

Jeffrey C. Jackson,

Christino TamonAuthors Info & Claims

COLT '99: Proceedings of the twelfth annual conference on Computational learning theory

Pages 75 - 80

https://doi.org/10.1145/307400.307414

Published: 06 July 1999 Publication History

PDF eReader

References

[1]

Avrim Blum, Carl Burch, and John Langford. On Learning Monotone Boolean Functions. In Proceedings of the 39th Annual IEEE Symposium on Foundations of Computer Science, 1998.

Digital Library

Google Scholar

[2]

Scott Decatur and Rossario Gennaro. On Learning from Noisy and Incomplete Examples. In Proceedings of the 8th Annual ACM Conference on Computational Learning Theory, 353-360, 1995.

Digital Library

Google Scholar

[3]

Luc Devroye, Lftszl6 Gy6rft, and Gfibor Lugosi. A Probabilistic Theory of Pattern Recognition. Springer- Verlag, 1996.

Crossref

Google Scholar

[4]

Shaft Goldwasser and Silvio Micali. Probabilistic Encryption. In Journal of Computer and System Sciences, 28(2):270-299, 1984.

Crossref

Google Scholar

[5]

Sally Goldman and Robert Sloan. Can PAC Learning Algorithms Tolerate Random Attribute Noise? In Algorithmica, 14(1):70-84, 1995.

Digital Library

Google Scholar

[6]

M. Kearns and M. Li. Learning in the Presence of Malicious Errors. In SIAM Journal on Computing, 22(4):80.7-837, 1993.

Digital Library

Google Scholar

[7]

Nathan Linial, Yishay Mansour, and Noam Nisan. Constant Depth Circuits, AGo Circuits, and Learnability. In Journal of the ACM, 40(3):607-620, 1993.

Digital Library

Google Scholar

[8]

George Shackelford and Dennis Volper. Learning k- DNF with Noise in the Attributes. In Proceedings of the 1988 Workshop on Computational Learning Theory, 97-103, 1988.

Digital Library

Google Scholar

[9]

Hans Ulrich Simon. General Bounds on the Number of Examples Needed for Learning Probabilistic Concepts. In Proceedings of the 6th Annual ACM Workshop on Computational Learning Theory, pages 402-411, 1993.

Digital Library

Google Scholar

Cited By

View all

Miyata ATarui JTomita E(2011)Learning Boolean functions in AC0 on attribute and classification noise -- Estimating an upper bound on attribute and classification noiseTheoretical Computer Science10.1016/j.tcs.2011.04.047412:35(4650-4660)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.tcs.2011.04.047
O'Donnell R(2004)Hardness amplification within NPJournal of Computer and System Sciences10.1016/j.jcss.2004.01.00169:1(68-94)Online publication date: 1-Aug-2004
https://dl.acm.org/doi/10.1016/j.jcss.2004.01.001
Miyata ATarui JTomita E(2004)Learning Boolean Functions in AC 0 on Attribute and Classification NoiseAlgorithmic Learning Theory10.1007/978-3-540-30215-5_12(142-155)Online publication date: 2004
https://doi.org/10.1007/978-3-540-30215-5_12
Show More Cited By

Index Terms

Uniform-distribution attribute noise learnability
1. Computing methodologies
  1. Machine learning
2. Theory of computation
  1. Logic
  2. Models of computation

Recommendations

Uniform-distribution attribute noise learnability

We study the problem of PAC-learning Boolean functions with random attribute noise under the uniform distribution. We define a noisy distance measure for function classes and show that if this measure is small for a class C and an attribute noise ...
Class noise vs. attribute noise: a quantitative study of their impacts

Real-world data is never perfect and can often suffer from corruptions (noise) that may impact interpretations of the data, models created from the data and decisions made based on the data. Noise can reduce system performance in terms of classification ...
Distribution learnability and robustness
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing Systems

We examine the relationship between learnability and robust (or agnostic) learnability for the problem of distribution learning. We show that learnability of a distribution class implies robust learnability with only additive corruption, but not if there ...

Comments

Information & Contributors

Information

Published In

COLT '99: Proceedings of the twelfth annual conference on Computational learning theory

July 1999

333 pages

ISBN:1581131674

DOI:10.1145/307400

Chairmen:
Shai Ben-David,
Phil Long

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: 06 July 1999

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

COLT99

Sponsor:

SIGAI
Univ. of California,
SIGACT

COLT99: The 12th Annual Conference on Computation Learning Theory

July 7 - 9, 1999

California, Santa Cruz, USA

Acceptance Rates

COLT '99 Paper Acceptance Rate 35 of 71 submissions, 49%;

Overall Acceptance Rate 35 of 71 submissions, 49%

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

7
Total Citations
View Citations
364
Total Downloads

Downloads (Last 12 months)40
Downloads (Last 6 weeks)7

Reflects downloads up to 26 Jul 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Miyata ATarui JTomita E(2011)Learning Boolean functions in AC0 on attribute and classification noise -- Estimating an upper bound on attribute and classification noiseTheoretical Computer Science10.1016/j.tcs.2011.04.047412:35(4650-4660)Online publication date: 1-Aug-2011
https://dl.acm.org/doi/10.1016/j.tcs.2011.04.047
O'Donnell R(2004)Hardness amplification within NPJournal of Computer and System Sciences10.1016/j.jcss.2004.01.00169:1(68-94)Online publication date: 1-Aug-2004
https://dl.acm.org/doi/10.1016/j.jcss.2004.01.001
Miyata ATarui JTomita E(2004)Learning Boolean Functions in AC 0 on Attribute and Classification NoiseAlgorithmic Learning Theory10.1007/978-3-540-30215-5_12(142-155)Online publication date: 2004
https://doi.org/10.1007/978-3-540-30215-5_12
Mossel EO'Donnell R(2003)On the noise sensitivity of monotone functionsRandom Structures & Algorithms10.1002/rsa.1009723:3(333-350)Online publication date: 1-Oct-2003
https://dl.acm.org/doi/10.1002/rsa.10097
Bshouty NFeldman V(2002)On using extended statistical queries to avoid membership queriesThe Journal of Machine Learning Research10.1162/1532443027602006692(359-395)Online publication date: 1-Mar-2002
https://dl.acm.org/doi/10.1162/153244302760200669
O'Donnell RReif J(2002)Hardness amplification within NPProceedings of the thiry-fourth annual ACM symposium on Theory of computing10.1145/509907.510015(751-760)Online publication date: 19-May-2002
https://dl.acm.org/doi/10.1145/509907.510015
Bshouty NFeldman V(2001)On Using Extended Statistical Queries to Avoid Membership QueriesComputational Learning Theory10.1007/3-540-44581-1_35(529-545)Online publication date: 13-Sep-2001
https://doi.org/10.1007/3-540-44581-1_35

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