On the difficulty of approximately maximizing agreements. (Q1401958): Difference between revisions

@@ Property / cites work @@
+The complexity and approximability of finding maximum feasible subsystems of linear relations
+Normal rank
@@ Property / cites work @@
+The hardness of approximate optima in lattices, codes, and systems of linear equations
+Normal rank
@@ Property / cites work @@
+Learnability and the Vapnik-Chervonenkis dimension
+Normal rank
@@ Property / cites work @@
+Computing the maximum bichromatic discrepancy, with applications to computer graphics and machine learning
+Normal rank
@@ Property / cites work @@
+Q4228484
@@ Property / cites work: Q4228484 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4526964
@@ Property / cites work: Q4526964 / 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 @@
+Tracking drifting concepts by minimizing disagreements
+Normal rank
@@ Property / cites work @@
+Robust trainability of single neurons
@@ Property / cites work: Robust trainability of single neurons / rank @@
+Normal rank
@@ Property / cites work @@
+Learning in the Presence of Malicious Errors
@@ Property / cites work: Learning in the Presence of Malicious Errors / rank @@
+Normal rank
@@ Property / cites work @@
+Cryptographic limitations on learning Boolean formulae and finite automata
+Normal rank
@@ Property / cites work @@
+Toward efficient agnostic learning
@@ Property / cites work: Toward efficient agnostic learning / rank @@
+Normal rank
@@ Property / cites work @@
+Cryptographic hardness of distribution-specific learning
+Normal rank
@@ Property / cites work @@
+Computational limitations on learning from examples
+Normal rank