Learning DNF from random walks (Q2568457): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: A Markovian extension of Valiant's learning model / rank
 
Normal rank
Property / cites work
 
Property / cites work: Noise sensitivity of Boolean functions and applications to percolation / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weakly learning DNF and characterizing statistical query learning using Fourier analysis / rank
 
Normal rank
Property / cites work
 
Property / cites work: Exact learning Boolean functions via the monotone theory / rank
 
Normal rank
Property / cites work
 
Property / cites work: 10.1162/153244302760200669 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning DNF over the Uniform Distribution Using a Quantum Example Oracle / rank
 
Normal rank
Property / cites work
 
Property / cites work: More efficient PAC-learning of DNF with membership queries under the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Uniform-distribution attribute noise learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Fourier spectrum of monotone functions / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning decision trees from random examples / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Pseudorandom Generator from any One-way Function / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: On using the Fourier transform to learn disjoint DNF / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cryptographic hardness of distribution-specific learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning DNF in time / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational power of depth 2 circuits with threshold and modulo gates / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning Decision Trees Using the Fourier Spectrum / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant depth circuits, Fourier transform, and learnability / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(O(n^{\log \log n})\) learning algorithm for DNF under the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4856179 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness amplification within NP / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learning monotone log-term DNF formulas under the uniform distribution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3148827 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4247017 / rank
 
Normal rank

Latest revision as of 16:21, 10 June 2024

scientific article
Language Label Description Also known as
English
Learning DNF from random walks
scientific article

    Statements

    Learning DNF from random walks (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    10 October 2005
    0 references
    computational learning theory
    0 references
    noise sensitivity
    0 references
    disjunctive normal form formulas
    0 references
    DNF
    0 references
    random walks
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers