Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
Learning Large-Alphabet and Analog Circuits with Value Injection Queries
 

Summary: Learning Large-Alphabet and Analog Circuits
with Value Injection Queries
Dana Angluin1
, James Aspnes1,
, Jiang Chen2,
, and Lev Reyzin1,
1
Computer Science Department, Yale University
{angluin,aspnes}@cs.yale.edu, lev.reyzin@yale.edu
2
Center for Computational Learning Systems, Columbia University
criver@cs.columbia.edu
Abstract. We consider the problem of learning an acyclic discrete cir-
cuit with n wires, fan-in bounded by k and alphabet size s using value
injection queries. For the class of transitively reduced circuits, we de-
velop the Distinguishing Paths Algorithm, that learns such a circuit us-
ing (ns)O(k)
value injection queries and time polynomial in the number
of queries. We describe a generalization of the algorithm to the class of
circuits with shortcut width bounded by b that uses (ns)O(k+b)

  

Source: Aspnes, James - Department of Computer Science, Yale University

 

Collections: Computer Technologies and Information Sciences