Disjunctions of negated counting functions are efficiently learnable with equivalence queries

DOI10.1007/BFB0030849MaRDI QIDQ6085721zbMATH OpenFDO

Authors Zhi-Xiang Chen

Publication date 12 December 2023

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0030849

Mathematics Subject Classification ID

Primes (11A41) Computational learning theory (68Q32) Combinatorics in computer science (68R05)

Recommendations

• Learning counting functions with queries
• Efficient learning with equivalence queries of conjunctions of modulo functions
• On exactly learning disjunctions and DNFs without equivalence queries
• Learning nearly monotone k-term DNF
• Exact learning Boolean functions via the monotone theory

Cites work

• Efficient learning with equivalence queries of conjunctions of modulo functions
• Learning Integer Lattices
• Queries and concept learning

Cited in

(2)

• Learning counting functions with queries
• A Lower Bound for Agnostically Learning Disjunctions

This page was built for publication: Disjunctions of negated counting functions are efficiently learnable with equivalence queries

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