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

@@ Property / author @@
+Bartlett, Peter L.
@@ Property / author: Bartlett, Peter L. / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+On the difficulty of approximately maximizing agreements.
+Normal rank
@@ Property / cites work @@
+Strong universal consistency of neural network classifiers
+Normal rank
@@ Property / cites work @@
+Q3729902
@@ Property / cites work: Q3729902 / rank @@
+Normal rank
@@ Property / cites work @@
+Decision theoretic generalizations of the PAC model for neural net and other learning applications
+Normal rank
@@ Property / cites work @@
+Robust trainability of single neurons
@@ Property / cites work: Robust trainability of single neurons / rank @@
+Normal rank
@@ Property / cites work @@
+The computational intractability of training sigmoidal neural networks
+Normal rank
@@ Property / cites work @@
+Q4259987
@@ Property / cites work: Q4259987 / rank @@
+Normal rank
@@ Property / cites work @@
+Cryptographic limitations on learning Boolean formulae and finite automata
+Normal rank
@@ Property / cites work @@
+Efficient agnostic learning of neural networks with bounded fan-in
+Normal rank
@@ Property / cites work @@
+On the complexity of polyhedral separability
@@ Property / cites work: On the complexity of polyhedral separability / rank @@
+Normal rank
@@ Property / cites work @@
+Optimization, approximation, and complexity classes
+Normal rank
@@ Property / cites work @@
+The hardness of approximation: Gap location
@@ Property / cites work: The hardness of approximation: Gap location / rank @@
+Normal rank