Composite geometric concepts and polynomial predictability
From MaRDI portal
Publication:1333260
DOI10.1006/inco.1994.1071zbMath0821.68102OpenAlexW1979866274MaRDI QIDQ1333260
Philip M. Long, Manfred K. Warmuth
Publication date: 3 October 1995
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/inco.1994.1071
Related Items
Learning unions of high-dimensional boxes over the reals, Learning an intersection of a constant number of halfspaces over a uniform distribution, On the complexity of function learning, An efficient membership-query algorithm for learning DNF with respect to the uniform distribution, Noise-tolerant parallel learning of geometric concepts
