New degree bounds for polynomial threshold functions
From MaRDI portal
Recommendations
- New degree bounds for polynomial threshold functions
- Extremal properties of polynomial threshold functions
- Bounding the sensitivity of polynomial threshold functions
- scientific article; zbMATH DE number 5592923
- A regularity lemma and low-weight approximators for low-degree polynomial threshold functions
- On Improved Degree Lower Bounds for Polynomial Approximation.
- A new polynomial bound and its efficiency
- scientific article; zbMATH DE number 18831
- scientific article; zbMATH DE number 2212146
- F-pure thresholds of homogeneous polynomials
Cited in
(15)- Unconditional lower bounds for learning intersections of halfspaces
- Polynomial regression under arbitrary product distributions
- On PAC learning algorithms for rich Boolean function classes
- Learning intersections of halfspaces with a margin
- Extremal properties of polynomial threshold functions
- Polynomial threshold functions and Boolean threshold circuits
- Polynomial threshold functions and Boolean threshold circuits
- Learning and lower bounds for AC\(^{0}\) with threshold gates
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
- Sign-rank can increase under intersection
- scientific article; zbMATH DE number 7250146 (Why is no real title available?)
- Breaking the Minsky-Papert barrier for constant-depth circuits
- Hardness results for agnostically learning low-degree polynomial threshold functions
- The intersection of two halfspaces has high threshold degree
- New degree bounds for polynomial threshold functions
This page was built for publication: New degree bounds for polynomial threshold functions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5901091)
