Learning of monotone functions with single error correction

DOI10.1515/DMA-2020-0017MaRDI QIDQ2050228zbMATH OpenOpenAlexFDO

Authors Yanyan Li

Publication date 30 August 2021

Published in Discrete Mathematics and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1515/dma-2020-0017

zbMATH Keywords

monotone functionBoolean functionerror correctionchainchain partitionerrorlearning complexity\(n\)-dimensional Boolean cubeHansel chainslearning of functions

Mathematics Subject Classification ID

Computer science (68-XX) Information and communication theory, circuits (94-XX)

Recommendations

• On learning monotone Boolean functions with irrelevant variables
• On learning monotone Boolean functions under the uniform distribution
• Learning Monotone Decision Trees in Polynomial Time
• scientific article; zbMATH DE number 1617283
• Almost all monotone Boolean functions are polynomially learnable using membership queries

Cites work

• scientific article; zbMATH DE number 3528155 (Why is no real title available?)
• scientific article; zbMATH DE number 3441975 (Why is no real title available?)
• scientific article; zbMATH DE number 3285251 (Why is no real title available?)
• scientific article; zbMATH DE number 3304025 (Why is no real title available?)
• Adaptive versus nonadaptive attribute-efficient learning
• Exact learning from an honest teacher that answers membership queries
• On learning monotone Boolean functions with irrelevant variables

Cited in

(2)

• Universal functions for classes of linear functions of three variables
• Learning Theory

This page was built for publication: Learning of monotone functions with single error correction

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2050228)