Pages that link to "Item:Q1009217"
From MaRDI portal
The following pages link to Unconditional lower bounds for learning intersections of halfspaces (Q1009217):
Displaying 14 items.
- The average sensitivity of an intersection of half spaces (Q347457) (← links)
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- A complete characterization of statistical query learning with applications to evolvability (Q439989) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- Notes on computational hardness of hypothesis testing: predictions using the low-degree likelihood ratio (Q2103494) (← links)
- On XOR lemmas for the weight of polynomial threshold functions (Q2280318) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- Statistical Query Algorithms for Mean Vector Estimation and Stochastic Convex Optimization (Q4575825) (← links)
- Learning Theory (Q4680888) (← links)
- (Q4808629) (← links)
