Weizmann Logo
Electronic Colloquium on Computational Complexity

Under the auspices of the Computational Complexity Foundation (CCF)

Login | Register | Classic Style

Reports tagged with query learning:
TR03-039 | 19th May 2003
Judy Goldsmith, Robert H. Sloan, Balázs Szörényi, György Turán

Theory Revision with Queries: Horn, Read-once, and Parity Formulas

A theory, in this context, is a Boolean formula; it is
used to classify instances, or truth assignments. Theories
can model real-world phenomena, and can do so more or less
The theory revision, or concept revision, problem is to
correct a given, roughly correct concept.
This problem is ... more >>>

TR05-082 | 3rd June 2005
Jorge Castro

On the Query Complexity of Quantum Learners

This paper introduces a framework for quantum exact learning via queries, the so-called quantum protocol. It is shown that usual protocols in the classical learning setting have quantum counterparts. A combinatorial notion, the general halving dimension, is also introduced. Given a quantum protocol and a target concept class, the general ... more >>>

ISSN 1433-8092 | Imprint