Attribute-efficient learning in query and mistake-bound models
暂无分享,去创建一个
[1] Ryuhei Uehara,et al. Optimal Attribute-Efficient Learning of Disjunction, Parity and Threshold Functions , 1997, EuroCOLT.
[2] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[3] Sampath Kannan,et al. Oracles and queries that are sufficient for exact learning (extended abstract) , 1994, COLT '94.
[4] Sampath Kannan. On the query complexity of learning , 1993, COLT '93.
[5] Noga Alon,et al. Construction of asymptotically good low-rate error-correcting codes through pseudo-random graphs , 1992, IEEE Trans. Inf. Theory.
[6] Sampath Kannan,et al. Oracles and Queries That Are Sufficient for Exact Learning , 1996, J. Comput. Syst. Sci..
[7] Johan Håstad,et al. Optimal Depth, Very Small Size Circuits for Symmetric Functions in AC0 , 1994, Inf. Comput..
[8] Michael Sipser,et al. Parity, circuits, and the polynomial-time hierarchy , 1981, 22nd Annual Symposium on Foundations of Computer Science (sfcs 1981).
[9] Lisa Hellerstein,et al. Learning in the presence of finitely or infinitely many irrelevant attributes , 1991, COLT '91.
[10] Marek Karpinski,et al. Learning read-once formulas with queries , 1993, JACM.
[11] J. Friedman. Constructing O(n log n) Size Monotone Formulae for the k-th Elementary Symmetric Polynomial of n Boolean Variables , 1984, FOCS.
[12] Ravi B. Boppana,et al. Amplification of probabilistic boolean formulas , 1985, 26th Annual Symposium on Foundations of Computer Science (sfcs 1985).
[13] János Komlós,et al. Storing a sparse table with O(1) worst case access time , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).
[14] Mark KLEIMAN,et al. An Explicit Construction of Short Monotone Formulae for the Monotone Symmetric Functions , 1978, Theor. Comput. Sci..