Efficient learning with virtual threshold gates
From MaRDI portal
Publication:1383714
DOI10.1006/inco.1997.2686zbMath0893.68127OpenAlexW2031979166MaRDI QIDQ1383714
Manfred K. Warmuth, Wolfgang Maass
Publication date: 26 April 1998
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://semanticscholar.org/paper/cb6211c56dab41b6043a1a8705350d557e93efb4
Related Items (6)
On approximating weighted sums with exponentially many terms ⋮ Learning unions of high-dimensional boxes over the reals ⋮ Learning unions of \(\omega(1)\)-dimensional rectangles ⋮ Agnostic learning of geometric patterns ⋮ Exact Learning of Discretized Geometric Concepts ⋮ Predicting nearly as well as the best pruning of a planar decision graph.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Exponentiated gradient versus gradient descent for linear predictors
- The Perceptron algorithm versus Winnow: linear versus logarithmic mistake bounds when few input variables are relevant
- Lower bound methods and separation results for on-line learning models
- The weighted majority algorithm
- Algorithms and lower bounds for on-line learning of geometrical concepts
- The bounded injury priority method and the learnability of unions of rectangles
- Learning from a consistently ignorant teacher
- Queries and concept learning
- Simulating access to hidden information while learning
- Learnability and the Vapnik-Chervonenkis dimension
- A theory of the learnable
- Universal Portfolios
- Sequential prediction of individual sequences under general loss functions
- On the Uniform Convergence of Relative Frequencies of Events to Their Probabilities
This page was built for publication: Efficient learning with virtual threshold gates
