An Algebraic Perspective on Boolean Function Learning

DOI10.1007/978-3-642-04414-4_19MaRDI QIDQ3648753zbMATH OpenOpenAlexFDO

Authors Ricard Gavaldà, Denis Thérien

Publication date 1 December 2009

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

Full work available at URL https://doi.org/10.1007/978-3-642-04414-4_19

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• An approach to guided learning of Boolean functions
• Learning of bounded-weight Boolean functions
• scientific article; zbMATH DE number 1163915
• Probabilistic learning and Boolean functions
• scientific article; zbMATH DE number 1104345
• scientific article; zbMATH DE number 1966612
• scientific article; zbMATH DE number 2080652
• Learning Boolean functions with queries
• Exact learning Boolean functions via the monotone theory

Cites work

• scientific article; zbMATH DE number 5899249 (Why is no real title available?)
• scientific article; zbMATH DE number 5605078 (Why is no real title available?)
• scientific article; zbMATH DE number 5605137 (Why is no real title available?)
• scientific article; zbMATH DE number 4041299 (Why is no real title available?)
• scientific article; zbMATH DE number 67609 (Why is no real title available?)
• scientific article; zbMATH DE number 1962825 (Why is no real title available?)
• A simple algorithm for learning O(log n)-term DNF
• A theory of the learnable
• Bounded-width polynomial-size branching programs recognize exactly those languages in \(NC^ 1\)
• Complete classifications for the communication complexity of regular languages
• Languages with Bounded Multiparty Communication Complexity
• Learning Behaviors of Automata from Multiplicity and Equivalence Queries
• Learning decision trees from random examples
• Learning expressions and programs over monoids
• Learning functions represented as multiplicity automata
• Learning regular sets from queries and counterexamples
• MONOIDS AND COMPUTATIONS
• Non-uniform automata over groups
• On ACC
• On PAC learning algorithms for rich Boolean function classes
• Representation theory of finite semigroups, semigroup radicals and formal language theory
• Sur le produit de concatenation non ambigu
• The pseudovariety of semigroups of triangular matrices over a finite field

Cited in

(16)

• LEARNING CLASSES OF LINEARLY SEPARABLE BOOLEAN FUNCTIONS FROM POSITIVE EXAMPLES
• Representing and learning Boolean functions of multivalued features
• scientific article; zbMATH DE number 2080652 (Why is no real title available?)
• Learning read-constant polynomials of constant degree modulo composites
• An incremental learning algorithm for constructing Boolean functions from positive and negative examples
• scientific article; zbMATH DE number 1895645 (Why is no real title available?)
• Exact learning from an honest teacher that answers membership queries
• Learning expressions and programs over monoids
• Derandomized learning of Boolean functions over finite abelian groups
• Learning Read-Constant Polynomials of Constant Degree Modulo Composites
• scientific article; zbMATH DE number 1688371 (Why is no real title available?)
• Learning families of algebraic structures from informant
• Learning of bounded-weight Boolean functions
• scientific article; zbMATH DE number 6129640 (Why is no real title available?)
• scientific article; zbMATH DE number 1966612 (Why is no real title available?)
• scientific article; zbMATH DE number 1962825 (Why is no real title available?)

This page was built for publication: An Algebraic Perspective on Boolean Function Learning

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