Generalized teaching dimensions and the query complexity of learning
暂无分享,去创建一个
[1] Lisa Hellerstein,et al. How many queries are needed to learn? , 1995, JACM.
[2] Tibor Hegedűs,et al. On training simple neural networks and small-weight neurons , 1994 .
[3] Tibor Hegedűs,et al. Geometrical concept learning and convex polytopes , 1994, COLT 1994.
[4] Sampath Kannan,et al. Oracles and queries that are sufficient for exact learning (extended abstract) , 1994, COLT '94.
[5] Philip M. Long,et al. Simulating access to hidden information while learning , 1994, STOC '94.
[6] Ricard Gavaldà,et al. On the power of equivalence queries , 1994, EuroCOLT.
[7] Yoshiyasu Ishigami,et al. The VC-Dimensions of Finite Automata with n States , 1993, ALT.
[8] Sampath Kannan. On the query complexity of learning , 1993, COLT '93.
[9] Nader H. Bshouty,et al. Asking questions to minimize errors , 1993, COLT '93.
[10] Michael E. Saks,et al. Combinatorial characterization of read-once formulae , 1993, Discret. Math..
[11] Marek Karpinski,et al. Learning read-once formulas with queries , 1993, JACM.
[12] Nader H. Bshouty,et al. On the exact learning of formulas in parallel , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[13] Lisa Hellerstein,et al. Read-thrice DNF is hard to learn with membership and equivalence queries , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.
[14] Wolfgang Maass,et al. Fast identification of geometric objects with membership queries , 1991, COLT '91.
[15] Michael Kearns,et al. On the complexity of teaching , 1991, COLT '91.
[16] Michael Frazier,et al. Learning conjunctions of Horn clauses , 1990, Proceedings [1990] 31st Annual Symposium on Foundations of Computer Science.
[17] Wolfgang Maass,et al. On the complexity of learning from counterexamples , 1989, 30th Annual Symposium on Foundations of Computer Science.
[18] Ronald L. Rivest,et al. Inference of finite automata using homing sequences , 1989, STOC '89.
[19] Dana Angluin,et al. Learning Regular Sets from Queries and Counterexamples , 1987, Inf. Comput..
[20] N. Littlestone. Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm , 1987, 28th Annual Symposium on Foundations of Computer Science (sfcs 1987).
[21] Thomas M. Cover,et al. Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition , 1965, IEEE Trans. Electron. Comput..
[22] A. Nerode,et al. Linear automaton transformations , 1958 .