Perceptron, Winnow, and PAC Learning

No abstract is available for this paper.

• Publication year

  2002

• Venue

  SIAM journal on computing (Print)

• Publication date

  2002-05-01

• Fields of study

  Mathematics, Computer Science

• Identifiers
  DOI 10.1137/S0097539798340928
• External record

  Open on Semantic Scholar

• Source metadata

  Semantic Scholar

• No claims are published for this paper.

• No concepts are published for this paper.

• Large Margin Classification Using the Perceptron Algorithm

  1998cited by this paper
• Projection Learning

  1998cited by this paper
• Identification Criteria and Lower Bounds for Perceptron-Like Learning Rules

  1998cited by this paper
• Efficient Learning With Virtual Threshold Gates

  1995cited by this paper
• The perceptron algorithm vs. Winnow: linear vs. logarithmic mistake bounds when few input variables are relevant

  1995cited by this paper
• Tracking the Best Disjunction

  1995cited by this paper
• How fast can a threshold gate learn

  1994influential reference
• Circuit complexity and neural networks

  1994cited by this paper
• On the Size of Weights for Threshold Gates

  1994cited by this paper
• Circuits of the mind

  1994cited by this paper
• Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow

  1991cited by this paper
• Mistake bounds and logarithmic linear-threshold learning algorithms

  1990cited by this paper
• The Perceptron Algorithm is Fast for Nonmalicious Distributions

  1990cited by this paper
• Computational limitations on learning from examples

  1988cited by this paper
• Learning Quickly When Irrelevant Attributes Abound: A New Linear-Threshold Algorithm

  1987cited by this paper
• Linear function neurons: Structure and training

  1986cited by this paper
• A theory of the learnable

  1984cited by this paper
• Fast probabilistic algorithms for hamiltonian circuits and matchings

  1977cited by this paper
• Threshold logic and its applications

  1971cited by this paper
• Perceptrons: An Introduction to Computational Geometry

  1969cited by this paper
• Threshold Logic: A Synthesis Approach

  1965cited by this paper
• ON CONVERGENCE PROOFS FOR PERCEPTRONS

  1963cited by this paper
• Principles of neurodynamics

  1962cited by this paper
• The perceptron: a model for brain functioning. I

  1962cited by this paper

• Collaborative Compressors in Distributed Mean Estimation with Limited Communication Budget

  2026cites this paper
• The Perils of Being Unhinged: On the Accuracy of Classifiers Minimizing a Noise-Robust Convex Loss

  2021influential citation
• Parallelizing randomized convex optimization

  2015cites this paper
• On Exact Learning Halfspaces with Random Consistent Hypothesis Oracle

  2006cites this paper
• Toward Attribute Efficient Learning of Decision Lists and Parities

  2006cites this paper
• Linear-time Learning with Noise

  2005cites this paper
• Some Dichotomy Theorems for Neural Learning Problems

  2004cites this paper
• A simple polynomial-time rescaling algorithm for solving linear programs

  2004cites this paper
• Toward Attribute Efficient Learning Algorithms

  2003cites this paper
• Toward Attribute E cient Learning Algorithms

  year unknowncites this paper