Pages that link to "Item:Q1384530"
From MaRDI portal
The following pages link to An efficient membership-query algorithm for learning DNF with respect to the uniform distribution (Q1384530):
Displaying 40 items.
- PACS, simple-PAC and query learning (Q294709) (← links)
- Reliable agnostic learning (Q439993) (← links)
- Learning intersections and thresholds of halfspaces (Q598257) (← links)
- Learning random monotone DNF (Q628302) (← links)
- Learning unions of \(\omega(1)\)-dimensional rectangles (Q950197) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- Learning large-alphabet and analog circuits with value injection queries (Q1009264) (← links)
- Selection of relevant features and examples in machine learning (Q1127357) (← links)
- Approximate location of relevant variables under the crossover distribution. (Q1422405) (← links)
- The monotone theory for the PAC-model. (Q1426003) (← links)
- Learnability of quantified formulas. (Q1426470) (← links)
- \(\mathrm{AC}^{0}\circ \mathrm{MOD}_{2}\) lower bounds for the Boolean inner product (Q1671999) (← links)
- A theory of formal synthesis via inductive learning (Q1674868) (← links)
- More efficient PAC-learning of DNF with membership queries under the uniform distribution (Q1878685) (← links)
- On learning monotone DNF under product distributions (Q1881232) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Learning DNF in time \(2^{\widetilde O(n^{1/3})}\) (Q1887713) (← links)
- The bounded injury priority method and the learnability of unions of rectangles (Q1919530) (← links)
- Low-complexity weak pseudorandom functions in \(\mathtt{AC}0[\mathtt{MOD}2]\) (Q2139645) (← links)
- Towards a proof of the Fourier-entropy conjecture? (Q2216459) (← links)
- Proper learning of \(k\)-term DNF formulas from satisfying assignments (Q2323349) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Quantum algorithms for learning and testing juntas (Q2462663) (← links)
- Extremal properties of polynomial threshold functions (Q2475403) (← links)
- Agnostic active learning (Q2517826) (← links)
- Learning DNF from random walks (Q2568457) (← links)
- Exact learning from an honest teacher that answers membership queries (Q2636406) (← links)
- A general dimension for query learning (Q2641869) (← links)
- Covert learning: how to learn with an untrusted intermediary (Q2697884) (← links)
- Breaking the Minsky--Papert Barrier for Constant-Depth Circuits (Q4554070) (← links)
- (Q4614114) (← links)
- Quantum Hardness of Learning Shallow Classical Circuits (Q4994987) (← links)
- Pseudo-Derandomizing Learning and Approximation (Q5009554) (← links)
- Pseudorandom Functions: Three Decades Later (Q5021131) (← links)
- (Q5743387) (← links)
- (Q5875378) (← links)
- Optimal bounds for sign-representing the intersection of two halfspaces by polynomials (Q5891428) (← 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)
- Learning a circuit by injecting values (Q5920703) (← links)
