Under the auspices of the Computational Complexity Foundation (CCF)

REPORTS > KEYWORD > ATTRIBUTE-EFFICIENT LEARNING:
Reports tagged with attribute-efficient learning:
TR09-060 | 4th June 2009
Harry Buhrman, David García Soriano, Arie Matsliah

#### Learning parities in the mistake-bound model.

We study the problem of learning parity functions that depend on at most $k$ variables ($k$-parities) attribute-efficiently in the mistake-bound model.
We design simple, deterministic, polynomial-time algorithms for learning $k$-parities with mistake bound $O(n^{1-\frac{c}{k}})$, for any constant $c > 0$. These are the first polynomial-time algorithms that learn $\omega(1)$-parities in ... more >>>

TR12-056 | 1st May 2012
Rocco Servedio, Li-Yang Tan, Justin Thaler

#### Attribute-Efficient Learning and Weight-Degree Tradeoffs for Polynomial Threshold Functions

Revisions: 1

We study the challenging problem of learning decision lists attribute-efficiently, giving both positive and negative results.

Our main positive result is a new tradeoff between the running time and mistake bound for learning length-$k$ decision lists over $n$ Boolean variables. When the allowed running time is relatively high, our new ... more >>>

ISSN 1433-8092 | Imprint