Exact learning of multivalued dependency formulas

2018 ◽  
Vol 716 ◽  
pp. 4-14 ◽  
Author(s):  
Montserrat Hermo ◽  
Ana Ozaki
Keyword(s):  
Exact Learning ◽  
Multivalued Dependency

scholarly journals Exact Learning of RNA Energy Parameters From Structure

2015 ◽  
Vol 22 (6) ◽  
pp. 463-473 ◽  
Author(s):  
Hamidreza Chitsaz ◽  
Mohammad Aminisharifabad
Keyword(s):  
Energy Parameters ◽  
Exact Learning

scholarly journals Oracles and Queries That Are Sufficient for Exact Learning

1996 ◽  
Vol 52 (3) ◽  
pp. 421-433 ◽  
Author(s):  
Nader H. Bshouty ◽  
Richard Cleve ◽  
Ricard Gavaldà ◽  
Sampath Kannan ◽  
Christino Tamon
Keyword(s):  
Exact Learning

ORACLES IN $\Sigma^p_2$ ARE SUFFFICIENT FOR EXACT LEARNING

2000 ◽  
Vol 11 (04) ◽  
pp. 613-632 ◽  
Author(s):  
Johannes Köbler ◽  
Wolfgang Lindner
Keyword(s):  
Polynomial Time ◽  
Learning Model ◽  
Query Complexity ◽  
Boolean Circuits ◽  
Membership Queries ◽  
Exact Learning ◽  
Equivalence Queries

We study the learnability of representation classes in Angluin's exact learning model. In particular, we consider the following three query types: equivalence queries, equivalence and membership queries, and membership queries only. We show in all three cases that polynomial query complexity implies already polynomial-time learnability, provided that the learner additionally has access to an oracle in [Formula: see text]. It follows that boolean circuits are polynomial-time learnable with equivalence queries and the help of an oracle in [Formula: see text].a

Sign in / Sign up

Export Citation Format

Share Document