A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Import240304020342 (talk | contribs)
Set profile property.
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Avrim L. Blum / rank
Normal rank
 
Property / author
 
Property / author: Q703071 / rank
Normal rank
 
Property / author
 
Property / author: Ravindran Kannan / rank
Normal rank
 
Property / author
 
Property / author: Santosh Vempala / rank
Normal rank
 
Property / Wikidata QID
 
Property / Wikidata QID: Q57401546 / rank
 
Normal rank
Property / author
 
Property / author: Avrim L. Blum / rank
 
Normal rank
Property / author
 
Property / author: Alan M. Frieze / rank
 
Normal rank
Property / author
 
Property / author: Ravindran Kannan / rank
 
Normal rank
Property / author
 
Property / author: Santosh Vempala / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 02:45, 5 March 2024

scientific article
Language Label Description Also known as
English
A polynomial-time algorithm for learning noisy linear threshold functions
scientific article

    Statements

    A polynomial-time algorithm for learning noisy linear threshold functions (English)
    0 references
    0 references
    11 November 1998
    0 references
    perceptron algorithm
    0 references
    learning
    0 references
    greedy algorithms
    0 references
    linear threshold functions
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers