Learning Integer Lattices
From MaRDI portal
Recommendations
Cited in
(22)- General bounds on statistical query learning and PAC learning with noise via hypothesis boosting
- Learning with restricted focus of attention
- Efficient learning with equivalence queries of conjunctions of modulo functions
- Learning counting functions with queries
- Learning nested differences in the presence of malicious noise
- Learning functions of \(k\) relevant variables
- Learning fallible deterministic finite automata
- Learning intersection-closed classes with signatures
- On PAC learning algorithms for rich Boolean function classes
- Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory
- Teaching and Compressing for Low VC-Dimension
- Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices
- What circuit classes can be learned with non-trivial savings?
- Learning nested differences in the presence of malicious noise
- Disjunctions of negated counting functions are efficiently learnable with equivalence queries
- The VC-dimension of a class of multiples of the primes and a connection to AdaBoost
- Statistical computational learning
- Sample compression for real-valued learners
- Attribute-efficient learning of monomials over highly-correlated variables
- On learning embedded midbit functions
- On the Fourier spectrum of symmetric Boolean functions
- Partial observability and learnability
This page was built for publication: Learning Integer Lattices
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3990652)
