On learning a union of half spaces

@article{Baum1990OnLA,
  title={On learning a union of half spaces},
  author={Eric B. Baum},
  journal={J. Complexity},
  year={1990},
  volume={6},
  pages={67-101}
}
In Valiant’s protocol for learning, the classes of functions which are known learnable in polynomial time are all trivial in the sense that they require no solution of a credit assignment problem (CAP)-either they can be learned using one type of example only (positive or negative), or they are learned by straightforward application of linear programming, or they are constructed so as to be learned by a greedy algorithm. Conversely, there is no natural class of finite Vapnik-Chervonenkis… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-10 of 23 references

A learning procedure for asymmetric threshold networks

  • LE CUNY.
  • Proc. Cognitiva
  • 1985
Highly Influential
7 Excerpts

Learning Boolean Formulae or Finite Automata Is as Hard as Factoring,

  • M. KEARNS, L. VALIANT
  • 1988

Similar Papers

Loading similar papers…