On Learning Ring-Sum-Expansions

DOI10.1137/0221014zbMath0743.68114OpenAlexW2088776358MaRDI QIDQ3990109

Hans Ulrich Simon, Paul Fischer

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/0221014

zbMATH Keywords

Boolean functionspac-learningVapnik-Chervonenkis-dimensionworst case mistake bound

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Related Items (12)

What Circuit Classes Can Be Learned with Non-Trivial Savings? ⋮ Efficient learning with equivalence queries of conjunctions of modulo functions ⋮ On PAC learning algorithms for rich Boolean function classes ⋮ Learning fallible deterministic finite automata ⋮ Error-free and best-fit extensions of partially defined Boolean functions ⋮ Learning counting functions with queries ⋮ Almost optimal proper learning and testing polynomials ⋮ Efficiently testing sparse \(\text{GF}(2)\) polynomials ⋮ Efficient and effective quantum compiling for entanglement-based machine learning on IBM Q devices ⋮ Partial observability and learnability ⋮ Exploiting random walks for learning ⋮ On learning embedded midbit functions

This page was built for publication: On Learning Ring-Sum-Expansions