boosting foundations and algorithms boosting foundations
play

Boosting: Foundations and Algorithms Boosting: Foundations and - PowerPoint PPT Presentation

Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Rob Schapire Example: Spam Filtering Example: Spam


  1. Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Boosting: Foundations and Algorithms Rob Schapire

  2. Example: Spam Filtering Example: Spam Filtering Example: Spam Filtering Example: Spam Filtering Example: Spam Filtering • problem: filter out spam (junk email) • gather large collection of examples of spam and non-spam: From: yoav@ucsd.edu Rob, can you review a paper... non-spam From: xa412@hotmail.com Earn money without working!!!! ... spam . . . . . . . . . • goal: have computer learn from examples to distinguish spam from non-spam

  3. Machine Learning Machine Learning Machine Learning Machine Learning Machine Learning • studies how to automatically learn to make accurate predictions based on past observations • classification problems: • classify examples into given set of categories new example labeled classification machine learning training rule algorithm examples predicted classification

  4. Examples of Classification Problems Examples of Classification Problems Examples of Classification Problems Examples of Classification Problems Examples of Classification Problems • text categorization (e.g., spam filtering) • fraud detection • machine vision (e.g., face detection) • natural-language processing (e.g., spoken language understanding) • market segmentation (e.g.: predict if customer will respond to promotion) • bioinformatics (e.g., classify proteins according to their function) . . .

  5. Back to Spam Back to Spam Back to Spam Back to Spam Back to Spam • main observation: • easy to find “rules of thumb” that are “often” correct • If ‘ viagra ’ occurs in message, then predict ‘ spam ’ • hard to find single rule that is very highly accurate

  6. The Boosting Approach The Boosting Approach The Boosting Approach The Boosting Approach The Boosting Approach • devise computer program for deriving rough rules of thumb • apply procedure to subset of examples • obtain rule of thumb • apply to 2nd subset of examples • obtain 2nd rule of thumb • repeat T times

  7. Key Details Key Details Key Details Key Details Key Details • how to choose examples on each round? • concentrate on “hardest” examples (those most often misclassified by previous rules of thumb) • how to combine rules of thumb into single prediction rule? • take (weighted) majority vote of rules of thumb

  8. Boosting Boosting Boosting Boosting Boosting • boosting = general method of converting rough rules of thumb into highly accurate prediction rule • technically: • assume given “weak” learning algorithm that can consistently find classifiers (“rules of thumb”) at least slightly better than random, say, accuracy ≥ 55% (in two-class setting) [ “weak learning assumption” ] • given sufficient data, a boosting algorithm can provably construct single classifier with very high accuracy, say, 99%

  9. Early History Early History Early History Early History Early History • [Valiant ’84] : • introduced theoretical (“PAC”) model for studying machine learning • [Kearns & Valiant ’88] : • open problem of finding a boosting algorithm • if boosting possible, then... • can use (fairly) wild guesses to produce highly accurate predictions • if can learn “part way” then can learn “all the way” • should be able to improve any learning algorithm • for any learning problem: • either can always learn with nearly perfect accuracy • or there exist cases where cannot learn even slightly better than random guessing

  10. First Boosting Algorithms First Boosting Algorithms First Boosting Algorithms First Boosting Algorithms First Boosting Algorithms • [Schapire ’89] : • first provable boosting algorithm • [Freund ’90] : • “optimal” algorithm that “boosts by majority” • [Drucker, Schapire & Simard ’92] : • first experiments using boosting • limited by practical drawbacks • [Freund & Schapire ’95] : • introduced “AdaBoost” algorithm • strong practical advantages over previous boosting algorithms

  11. A Formal Description of Boosting A Formal Description of Boosting A Formal Description of Boosting A Formal Description of Boosting A Formal Description of Boosting • given training set ( x 1 , y 1 ) , . . . , ( x m , y m ) • y i ∈ {− 1 , +1 } correct label of instance x i ∈ X • for t = 1 , . . . , T : • construct distribution D t on { 1 , . . . , m } • find weak classifier (“rule of thumb”) h t : X → {− 1 , +1 } with small error ǫ t on D t : ǫ t = Pr i ∼ D t [ h t ( x i ) � = y i ] • output final classifier H final

  12. AdaBoost AdaBoost AdaBoost AdaBoost AdaBoost [with Freund] • constructing D t : • D 1 ( i ) = 1 / m • given D t and h t : � e − α t D t ( i ) if y i = h t ( x i ) D t +1 ( i ) = × e α t if y i � = h t ( x i ) Z t D t ( i ) = exp( − α t y i h t ( x i )) Z t where Z t = normalization factor � 1 − ǫ t � α t = 1 2 ln > 0 ǫ t • final classifier: �� � • H final ( x ) = sign α t h t ( x ) t

  13. Toy Example Toy Example Toy Example Toy Example Toy Example D 1 weak classifiers = vertical or horizontal half-planes

  14. Round 1 Round 1 Round 1 Round 1 Round 1 h 1 D 2 ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ���� ���� ������������� ������������� ε 1 =0.30 α =0.42 1

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend