Learning large-alphabet and analog circuits with value injection queries
From MaRDI portal
Publication:1009264
DOI10.1007/s10994-008-5048-8zbMath1470.68051MaRDI QIDQ1009264
Lev Reyzin, James Aspnes, Jiang Chen, Dana Angluin
Publication date: 31 March 2009
Published in: Machine Learning (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10994-008-5048-8
68Q32: Computational learning theory
68T05: Learning and adaptive systems in artificial intelligence
Related Items
Optimally learning social networks with activations and suppressions, Completing Networks Using Observed Data
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Learning conjunctions of Horn clauses
- An efficient membership-query algorithm for learning DNF with respect to the uniform distribution
- Identification of genetic networks by strategic gene disruptions and gene overexpressions under a Boolean model.
- When won't membership queries help?
- Exact learning Boolean functions via the monotone theory
- Constant depth circuits, Fourier transform, and learnability
- Learnability beyond AC 0
- Learning read-once formulas with queries
- Cryptographic limitations on learning Boolean formulae and finite automata
- Color-coding
- Cryptographic hardness of distribution-specific learning
- Learning Large-Alphabet and Analog Circuits with Value Injection Queries
- The Transitive Reduction of a Directed Graph
- Learning a circuit by injecting values
