Efficient learning with equivalence queries of conjunctions of modulo functions

DOI10.1016/0020-0190(95)00126-WMaRDI QIDQ1350223zbMATH OpenOpenAlexDBLPWikidataFDO

Authors Alberto Bertoni, Nicolò Cesa-Bianchi, Guido Fiorino

Publication date 27 February 1997

Published in Information Processing Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0020-0190(95)00126-w

zbMATH Keywords

Analysis of algorithmsLearning with queriesModulo functions

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• Learning counting functions with queries
• Exact learning of linear combinations of monotone terms from function value queries
• Exact learning Boolean functions via the monotone theory
• Noise-tolerant learning, the parity problem, and the statistical query model

Cites work

• scientific article; zbMATH DE number 2077162 (Why is no real title available?)
• Learning Integer Lattices
• On Learning Ring-Sum-Expansions
• Queries and concept learning

Cited in

(3)

• Learning counting functions with queries
• Preface
• Disjunctions of negated counting functions are efficiently learnable with equivalence queries

This page was built for publication: Efficient learning with equivalence queries of conjunctions of modulo functions

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