An unfeasibility view of neural network learning (Q2685066): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Neural Network Learning / rank
 
Normal rank
Property / cites work
 
Property / cites work: Quiz games as a model for information hiding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Complexity of cylindrical decompositions of sub-Pfaffian / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3110218 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Sur la complexité du principe de Tarski-Seidenberg / rank
 
Normal rank
Property / cites work
 
Property / cites work: Multilayer feedforward networks are universal approximators / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the computational complexity and geometry of the first-order theory of the reals. I: Introduction. Preliminaries. The geometry of semi-algebraic sets. The decision problem for the existential theory of the reals / rank
 
Normal rank

Latest revision as of 13:42, 31 July 2024

scientific article
Language Label Description Also known as
English
An unfeasibility view of neural network learning
scientific article

    Statements

    An unfeasibility view of neural network learning (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    17 February 2023
    0 references
    0 references
    multilayer neural network
    0 references
    activation function
    0 references
    continuously differentiable function
    0 references
    machine learning
    0 references
    complexity lower bound
    0 references
    epicycle
    0 references
    0 references
    0 references