Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.jcss.2003.07.007 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1517311456 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Queries and concept learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Classification by polynomial surfaces / rank
 
Normal rank
Property / cites work
 
Property / cites work: The expressive power of voting polynomials / rank
 
Normal rank
Property / cites work
 
Property / cites work: A lower bound for perceptrons and an oracle separation of the \(PP^{PH}\) hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Rank-\(r\) decision trees are a subclass of \(r\)-decision lists / rank
 
Normal rank
Property / cites work
 
Property / cites work: A polynomial-time algorithm for learning noisy linear threshold functions / 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: Fast learning of \(k\)-term DNF formulas with queries. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: A subexponential exact learning algorithm for DNF using equivalence queries / rank
 
Normal rank
Property / cites work
 
Property / cites work: Worst-case analysis of the Perceptron and Exponentiated Update algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5543516 / 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 general lower bound on the number of examples needed for learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Boosting a weak learning algorithm by majority / rank
 
Normal rank
Property / cites work
 
Property / cites work: Large margin classification using the perceptron algorithm / rank
 
Normal rank
Property / cites work
 
Property / cites work: SeparatingPH fromPP by relativization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parity, circuits, and the polynomial-time hierarchy / rank
 
Normal rank
Property / cites work
 
Property / cites work: Majority gates vs. general weighted threshold gates / 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: Efficient noise-tolerant learning from statistical queries / 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: The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning monotone DNF formulae under uniform distributions / rank
 
Normal rank
Property / cites work
 
Property / cites work: On learning visual concepts and DNF formulae / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate inclusion-exclusion / 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: Q4505382 / 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
links / mardi / namelinks / mardi / name
 

Latest revision as of 15:33, 7 June 2024

scientific article
Language Label Description Also known as
English
Learning DNF in time \(2^{\widetilde O(n^{1/3})}\)
scientific article

    Statements

    Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (English)
    0 references
    0 references
    0 references
    22 November 2004
    0 references
    0 references
    Disjunctive Normal Form
    0 references
    Computational learning theory
    0 references
    Polynomial threshold function
    0 references
    0 references
    0 references
    0 references
    0 references