quantifying algorithmic improvements
play

Quantifying Algorithmic Improvements Lars Kotthofg University of - PowerPoint PPT Presentation

Quantifying Algorithmic Improvements Lars Kotthofg University of Wyoming larsko@uwyo.edu 1 Leiden, 10 July 2018 1 joint work with Alexandre Frchette, Tomasz Michalak, Talal Rahwan, Holger H. Hoos, Kevin Leyton-Brown you still have made lots


  1. Quantifying Algorithmic Improvements Lars Kotthofg University of Wyoming larsko@uwyo.edu 1 Leiden, 10 July 2018 1 joint work with Alexandre Fréchette, Tomasz Michalak, Talal Rahwan, Holger H. Hoos, Kevin Leyton-Brown

  2. you still have made lots of money? What if one of the constituent Motivation 1.35 0.35 0.275 0.375 popularity times volume? 2 popularity times price? 1.75 5 5 0.3 2 How much worse would the blend be without each cheese? Would cheeses is based on another constituent cheese? average fractions? 3 1 0.2 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.45 10 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  3. you still have made lots of money? What if one of the constituent Motivation 1.35 0.35 0.275 0.375 popularity times volume? 2 popularity times price? 1.75 5 5 0.3 2 How much worse would the blend be without each cheese? Would cheeses is based on another constituent cheese? average fractions? 3 1 0.2 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.45 10 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  4. you still have made lots of money? What if one of the constituent Motivation 1.35 0.35 0.275 0.375 popularity times volume? 2 popularity times price? 1.75 5 5 0.3 2 How much worse would the blend be without each cheese? Would cheeses is based on another constituent cheese? average fractions? 3 1 0.2 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.45 10 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  5. you still have made lots of money? What if one of the constituent Motivation 1.35 0.35 0.275 0.375 popularity times volume? 2 popularity times price? 1.75 5 5 0.3 2 How much worse would the blend be without each cheese? Would cheeses is based on another constituent cheese? average fractions? 3 1 0.2 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.45 10 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  6. you still have made lots of money? What if one of the constituent Motivation 1.35 0.35 0.275 0.375 popularity times volume? 2 popularity times price? 1.75 5 5 0.3 2 How much worse would the blend be without each cheese? Would cheeses is based on another constituent cheese? average fractions? 3 1 0.2 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.45 10 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  7. you still have made lots of money? What if one of the constituent Motivation 1.35 0.35 0.275 0.375 popularity times volume? 2 popularity times price? 1.75 5 5 0.3 2 How much worse would the blend be without each cheese? Would cheeses is based on another constituent cheese? average fractions? 3 1 0.2 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.45 10 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  8. you still have made lots of money? What if one of the constituent Motivation 1.35 0.35 0.275 0.375 popularity times volume? 2 popularity times price? 1.75 5 5 0.3 2 How much worse would the blend be without each cheese? Would cheeses is based on another constituent cheese? average fractions? 3 1 0.2 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.45 10 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  9. Motivation popularity times price? 0.275 0.375 popularity times volume? 2 1.35 1.75 5 average fractions? 0.3 2 How much worse would the blend be without each cheese? Would you still have made lots of money? What if one of the constituent cheeses is based on another constituent cheese? 0.35 5 1 3 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.2 0.45 0.35 cost fraction in blend 0.5 0.1 0.4 popularity 10 ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of

  10. Motivation 5 cheeses is based on another constituent cheese? How much worse would the blend be without each cheese? Would 2 0.3 5 popularity times price? 1.75 1.35 2 popularity times volume? 0.375 0.275 0.35 average fractions? 3 1 10 the constituent cheeses cheese A cheese B cheese C volume fraction in blend 0.2 0.45 0.35 cost fraction in blend 0.5 0.1 0.4 popularity ▷ you’re blending a great new cheese and make lots of money ▷ you want to distribute the money fairly to the producers of you still have made lots of money? What if one of the constituent

  11. Analyzing Algorithms – Setting unsorted list 2 ▷ sorting lists with quicksort algorithm ▷ difgerent methods for choosing pivot, which partitions the ▷ measure time to sort list ▷ score proportional to speed

  12. Contributions – Standalone Performance 3 dual pivot (2009) 798602199 dual pivot (2009) median 9 (1993) 798501630 median 9 (1993) median 9 random (1993) 798470169 median 9 random (1993) 798466233 mid (1978) mid (1978) 798461169 median 3 random (1978) median 3 random (1978) random (1961) 798360514 random (1961) median 3 (1978) 794178118 median 3 (1978) first (1961) 784476788 first (1961) insertion (1946) 671833 insertion (1946) Standalone Performance

  13. Contributions – Standalone Performance How well do they complement each other? 3 dual pivot (2009) 798602199 dual pivot (2009) median 9 (1993) 798501630 median 9 (1993) median 9 random (1993) 798470169 median 9 random (1993) 798466233 mid (1978) mid (1978) 798461169 median 3 random (1978) median 3 random (1978) random (1961) 798360514 random (1961) median 3 (1978) 794178118 median 3 (1978) first (1961) 784476788 first (1961) insertion (1946) 671833 insertion (1946) Standalone Performance

  14. Contributions – Marginal Performance How much does an algorithm contribute to the state of the art (defjned by a coalition of all other algorithms)? Xu, Hutter, Hoos, Leyton-Brown. “Evaluating Component Solver Contributions to Portfolio-Based Algorithm Selectors.” SAT 2012 4 φ i = v ( C i ∪ { i } ) − v ( C i )

  15. Contributions – Marginal Performance 5 dual pivot (2009) 798602199 median 9 (1993) 798501630 798470169 median 9 random (1993) mid (1978) 798466233 median 3 random (1978) 798461169 798360514 random (1961) median 3 (1978) 794178118 first (1961) 784476788 98900 dual pivot (2009) 18 median 9 (1993) 5 median 3 random (1978) 5 median 9 random (1993) 3 mid (1978) 1 median 3 (1978) 0 first (1961) 0 insertion (1946) insertion (1946) 671833 0 random (1961) Standalone Performance Marginal Performance

  16. Contributions – Marginal Performance …most get almost nothing? 5 dual pivot (2009) 798602199 median 9 (1993) 798501630 798470169 median 9 random (1993) mid (1978) 798466233 median 3 random (1978) 798461169 798360514 random (1961) median 3 (1978) 794178118 first (1961) 784476788 98900 dual pivot (2009) 18 median 9 (1993) 5 median 3 random (1978) 5 median 9 random (1993) 3 mid (1978) 1 median 3 (1978) 0 first (1961) 0 insertion (1946) insertion (1946) 671833 0 random (1961) Standalone Performance Marginal Performance

  17. Shapley Value How much does an algorithm contribute to all possible coalitions Algorithm Portfolios.” In 30th AAAI Conference on Artifjcial Intelligence, 2016. Leyton-Brown, and Tomasz P. Michalak. “Using the Shapley Value to Analyze Fréchette, Alexandre, Lars Kotthofg, Talal Rahwan, Holger H. Hoos, Kevin Games, 1953. We can compute this in polynomial time. 6 of other algorithms? φ i = 1 ∑ v ( C π i ∪ { i } ) − v ( C π i ) | Π | π ∈ Π N Shapley. “A Value for n -person Games.” In Contributions to the Theory of

  18. Properties Dummy An algorithm that make no contribution in any case does not have any value. Symmetry Identical algorithms have the same value. Additivity The sum of values of an algorithm under two difgerent performance measures is the same as its value under a combined measure. 7 Effjciency The total value is distributed among algorithms.

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