1 / 45

Lecture 17: Supervised Learning Recap

Lecture 17: Supervised Learning Recap. Machine Learning April 6, 2010. Last Time. Support Vector Machines Kernel Methods. Today. Short recap of Kernel Methods Review of Supervised Learning Unsupervised Learning (Soft) K-means clustering Expectation Maximization Spectral Clustering

lotta
Download Presentation

Lecture 17: Supervised Learning Recap

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript


  1. Lecture 17: Supervised Learning Recap Machine Learning April 6, 2010

  2. Last Time • Support Vector Machines • Kernel Methods

  3. Today • Short recap of Kernel Methods • Review of Supervised Learning • Unsupervised Learning • (Soft) K-means clustering • Expectation Maximization • Spectral Clustering • Principle Components Analysis • Latent Semantic Analysis

  4. Kernel Methods • Feature extraction to higher dimensional spaces. • Kernels describe the relationship between vectors (points) rather than the new feature space directly.

  5. When can we use kernels? • Any time training and evaluation are both based on the dot product between two points. • SVMs • Perceptron • k-nearest neighbors • k-means • etc.

  6. Kernels in SVMs • Optimize αi’s and bias w.r.t. kernel • Decision function:

  7. Kernels in Perceptrons • Training • Decision function

  8. Good and Valid Kernels • Good: Computing K(xi,xj) is cheaper than ϕ(xi) • Valid: • Symmetric: K(xi,xj) =K(xj,xi) • Decomposable into ϕ(xi)Tϕ(xj) • Positive Semi Definite Gram Matrix • Popular Kernels • Linear, Polynomial • Radial Basis Function • String (technically infinite dimensions) • Graph

  9. Supervised Learning • Linear Regression • Logistic Regression • Graphical Models • Hidden Markov Models • Neural Networks • Support Vector Machines • Kernel Methods

  10. Major concepts • Gaussian, Multinomial, Bernoulli Distributions • Joint vs. Conditional Distributions • Marginalization • Maximum Likelihood • Risk Minimization • Gradient Descent • Feature Extraction, Kernel Methods

  11. Some favorite distributions • Bernoulli • Multinomial • Gaussian

  12. Maximum Likelihood • Identify the parameter values that yield the maximum likelihood of generating the observed data. • Take the partial derivative of the likelihood function • Set to zero • Solve • NB: maximum likelihood parameters are the same as maximum log likelihood parameters

  13. Maximum Log Likelihood • Why do we like the log function? • It turns products (difficult to differentiate) and turns them into sums (easy to differentiate) • log(xy) = log(x) + log(y) • log(xc) = clog(x)

  14. Risk Minimization • Pick a loss function • Squared loss • Linear loss • Perceptron (classification) loss • Identify the parameters that minimize the loss function. • Take the partial derivative of the loss function • Set to zero • Solve

  15. Frequentistsv. Bayesians • Point estimates vs. Posteriors • Risk Minimization vs. Maximum Likelihood • L2-Regularization • Frequentists: Add a constraint on the size of the weight vector • Bayesians: Introduce a zero-mean prior on the weight vector • Result is the same!

  16. L2-Regularization • Frequentists: • Introduce a cost on the size of the weights • Bayesians: • Introduce a prior on the weights

  17. Types of Classifiers • Generative Models • Highest resource requirements. • Need to approximate the joint probability • Discriminative Models • Moderate resource requirements. • Typically fewer parameters to approximate than generative models • Discriminant Functions • Can be trained probabilistically, but the output does not include confidence information

  18. Linear Regression • Fit a line to a set of points

  19. Linear Regression • Extension to higher dimensions • Polynomial fitting • Arbitrary function fitting • Wavelets • Radial basis functions • Classifier output

  20. Logistic Regression • Fit gaussians to data for each class • The decision boundary is where the PDFs cross • No “closed form” solution to the gradient. • Gradient Descent

  21. Graphical Models • General way to describe the dependence relationships between variables. • Junction Tree Algorithm allows us to efficiently calculate marginals over any variable.

  22. Junction Tree Algorithm • Moralization • “Marry the parents” • Make undirected • Triangulation • Remove cycles >4 • Junction Tree Construction • Identify separators such that the running intersection property holds • Introduction of Evidence • Pass slices around the junction tree to generate marginals

  23. Hidden Markov Models • Sequential Modeling • Generative Model • Relationship between observations and state (class) sequences

  24. Perceptron • Step function used for squashing. • Classifier as Neuron metaphor.

  25. Perceptron Loss • Classification Error vs. Sigmoid Error • Loss is only calculated on Mistakes Perceptrons use strictly classification error

  26. Neural Networks • Interconnected Layers of Perceptrons or Logistic Regression “neurons”

  27. Neural Networks • There are many possible configurations of neural networks • Vary the number of layers • Size of layers

  28. Support Vector Machines • Maximum Margin Classification Small Margin Large Margin

  29. Support Vector Machines • Optimization Function • Decision Function

  30. Visualization of Support Vectors

  31. Questions? • Now would be a good time to ask questions about Supervised Techniques.

  32. Clustering • Identify discrete groups of similar data points • Data points are unlabeled

  33. Recall K-Means • Algorithm • Select K – the desired number of clusters • Initialize K cluster centroids • For each point in the data set, assign it to the cluster with the closest centroid • Update the centroid based on the points assigned to each cluster • If any data point has changed clusters, repeat

  34. k-means output

  35. Soft K-means • In k-means, we force every data point to exist in exactly one cluster. • This constraint can be relaxed. Minimizes the entropy of cluster assignment

  36. Soft k-means example

  37. Soft k-means • We still define a cluster by a centroid, but we calculate the centroid as the weighted mean of all the data points • Convergence is based on a stopping threshold rather than changed assignments

  38. Gaussian Mixture Models • Rather than identifying clusters by “nearest” centroids • Fit a Set of k Gaussians to the data.

  39. GMM example

  40. Gaussian Mixture Models • Formally a Mixture Model is the weighted sum of a number of pdfs where the weights are determined by a distribution,

  41. Graphical Modelswith unobserved variables • What if you have variables in a Graphical model that are never observed? • Latent Variables • Training latent variable models is an unsupervised learning application uncomfortable amused sweating laughing

  42. Latent Variable HMMs • We can cluster sequences using an HMM with unobserved state variables • We will train the latent variable models using Expectation Maximization

  43. Expectation Maximization • Both the training of GMMs and Gaussian Models with latent variables are accomplished using Expectation Maximization • Step 1: Expectation (E-step) • Evaluate the “responsibilities” of each cluster with the current parameters • Step 2: Maximization (M-step) • Re-estimate parameters using the existing “responsibilities” • Related to k-means

  44. Questions • One more time for questions on supervised learning…

  45. Next Time • Gaussian Mixture Models (GMMs) • Expectation Maximization

More Related