Corpus ID: 14378503

Learning DNF Expressions from Fourier Spectrum

@article{Feldman2012LearningDE,
  title={Learning DNF Expressions from Fourier Spectrum},
  author={Vitaly Feldman},
  journal={ArXiv},
  year={2012},
  volume={abs/1203.0594}
}
  • Vitaly Feldman
  • Published 2012
  • Computer Science, Mathematics
  • ArXiv
  • Since its introduction by Valiant in 1984, PAC learning of DNF expressions remains one of the central problems in learning theory. We consider this problem in the setting where the underlying distribution is uniform, or more generally, a product distribution. Kalai, Samorodnitsky and Teng (2009) showed that in this setting a DNF expression can be efficiently approximated from its "heavy" low-degree Fourier coefficients alone. This is in contrast to previous approaches where boosting was used… CONTINUE READING

    Citations

    Publications citing this paper.
    SHOWING 1-10 OF 14 CITATIONS

    Hardness of Learning DNFs using Halfspaces

    Efficient learning algorithms with limited information

    VIEW 2 EXCERPTS
    CITES METHODS

    Learning Using Local Membership Queries

    VIEW 1 EXCERPT
    CITES METHODS

    A Bayesian Framework for Learning Rule Sets for Interpretable Classification

    VIEW 1 EXCERPT
    CITES BACKGROUND

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 25 REFERENCES

    Learning and Smoothed Analysis

    VIEW 23 EXCERPTS
    HIGHLY INFLUENTIAL

    An efficient membership-query algorithm for learning DNF with respect to the uniform distribution

    • Jeffrey C. Jackson
    • Computer Science
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994

    Boosting and Hard-Core Set Construction

    VIEW 2 EXCERPTS

    On the learnability of disjunctive normal form formulas

    VIEW 7 EXCERPTS
    HIGHLY INFLUENTIAL

    Attribute-Efficient and Non-adaptive Learning of Parities and DNF Expressions

    VIEW 1 EXCERPT

    Learning DNF in time 2Õ(n1/3)

    VIEW 2 EXCERPTS