Pages that link to "Item:Q676245"
From MaRDI portal
The following pages link to On the limits of proper learnability of subclasses of DNF formulas (Q676245):
Displaying 15 items.
- Integer equal flows (Q833591) (← links)
- Self-improved gaps almost everywhere for the agnostic approximation of monomials (Q884469) (← links)
- Learning conditional preference networks (Q991013) (← links)
- Complexity theoretic hardness results for query learning (Q1266164) (← links)
- The learnability of exclusive-or expansions based on monotone DNF formulas (Q1575458) (← links)
- On learning formulas in the limit and with assurance. (Q1607074) (← links)
- The learnability of unions of two rectangles in the two-dimensional discretized space (Q1807675) (← links)
- A subexponential exact learning algorithm for DNF using equivalence queries (Q1847366) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- The complexity of properly learning simple concept classes (Q2462500) (← links)
- 10.1162/153244304322972676 (Q3159782) (← links)
- (Q3174124) (← links)
- Learning Theory (Q5473638) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- An optimal algorithm for proper learning of unions of two rectangles with queries (Q6085720) (← links)