Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > EXACT LEARNING:
Reports tagged with Exact Learning:
TR02-019 | 20th March 2002

#### On the proper learning of axis parallel concepts

We study the proper learnability of axis parallel concept classes
in the PAC learning model and in the exact learning model with
membership and equivalence queries. These classes include union of boxes,
DNF, decision trees and multivariate polynomials.

For the {\it constant} dimensional axis parallel concepts $C$
we ... more >>>

TR14-058 | 20th April 2014
Ilya Volkovich

#### On Learning, Lower Bounds and (un)Keeping Promises

We extend the line of research initiated by Fortnow and Klivans \cite{FortnowKlivans09} that studies the relationship between efficient learning algorithms and circuit lower bounds. In \cite{FortnowKlivans09}, it was shown that if a Boolean circuit class $\mathcal{C}$ has an efficient \emph{deterministic} exact learning algorithm, (i.e. an algorithm that uses membership and ... more >>>

ISSN 1433-8092 | Imprint