On learning a union of half spaces (Q915490): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Learnability and the Vapnik-Chervonenkis dimension / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5556250 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4403756 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of loading shallow neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: A new polynomial-time algorithm for linear programming / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polyhedral separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5595902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Convergence of stochastic processes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5519782 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A theory of the learnable / rank
 
Normal rank

Latest revision as of 08:32, 21 June 2024

scientific article
Language Label Description Also known as
English
On learning a union of half spaces
scientific article

    Statements

    On learning a union of half spaces (English)
    0 references
    0 references
    1990
    0 references
    polynomial time
    0 references
    learnability
    0 references
    learning from examples
    0 references
    credit assignment problem
    0 references
    lower bounds on the number of examples
    0 references

    Identifiers