Learning random monotone DNF (Q628302)

From MaRDI portal
Revision as of 21:20, 3 July 2024 by ReferenceBot (talk | contribs) (‎Changed an Item)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)
scientific article
Language Label Description Also known as
English
Learning random monotone DNF
scientific article

    Statements

    Learning random monotone DNF (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 March 2011
    0 references
    Learning polynomial-time disjunctive normal formulas from random samples is an open problem in learning theory, even with the uniform distribution. A special case is to learn monotone disjunctive normal formulas under the uniform distribution, which is the topic considered in this paper. By studying Fourier properties of monotone functions, the authors give a polynomial-time algorithm to solve an average-case version of this problem for learning monotone disjunctive normal formulas.
    0 references
    0 references
    Fourier analysis
    0 references
    monotone Boolean function
    0 references
    computational learning theory
    0 references
    0 references