Learning counting functions with queries

DOI10.1016/S0304-3975(96)00144-2MaRDI QIDQ1390865zbMATH OpenFDO

Authors Zhi-Xiang Chen, S. Homer

Publication date 22 July 1998

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

Full work available at URL https://doi.org/10.1016/S0304-3975(96)00144-2

zbMATH Keywords

Boolean-weighted counting functionslearning

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning Boolean functions with queries
• Learning low-degree functions from a logarithmic number of random queries
• Disjunctions of negated counting functions are efficiently learnable with equivalence queries
• Counting functions
• Learning via finitely many queries
• Learning an extension of the class of functional dependencies with queries
• Learning via queries in [+, <]
• Learning via queries
• Learning via queries and oracles
• The logic of counting query answers

Cites work

• Efficient learning with equivalence queries of conjunctions of modulo functions
• Learning Integer Lattices
• Learning read-once formulas with queries
• On Learning Ring-Sum-Expansions
• Queries and concept learning

Cited in

(5)

• Efficient learning with equivalence queries of conjunctions of modulo functions
• Learnability of quantified formulas.
• Identification of partial disjunction, parity, and threshold functions
• scientific article; zbMATH DE number 6820309 (Why is no real title available?)
• Disjunctions of negated counting functions are efficiently learnable with equivalence queries

This page was built for publication: Learning counting functions with queries

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