scientific article; zbMATH DE number 5957469

MaRDI QIDQ3174124zbMATH OpenFDO

Authors Vitaly Feldman

Publication date 12 October 2011

Full work available at URL http://www.jmlr.org/papers/v8/feldman07a.html

zbMATH Keywords

membership queryparity functionDNFnon-adaptiveattribute-efficientrandom linear code

Mathematics Subject Classification ID

Computational learning theory (68Q32)

Recommendations

• Learning Theory
• scientific article; zbMATH DE number 4092808
• scientific article; zbMATH DE number 1256728
• Learnability of DNF with representation-specific queries
• On the limits of proper learnability of subclasses of DNF formulas
• Exact learning of DNF formulas using DNF hypotheses
• Proper learning of \(k\)-term DNF formulas from satisfying assignments
• A subexponential exact learning algorithm for DNF using equivalence queries
• On exactly learning disjunctions and DNFs without equivalence queries
• scientific article; zbMATH DE number 2077165

Cited in

(12)

• Learning Theory
• Toward attribute efficient learning of decision lists and parities
• Almost tight upper bound for finding Fourier coefficients of bounded pseudo-Boolean functions
• scientific article; zbMATH DE number 2019591 (Why is no real title available?)
• More on average case vs approximation complexity
• scientific article; zbMATH DE number 1775448 (Why is no real title available?)
• Adaptive versus nonadaptive attribute-efficient learning
• Exact learning from an honest teacher that answers membership queries
• Separating Models of Learning with Faulty Teachers
• Separating models of learning with faulty teachers
• More efficient PAC-learning of DNF with membership queries under the uniform distribution
• Learning Theory

This page was built for publication:

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