ECCC-Report TR96-061https://eccc.weizmann.ac.il/report/1996/061Comments and Revisions published for TR96-061en-usThu, 28 Nov 1996 11:10:34 +0200
Paper TR96-061
| Optimal attribute-efficient learning of disjunction, parity, and threshold functions |
Ryuhei Uehara,
Kensei Tsuchida,
Ingo Wegener
https://eccc.weizmann.ac.il/report/1996/061Decision trees are a very general computation model.
Here the problem is to identify a Boolean function $f$ out of a given
set of Boolean functions $F$ by asking for the value of $f$ at adaptively
chosen inputs.
For classes $F$ consisting of functions which may be obtained from one
function $g$ on $n$ inputs by replacing arbitrary $n-k$ inputs by given
constants this problem is known as attribute-efficient learning with $k$
essential attributes.
Results on general classes of functions are known.
More precise and often optimal results are presented for the cases
where $g$ is one of the functions disjunction, parity or threshold.
Thu, 28 Nov 1996 11:10:34 +0200https://eccc.weizmann.ac.il/report/1996/061