Learning $$AC^0$$ Under k-Dependent Distributions (Q2988821): Difference between revisions

@@ Property / full work available at URL @@
+https://doi.org/10.1007/978-3-319-55911-7_14
+Normal rank
@@ Property / OpenAlex ID @@
+W2600155308
@@ Property / OpenAlex ID: W2600155308 / rank @@
+Normal rank
@@ Property / cites work @@
+The expressive power of voting polynomials
@@ Property / cites work: The expressive power of voting polynomials / rank @@
+Normal rank
@@ Property / cites work @@
+When do extra majority gates help? Polylog\((N)\) majority gates are equivalent to one
+Normal rank
@@ Property / cites work @@
+Polynomial regression under arbitrary product distributions
+Normal rank
@@ Property / cites work @@
+The average sensitivity of bounded-depth circuits
@@ Property / cites work: The average sensitivity of bounded-depth circuits / rank @@
+Normal rank
@@ Property / cites work @@
+Hardness Amplification and the Approximate Degree of Constant-Depth Circuits
+Normal rank
@@ Property / cites work @@
+Learning and Lower Bounds for AC 0 with Threshold Gates
+Normal rank
@@ Property / cites work @@
+Threshold circuits of bounded depth
@@ Property / cites work: Threshold circuits of bounded depth / rank @@
+Normal rank
@@ Property / cites work @@
+Q4636465
@@ Property / cites work: Q4636465 / rank @@
+Normal rank
@@ Property / cites work @@
+A slight sharpening of LMN
@@ Property / cites work: A slight sharpening of LMN / 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 @@
+Agnostically Learning Halfspaces
@@ Property / cites work: Agnostically Learning Halfspaces / rank @@
+Normal rank
@@ Property / cites work @@
+Toward efficient agnostic learning
@@ Property / cites work: Toward efficient agnostic learning / rank @@
+Normal rank
@@ Property / cites work @@
+Constant depth circuits, Fourier transform, and learnability
+Normal rank
@@ Property / cites work @@
+Probabilistic polynomials, AC\(^ 0\) functions and the polynomial-time hierarchy
+Normal rank
@@ Property / cites work @@
+Counting Classes are at Least as Hard as the Polynomial-Time Hierarchy
+Normal rank
@@ Property / cites work @@
+A theory of the learnable
@@ Property / cites work: A theory of the learnable / rank @@
+Normal rank