Toward attribute efficient learning of decision lists and parities
From MaRDI portal
Recommendations
Cited in
(21)- Learning customized and optimized lists of rules with mathematical programming
- Lower bounds on learning decision lists and trees
- Classification with guaranteed probability of error
- On the fusion of threshold classifiers for categorization and dimensionality reduction
- Hardness amplification and the approximate degree of constant-depth circuits
- A small decrease in the degree of a polynomial with a given sign function can exponentially increase its weight and length
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits
- The power of asymmetry in constant-depth circuits
- Lower bounds on learning decision lists and trees
- Learning Theory
- Near-Optimal Lower Bounds on the Threshold Degree and Sign-Rank of AC^0
- Approximate degree and the complexity of depth three circuits
- A short list of equalities induces large sign-rank
- A nearly optimal lower bound on the approximate degree of \(\mathrm{AC}^0\)
- The polynomial method strikes back: tight quantum query bounds via dual polynomials
- Computational sample complexity and attribute-efficient learning
- Improved learning of \(k\)-parities
- Properly learning decision trees in almost polynomial time
- Approximate degree composition for recursive functions
- Attribute-efficient learning of monomials over highly-correlated variables
- Learning stochastic decision trees
This page was built for publication: Toward attribute efficient learning of decision lists and parities
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3093360)
