Abstract
We address the problem of nonadaptive learning of Boolean functions with few relevant variables by membership queries. In another recent paper [7] we have characterized those assignment families (query sets) which are sufficient for nonadaptive learning of this function class, and we studied the query number. However, the reconstruction of the given Boolean function from the obtained responses is an important matter as well in applying such nonadaptive strategies. The computational amount for this is apparently too high if we use our query families in a straightforward way. Therefore we introduce algorithms where also the computational complexity is reasonable, rather than the query number only. The idea is to apply our assignment families to certain coarsenings of the given Boolean function, followed by simple search and verification routines.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
D.J. Balding, D.C. Torney: A comparative survey of non-adaptive pooling designs, in:Genetic Mapping and DNA Sequencing, IMA Volumes in Mathematics and Its Applications, Springer 1995, 133–155
D.J. Balding, D.C. Torney: Optimal pooling designs with error detection, J. of Com-binatorial Theory A 74 (1996), 131–140
A. Blum, L. Hellerstein, N. Littlestone: Learning in the presence of finitely or infinitely many irrelevant attributes, J. of Computer and System Sciences 50 (1995), 32–40
N.H. Bshouty, R. Cleve: On the exact learning of formulas in parallel, 33rd IEEE Symposium on Foundations of Computer Science FOCS (1992), 513–522
N.H. Bshouty, L. Hellerstein: Attribute-efficient learning in query and mistake-bound models, 9th Computational Learning Theory COLT (1996), 235–243
C.J. Colbourn, J.H. Dinitz: The CRC Handbook of Combinatorial Designs, CRC Press 1996, Section V6.1:Nonadaptive group testing
P. Damaschke: Adaptive vs.nonadaptive attribute-efficient learning,preliminary version in:30th ACM Symposium on Theory of Computing STOC (1998), 590–596
A. Dhagat, L. Hellerstein: PAC learning with irrelevant attributes, 35th IEEE Sym-posium on Foundations of Computer Science FOCS (1994), 64–74
D.Z. Du, F.K. Hwang: Combinatorial Group Testing and Its Applications, World Scientific 1993
M. Farach, S. Kannan, E. Knill, S. Muthukrishnan: Group testing problems in experimental molecular biology, Proc. of Sequences’97
S. Goldman, M. Kearns: On the complexity of teaching, J. of Computer and System Sciences 50 (1995), 20–31
S. Goldman, M. Kearns, R. Schapire: Exact identification of read-once formulas using fixed points of amplification functions, SIAM J. of Computing 22 (1993), 705–726
T. Hegedüs: Combinatorial results on the complexity of teaching and learning, 19th Symposium on Mathematical Foundations of Computer Science MFCS (1994), LNCS 841 (Springer), 393–402
T. Hegedüs, P. Indyk: On learning disjunctions of zero-one threshold functions with queries, 8th Workshop on Algorithmic Learning Theory ALT (1997), LNAI 1316 (Springer), 446–460
N. Littlestone: Learning quickly when irrelevant attributes abound: A linear threshold algorithm, Machine Learning 2 (1988), 285–318
R. Motwani, P. Raghavan: Randomized Algorithms, Cambridge Univ. Press 1995
M. Naor, L.J. Schulman, A. Srinivasan: Splitters and near-optimal derandomization, 36th IEEE Symposium on Foundations of Computer Science FOCS (1995), 182–191
G. Seroussi, N.H. Bshouty: Vector sets for exhaustive testing of logic circuits, IEEE Transactions on Information Theory 34 (1988), 513–522
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 1998 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Damaschke, P. (1998). Computational Aspects of Parallel Attribute-Efficient Learning. In: Richter, M.M., Smith, C.H., Wiehagen, R., Zeugmann, T. (eds) Algorithmic Learning Theory. ALT 1998. Lecture Notes in Computer Science(), vol 1501. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49730-7_8
Download citation
DOI: https://doi.org/10.1007/3-540-49730-7_8
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65013-3
Online ISBN: 978-3-540-49730-1
eBook Packages: Springer Book Archive