Pages that link to "Item:Q598257"
From MaRDI portal
The following pages link to Learning intersections and thresholds of halfspaces (Q598257):
Displayed 32 items.
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length (Q368235) (← links)
- On the hardness of learning intersections of two halfspaces (Q619909) (← links)
- Unconditional lower bounds for learning intersections of halfspaces (Q1009217) (← links)
- Noise stability and correlation with half spaces (Q1748919) (← links)
- The regularized least squares algorithm and the problem of learning halfspaces (Q1944907) (← links)
- Polynomial regression under arbitrary product distributions (Q1959600) (← links)
- Noise stability of weighted majority (Q1983068) (← links)
- The hardest halfspace (Q1983325) (← links)
- New cryptographic hardness for learning intersections of halfspaces over Boolean cubes with membership queries (Q2051795) (← links)
- A characterization of 2-threshold functions via pairs of prime segments (Q2136278) (← links)
- On XOR lemmas for the weight of polynomial threshold functions (Q2280318) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Learning intersections of halfspaces with a margin (Q2462501) (← links)
- Polynomial threshold functions and Boolean threshold circuits (Q2514146) (← links)
- Cryptographic hardness for learning intersections of halfspaces (Q2517820) (← links)
- Approximating Boolean Functions with Depth-2 Circuits (Q3451753) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- The Power of Asymmetry in Constant-Depth Circuits (Q4562278) (← links)
- Submodular Functions: Learnability, Structure, and Optimization (Q4564777) (← links)
- Average-Case Lower Bounds and Satisfiability Algorithms for Small Threshold Circuits (Q4568115) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC$^0$ (Q4957911) (← links)
- On the proliferation of support vectors in high dimensions* (Q5055426) (← links)
- Fooling Polytopes (Q5066946) (← links)
- A Short List of Equalities Induces Large Sign-Rank (Q5087014) (← links)
- (Q5091179) (← links)
- Agnostically Learning Boolean Functions with Finite Polynomial Representation (Q5136248) (← links)
- Algorithmic Polynomials (Q5138783) (← links)
- (Q5743387) (← links)
- (Q5743502) (← links)
- Approximating the Noise Sensitivity of a Monotone Boolean Function (Q5875511) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← links)