L3 Apprentissage. Michèle Sebag Benjamin Monmège LRI LSV. 27 février 2013
|
|
- Shonda Williamson
- 6 years ago
- Views:
Transcription
1 L3 Apprentissage Michèle Sebag Benjamin Monmège LRI LSV 27 février 2013
2 Next course Tutorials/Videolectures bengioy/talks/icml2012-ybtutorial.pdf Part 1: 1-56; Part 2: Mar. 13th (oral participation) Some students present part 1-2 Other students ask questions
3 Hypothesis Space H / Navigation This course H navigation operators Version Space Logical spec / gen Decision Trees Logical specialisation Neural Networks Numerical gradient Support Vector Machines Numerical quadratic opt. Ensemble Methods adaptation E h : X = IR D IR Binary classification h(x) > 0 x classified as True else, classified as False
4 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
5 5 The separable case: More than one separating hyperplane
6 Linear Support Vector Machines Linear Separators f (x) = w, x + b Region ŷ = 1: f (x) > 0 Region ŷ = 1: f (x) < 0 Criterion i, y i ( w, x i + b) > 0 Remark Invariant by multiplication of w and b by a positive value
7 Canonical formulation Fix the scale: min i {y i ( w, x i + b)} = 1 i, y i ( w, x i + b) 1
8 Maximize the Margin Criterion Maximize the minimal distance (points, hyperplane). Obtain the largest possible band Margin w, x + + b = 1 w, x + b = 1 w, x + x = 2 Margin = projection of x + x on the normal vector of the hyperplane, w w 2 1 Maximize w minimize w 2
9 9 Maximize the Margin (2) Problem { Minimize 1 2 w 2 with the constraints i, y i ( w, x i + b) 1
10 10 Maximal Margin Hyperplane
11 Quadratic Optimization (reminder) Optimize f with constraints f i 0 When f and f i are convex Introduce the Lagrange multipliers α i (α i 0), Consider (penalization of the violated constraints) F (x, α) = f (x) i α i f i (x) Kuhn-Tucker principle (1951) At the optimum (x 0, α ) F (x 0, α ) = min α 0 F (x 0, α) = max x F (x, α )
12 12 Primal Problem L(w, b, α) = 1 2 w 2 i α i (y i ( x i, w + b) 1), α i 0 Differentiate w.r.t. b: at the optimum, Differentiate w.r.t. w : Replace in L(w, b, α): L b = 0 = α i y i L w = 0 = w α i y i x i
13 Dual problem (Wolfe) Maximize W (α) = i α i 1 2 with the constraint i, α i 0 i α iy i = 0 i,j α iα j y i y j < x i, x j > Quadratic form w.r.t. α Solution: αi Compute w : w = i quadratic optimization is easy α i y i x i If ( x i, w + b)y i > 1, α i = 0. IF ( x i, w + b)y i = 1, α i > 0, x i support vector Compute b : b = 1 2 ( w, x + + w, x )
14 14
15 15 Summary E = {(x i, y i )}, x i IR d, y i { 1, 1}, i = 1..n} (x i, y i ) P(x, y) Two goals h(x) = w, x + b Role Data fitting sign(y i ) = sign (h(x i )) maximize margin y i.h(x i ) achieve learning Regularization : minimize w avoid overfitting
16 16 Support Vector Machines General scheme Minimize the regularization term... subject to data constraints = margin 1 (*) { Min. 1 2 w 2 s.t. y i ( w, x i + b) 1 i = 1... n Constrained minimization of a convex function introduce Lagrange multipliers α i 0, i = 1... n Min L(w, b, α) = 1 2 w 2 + i α i (1 y i ( w, x i + b)) Primal problem d + 1 variables (+ n Lagrange multipliers) (*) in the separable case; see later for non-separable case
17 Support Vector Machines, 2 At the optimum L w = L b = L α = 0 Dual problem Max. Q(α) = i α i 1 2 s.t. i, α i 0 i α iy i = 0 i,j α iα j y i y j x i, x j Wolfe Support vectors Examples (x i, y i ) s.t. α i > 0 the only ones involved in the decision function w = α i y i x i
18 18 Support vectors, examples
19 19 Support vectors, examples MNIST data Data Support vectors Remarks Support vectors are critical examples Show that the Leave-One-Out error is less than # sv. near-miss LOO: iteratively, learn on all examples but one, and test on the remaining one
20 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
21 21 Separable vs non-separable data Training Test
22 Linear hypotheses, non separable data Cortes & Vapnik 95 Non-separable data not all constraints are satisfiable Formalization y i ( w, x i + b) 1 ξ i Introduce slack variables ξ i And penalize them 1 Minimize 2 w 2 + C i ξ i Subject to i, y i ( w, x i + b) 1 ξ i ξ i 0 Critical decision: adjust C = error cost.
23 23 Primal problem, non separable case Same resolution: Lagrange Multipliers α i and β i, with α i 0, β i 0 L(w, b, ξ, α, β) = Min 1 2 w 2 + C i ξ i i α i(y i ( w, x i + b) 1 + ξ i ) At the optimum Likewise w = i α i y i x i i β iξ i L w = L b = L = 0 ξ i α i y i = 0 C α i β i = 0 i Convex (quadratic) optimization problem it is equivalent to solve the primal and the dual problem (expressed with multipliers α, β)
24 24 Dual problem, non separable case Min i α i 1 α i α j y i y j x i, x j, 0 α i C 2 i,j Mathematically nice problem H = semi-definite positive n n matrix H i,j = y i y j x i, x j Dual problem quadratic form with e = (1,..., 1) IR n. Minimize α, e α T Hα
25 25 Support vectors Only support vectors (α i > 0) are involved in h w = α i y i x i Importance of support vector x i : weight α i Difference with the separable case 0 < α i < C bounded influence of examples
26 The loss (error cost) function Roles The goal is data fitting loss function characterizes the learning goal while solving a convex optimization problem and makes it tractable/reproducible The error cost Binary cost: l(y, h(x)) = 1 iff y h(x) Quadratic cost: l(y, h(x)) = (y h(x)) 2 Hinge loss l(y, h(x)) = max(0, 1 y.h(x)) = (1 y.h(x)) + = ξ Hinge loss Square hinge loss 0 1 loss y. f(x)
27 Complexity Learning complexity Worst case: O(n 3 ) Empirical complexity: depends on C O(n 2 n sv ) where n sv is the number of s.v. Usage complexity O(n sv )
28 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
29 Non-separable data Representation change x IR 2 polar coordinates IR 2
30 Principle Intuition Φ : X Φ(X ) IR D In a high-dimensional space, every dataset is linearly separable Map data onto Φ(X ), and we are back to linear separation Glossary X : input space Φ(X ): feature space
31 The kernel trick Remark Generalization bounds do not depend on the dimension of input space X but on the capacity of the hypothesis space H. SVMs only involve scalar products x i, x j. Intuition Representation change is only virtual Φ : X Φ(X ) Consider scalar product in Φ(X )... and compute it in X K(x i, x j ) = Φ(x i ), Φ(x j )
32 2 Example: polynomial kernel Principle x IR 3 Φ(x) IR 10 x = (x 1, x 2, x 3 ) Φ(x) = (1, 2x 1, 2x 2, 2x 3, 2x 1 x 2, 2x 1 x 3, 2x 2 x 3, x1 2, x 2 2, x 3 2) Why 2?
33 2 Example: polynomial kernel Principle x IR 3 Φ(x) IR 10 x = (x 1, x 2, x 3 ) Φ(x) = (1, 2x 1, 2x 2, 2x 3, 2x 1 x 2, 2x 1 x 3, 2x 2 x 3, x1 2, x 2 2, x 3 2) Why 2? because Φ(x), Φ(x ) = (1 + x, x ) 2 = K(x, x )
34 33 Primal and dual problems unchanged Primal problem { Min. 1 2 w 2 s.t. y i ( w, Φ(x i ) + b) 1 i = 1... n Dual problem Max. Q(α) = i α i 1 2 s.t. i, α i 0 i α iy i = 0 i,j α iα j y i y j K(x i, x j ) Hypothesis h(x) = i α i y i K(x i, x)
35 34 Example, polynomial kernel K(x, x ) = (a x, x + 1) b Choice of a, b : cross validation Domination of high/low degree terms? Importance of normalization
36 35 Example, Radius-Based Function kernel (RBF) K(x, x ) = exp ( γ x x 2) No closed form Φ Φ(X ) of infinite dimension For x in IR Φ(x) = exp ( γx 2 ) ) [ ] 2γ (2γ) 1, 1! x, 2 (2γ) x 2 3, x 3,... 2! 3! Choice of γ? (intuition: think of H, H i,j = y i y j K(x i, x j ))
37 String kernels Notations s a string on alphabet Σ Watkins 99, Lodhi 02 i = (i 1, i 2,..., i n ) an ordered index sequence (i j < i j+1 ), avec l(i) = i n i s[i] substring of s, extraction pattern is i s = BICYCLE, i= (1, 3, 6), s[i] = BCL Definition K n (s, s ) = u Σ n with 0 < ε < 1 (discount) is.t.s[i]=u js.t.s [j]=u ε l(i)+l(j)
38 37 String kernels, followed Φ: projection on IR D où D = Σ n Prefer the normalized version CH CA CT AT CHAT ε 2 ε 3 ε 4 ε 2 CARTOON 0 ε 2 ε 4 ε 3 K(CHAT, CARTON) = 2ε 5 + ε 8 κ ( s, s ) = K(s, s ) K(s, s)k(s s )
39 String kernels, followed Application 1 Document mining Pre-processing matters a lot (stop-words, stemming) Multi-lingual aspects Document classification Information retrieval Application 2, Bio-informatics Pre-processing matters a lot Classification (secondary structures) 38 Extension to graph kernels vert ckac/
40 39 Application to musical analysis Input: Midi files Pre-processing, rythm detection Representation: the musical worm (tempo, loudness) Output: Identification of performer styles Using String Kernels to Identify Famous Performers from their Playing Style, Saunders et al., 2004
41 Kernels: key features Absolute Relative representation x, x angle of x and x More generally K(x, x ) measures the (non-linear) similarity of x and x x is described by its similarity to other examples Necessary condition: the Mercer condition K must be positive semi-definite g L 2, K(x, x )g(x)g(x )dx 0
42 Why? Related to Φ Mercer condition holds φ 1, φ 2,.. k(x, x ) = λ i φ i (x)φ i (x ) i=1 with φ i eigen functions, λ i > 0 eigen values Kernel properties: let K, K be p.d. kernels and α > 0, then αk is a p.d. kernel K + K is a p.d. kernel K.K is a p.d. kernel K(x, x ) = limit p K p (x, x ) is p.d. if it exists K(A, B) = x A,x B K(x, x ) is a p.d. kernel
43 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
44 43 Multi-class discrimination Input Binary case E = {(x i, y i )}, x i IR d, y i { 1, 1}, i = 1..n} (x i, y i ) P(x, y) Multi-class case E = {(x i, y i )}, x i IR d, y i {1... k}, i = 1..n} (x i, y i ) P(x, y) Output : ĥ : IR d {1... k}.
45 Multi-class learning: one against all First option: k binary learning problems Pb 1: class 1 +1, classes 2... k 1 h 1 Pb 2: class 2 +1, classes 1, 3,... k 1 h 2... Prediction h(x) = i iff h i (x) = argmax{h j (x), j = 1... k} Justification If x belongs to class 1, one should have h 1 (x) 1, h j (x) < 1, j 1
46 45 Where is the difficulty? o o o o o o o o What we get (one vs all) What we want
47 46 Multi-class learning: one vs one Second option: k(k 1) 2 binary classification problems Pb i, j class i +1, class j 1 h i,j Prediction Compute all h i,j (x) Count the votes NB: One can also use the h i,j (x) values.
48 Multi-class learning: additionnal constraints Another option Vapnik 98; Weston, Watkins 99 Hum! 1 Minimise k 2 j=1 w j 2 + C n k i=1 l=1,l y i ξ i,l Subject to i, l y i, ( w yi, x i + b yi ) ( w l, x i + b l ) + 2 ξ i,l ξ i,l 0 n k constraints: n k dual variables
49 Recommendations In practice Results are in general (but not always!) similar 1-vs-1 is the fastest option
50 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
51 50 Regression Input E = {(x i, y i )}, x i IR d, y i IR, i = 1..n} (x i, y i ) P(x, y) Output : ĥ : IRd IR.
52 51 Regression with Support Vector Machines Intuition Find h deviating by at most ε from the data... while being as flat as possible loss function regularization Formulation 1 Min. 2 w 2 s.t. i = 1... n ( w, x i + b) y i ε ( w, x i + b) y i + ε
53 52 Regression with Support Vector Machines, followed Using slack variables 1 Min. 2 w 2 + C i (ξ+ i + ξ i ) s.t. i = 1... n ( w, x i + b) y i ε ξ i ( w, x i + b) y i + ε +ξ + i
54 Regression with Support Vector Machines, followed Primal problem L(w, b, ξ, α, β) = Min 1 2 w 2 + C i (ξ+ i + ξ i ) i α+ i (y i + ε + ξ + i w, x i + b) i α i ( w, x i + b y i + ε + ξ i ) i β+ i ξ + i i β i ξ i Dual problem Q(α +, α ) = i y i(α + i α i ) ε i (α+ i + α i ) + i,j (α+ i α i )(α + j α j ) x i, x j s.t. i = 1... n (α + i α i ) = 0 0 α + i C 0 α i C
55 54 Regression with Support Vector Machines, followed Hypothesis h(x) = (α + i α i ) x i, x + b With no loss of generality you can replace everywhere x, x K(x, x )
56 Beware High-dimensional regression E = {(x i, y i )}, x i IR D, y i IR, i = 1..n} (x i, y i ) P(x, y) A very slippery game if D >> n curse of dimensionality Dimensionality reduction mandatory Map x onto IR d Central subspace: π : X S IR d with S minimal such that y and x are independent conditionally to π(x). Find h, w : y = h(w, x)
57 56 Sliced Inverse Regression Bernard-Michel et al, 09 More: S. Girard
58 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
59 58 Novelty Detection Input Context E = {(x i )}, x i X, i = 1..n} (x i ) P(x) Information retrieval Identification of the data support estimation of distribution Critical issue Classification approaches not efficient: too much noise
60 59 One-class SVM Formulation 1 Min. 2 w 2 ρ +C i ξ i s.t. i = 1... n w, x i ρ ξ i Dual problem Min. i,j α iα j x i, x j s.t. i = 1... n 0 α i C i α i = 0
61 60 Implicit surface modelling Schoelkopf et al, 04 Goal: find the surface formed by the data points w, x i ρ becomes ε ( w, x i ρ) ε
62 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
63 62 Normalisation / Scaling Needed to prevent attributes to steal the game Height Gender Class x F 1 x M 0 x M 0 Normalization Height Height
64 Beware Usual practice Normalize the whole dataset Learn on the training set Test on the test set
65 Beware Usual practice Normalize the whole dataset Learn on the training set Test on the test set NO! Good practice Normalize the training set (Scale train ) Learn from the normalized training set Scale the test set according to Scale train and test
66 Imbalanced datasets Typically Normal transactions: 99.99% Fraudulous transactions: not many Practice Define asymmetrical penalizations std penalization asymmetrical penalizations C i ξ i C + i,y i =1 ξ i + C i,y i = 1 ξ i Other options?
67 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
68 Data sampling Simple approaches Uniform sampling Stratified sampling often efficient same distribution as in E Incremental approaches Syed et al. 99 Partition E E 1,... E N Learn from E 1 support vectors SV 1 Learn from E 2 SV 1 support vectors SV 2 etc.
69 Data sampling, followed Select examples Bakir 2005 Use k-nearest neighbors Train SVM on k-means (prototypes) Pb about distances Hierarchical methods Yu 2003 Use unsupervised learning and form clusters Unsupervised learning, J. Gama Learn a hypothesis on each cluster Aggregate hypotheses
70 68 Reduce number of variables Select candidate s.v. F E w = α i y i x i with (x i, y i ) F Optimize α i on E 1 Min. 2 i,j, F α iα j y i y j x i, x j + C n l=1 ξ l t.q. l = 1... n, ( w, x l + b) 1 ξ l ξ l 0
71 Sources Vapnik, The nature of statistical learning, Springer Verlag 1995; Statistical Learning Theory, Wiley 1998 Cristianini & Shawe Taylor, An introduction to Support Vector Machines, Cambridge University Press, Videolectures + ML Summer Schools Large scale Machine Learning challenge, ICML 2008 wshop:
72 Overview Linear SVM, separable case Linear SVM, non separable case The kernel trick The Kernel principle Examples Discussion Extensions Multi-class discrimination Regression Novelty detection On the practitioner side Improve precision Reduce computational cost Theory
73 71 Reminder Input Vapnik, 1995, 1998 E = {(x i, y i )}, x i IR m, y i { 1, 1}, i = 1..n} (x i, y i ) P(x, y) Output : ĥ : IR m { 1, 1} ou IR. ĥ approximates y Criterion : ideally, minimize the generalization error Err(h) = l(y, ĥ(x))dp(x, y) l = loss function: 1 y ĥ(x), (y ĥ(x))2 P(x, y) = joint distribution of the data.
74 72 The Bias-Variance Tradeoff Choice of a model: The space H where we are looking for ĥ. Bias: Distance between y and h = argmin{err(h), h H}. the best we can hope for Variance: Distance between ĥ and h between the best h and the ĥ we actually learn Note : Only the empirical risk (on the available data) is given Err emp,n (ĥ) = 1 n n l(y i, ĥ(x i)) i=1 Principle: Err(ĥ) < Erremp,n(ĥ) + B(n, H) If H is reasonable, Err emp,n Err when n
75 73 Statistical Learning Statistical Learning Theory Learning from a statistical perspective. Goal of the theory Model a real / artificial phenomenon, in order to: * understand * predict * exploit in general
76 General A theory: hypotheses predictions Hypotheses on the phenomenon Predictions about its behavior here, Learning errors Theory algorithm Optimize the quantities allowing prediction Nothing practical like a good theory! Vapnik
77 General A theory: hypotheses predictions Hypotheses on the phenomenon Predictions about its behavior here, Learning errors Theory algorithm Optimize the quantities allowing prediction Nothing practical like a good theory! Vapnik Strength/Weaknesses + Stronger Hypotheses more precise predictions BUT if the hypotheses are wrong, nothing will work
78 What Theory do we need? Approach in expectation A set of data x + : average of positive examples x : average of negative examples h(x) = +1 iff d(x, x + ) < d(x, x ) one example breast cancer Estimate the generalization error Data Training set, test set Learn x + et x on the training set, measure the errors on the test set
79 Classical Statistics vs Statistical Learning Classical Statistics Mean error We want guarantees PAC Model Probably Approximately Correct What is the probability that the error is greater than a given threshold?
80 Example Assume Err(h) > ε What is the probability that Err emp,n (h) = 0? Pr(Err emp,n (h) = 0, Err(h) > ε) = (1 Err(h)) n < (1 ε) n < exp( εn)
81 Example Assume Err(h) > ε What is the probability that Err emp,n (h) = 0? Pr(Err emp,n (h) = 0, Err(h) > ε) = (1 Err(h)) n < (1 ε) n < exp( εn) Hence, in order to guarantee a risk δ Pr(Err emp,n (h) = 0, Err(h) > ε) < δ
82 Example Assume Err(h) > ε What is the probability that Err emp,n (h) = 0? Pr(Err emp,n (h) = 0, Err(h) > ε) = (1 Err(h)) n < (1 ε) n < exp( εn) Hence, in order to guarantee a risk δ Pr(Err emp,n (h) = 0, Err(h) > ε) < δ The error should not be greater than ε < 1 n ln 1 δ
83 Statistical Learning Principle Find a bound on the generalization error Minimize the bound. Note ĥ should be considered as a random variable, depending on the training set E and the number of examples n. ĥ n Results deviation of the empirical error bias-variance Err(ĥn) Err emp,n (ĥn) + B 1 (n, H) Err(ĥn) Err(h ) + B 2 (n, H)
84 Approaches Minimization of the empirical risk Model selection: Choose hypothesis space H Choose ĥn = argmin{err n (h), h H} beware of overfitting Minimization of the structual risk Given H 1 H 2... H k, Find ĥn = argmin{err n (h) + pen(n, k), h H k } Regularization Which penalization? Find ĥn = argmin{err n (h) + λ h, h H} λ is identified by cross-validation
85 80 Structural Risk Minimization
86 81 Tool 1. Hoeffding bound Hoeffing 1963 Let X 1..., X n be independent random variables, and assume X i takes values in [a i, b i ] Let X = (X X n )/n be their empirical mean. Theorem ( 2ε 2 n 2 ) Pr( X E[X ] ε) 2 exp n i=1 (b i a i ) 2 where E[X ] is the expectation of X.
87 82 Hoeffding Bound (2) Application: if Pr( Err(g) Err n (g) > ε) < 2e 2nε2 then with probability at least 1 δ log 2/δ Err(g) Err n (g) + 2n Uniform deviations but this does not say anything about ĥ n... Err(ĥn) Err n (ĥn) sup h H Err(h) Err n (h) if H is finite, consider the sum of Err(h) Err n (h) sif H is infinite, consider its trace on the data
88 Statistical Learning. Definitions Trace of H on {x 1,... x n } Vapnik 92, 95, 98 Growth Function Tr x1,..x n (H) = {(h(x 1 ),..h(x n )), h H} S(H, n) = sup (x1,..x n) Tr x1,..x n (H)
89 Statistical Learning. Definitions (2) Capacity of an hypothesis space H If the training set is of size n, and some function of H can have any behavior on n examples, nothing can be said! H shatters (x 1,... x n ) iff (y 1,... y n ) {1, 1} n, h H s.t. i = 1... n, h(x i ) = y i Vapnik Cervonenkis Dimension VC(H) = max {n; (x 1,... x n ) shattered by H} VC(H) = max{n / S(H, n) = 2 n }
90 85 A shattered set 3 points in IR 2 H= lines of the plane
91 86 Growth Function of linear functions over IR 20 S(H, n) 1 2 n vs n THe growth function is exponental w.r.t. n for n < d = VC(H), then polynomial (in n d ).
92 87 Theorem, separable case δ > 0, with probability at least 1 δ log(s(h, 2n)) + log(2/δ) Err(h) Err n (h) + 2 n Idea 1: Double sample trick Consider a second sample E Pr(sup h (Err(h) Err n (h)) ε) where Err n(h) is the empirical error on E. 2Pr(sup h (Err n(h) Err n (h)) ε/2)
93 88 Double sample trick There exists h s.t. A: Err E (h) = 0 B: Err(h) ε C: Err E ε 2 P(A(h)&C(h)) P(A(h)&B(h)&C(h)) = P(A(h)&B(h)).P(C(h) A(h)&B(h)) 1 2 P(A(h)&B(h))
94 89 Tool 2. Sauer Lemma Sauer Lemma If d = VC(H) S(H, n) = d i=1 ( n i For n > d, ( en ) d S(H, n) d Idea 2: Symmetrization Count the permutations that swap E et E. ) Summary d log n Err(h) Err n (h) + O( n )
Machine Learning. Alexandre Allauzen Michèle Sebag Thomas Schmitt LIMSI LRI. Sept. 28th, 2016
Machine Learning Alexandre Allauzen Michèle Sebag Thomas Schmitt LIMSI LRI Sept. 28th, 2016 Hypothesis Space H / Navigation H navigation operators Version Space Logical spec / gen Decision Trees Logical
More informationIntroduction to Support Vector Machines
Introduction to Support Vector Machines Shivani Agarwal Support Vector Machines (SVMs) Algorithm for learning linear classifiers Motivated by idea of maximizing margin Efficient extension to non-linear
More informationSupport Vector Machine (SVM) and Kernel Methods
Support Vector Machine (SVM) and Kernel Methods CE-717: Machine Learning Sharif University of Technology Fall 2016 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
More informationSupport Vector Machine (SVM) and Kernel Methods
Support Vector Machine (SVM) and Kernel Methods CE-717: Machine Learning Sharif University of Technology Fall 2014 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
More informationSupport Vector Machine (SVM) and Kernel Methods
Support Vector Machine (SVM) and Kernel Methods CE-717: Machine Learning Sharif University of Technology Fall 2015 Soleymani Outline Margin concept Hard-Margin SVM Soft-Margin SVM Dual Problems of Hard-Margin
More informationSupport Vector Machines. Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar
Data Mining Support Vector Machines Introduction to Data Mining, 2 nd Edition by Tan, Steinbach, Karpatne, Kumar 02/03/2018 Introduction to Data Mining 1 Support Vector Machines Find a linear hyperplane
More informationReview: Support vector machines. Machine learning techniques and image analysis
Review: Support vector machines Review: Support vector machines Margin optimization min (w,w 0 ) 1 2 w 2 subject to y i (w 0 + w T x i ) 1 0, i = 1,..., n. Review: Support vector machines Margin optimization
More informationLinear & nonlinear classifiers
Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology Fall 1396 Hamid Beigy (Sharif University of Technology) Linear & nonlinear classifiers Fall 1396 1 / 44 Table
More informationLinear vs Non-linear classifier. CS789: Machine Learning and Neural Network. Introduction
Linear vs Non-linear classifier CS789: Machine Learning and Neural Network Support Vector Machine Jakramate Bootkrajang Department of Computer Science Chiang Mai University Linear classifier is in the
More informationClassifier Complexity and Support Vector Classifiers
Classifier Complexity and Support Vector Classifiers Feature 2 6 4 2 0 2 4 6 8 RBF kernel 10 10 8 6 4 2 0 2 4 6 Feature 1 David M.J. Tax Pattern Recognition Laboratory Delft University of Technology D.M.J.Tax@tudelft.nl
More informationData Mining. Linear & nonlinear classifiers. Hamid Beigy. Sharif University of Technology. Fall 1396
Data Mining Linear & nonlinear classifiers Hamid Beigy Sharif University of Technology Fall 1396 Hamid Beigy (Sharif University of Technology) Data Mining Fall 1396 1 / 31 Table of contents 1 Introduction
More informationSupport Vector Machine (SVM) & Kernel CE-717: Machine Learning Sharif University of Technology. M. Soleymani Fall 2012
Support Vector Machine (SVM) & Kernel CE-717: Machine Learning Sharif University of Technology M. Soleymani Fall 2012 Linear classifier Which classifier? x 2 x 1 2 Linear classifier Margin concept x 2
More informationSUPPORT VECTOR MACHINE
SUPPORT VECTOR MACHINE Mainly based on https://nlp.stanford.edu/ir-book/pdf/15svm.pdf 1 Overview SVM is a huge topic Integration of MMDS, IIR, and Andrew Moore s slides here Our foci: Geometric intuition
More informationLecture Support Vector Machine (SVM) Classifiers
Introduction to Machine Learning Lecturer: Amir Globerson Lecture 6 Fall Semester Scribe: Yishay Mansour 6.1 Support Vector Machine (SVM) Classifiers Classification is one of the most important tasks in
More informationSupport Vector Machines (SVM) in bioinformatics. Day 1: Introduction to SVM
1 Support Vector Machines (SVM) in bioinformatics Day 1: Introduction to SVM Jean-Philippe Vert Bioinformatics Center, Kyoto University, Japan Jean-Philippe.Vert@mines.org Human Genome Center, University
More informationKernel Methods and Support Vector Machines
Kernel Methods and Support Vector Machines Oliver Schulte - CMPT 726 Bishop PRML Ch. 6 Support Vector Machines Defining Characteristics Like logistic regression, good for continuous input features, discrete
More informationPAC-learning, VC Dimension and Margin-based Bounds
More details: General: http://www.learning-with-kernels.org/ Example of more complex bounds: http://www.research.ibm.com/people/t/tzhang/papers/jmlr02_cover.ps.gz PAC-learning, VC Dimension and Margin-based
More informationSupport Vector Machine for Classification and Regression
Support Vector Machine for Classification and Regression Ahlame Douzal AMA-LIG, Université Joseph Fourier Master 2R - MOSIG (2013) November 25, 2013 Loss function, Separating Hyperplanes, Canonical Hyperplan
More informationStatistical Machine Learning from Data
Samy Bengio Statistical Machine Learning from Data 1 Statistical Machine Learning from Data Support Vector Machines Samy Bengio IDIAP Research Institute, Martigny, Switzerland, and Ecole Polytechnique
More informationCS145: INTRODUCTION TO DATA MINING
CS145: INTRODUCTION TO DATA MINING 5: Vector Data: Support Vector Machine Instructor: Yizhou Sun yzsun@cs.ucla.edu October 18, 2017 Homework 1 Announcements Due end of the day of this Thursday (11:59pm)
More informationSupport Vector Machines.
Support Vector Machines www.cs.wisc.edu/~dpage 1 Goals for the lecture you should understand the following concepts the margin slack variables the linear support vector machine nonlinear SVMs the kernel
More informationPerceptron Revisited: Linear Separators. Support Vector Machines
Support Vector Machines Perceptron Revisited: Linear Separators Binary classification can be viewed as the task of separating classes in feature space: w T x + b > 0 w T x + b = 0 w T x + b < 0 Department
More informationLinear & nonlinear classifiers
Linear & nonlinear classifiers Machine Learning Hamid Beigy Sharif University of Technology Fall 1394 Hamid Beigy (Sharif University of Technology) Linear & nonlinear classifiers Fall 1394 1 / 34 Table
More informationOutline. Basic concepts: SVM and kernels SVM primal/dual problems. Chih-Jen Lin (National Taiwan Univ.) 1 / 22
Outline Basic concepts: SVM and kernels SVM primal/dual problems Chih-Jen Lin (National Taiwan Univ.) 1 / 22 Outline Basic concepts: SVM and kernels Basic concepts: SVM and kernels SVM primal/dual problems
More informationMachine Learning and Data Mining. Support Vector Machines. Kalev Kask
Machine Learning and Data Mining Support Vector Machines Kalev Kask Linear classifiers Which decision boundary is better? Both have zero training error (perfect training accuracy) But, one of them seems
More informationModelli Lineari (Generalizzati) e SVM
Modelli Lineari (Generalizzati) e SVM Corso di AA, anno 2018/19, Padova Fabio Aiolli 19/26 Novembre 2018 Fabio Aiolli Modelli Lineari (Generalizzati) e SVM 19/26 Novembre 2018 1 / 36 Outline Linear methods
More informationMACHINE LEARNING. Support Vector Machines. Alessandro Moschitti
MACHINE LEARNING Support Vector Machines Alessandro Moschitti Department of information and communication technology University of Trento Email: moschitti@dit.unitn.it Summary Support Vector Machines
More informationChapter 9. Support Vector Machine. Yongdai Kim Seoul National University
Chapter 9. Support Vector Machine Yongdai Kim Seoul National University 1. Introduction Support Vector Machine (SVM) is a classification method developed by Vapnik (1996). It is thought that SVM improved
More informationAn introduction to Support Vector Machines
1 An introduction to Support Vector Machines Giorgio Valentini DSI - Dipartimento di Scienze dell Informazione Università degli Studi di Milano e-mail: valenti@dsi.unimi.it 2 Outline Linear classifiers
More informationSupport'Vector'Machines. Machine(Learning(Spring(2018 March(5(2018 Kasthuri Kannan
Support'Vector'Machines Machine(Learning(Spring(2018 March(5(2018 Kasthuri Kannan kasthuri.kannan@nyumc.org Overview Support Vector Machines for Classification Linear Discrimination Nonlinear Discrimination
More informationSupport Vector Machine (continued)
Support Vector Machine continued) Overlapping class distribution: In practice the class-conditional distributions may overlap, so that the training data points are no longer linearly separable. We need
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationSupport Vector Machines and Kernel Methods
2018 CS420 Machine Learning, Lecture 3 Hangout from Prof. Andrew Ng. http://cs229.stanford.edu/notes/cs229-notes3.pdf Support Vector Machines and Kernel Methods Weinan Zhang Shanghai Jiao Tong University
More informationMachine Learning. Support Vector Machines. Manfred Huber
Machine Learning Support Vector Machines Manfred Huber 2015 1 Support Vector Machines Both logistic regression and linear discriminant analysis learn a linear discriminant function to separate the data
More informationJeff Howbert Introduction to Machine Learning Winter
Classification / Regression Support Vector Machines Jeff Howbert Introduction to Machine Learning Winter 2012 1 Topics SVM classifiers for linearly separable classes SVM classifiers for non-linearly separable
More informationCS798: Selected topics in Machine Learning
CS798: Selected topics in Machine Learning Support Vector Machine Jakramate Bootkrajang Department of Computer Science Chiang Mai University Jakramate Bootkrajang CS798: Selected topics in Machine Learning
More informationStatistical learning theory, Support vector machines, and Bioinformatics
1 Statistical learning theory, Support vector machines, and Bioinformatics Jean-Philippe.Vert@mines.org Ecole des Mines de Paris Computational Biology group ENS Paris, november 25, 2003. 2 Overview 1.
More informationIndirect Rule Learning: Support Vector Machines. Donglin Zeng, Department of Biostatistics, University of North Carolina
Indirect Rule Learning: Support Vector Machines Indirect learning: loss optimization It doesn t estimate the prediction rule f (x) directly, since most loss functions do not have explicit optimizers. Indirection
More informationMax Margin-Classifier
Max Margin-Classifier Oliver Schulte - CMPT 726 Bishop PRML Ch. 7 Outline Maximum Margin Criterion Math Maximizing the Margin Non-Separable Data Kernels and Non-linear Mappings Where does the maximization
More informationLecture 9: Large Margin Classifiers. Linear Support Vector Machines
Lecture 9: Large Margin Classifiers. Linear Support Vector Machines Perceptrons Definition Perceptron learning rule Convergence Margin & max margin classifiers (Linear) support vector machines Formulation
More informationSupport Vector Machines
Wien, June, 2010 Paul Hofmarcher, Stefan Theussl, WU Wien Hofmarcher/Theussl SVM 1/21 Linear Separable Separating Hyperplanes Non-Linear Separable Soft-Margin Hyperplanes Hofmarcher/Theussl SVM 2/21 (SVM)
More informationApplied inductive learning - Lecture 7
Applied inductive learning - Lecture 7 Louis Wehenkel & Pierre Geurts Department of Electrical Engineering and Computer Science University of Liège Montefiore - Liège - November 5, 2012 Find slides: http://montefiore.ulg.ac.be/
More informationSupport Vector Machine & Its Applications
Support Vector Machine & Its Applications A portion (1/3) of the slides are taken from Prof. Andrew Moore s SVM tutorial at http://www.cs.cmu.edu/~awm/tutorials Mingyue Tan The University of British Columbia
More informationNeural Networks. Prof. Dr. Rudolf Kruse. Computational Intelligence Group Faculty for Computer Science
Neural Networks Prof. Dr. Rudolf Kruse Computational Intelligence Group Faculty for Computer Science kruse@iws.cs.uni-magdeburg.de Rudolf Kruse Neural Networks 1 Supervised Learning / Support Vector Machines
More informationIntroduction to Support Vector Machines
Introduction to Support Vector Machines Hsuan-Tien Lin Learning Systems Group, California Institute of Technology Talk in NTU EE/CS Speech Lab, November 16, 2005 H.-T. Lin (Learning Systems Group) Introduction
More informationSupport Vector Machines
Support Vector Machines Ryan M. Rifkin Google, Inc. 2008 Plan Regularization derivation of SVMs Geometric derivation of SVMs Optimality, Duality and Large Scale SVMs The Regularization Setting (Again)
More informationSupport Vector Machines
Support Vector Machines Le Song Machine Learning I CSE 6740, Fall 2013 Naïve Bayes classifier Still use Bayes decision rule for classification P y x = P x y P y P x But assume p x y = 1 is fully factorized
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationMachine Learning Support Vector Machines. Prof. Matteo Matteucci
Machine Learning Support Vector Machines Prof. Matteo Matteucci Discriminative vs. Generative Approaches 2 o Generative approach: we derived the classifier from some generative hypothesis about the way
More informationSupport Vector Machines
Support Vector Machines Reading: Ben-Hur & Weston, A User s Guide to Support Vector Machines (linked from class web page) Notation Assume a binary classification problem. Instances are represented by vector
More informationL5 Support Vector Classification
L5 Support Vector Classification Support Vector Machine Problem definition Geometrical picture Optimization problem Optimization Problem Hard margin Convexity Dual problem Soft margin problem Alexander
More informationSupport Vector Machines Explained
December 23, 2008 Support Vector Machines Explained Tristan Fletcher www.cs.ucl.ac.uk/staff/t.fletcher/ Introduction This document has been written in an attempt to make the Support Vector Machines (SVM),
More informationML (cont.): SUPPORT VECTOR MACHINES
ML (cont.): SUPPORT VECTOR MACHINES CS540 Bryan R Gibson University of Wisconsin-Madison Slides adapted from those used by Prof. Jerry Zhu, CS540-1 1 / 40 Support Vector Machines (SVMs) The No-Math Version
More informationSupport Vector Machines and Kernel Methods
Support Vector Machines and Kernel Methods Geoff Gordon ggordon@cs.cmu.edu July 10, 2003 Overview Why do people care about SVMs? Classification problems SVMs often produce good results over a wide range
More informationLearning with kernels and SVM
Learning with kernels and SVM Šámalova chata, 23. května, 2006 Petra Kudová Outline Introduction Binary classification Learning with Kernels Support Vector Machines Demo Conclusion Learning from data find
More informationMidterm Review CS 6375: Machine Learning. Vibhav Gogate The University of Texas at Dallas
Midterm Review CS 6375: Machine Learning Vibhav Gogate The University of Texas at Dallas Machine Learning Supervised Learning Unsupervised Learning Reinforcement Learning Parametric Y Continuous Non-parametric
More informationStatistical and Computational Learning Theory
Statistical and Computational Learning Theory Fundamental Question: Predict Error Rates Given: Find: The space H of hypotheses The number and distribution of the training examples S The complexity of the
More informationPattern Recognition and Machine Learning. Perceptrons and Support Vector machines
Pattern Recognition and Machine Learning James L. Crowley ENSIMAG 3 - MMIS Fall Semester 2016 Lessons 6 10 Jan 2017 Outline Perceptrons and Support Vector machines Notation... 2 Perceptrons... 3 History...3
More informationEE613 Machine Learning for Engineers. Kernel methods Support Vector Machines. jean-marc odobez 2015
EE613 Machine Learning for Engineers Kernel methods Support Vector Machines jean-marc odobez 2015 overview Kernel methods introductions and main elements defining kernels Kernelization of k-nn, K-Means,
More information18.9 SUPPORT VECTOR MACHINES
744 Chapter 8. Learning from Examples is the fact that each regression problem will be easier to solve, because it involves only the examples with nonzero weight the examples whose kernels overlap the
More informationFoundation of Intelligent Systems, Part I. SVM s & Kernel Methods
Foundation of Intelligent Systems, Part I SVM s & Kernel Methods mcuturi@i.kyoto-u.ac.jp FIS - 2013 1 Support Vector Machines The linearly-separable case FIS - 2013 2 A criterion to select a linear classifier:
More informationSupport Vector Machines
Support Vector Machines Sridhar Mahadevan mahadeva@cs.umass.edu University of Massachusetts Sridhar Mahadevan: CMPSCI 689 p. 1/32 Margin Classifiers margin b = 0 Sridhar Mahadevan: CMPSCI 689 p.
More informationMachine Learning And Applications: Supervised Learning-SVM
Machine Learning And Applications: Supervised Learning-SVM Raphaël Bournhonesque École Normale Supérieure de Lyon, Lyon, France raphael.bournhonesque@ens-lyon.fr 1 Supervised vs unsupervised learning Machine
More informationLinear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers) Solution only depends on a small subset of training
More informationLinear Classification and SVM. Dr. Xin Zhang
Linear Classification and SVM Dr. Xin Zhang Email: eexinzhang@scut.edu.cn What is linear classification? Classification is intrinsically non-linear It puts non-identical things in the same class, so a
More informationConstrained Optimization and Support Vector Machines
Constrained Optimization and Support Vector Machines Man-Wai MAK Dept. of Electronic and Information Engineering, The Hong Kong Polytechnic University enmwmak@polyu.edu.hk http://www.eie.polyu.edu.hk/
More informationSupport Vector Machines
Support Vector Machines Stephan Dreiseitl University of Applied Sciences Upper Austria at Hagenberg Harvard-MIT Division of Health Sciences and Technology HST.951J: Medical Decision Support Overview Motivation
More informationICS-E4030 Kernel Methods in Machine Learning
ICS-E4030 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 28. September, 2016 Juho Rousu 28. September, 2016 1 / 38 Convex optimization Convex optimisation This
More informationLecture 14 : Online Learning, Stochastic Gradient Descent, Perceptron
CS446: Machine Learning, Fall 2017 Lecture 14 : Online Learning, Stochastic Gradient Descent, Perceptron Lecturer: Sanmi Koyejo Scribe: Ke Wang, Oct. 24th, 2017 Agenda Recap: SVM and Hinge loss, Representer
More informationPattern Recognition 2018 Support Vector Machines
Pattern Recognition 2018 Support Vector Machines Ad Feelders Universiteit Utrecht Ad Feelders ( Universiteit Utrecht ) Pattern Recognition 1 / 48 Support Vector Machines Ad Feelders ( Universiteit Utrecht
More informationLecture 18: Kernels Risk and Loss Support Vector Regression. Aykut Erdem December 2016 Hacettepe University
Lecture 18: Kernels Risk and Loss Support Vector Regression Aykut Erdem December 2016 Hacettepe University Administrative We will have a make-up lecture on next Saturday December 24, 2016 Presentations
More informationAnnouncements - Homework
Announcements - Homework Homework 1 is graded, please collect at end of lecture Homework 2 due today Homework 3 out soon (watch email) Ques 1 midterm review HW1 score distribution 40 HW1 total score 35
More informationIntroduction to SVM and RVM
Introduction to SVM and RVM Machine Learning Seminar HUS HVL UIB Yushu Li, UIB Overview Support vector machine SVM First introduced by Vapnik, et al. 1992 Several literature and wide applications Relevance
More informationPolyhedral Computation. Linear Classifiers & the SVM
Polyhedral Computation Linear Classifiers & the SVM mcuturi@i.kyoto-u.ac.jp Nov 26 2010 1 Statistical Inference Statistical: useful to study random systems... Mutations, environmental changes etc. life
More informationMachine Learning
Machine Learning 10-601 Tom M. Mitchell Machine Learning Department Carnegie Mellon University October 11, 2012 Today: Computational Learning Theory Probably Approximately Coorrect (PAC) learning theorem
More informationLinear, threshold units. Linear Discriminant Functions and Support Vector Machines. Biometrics CSE 190 Lecture 11. X i : inputs W i : weights
Linear Discriminant Functions and Support Vector Machines Linear, threshold units CSE19, Winter 11 Biometrics CSE 19 Lecture 11 1 X i : inputs W i : weights θ : threshold 3 4 5 1 6 7 Courtesy of University
More informationSupport Vector Machines for Classification: A Statistical Portrait
Support Vector Machines for Classification: A Statistical Portrait Yoonkyung Lee Department of Statistics The Ohio State University May 27, 2011 The Spring Conference of Korean Statistical Society KAIST,
More informationMachine Learning. Lecture 6: Support Vector Machine. Feng Li.
Machine Learning Lecture 6: Support Vector Machine Feng Li fli@sdu.edu.cn https://funglee.github.io School of Computer Science and Technology Shandong University Fall 2018 Warm Up 2 / 80 Warm Up (Contd.)
More informationSupport Vector Machines
EE 17/7AT: Optimization Models in Engineering Section 11/1 - April 014 Support Vector Machines Lecturer: Arturo Fernandez Scribe: Arturo Fernandez 1 Support Vector Machines Revisited 1.1 Strictly) Separable
More informationMidterm Review CS 7301: Advanced Machine Learning. Vibhav Gogate The University of Texas at Dallas
Midterm Review CS 7301: Advanced Machine Learning Vibhav Gogate The University of Texas at Dallas Supervised Learning Issues in supervised learning What makes learning hard Point Estimation: MLE vs Bayesian
More informationMehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Homework assignment 3 April 5, 2013 Due: April 19, 2013
Mehryar Mohri Foundations of Machine Learning Courant Institute of Mathematical Sciences Homework assignment 3 April 5, 2013 Due: April 19, 2013 A. Kernels 1. Let X be a finite set. Show that the kernel
More informationSupport vector machines Lecture 4
Support vector machines Lecture 4 David Sontag New York University Slides adapted from Luke Zettlemoyer, Vibhav Gogate, and Carlos Guestrin Q: What does the Perceptron mistake bound tell us? Theorem: The
More informationDan Roth 461C, 3401 Walnut
CIS 519/419 Applied Machine Learning www.seas.upenn.edu/~cis519 Dan Roth danroth@seas.upenn.edu http://www.cis.upenn.edu/~danroth/ 461C, 3401 Walnut Slides were created by Dan Roth (for CIS519/419 at Penn
More informationSupport Vector Machine
Andrea Passerini passerini@disi.unitn.it Machine Learning Support vector machines In a nutshell Linear classifiers selecting hyperplane maximizing separation margin between classes (large margin classifiers)
More informationA short introduction to supervised learning, with applications to cancer pathway analysis Dr. Christina Leslie
A short introduction to supervised learning, with applications to cancer pathway analysis Dr. Christina Leslie Computational Biology Program Memorial Sloan-Kettering Cancer Center http://cbio.mskcc.org/leslielab
More informationCS-E4830 Kernel Methods in Machine Learning
CS-E4830 Kernel Methods in Machine Learning Lecture 3: Convex optimization and duality Juho Rousu 27. September, 2017 Juho Rousu 27. September, 2017 1 / 45 Convex optimization Convex optimisation This
More informationComputational Learning Theory
Computational Learning Theory Pardis Noorzad Department of Computer Engineering and IT Amirkabir University of Technology Ordibehesht 1390 Introduction For the analysis of data structures and algorithms
More informationIntroduction to Support Vector Machines
Introduction to Support Vector Machines Andreas Maletti Technische Universität Dresden Fakultät Informatik June 15, 2006 1 The Problem 2 The Basics 3 The Proposed Solution Learning by Machines Learning
More informationLecture Notes on Support Vector Machine
Lecture Notes on Support Vector Machine Feng Li fli@sdu.edu.cn Shandong University, China 1 Hyperplane and Margin In a n-dimensional space, a hyper plane is defined by ω T x + b = 0 (1) where ω R n is
More informationCIS 520: Machine Learning Oct 09, Kernel Methods
CIS 520: Machine Learning Oct 09, 207 Kernel Methods Lecturer: Shivani Agarwal Disclaimer: These notes are designed to be a supplement to the lecture They may or may not cover all the material discussed
More informationA GENERAL FORMULATION FOR SUPPORT VECTOR MACHINES. Wei Chu, S. Sathiya Keerthi, Chong Jin Ong
A GENERAL FORMULATION FOR SUPPORT VECTOR MACHINES Wei Chu, S. Sathiya Keerthi, Chong Jin Ong Control Division, Department of Mechanical Engineering, National University of Singapore 0 Kent Ridge Crescent,
More informationSupport Vector Machines. Machine Learning Fall 2017
Support Vector Machines Machine Learning Fall 2017 1 Where are we? Learning algorithms Decision Trees Perceptron AdaBoost 2 Where are we? Learning algorithms Decision Trees Perceptron AdaBoost Produce
More informationMachine Learning
Machine Learning 10-601 Tom M. Mitchell Machine Learning Department Carnegie Mellon University October 11, 2012 Today: Computational Learning Theory Probably Approximately Coorrect (PAC) learning theorem
More informationSupport Vector Machines. CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington
Support Vector Machines CSE 6363 Machine Learning Vassilis Athitsos Computer Science and Engineering Department University of Texas at Arlington 1 A Linearly Separable Problem Consider the binary classification
More informationChapter 6: Classification
Chapter 6: Classification 1) Introduction Classification problem, evaluation of classifiers, prediction 2) Bayesian Classifiers Bayes classifier, naive Bayes classifier, applications 3) Linear discriminant
More informationMark your answers ON THE EXAM ITSELF. If you are not sure of your answer you may wish to provide a brief explanation.
CS 189 Spring 2015 Introduction to Machine Learning Midterm You have 80 minutes for the exam. The exam is closed book, closed notes except your one-page crib sheet. No calculators or electronic items.
More informationAbout this class. Maximizing the Margin. Maximum margin classifiers. Picture of large and small margin hyperplanes
About this class Maximum margin classifiers SVMs: geometric derivation of the primal problem Statement of the dual problem The kernel trick SVMs as the solution to a regularization problem Maximizing the
More informationA Tutorial on Support Vector Machine
A Tutorial on School of Computing National University of Singapore Contents Theory on Using with Other s Contents Transforming Theory on Using with Other s What is a classifier? A function that maps instances
More informationCOMP 875 Announcements
Announcements Tentative presentation order is out Announcements Tentative presentation order is out Remember: Monday before the week of the presentation you must send me the final paper list (for posting
More informationCSC 411 Lecture 17: Support Vector Machine
CSC 411 Lecture 17: Support Vector Machine Ethan Fetaya, James Lucas and Emad Andrews University of Toronto CSC411 Lec17 1 / 1 Today Max-margin classification SVM Hard SVM Duality Soft SVM CSC411 Lec17
More information