Learning Integer Lattices
From MaRDI portal
Publication:3990652
DOI10.1137/0221019zbMath0747.68047OpenAlexW2081585469MaRDI QIDQ3990652
No author found.
Publication date: 28 June 1992
Published in: SIAM Journal on Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/0221019
Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Lattices (06B99)
Related Items (20)
Learning functions of \(k\) relevant variables ⋮ What Circuit Classes Can Be Learned with Non-Trivial Savings? ⋮ Efficient learning with equivalence queries of conjunctions of modulo functions ⋮ Learning intersection-closed classes with signatures ⋮ On PAC learning algorithms for rich Boolean function classes ⋮ Learning fallible deterministic finite automata ⋮ Learning counting functions with queries ⋮ Learning nested differences in the presence of malicious noise ⋮ Disjunctions of negated counting functions are efficiently learnable with equivalence queries ⋮ Teaching and Compressing for Low VC-Dimension ⋮ Unnamed Item ⋮ Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices ⋮ Learning nested differences in the presence of malicious noise ⋮ Learning nonsingular phylogenies and hidden Markov models ⋮ On the Fourier spectrum of symmetric Boolean functions ⋮ Partial observability and learnability ⋮ Commutative Regular Shuffle Closed Languages, Noetherian Property, and Learning Theory ⋮ General bounds on statistical query learning and PAC learning with noise via hypothesis boosting ⋮ Learning with restricted focus of attention ⋮ On learning embedded midbit functions
This page was built for publication: Learning Integer Lattices
