Hardness results for neural network approximation problems (Q1603592): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(4 intermediate revisions by 3 users not shown)
Property / author
 
Property / author: Bartlett, Peter L. / rank
Normal rank
 
Property / author
 
Property / author: Bartlett, Peter L. / rank
 
Normal rank
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / 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: On the difficulty of approximately maximizing agreements. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Strong universal consistency of neural network classifiers / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3729902 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decision theoretic generalizations of the PAC model for neural net and other learning applications / 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: Cryptographic limitations on learning Boolean formulae and finite automata / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient agnostic learning of neural networks with bounded fan-in / 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: The hardness of approximation: Gap location / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:48, 4 June 2024

scientific article
Language Label Description Also known as
English
Hardness results for neural network approximation problems
scientific article

    Statements

    Identifiers