Learning parities in the mistake-bound model
暂无分享,去创建一个
Harry Buhrman | Arie Matsliah | David García-Soriano | H. Buhrman | A. Matsliah | David García-Soriano
[1] Larry J. Stockmeyer,et al. The complexity of approximate counting , 1983, STOC.
[2] Avrim Blum,et al. Separating distribution-free and mistake-bound learning models over the Boolean domain , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[3] Manuel Blum,et al. Secure Human Identification Protocols , 2001, ASIACRYPT.
[4] Nick Littlestone,et al. From on-line to batch learning , 1989, COLT '89.
[5] Avrim Blum,et al. On-line Algorithms in Machine Learning , 1996, Online Algorithms.
[7] Dana Angluin,et al. Queries and concept learning , 1988, Machine Learning.
[8] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[9] Noga Alon,et al. Deterministic Approximation Algorithms for the Nearest Codeword Problem , 2009, APPROX-RANDOM.
[10] Rocco A. Servedio,et al. Toward Attribute Efficient Learning of Decision Lists and Parities , 2006, J. Mach. Learn. Res..