No article text was recorded for this version.
DNF learnability
Version 1 of 134 papers44 conceptsfrozen 2026-10-04
Papers in this version
- Blog: Tight Bounds on Proper Equivalence Query Learning of DNF
- Blog: A Query Algorithm for Agnostically Learning DNF?
- Blog: mu - biased quantum Fourier sampling
- Blog: Faster Algorithms for Agnostically Learning Disjunctions and their Implications
- Blog: New Results for Random Walk Learning
- Blog: Learning Disjunction of Conjunctions
- Blog: Open Problem: Meeting Times for Learning Random Automata
- Blog: DNF Learning via Locally Mixing Random Walks
- Blog: Learning Using Local Membership Queries
- Blog: Learning Neural Networks with Two Nonlinear Layers in Polynomial Time
- Blog: Learning Random Monotone DNF Under the Uniform Distribution
- Blog: Learning Economic Parameters from Revealed Preferences
- Blog: Inverse Problems in Approximate Uniform Generation
- Blog: On Learning Parallel Pancakes with Mostly Uniform Weights
- Blog: Learning What's Going on: Reconstructing Preferences and Priorities from Opaque Transactions
- Blog: Learning from satisfying assignments under continuous distributions
- Blog: Efficient Learning With Virtual Threshold Gates
- Blog: Sign-rank Can Increase under Intersection
- Blog: Projective DNF Formulae and Their Revision
- Blog: Hardness of learning DNFs using halfspaces
- Blog: Learning DNF through Generalized Fourier Representations
- Blog: Lower Bounds and Hardness Amplification for Learning Shallow Monotone Formulas
- Blog: Hardness of Agnostically Learning Halfspaces from Worst-Case Lattice Problems
- Blog: Min-CSPs on Complete Instances
- Blog: Learning boolean functions in an infinite attribute space
- Blog: Exact Learning of Lightweight Description Logic Ontologies
- Blog: An algorithmic theory of learning: Robust concepts and random projection
- Blog: Maximum Margin Algorithms with Boolean Kernels
- Blog: Polynomial Time Inductive Inference of Ordered Tree Patterns with Internal Structured Variables from Positive Data
- Blog: Noise-tolerant learning, the parity problem, and the statistical query model
- Blog: Universal guarantees for decision tree induction via a higher-order splitting criterion
- Blog: Improved Hardness Results for Learning Intersections of Halfspaces
- Blog: Agnostically Learning Halfspaces
- Blog: Toward Attribute Efficient Learning of Decision Lists and Parities
History & citation
Current · Permanent link
- This direction split from The Computational Hardness of Learning Disjunctive Normal Form (50% overlap)
Cite this direction
Latest version (a living page):
@misc{lacuna_dnf_learnability_ed5ef3b4,
title = {DNF learnability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dnf-learnability/rdr_ed5ef3b4e254498789377c649fd5208d},
note = {Latest version of a living research direction; cite a version for a fixed text. Accessed 2026-11-20},
}This exact version (version 1, frozen text):
@misc{lacuna_dnf_learnability_ed5ef3b4_v1,
title = {DNF learnability},
author = {{Lacuna}},
howpublished = {Lacuna research direction},
year = {2026},
url = {https://lacuna.tiptreesystems.com/direction/dnf-learnability/rdr_ed5ef3b4e254498789377c649fd5208d/v/1},
note = {Version 1, frozen 2026-10-04. Accessed 2026-11-20},
}