Pages that link to "Item:Q1887713"
From MaRDI portal
The following pages link to Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713):
Displayed 8 items.
- The Gaussian surface area and noise sensitivity of degree-\(d\) polynomial threshold functions (Q645127) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- Improved MCMC sampling methods for estimating weighted sums in Winnow with application to DNF learning (Q1009287) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- The unbounded-error communication complexity of symmetric functions (Q2428632) (← links)
- Maximum patterns in datasets (Q2478429) (← links)
- Exact learning of DNF formulas using DNF hypotheses (Q5916223) (← links)
- Hardness of approximate two-level logic minimization and PAC learning with membership queries (Q5920702) (← links)