DOCSLIB.ORG

Bandit Multiclass Linear Classification: Efficient Algorithms

Total Page：16

File Type：pdf, Size：1020Kb

Download full-text PDF Read full-text
Bandit Multiclass Linear Classification: Efficient Algorithms Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case Alina Beygelzimer* 1 David´ Pal´ * 1 Balazs´ Szor¨ enyi´ * 1 Devanathan Thiruvenkatachari* 2 Chen-Yu Wei* 3 Chicheng Zhang* 4 Abstract and reveals the feature vector xt to the learner. Upon re- ceiving xt, the learner makes a prediction ybt and receives We study the problem of efficient online multi- feedback. In contrast with the standard full-information class linear classification with bandit feedback, setting, where the feedback given is the correct label yt, where all examples belong to one of K classes here the feedback is only a binary indicator of whether the and lie in the d-dimensional Euclidean space. prediction was correct or not. The protocol of the problem Previous works have left open the challenge of is formally stated below. designing efficient algorithms with finite mistake bounds when the data is linearly separable by a Protocol 1 ONLINE MULTICLASS LINEAR CLASSIFICA- margin γ. In this work, we take a first step to- TION WITH BANDIT FEEDBACK wards this problem. We consider two notions of Require: Number of classes K, number of rounds T . linear separability, strong and weak. Require: Inner product space (V; h·; ·i). for t = 1; 2;:::;T do 1. Under the strong linear separability condi- Adversary chooses example (x ; y ) 2 V × tion, we design an efficient algorithm that t t f1; 2;:::;Kg where x is revealed to the learner. achieves a near-optimal mistake bound of t 2 Predict class label ybt 2 f1; 2;:::;Kg. O K/γ . 1 Observe feedback zt = [ybt 6= yt] 2 f0; 1g. 2. Under the more challenging weak linear separability condition, we design an effi- The performance of the learner is measured by its cumu- cient algorithm with a mistake bound of PT PT p lative number of mistakes zt = 1 [yt 6= yt], 2 t=1 t=1 b min(2Oe(K log (1/γ)); 2Oe( 1/γ log K)).1 Our where 1 denotes the indicator function. algorithm is based on kernel Perceptron and In this paper, we focus on the special case when the ex- is inspired by the work of Klivans & Serve- d dio(2008) on improperly learning intersec- amples chosen by the adversary lie in R and are linearly tion of halfspaces. separable with a margin. We introduce two notions of lin- ear separability, weak and strong, formally stated in Defi- nition 1. The standard notion of multiclass linear separa- bility (Crammer & Singer, 2003) corresponds to the weak 1. Introduction linear separability. For multiclass classification with K We study the problem of ONLINE MULTICLASS LINEAR classes, weak linear separability requires that all examples arXiv:1902.02244v2 [cs.LG] 18 Jun 2019 CLASSIFICATION WITH BANDIT FEEDBACK (Kakade from the same class lie in an intersection of K − 1 halfs- et al., 2008). The problem can be viewed as a repeated paces and all other examples lie in the complement of the game between a learner and an adversary. At each time intersection of the halfspaces. Strong linear separability means that examples from each class are separated from step t, the adversary chooses a labeled example (xt; yt) the remaining examples by a single hyperplane. *The authors are listed in alphabetical order. 1Yahoo Research, New York, NY, USA 2New York University, New York, NY, In the full-information feedback setting, it is well known USA 3University of Southern California, Los Angeles, CA, USA (Crammer & Singer, 2003) that if all examples have norm 4Microsoft Research, New York, NY, USA. Correspondence to: at most R and are weakly linearly separable with a margin David´ Pal´ <[email protected]>. γ, then the MULTICLASS PERCEPTRON algorithm makes 2 Proceedings of the 36 th International Conference on Machine at most b2(R/γ) c mistakes. It is also known that any 1 2 Learning, Long Beach, California, PMLR 97, 2019. Copyright (possibly randomized) algorithm must make 2 (R/γ) 2019 by the author(s). mistakes in the worst case. The MULTICLASS PERCEP- 1We use the notation Oe(f(·)) = O(f(·) polylog(f(·))). TRON achieves an information-theoretically optimal mis- Bandit Multiclass Linear Classification: Efficient Algorithms for the Separable Case take bound, while being time and memory efficient.23 intersection of halfspaces and has been studied previously by Klivans & Servedio(2008). As a side result, we improve The bandit feedback setting, however, is much more chal- on the results of Klivans & Servedio(2008) by removing lenging. For the strongly linearly separable case, we are the dependency on the original dimension d. not aware of any prior efficient algorithm with a finite mis- take bound. 4 We design a simple and efficient algorithm The resulting kernelized algorithm runs in time polynomial (Algorithm1) that makes at most O(K(R/γ)2) mistakes in the original dimension of the feature vectors d, the num- in expectation. Its memory complexity and per-round time ber of classes K, and the number of rounds T . We prove complexity are both O(dK). The algorithm can be viewed that if the examples lie in the unit ball of Rd and are weakly as running K copies of the BINARY PERCEPTRON algo- linearly separable with marginpγ, Algorithm2 makes at 2 rithm, one copy for each class. We prove that any (possibly most min(2Oe(K log (1/γ)); 2Oe( 1/γ log K)) mistakes. randomized) algorithm must make Ω(K(R/γ)2) mistakes in the worst case. The extra O(K) multiplicative factor in In AppendixG, we propose and analyze a very different al- the mistake bound, as compared to the full-information set- gorithm for weakly linearly separable data. The algorithm ting, is the price we pay for the bandit feedback, or more is based on the obvious idea that two points that are close precisely, the lack of full-information feedback. enough must have the same label. For the case when the examples are weakly linearly sepa- Finally, we study two questions related to the computa- rable, it was open for a long time whether there exist effi- tional and information-theoretic hardness of the problem. cient algorithms with finite mistake bound (Kakade et al., Any algorithm for the bandit setting collects information in 2008; Beygelzimer et al., 2017). Furthermore, Kakade the form of so called strongly labeled and weakly labeled et al.(2008) ask the question: Is there any algorithm with examples. Strongly labeled examples are those for which a finite mistake bound that has no explicit dependence on we know the class label. Weakly labeled example is an ex- the dimensionality of the feature vectors? We answer both ample for which we know that class label can be anything questions affirmatively by providing an efficient algorithm except for one particular class. In AppendixH, we show with finite dimensionless mistake bound (Algorithm2). 5 that the offline problem of finding a multiclass linear clas- sifier consistent with a set of strongly and weakly labeled The strategy used in Algorithm2 is to construct a non- examples is NP-hard. In AppendixI, we prove a lower linear feature mapping φ and associated positive definite bound on the number of mistakes of any algorithm that uses 0 kernel k(x; x ) that makes the examples strongly linearly only strongly-labeled examples and ignores weakly labeled separable in a higher-dimensional space. We then use the examples. kernelized version of Algorithm1 for the strongly separa- ble case. The kernel k(x; x0) corresponding to the feature mapping φ has a simple explicit formula and can be com- 2. Related work puted in O(d) time, making Algorithm2 computationally The problem of online bandit multiclass learning was ini- efficient. For details on kernel methods see e.g. (Scholkopf¨ tially formulated in the pioneering work of Auer & Long & Smola, 2002) or (Shawe-Taylor & Cristianini, 2004). (1999) under the name of “weak reinforcement model”. The number of mistakes of the kernelized algorithm de- They showed that if all examples agree with some classifier pends on the margin in the corresponding feature space. from a prespecified hypothesis class H, then the optimal We analyze how the mapping φ transforms the margin pa- mistake bound in the bandit setting can be upper bounded d by the optimal mistake bound in the full information set- rameter of weak separability in the original space R into a margin parameter of strong separability in the new feature ting, times a factor of (2:01 + o(1))K ln K. Long(2017) space. This problem is related to the problem of learning later improved the factor to (1 + o(1))K ln K and showed its near-optimality. Daniely & Helbertal(2013) extended 2We call an algorithm computationally efficient, if its running the results to the setting where the performance of the al- time is polynomial in K, d, 1/γ and T . 3 gorithm is measured by its regret, i.e. the difference be- For completeness, we present these folklore results along tween the number of mistakes made by the algorithm and with their proofs in AppendixA in the supplementary material. 4Although Chen et al.(2009) claimed that their Conservative the number of mistakes made by the best classifier in H in OVA algorithm with PA-I update has a finite mistake bound un- hindsight. We remark that all algorithms developed in this der the strong linear separability condition, their Theorem 2 is context are computationally inefficient. incorrect: first, their Lemma 1 (with C = +1) along with their R 2 The linear classification version of this problem is ini- Theorem 1 implies a mistake upper bound of ( γ ) , which contra- dicts the lower bound in our Theorem3; second, their Lemma 1 tially studied by Kakade et al.(2008).
Load more

Recommended publications
  • 1 Algorithms for Machine Learning 2 Linear Separability
    15-451/651: Design & Analysis of Algorithms November 24, 2014 Lecture #26 last changed: December 7, 2014 1 Algorithms for Machine Learning Suppose you want to classify mails as spam/not-spam. Your data points are email messages, and say each email can be classified as a positive instance (it is spam), or a negative instance (it is not). It is unlikely that you'll get more than one copy of the same message: you really want to \learn" the concept of spam-ness, so that you can classify future emails correctly. Emails are too unstructured, so you may represent them as more structured objects. One simple way is to use feature vectors: say you have a long bit vector indexed by words and features (e.g., \money", \bank", \click here", poor grammar, mis-spellings, known-sender) and the ith bit is set if the ith feature occurs in your email. (You could keep track of counts of words, and more sophisticated features too.) Now this vector is given a single-bit label: 1 (spam) or -1 (not spam). d These positively- and negatively-labeled vectors are sitting in R , and ideally we want to find something about the structure of the positive and negative clouds-of-points so that future emails (represented by vectors in the same space) can be correctly classified. 2 Linear Separability How do we represent the concept of \spam-ness"? Given the geometric representation of the input, it is reasonable to represent the concept geometrically as well. Here is perhaps the simplest d formalization: we are given a set S of n pairs (xi; yi) 2 R × {−1; 1g, where each xi is a data point and yi is a label, where you should think of xi as the vector representation of the actual data point, and the label yi = 1 as \xi is a positive instance of the concept we are trying to learn" and yi = −1 1 as \xi is a negative instance".
    [Show full text]
  • Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition
    IEEE TRANSACTIONS ON ELECTRONIC COMPUTERS Geometrical and Statistical Properties of Systems of Linear Inequalities with Applications in Pattern Recognition THOMAS M. COVER Abstract-This paper develops the separating capacities of fami- in Ed. A dichotomy { X+, X- } of X is linearly separable lies of nonlinear decision surfaces by a direct application of a theorem if and only if there exists a weight vector w in Ed and a in classical combinatorial geometry. It is shown that a family of sur- faces having d degrees of freedom has a natural separating capacity scalar t such that of 2d pattern vectors, thus extending and unifying results of Winder x w > t, if x (E X+ and others on the pattern-separating capacity of hyperplanes. Apply- ing these ideas to the vertices of a binary n-cube yields bounds on x w<t, if xeX-. (3) the number of spherically, quadratically, and, in general, nonlinearly separable Boolean functions of n variables. The dichotomy { X+, X-} is said to be homogeneously It is shown that the set of all surfaces which separate a dichotomy linearly separable if it is linearly separable with t = 0. A of an infinite, random, separable set of pattern vectors can be charac- terized, on the average, by a subset of only 2d extreme pattern vec- vector w satisfying tors. In addition, the problem of generalizing the classifications on a w x >O, x E X+ labeled set of pattern points to the classification of a new point is defined, and it is found that the probability of ambiguous generaliza- w-x < 0o xCX (4) tion is large unless the number of training patterns exceeds the capacity of the set of separating surfaces.
    [Show full text]
  • Solvable Model for the Linear Separability of Structured Data
    entropy Article Solvable Model for the Linear Separability of Structured Data Marco Gherardi 1,2 1 Department of Physics, Università degli Studi di Milano, via Celoria 16, 20133 Milano, Italy; [email protected] 2 Istituto Nazionale di Fisica Nucleare Sezione di Milano, via Celoria 16, 20133 Milano, Italy Abstract: Linear separability, a core concept in supervised machine learning, refers to whether the labels of a data set can be captured by the simplest possible machine: a linear classifier. In order to quantify linear separability beyond this single bit of information, one needs models of data structure parameterized by interpretable quantities, and tractable analytically. Here, I address one class of models with these properties, and show how a combinatorial method allows for the computation, in a mean field approximation, of two useful descriptors of linear separability, one of which is closely related to the popular concept of storage capacity. I motivate the need for multiple metrics by quantifying linear separability in a simple synthetic data set with controlled correlations between the points and their labels, as well as in the benchmark data set MNIST, where the capacity alone paints an incomplete picture. The analytical results indicate a high degree of “universality”, or robustness with respect to the microscopic parameters controlling data structure. Keywords: linear separability; storage capacity; data structure 1. Introduction Citation: Gherardi, M. Solvable Linear classifiers are quintessential models of supervised machine learning. Despite Model for the Linear Separability of their simplicity, or possibly because of it, they are ubiquitous: they are building blocks of Structured Data. Entropy 2021, 23, more complex architectures, for instance, in deep learning and support vector machines, 305.
    [Show full text]
  • Linear Separability in Non-Euclidean Geometry
    Linear Separability George M. Georgiou Linear Separability in Non-Euclidean Outline Geometry The problem Separating hyperplane Euclidean George M. Georgiou, Ph.D. Geometry Non-Euclidean Geometry Computer Science Department California State University, San Bernardino Three solutions Conclusion March 3, 2006 [email protected] 1 : 29 The problem Linear Separability Find a geodesic that separates two given sets of points on George M. Georgiou the Poincare´ disk non-Euclidean geometry model. Outline The problem Linear Separability Geometrically Separating hyperplane Euclidean Geometry Non-Euclidean Geometry Three solutions Conclusion 2 : 29 The problem Linear Separability Find a geodesic that separates two given sets of points on George M. Georgiou the Poincare´ disk non-Euclidean geometry model. Outline The problem Linear Separability Geometrically Separating hyperplane Euclidean Geometry Non-Euclidean Geometry Three solutions Conclusion 2 : 29 Linear Separability in Machine Learning Linear Separability George M. Georgiou Machine Learning is branch of AI, which includes areas Outline such as pattern recognition and artificial neural networks. The problem n Linear Separability Each point X = (x1, x2,..., xn) ∈ (vector or object) Geometrically R Separating belongs to two class C0 and C1 with labels -1 and 1, hyperplane respectively. Euclidean Geometry The two classes are linearly separable if there exists n+1 Non-Euclidean W = (w0, w1, w2,..., wn) ∈ such that Geometry R Three solutions w0 + w1x1 + w2x2 + ... + wnxn 0, if X ∈ C0 (1) Conclusion > w0 + w1x1 + w2x2 + ... + wnxn< 0, if X ∈ C1 (2) 3 : 29 Geometrically Linear Separability George M. Georgiou Outline The problem Linear Separability Geometrically Separating hyperplane Euclidean Geometry Non-Euclidean Geometry Three solutions Conclusion 4 : 29 “Linearizing” the circle Linear Separability George M.
    [Show full text]
  • 4 Perceptron Learning
    4 Perceptron Learning 4.1 Learning algorithms for neural networks In the two preceding chapters we discussed two closely related models, McCulloch–Pitts units and perceptrons, but the question of how to find the parameters adequate for a given task was left open. If two sets of points have to be separated linearly with a perceptron, adequate weights for the comput- ing unit must be found. The operators that we used in the preceding chapter, for example for edge detection, used hand customized weights. Now we would like to find those parameters automatically. The perceptron learning algorithm deals with this problem. A learning algorithm is an adaptive method by which a network of com- puting units self-organizes to implement the desired behavior. This is done in some learning algorithms by presenting some examples of the desired input- output mapping to the network. A correction step is executed iteratively until the network learns to produce the desired response. The learning algorithm is a closed loop of presentation of examples and of corrections to the network parameters, as shown in Figure 4.1. network test input-output compute the examples error fix network parameters Fig. 4.1. Learning process in a parametric system R. Rojas: Neural Networks, Springer-Verlag, Berlin, 1996 78 4 Perceptron Learning In some simple cases the weights for the computing units can be found through a sequential test of stochastically generated numerical combinations. However, such algorithms which look blindly for a solution do not qualify as “learning”. A learning algorithm must adapt the network parameters accord- ing to previous experience until a solution is found, if it exists.
    [Show full text]
  • Linear Separation
    Supervised Learning (contd) Linear Separation Mausam (based on slides by UW-AI faculty) 1 Images as Vectors Binary handwritten characters Treat an image as a high- dimensional vector (e.g., by reading pixel values left to right, top to bottom row) p1 p 2 I Greyscale images pN 2 pN Pixel value pi can be 0 or 1 (binary image) or 0 to 255 (greyscale) 2 The human brain is extremely good at classifying images Can we develop classification methods by emulating the brain? 3 4 Neurons communicate via spikes Inputs Output spike (electrical pulse) Output spike roughly dependent on whether sum of all inputs reaches a threshold 5 Neurons as “Threshold Units” Artificial neuron: • m binary inputs (-1 or 1), 1 output (-1 or 1) • Synaptic weights wji • Threshold i w1i Weighted Sum Threshold Inputs uj w 2i Output vi (-1 or +1) (-1 or +1) w3i vi (wjiu j i ) j (x) = 1 if x > 0 and -1 if x 0 6 “Perceptrons” for Classification Fancy name for a type of layered “feed-forward” networks (no loops) Uses artificial neurons (“units”) with binary inputs and outputs Multilayer Single-layer 7 Perceptrons and Classification Consider a single-layer perceptron • Weighted sum forms a linear hyperplane wjiu j i 0 j • Everything on one side of this hyperplane is in class 1 (output = +1) and everything on other side is class 2 (output = -1) Any function that is linearly separable can be computed by a perceptron 8 Linear Separability Example: AND is linearly separable Linear hyperplane u1 u2 AND -1 -1 -1 u 2 (1,1) v 1 -1 -1 1 = 1.5 -1 1 -1 u1 1 1 1 -1
    [Show full text]
  • Supervised.Pdf
    patterns, predictions, and actions - 2021-09-27 1 3 Supervised learning Previously, we talked about the fundamentals of prediction and statistical modeling of populations. Our goal was, broadly speaking, to use available information described by a random variable X to conjecture about an unknown outcome Y. In the important special case of a binary outcome Y, we saw that we can write an optimal predictor Yb as a threshold of some function f : Yb(x) = 1 f (x) > t f g We saw that in many cases the optimal function is a ratio of two likelihood functions. This optimal predictor has a serious limitation in practice, however. To be able to compute the prediction for a given input, we need to know a probability density function for the positive instances in our problem and also one for the negative instances. But we are often unable to construct or unwilling to assume a particular density function. As a thought experiment, attempt to imagine what a probability density function over images labeled cat might look like. Coming up with such a density function appears to be a formidable task, one that’s not intuitively any easier than merely classifying whether an image contains a cat or not. In this chapter, we transition from a purely mathematical charac- terization of optimal predictors to an algorithmic framework. This framework has two components. One is the idea of working with fi- nite samples from a population. The other is the theory of supervised learning and it tells us how to use finite samples to build predictors algorithmically.
    [Show full text]
  • Arxiv:1811.05321V1 [Cs.LG] 11 Nov 2018 (E.G
    Correction of AI systems by linear discriminants: Probabilistic foundations A.N. Gorbana,b,∗, A. Golubkovc, B. Grechuka, E.M. Mirkesa,b, I.Y. Tyukina,b aDepartment of Mathematics, University of Leicester, Leicester, LE1 7RH, UK bLobachevsky University, Nizhni Novgorod, Russia cSaint-Petersburg State Electrotechnical University, Saint-Petersburg, Russia Abstract Artificial Intelligence (AI) systems sometimes make errors and will make errors in the future, from time to time. These errors are usually unexpected, and can lead to dramatic consequences. Intensive development of AI and its practical applications makes the problem of errors more important. Total re-engineering of the systems can create new errors and is not always possible due to the resources involved. The important challenge is to develop fast methods to correct errors without damaging existing skills. We formulated the technical requirements to the ‘ideal’ correctors. Such correctors include binary classifiers, which separate the situations with high risk of errors from the situations where the AI systems work properly. Surprisingly, for essentially high-dimensional data such methods are possible: simple linear Fisher discriminant can separate the situations with errors from correctly solved tasks even for exponentially large samples. The paper presents the probabilistic basis for fast non-destructive correction of AI systems. A series of new stochastic separation theorems is proven. These theorems provide new instruments for fast non-iterative correction of errors of legacy AI systems. The new approaches become efficient in high-dimensions, for correction of high-dimensional systems in high-dimensional world (i.e. for processing of essentially high-dimensional data by large systems). We prove that this separability property holds for a wide class of distributions including log-concave distributions and distributions with a special ‘SMeared Absolute Continuity’ (SmAC) property defined through relations between the volume and probability of sets of vanishing volume.
    [Show full text]
  • Hyperplane Separability and Convexity of Probabilistic Point Sets
    Hyperplane Separability and Convexity of Probabilistic Point Sets Martin Fink∗1, John Hershberger2, Nirman Kumar†3, and Subhash Suri‡4 1 University of California, Santa Barbara, CA, USA 2 Mentor Graphics Corp., Wilsonville, OR, USA 3 University of California, Santa Barbara, CA, USA 4 University of California, Santa Barbara, CA, USA Abstract We describe an O(nd) time algorithm for computing the exact probability that two d-dimensional probabilistic point sets are linearly separable, for any fixed d ≥ 2. A probabilistic point in d-space is the usual point, but with an associated (independent) probability of existence. We also show that the d-dimensional separability problem is equivalent to a (d + 1)-dimensional convex hull membership problem, which asks for the probability that a query point lies inside the convex hull of n probabilistic points. Using this reduction, we improve the current best bound for the convex hull membership by a factor of n [6]. In addition, our algorithms can handle “input degeneracies” in which more than k + 1 points may lie on a k-dimensional subspace, thus resolving an open problem in [6]. Finally, we prove lower bounds for the separability problem via a reduction from the k-SUM problem, which shows in particular that our O(n2) algorithms for 2-dimensional separability and 3-dimensional convex hull membership are nearly optimal. 1998 ACM Subject Classification I.3.5 Computational Geometry and Object Modeling, F.2.2 Nonnumerical Algorithms and Problems, G.3 Probability and Statistics Keywords and phrases probabilistic separability, uncertain data, 3-SUM hardness, topological sweep, hyperplane separation, multi-dimensional data Digital Object Identifier 10.4230/LIPIcs.SoCG.2016.38 1 Introduction Multi-dimensional point sets are a commonly used abstraction for modeling and analyzing data in many domains.
    [Show full text]
  • Introduction to Feedforward Neural Networks
    EEL5840: Machine Intelligence Introduction to feedforward neural networks Introduction to feedforward neural networks 1. Problem statement and historical context A. Learning framework Figure 1 below illustrates the basic framework that we will see in artificial neural network learning. We assume that we want to learn a classification task G with n inputs and m outputs, where, y = G()x , (1) T T x = x1 x2 … xn and y = y1 y2 … ym . (2) In order to do this modeling, let us assume a model Γ with trainable parameter vector w , such that, z = Γ()xw, (3) where, T z = z1 z2 … zm . (4) Now, we want to minimize the error between the desired outputs y and the model outputs z for all possible inputs x . That is, we want to find the parameter vector w∗ so that, E()w∗ ≤E()w , ∀w , (5) where E()w denotes the error between G and Γ for model parameter vector w . Ideally, E()w is given by, E()w = ∫ yz– 2p()x dx (6) x where p()x denotes the probability density function over the input space x . Note that E()w in equation (6) is dependent on w through z [see equation (3)]. Now, in general, we cannot compute equation (6) directly; therefore, we typically compute E()w for a training data set of input/output data, {}()xi, yi , i ∈{12,,…,p}, (7) where xi is the n -dimensional input vector, T xi = xi1 xi2 … xin (8) corresponding to the i th training pattern, and yi is the m -dimensional output vector, x1 y1 x2 Unknown mapping G y2 ed outputs inputs … … x y n m desir z1 Trainable model Γ z2 … … zm model outputs Figure 1 - 1 - EEL5840: Machine Intelligence Introduction to feedforward neural networks T yi = yi1 yi2 … yim (9) corresponding to the i th training pattern, i ∈{12,,…,p}.
    [Show full text]
  • The Linear Separability Problem: Some Testing Methods D
    330 IEEE TRANSACTIONS ON NEURAL NETWORKS, VOL. 17, NO. 2, MARCH 2006 The Linear Separability Problem: Some Testing Methods D. Elizondo Abstract—The notion of linear separability is used widely in ma- chine learning research. Learning algorithms that use this concept to learn include neural networks (single layer perceptron and re- cursive deterministic perceptron), and kernel machines (support vector machines). This paper presents an overview of several of the methods for testing linear separability between two classes. The methods are divided into four groups: Those based on linear pro- gramming, those based on computational geometry, one based on neural networks, and one based on quadratic programming. The Fisher linear discriminant method is also presented. A section on the quantification of the complexity of classification problems is in- cluded. Index Terms—Class of separability, computational geometry, convex hull, Fisher linear discriminant, linear programming, linear separability, quadratic programming, simplex, support vector machine. I. INTRODUCTION WO SUBSETS and of are said to be linearly T separable (LS) if there exists a hyperplane of such that the elements of and those of lie on opposite sides of it. Fig. 1 shows an example of LS and NLS set of points. Squares and circles denote the two classes. Linear separability is an important topic in the domain of machine learning and cognitive psychology. A linear model is rather robust against noise and most likely will not over fit. Mul- tilayer non linear neural networks, such as the back propagation algorithm, work well for classification problems. However, as the experience of perceptrons has shown, there are many real life problems in which there is a linear separation.
    [Show full text]
  • Perceptron (Theory) + Linear Regression
    10-601 Introduction to Machine Learning Machine Learning Department School of Computer Science Carnegie Mellon University Perceptron (Theory) + Linear Regression Matt Gormley Lecture 6 Feb. 5, 2018 1 Q&A Q: I can’t read the chalkboard, can you write larger? A: Sure. Just raise your hand and let me Know if you can’t read something. Q: I’m concerned that you won’t be able to read my solution in the homeworK template because it’s so tiny, can I use my own template? A: No. However, we do all of our grading online and can zoom in to view your solution! Make it as small as you need to. 2 Reminders • Homework 2: Decision Trees – Out: Wed, Jan 24 – Due: Mon, Feb 5 at 11:59pm • Homework 3: KNN, Perceptron, Lin.Reg. – Out: Mon, Feb 5 …possibly delayed – Due: Mon, Feb 12 at 11:59pm by two days 3 ANALYSIS OF PERCEPTRON 4 Geometric Margin Definition: The margin of example ! w.r.t. a linear sep. " is the distance from ! to the plane " ⋅ ! = 0 (or the negative if on wrong side) Margin of positive example !' !' w Margin of negative example !( !( Slide from Nina Balcan Geometric Margin Definition: The margin of example ! w.r.t. a linear sep. " is the distance from ! to the plane " ⋅ ! = 0 (or the negative if on wrong side) Definition: The margin )* of a set of examples + wrt a linear separator " is the smallest margin over points ! ∈ +. + + + w )* + ) + - * + - + - - - + - - Slide from Nina Balcan - - Geometric Margin Definition: The margin of example ! w.r.t. a linear sep.
    [Show full text]