Exact learning of linear combinations of monotone terms from function value queries

DOI10.1016/0304-3975(94)00166-GMaRDI QIDQ1367523zbMATH OpenFDO

Authors Atsuyoshi Nakamura, Naoki Abe

Publication date 29 September 1997

Published in Theoretical Computer Science (Search for Journal in Brave)

zbMATH Keywords

learning algorithm

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05) Parallel algorithms in computer science (68W10)

Recommendations

• Exact learning Boolean functions via the monotone theory
• A new abstract combinatorial dimension for exact learning via queries
• Learning Theory
• Minimizing the average query complexity of learning monotone Boolean functions
• Learning k-Term Monotone Boolean Formulae.
• New Computational Paradigms
• On learning monotone Boolean functions with irrelevant variables
• Almost all monotone Boolean functions are polynomially learnable using membership queries
• On Exact Learning Monotone DNF from Membership Queries

Cites work

• scientific article; zbMATH DE number 3577144 (Why is no real title available?)
• scientific article; zbMATH DE number 1351090 (Why is no real title available?)
• Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
• Learning read-once formulas with queries
• On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
• Queries and concept learning

Cited in

(3)

• Exact learning Boolean functions via the monotone theory
• Learning sparse linear combinations of basis functions over a finite domain
• Learning Theory

This page was built for publication: Exact learning of linear combinations of monotone terms from function value queries

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