Large margin classification using the perceptron algorithm
From MaRDI portal
Publication:1969320
DOI10.1023/A:1007662407062zbMath0944.68535WikidataQ55968102 ScholiaQ55968102MaRDI QIDQ1969320
Yoav Freund, Robert E. Schapire
Publication date: 5 September 2000
Published in: Machine Learning (Search for Journal in Brave)
Related Items
Error-probability noise benefits in threshold neural signal detection, Learning DNF in time \(2^{\widetilde O(n^{1/3})}\), Online passive-aggressive active learning, An algorithmic theory of learning: robust concepts and random projection, Kernels as features: on kernels, margins, and low-dimensional mappings, Reduction from Cost-Sensitive Ordinal Ranking to Weighted Binary Classification, A stochastic approach to handle resource constraints as knapsack problems in ensemble pruning, Fast and Robust Learning by Reinforcement Signals: Explorations in the Insect Brain, Inhibition in Multiclass Classification, Online Learning with (Multiple) Kernels: A Review, One-pass online learning: a local approach, Adaptive regularization of weight vectors, Improving kernel online learning with a snapshot memory, A learning rule for very simple universal approximators consisting of a single layer of perceptrons, Machine learning applied to asteroid dynamics, Discriminative Reranking for Natural Language Parsing, Maximal closed set and half-space separations in finite closure systems, Spiking neural networks modelled as timed automata: with parameter learning, PAMR: passive aggressive mean reversion strategy for portfolio selection, A kernel-based perceptron with dynamic memory, Online multiple kernel classification, Pegasos: primal estimated sub-gradient solver for SVM, Scale-free online learning, Learning Kernel Perceptrons on Noisy Data Using Random Projections, Computational geometry of positive definiteness, Dynamical memory control based on projection technique for online regression, Exploiting Cluster-Structure to Predict the Labeling of a Graph, Search-based structured prediction, Training parsers by inverse reinforcement learning, Fast learning of relational kernels, Sequential correction of linear classifiers, Online transfer learning, Provable Training of a ReLU Gate with an Iterative Non-Gradient Algorithm, Online Ranking by Projecting, Learning intersections of halfspaces with a margin, Optimal third root asymptotic bounds in the statistical estimation of thresholds, Unnamed Item, Towards easier and faster sequence labeling for natural language processing: a search-based probabilistic online learning framework (SAPO), Unsupervised ensemble minority clustering, An algorithmic theory of learning: Robust concepts and random projection, Learning with Kernels and Logical Representations, A deterministic rescaled perceptron algorithm, Stochastic separation theorems, Tracking the best hyperplane with a simple budget perceptron, A theory of learning with similarity functions, Learning quantized neural nets by coarse gradient method for nonlinear classification, Hadamard matrix guided online hashing, Scale-Free Algorithms for Online Linear Optimization, Online Linear Optimization for Job Scheduling Under Precedence Constraints, Blended coarse gradient descent for full quantization of deep neural networks, Unnamed Item, Unnamed Item, On the perceptron's compression, Unconfused ultraconservative multiclass algorithms, Similarity, kernels, and the fundamental constraints on cognition, The weighted majority algorithm
