The following pages link to Learning Integer Lattices (Q3990652):
Displaying 19 items.
- On learning embedded midbit functions (Q817826) (← links)
- On the Fourier spectrum of symmetric Boolean functions (Q987559) (← links)
- Partial observability and learnability (Q991012) (← links)
- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting (Q1271468) (← links)
- Learning with restricted focus of attention (Q1271613) (← links)
- Efficient learning with equivalence queries of conjunctions of modulo functions (Q1350223) (← links)
- Learning counting functions with queries (Q1390865) (← links)
- Learning nested differences in the presence of malicious noise (Q1390947) (← links)
- Learning functions of \(k\) relevant variables (Q1886314) (← links)
- Learning fallible deterministic finite automata (Q1900974) (← links)
- Learning intersection-closed classes with signatures (Q2381578) (← links)
- On PAC learning algorithms for rich Boolean function classes (Q2382283) (← links)
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory (Q3618571) (← links)
- Teaching and Compressing for Low VC-Dimension (Q4604393) (← links)
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices (Q4620294) (← links)
- What Circuit Classes Can Be Learned with Non-Trivial Savings? (Q4638080) (← links)
- Learning nonsingular phylogenies and hidden Markov models (Q5901107) (← links)
- Disjunctions of negated counting functions are efficiently learnable with equivalence queries (Q6085721) (← links)
- Statistical computational learning (Q6602226) (← links)
