On approximate learning by multi-layered feedforward circuits (Q2581366): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(5 intermediate revisions by 4 users not shown)
Property / author
 
Property / author: Bhaskar Das Gupta / rank
Normal rank
 
Property / author
 
Property / author: Barbara Hammer / rank
Normal rank
 
Property / author
 
Property / author: Bhaskar Das Gupta / rank
 
Normal rank
Property / author
 
Property / author: Barbara Hammer / rank
 
Normal rank
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.tcs.2005.09.008 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2121678276 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The complexity and approximability of finding maximum feasible subsystems of linear relations / rank
 
Normal rank
Property / cites work
 
Property / cites work: The hardness of approximate optima in lattices, codes, and systems of linear equations / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4258216 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4039803 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hardness results for neural network approximation problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839059 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4091004 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q2747613 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839060 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Robust trainability of single neurons / rank
 
Normal rank
Property / cites work
 
Property / cites work: The computational intractability of training sigmoidal neural networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4259987 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimization problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4839054 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finiteness results for sigmoidal “neural” networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the complexity of polyhedral separability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization, approximation, and complexity classes / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4894121 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedforward nets for interpolation and classification / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4253255 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 14:51, 11 June 2024

scientific article
Language Label Description Also known as
English
On approximate learning by multi-layered feedforward circuits
scientific article

    Statements

    On approximate learning by multi-layered feedforward circuits (English)
    0 references
    10 January 2006
    0 references
    Neural networks
    0 references
    Loading problem
    0 references
    NP-hardness
    0 references
    Approximation
    0 references
    0 references
    0 references

    Identifiers