A polynomial-time algorithm for learning noisy linear threshold functions (Q1271190): Difference between revisions

← Older edit

@@ Property / author @@
-Avrim L. Blum
@@ Property / author: Avrim L. Blum / rank @@
-Normal rank
@@ Property / author @@
-Q703071
@@ Property / author: Q703071 / rank @@
-Normal rank
@@ Property / author @@
-Ravindran Kannan
@@ Property / author: Ravindran Kannan / rank @@
-Normal rank
@@ Property / author @@
-Santosh Vempala
@@ Property / author: Santosh Vempala / rank @@
-Normal rank
@@ Property / Wikidata QID @@
+Q57401546
@@ Property / Wikidata QID: Q57401546 / rank @@
+Normal rank
@@ Property / author @@
+Avrim L. Blum
@@ Property / author: Avrim L. Blum / rank @@
+Normal rank
@@ Property / author @@
+Alan M. Frieze
@@ Property / author: Alan M. Frieze / rank @@
+Normal rank
@@ Property / author @@
+Ravindran Kannan
@@ Property / author: Ravindran Kannan / rank @@
+Normal rank
@@ Property / author @@
+Santosh Vempala
@@ Property / author: Santosh Vempala / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+Publication
@@ Property / MaRDI profile type: Publication / rank @@
+Normal rank
@@ Property / Recommended article @@
+Q5365141
@@ Property / Recommended article: Q5365141 / rank @@
+Normal rank
@@ Property / Recommended article: Q5365141 / qualifier @@
+Similarity Score: 0.86494887Amount 0.86494887
Unit 1
-Amount
+.86494887
 Unit
@@ Property / Recommended article: Q5365141 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Thresholding in learning theory
@@ Property / Recommended article: Thresholding in learning theory / rank @@
+Normal rank
@@ Property / Recommended article: Thresholding in learning theory / qualifier @@
+Similarity Score: 0.860769Amount 0.860769
Unit 1
-Amount
+.860769
 Unit
@@ Property / Recommended article: Thresholding in learning theory / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Uniform-Distribution Learnability of Noisy Linear Threshold Functions with Restricted Focus of Attention
+Normal rank
+Similarity Score: 0.8581841Amount 0.8581841
Unit 1
-Amount
+.8581841
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Learning Polynomials with Queries: The Highly Noisy Case
+Normal rank
+Similarity Score: 0.85651016Amount 0.85651016
Unit 1
-Amount
+.85651016
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q4013524
@@ Property / Recommended article: Q4013524 / rank @@
+Normal rank
@@ Property / Recommended article: Q4013524 / qualifier @@
+Similarity Score: 0.8464627Amount 0.8464627
Unit 1
-Amount
+.8464627
 Unit
@@ Property / Recommended article: Q4013524 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Bounding the average sensitivity and noise sensitivity of polynomial threshold functions
+Normal rank
+Similarity Score: 0.84641206Amount 0.84641206
Unit 1
-Amount
+.84641206
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Approximating Linear Threshold Predicates
+Normal rank
+Similarity Score: 0.8461658Amount 0.8461658
Unit 1
-Amount
+.8461658
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Approximating Linear Threshold Predicates
+Normal rank
+Similarity Score: 0.8461658Amount 0.8461658
Unit 1
-Amount
+.8461658
 Unit
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+Q5754614
@@ Property / Recommended article: Q5754614 / rank @@
+Normal rank
@@ Property / Recommended article: Q5754614 / qualifier @@
+Similarity Score: 0.8451867Amount 0.8451867
Unit 1
-Amount
+.8451867
 Unit
@@ Property / Recommended article: Q5754614 / qualifier @@
+Recommender Run: Recommender Run 2
@@ Property / Recommended article @@
+An efficient approach to compute the threshold for multi-dimensional linear classifiers
+Normal rank
+Similarity Score: 0.8420409Amount 0.8420409
Unit 1
-Amount
+.8420409
 Unit
+Recommender Run: Recommender Run 2