On learning monotone Boolean functions with irrelevant variables

DOI10.1515/DMA.2010.018MaRDI QIDQ3585190zbMATH OpenOpenAlexFDO

Authors V. V. Osokin

Publication date 19 August 2010

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

Full work available at URL https://doi.org/10.1515/dma.2010.018

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Exact learning when irrelevant variables abound
• Exact learning Boolean functions via the monotone theory
• Almost all monotone Boolean functions are polynomially learnable using membership queries
• scientific article; zbMATH DE number 1617283
• Learning in the presence of finitely or infinitely many irrelevant attributes

Cites work

• A theory of the learnable
• Adaptive versus nonadaptive attribute-efficient learning
• On parallel attribute-efficient learning.
• On the complexity of decoding Boolean cube splitting into cube faces

Cited in

(11)

• Exact learning of linear combinations of monotone terms from function value queries
• Almost all monotone Boolean functions are polynomially learnable using membership queries
• Exact learning when irrelevant variables abound
• Learning functions of \(k\) relevant variables
• Learning of monotone functions with single error correction
• Exact learning Boolean functions via the monotone theory
• Exact learning from an honest teacher that answers membership queries
• Learning k-Term Monotone Boolean Formulae.
• On approximating the number of relevant variables in a function
• On approximating the number of relevant variables in a function
• Attribute-efficient learning of Boolean functions from Post closed classes

This page was built for publication: On learning monotone Boolean functions with irrelevant variables

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