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

DOI10.1016/0304-3975(94)00166-GzbMATH Open0884.68105MaRDI QIDQ1367523FDOQ1367523

Authors: Atsuyoshi Nakamura, Naoki Abe 

Publication date: 29 September 1997

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

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

zbMATH Keywords

learning algorithm

Mathematics Subject Classification ID

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

Cites Work

• Queries and concept learning
• Learning read-once formulas with queries
• Title not available (Why is that?)
• On zero-testing and interpolation of \(k\)-sparse multivariate polynomials over finite fields
• Interpolation and Approximation of Sparse Multivariate Polynomials over $GF(2)$
• Title not available (Why is that?)

Cited In (3)

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

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)