good predictions are worth a few comparisons
play

Good Predictions Are Worth a Few Comparisons Carine Pivoteau with - PowerPoint PPT Presentation

Jun 02, 2023 •444 likes •1.11k views

Good Predictions Are Worth a Few Comparisons Carine Pivoteau with Nicolas Auger and Cyril Nicaud LIGM - Universit e Paris-Est-Marne-la-Vall ee March 2016 Carine Pivoteau Good predictions are worth... 1/11 A case study Find both the

  1. Good Predictions Are Worth a Few Comparisons Carine Pivoteau with Nicolas Auger and Cyril Nicaud LIGM - Universit´ e Paris-Est-Marne-la-Vall´ ee March 2016 Carine Pivoteau Good predictions are worth... 1/11

  2. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 min = 5 max = 5 Carine Pivoteau Good predictions are worth... 2/11

  3. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 1 < min ? 1 > max ? min = 5 max = 5 Carine Pivoteau Good predictions are worth... 2/11

  4. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 1 < min ? 1 > max ? min = 1 max = 5 Carine Pivoteau Good predictions are worth... 2/11

  5. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 4 < min ? 4 > max ? min = 1 max = 5 Carine Pivoteau Good predictions are worth... 2/11

  6. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 3 < min ? 3 > max ? min = 1 max = 5 Carine Pivoteau Good predictions are worth... 2/11

  7. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 6 < min ? 6 > max ? min = 1 max = 5 Carine Pivoteau Good predictions are worth... 2/11

  8. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 6 < min ? 6 > max ? min = 1 max = 6 Carine Pivoteau Good predictions are worth... 2/11

  9. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 0 < min ? 0 > max ? min = 1 max = 6 Carine Pivoteau Good predictions are worth... 2/11

  10. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 0 < min ? 0 > max ? min = 0 max = 6 Carine Pivoteau Good predictions are worth... 2/11

  11. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 2 < min ? 2 > max ? min = 0 max = 6 Carine Pivoteau Good predictions are worth... 2/11

  12. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 8 < min ? 8 > max ? min = 0 max = 6 Carine Pivoteau Good predictions are worth... 2/11

  13. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 8 < min ? 8 > max ? min = 0 max = 8 Carine Pivoteau Good predictions are worth... 2/11

  14. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 7 < min ? 7 > max ? min = 0 max = 8 Carine Pivoteau Good predictions are worth... 2/11

  15. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 9 < min ? 9 > max ? min = 0 max = 8 Carine Pivoteau Good predictions are worth... 2/11

  16. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 5 1 4 3 6 0 2 8 7 9 9 < min ? 9 > max ? min = 0 max = 9 Carine Pivoteau Good predictions are worth... 2/11

  17. A case study Find both the min. and the max. of an array of size n . Naive Algorithm: 2 n comparisons 5 1 4 3 6 0 2 8 7 9 9 < min ? 9 > max ? min = 0 max = 9 Can we do better? Carine Pivoteau Good predictions are worth... 2/11

  18. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 min = 5 max = 5 Carine Pivoteau Good predictions are worth... 2/11

  19. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 5 < 1 ? 1 < min ? min = 5 5 > max ? max = 5 Carine Pivoteau Good predictions are worth... 2/11

  20. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 5 < 1 ? 1 < min ? min = 1 5 > max ? max = 5 Carine Pivoteau Good predictions are worth... 2/11

  21. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 4 < 3 ? 3 < min ? min = 1 4 > max ? max = 5 Carine Pivoteau Good predictions are worth... 2/11

  22. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 6 < 0 ? 0 < min ? min = 1 6 > max ? max = 5 Carine Pivoteau Good predictions are worth... 2/11

  23. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 6 < 0 ? 0 < min ? min = 0 6 > max ? max = 6 Carine Pivoteau Good predictions are worth... 2/11

  24. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 2 < 8 ? 2 < min ? min = 0 8 > max ? max = 6 Carine Pivoteau Good predictions are worth... 2/11

  25. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 2 < 8 ? 2 < min ? min = 0 8 > max ? max = 8 Carine Pivoteau Good predictions are worth... 2/11

  26. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 7 < 9 ? 7 < min ? min = 0 9 > max ? max = 8 Carine Pivoteau Good predictions are worth... 2/11

  27. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 5 1 4 3 6 0 2 8 7 9 7 < 9 ? 7 < min ? min = 0 9 > max ? max = 9 Carine Pivoteau Good predictions are worth... 2/11

  28. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 3 n/ 2 comparisons (optimal) 5 1 4 3 6 0 2 8 7 9 7 < 9 ? 7 < min ? min = 0 9 > max ? max = 9 Carine Pivoteau Good predictions are worth... 2/11

  29. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 3 n/ 2 comparisons (optimal) Naive Algorithm: 2 n comparisons Carine Pivoteau Good predictions are worth... 2/11

  30. A case study Find both the min. and the max. of an array of size n . Optimized Algorithm: 3 n/ 2 comparisons (optimal) Naive Algorithm: 2 n comparisons In practice, on uniform random data? Carine Pivoteau Good predictions are worth... 2/11

  31. A case study Find both the min. and the max. of an array of size n . in C, using gcc -O0 , random integers Carine Pivoteau Good predictions are worth... 2/11

  32. A case study Find both the min. and the max. of an array of size n . in C, using gcc -O0 , random integers Carine Pivoteau Good predictions are worth... 2/11

  33. Some background (mostly from Hennessy and Patterson [HP11]) ◮ Most modern processors are pipelined ◮ Instructions are parallelized Branch predictors are used to avoid stalls on branches! Conditional instructions (such as the “if” statement) yield branches in the execution of a program The branch predictor will guess which branch will be taken (T) or not (NT). A misprediction can be quite expensive ! Different schemes: static, dynamic, local, global,. . . Carine Pivoteau Good predictions are worth... 3/11

  34. Some background (mostly from Hennessy and Patterson [HP11]) ◮ Most modern processors are pipelined ◮ Instructions are parallelized Branch predictors are used to avoid stalls on branches! 1-bit predictor: NT T T NT T NT Carine Pivoteau Good predictions are worth... 3/11

  35. Some background (mostly from Hennessy and Patterson [HP11]) ◮ Most modern processors are pipelined ◮ Instructions are parallelized Branch predictors are used to avoid stalls on branches! 2-bit predictor: NT T T T T S. NT NT T S. T NT NT NT Carine Pivoteau Good predictions are worth... 3/11

  36. Some background (mostly from Hennessy and Patterson [HP11]) ◮ Most modern processors are pipelined ◮ Instructions are parallelized Branch predictors are used to avoid stalls on branches! Global (or mixed) predictor: ← − ¸ − → 0000...00 0000...01 ... 1111...11 Carine Pivoteau Good predictions are worth... 3/11

  37. Some background (mostly from Hennessy and Patterson [HP11]) ◮ Most modern processors are pipelined ◮ Instructions are parallelized Branch predictors are used to avoid stalls on branches! Conditional instructions (such as the “if” statement) yield branches in the execution of a program The branch predictor will guess which branch will be taken (T) or not (NT). A misprediction can be quite expensive ! Different schemes: static, dynamic, local, global,. . . Min and max search is very sensitive to branch prediction... Carine Pivoteau Good predictions are worth... 3/11

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

Good Predictions Are Worth a Few Comparisons Carine Pivoteau with Nicolas Auger and Cyril Nicaud

Good Predictions Are Worth a Few Comparisons Carine Pivoteau with Nicolas Auger and Cyril Nicaud

Good Predictions Are Worth a Few Comparisons Carine Pivoteau with Nicolas Auger and Cyril Nicaud LIGM - Universit e Paris-Est-Marne-la-Vall ee April 2016 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 1/16 A case

936 views • 78 slides
Multiple Comparisons Occasionally, e.g., at the start of a research project, we do not have a

Multiple Comparisons Occasionally, e.g., at the start of a research project, we do not have a

Lecture 7.1: Multiple Comparisons (A non-quiz topic) Examples of the need for multiple comparisons The problem with multiple comparisons post hoc; an outline of a solution Specific solutions: Fisher LSD, Tukey HSD, Holm (same as

840 views • 69 slides
Good ideas that we forgot Joe Armstrong My goals To remind you of the important things

Good ideas that we forgot Joe Armstrong My goals To remind you of the important things

Good ideas that we forgot Joe Armstrong My goals To remind you of the important things worth knowing Identify the stuff worth learning Identify some problems worth solving [note: this is a very biased view] What ideas has

523 views • 49 slides
Essential components of a good experiment Questions/hypotheses/predictions Variables (treatments,

Essential components of a good experiment Questions/hypotheses/predictions Variables (treatments,

Essential components of a good experiment Questions/hypotheses/predictions Variables (treatments, controls, and hypothesis) Experimental units and sampling units Replication Randomization Questions, hypotheses, and predictions Make questions and

355 views • 11 slides
Condition Monitoring &amp; Transfer Learning Good predictions in situations with (initially)

Condition Monitoring &amp; Transfer Learning Good predictions in situations with (initially)

Condition Monitoring &amp; Transfer Learning Good predictions in situations with (initially) almost no data DB Systel GmbH | Dr. Daniel Germanus, Felix Bert | FOSDEM | February 2019 Background Condition Monitoring is a precondition to

804 views • 20 slides
1 Predictions for 2020 Predictions for 2020 We will live in flying houses. 1966

1 Predictions for 2020 Predictions for 2020 We will live in flying houses. 1966

1 Predictions for 2020 Predictions for 2020 We will live in flying houses. 1966 Predictions for 2020 We will have personal helicopters. 1951 Predictions for 2020 C, X, and Q will not be part of the alphabet. 1900 Predictions

818 views • 49 slides
Published @ ICCV 2017 Context Many try to explain CNN predictions Good overview: CVPR 2018

Published @ ICCV 2017 Context Many try to explain CNN predictions Good overview: CVPR 2018

Published @ ICCV 2017 Context Many try to explain CNN predictions Good overview: CVPR 2018 tutorial on Interpretable ML for CV https://interpretablevision.github.io/ Studies show existing methods that use gradients are problematic

277 views • 11 slides
Because Your Worth It Growing Towards Godly Giving Today we are starting a 3 week series on giving

Because Your Worth It Growing Towards Godly Giving Today we are starting a 3 week series on giving

Because Your Worth It Growing Towards Godly Giving Today we are starting a 3 week series on giving called Because youre worth it Show pictures of good deals or bad deals (is this a good deal?...) just pictures required I can

62 views • 3 slides
Model Quality Assessment Guessing how good protein structure predictions are Kevin Karplus,

Model Quality Assessment Guessing how good protein structure predictions are Kevin Karplus,

Model Quality Assessment Guessing how good protein structure predictions are Kevin Karplus, Martin Paluszewski, John Archie karplus@soe.ucsc.edu Biomolecular Engineering Department Undergraduate and Graduate Director, Bioinformatics

400 views • 24 slides
Good Morning Ladies and Gentlemen Welcome to How to Help Your Fee-Earners Charge What Theyre

Good Morning Ladies and Gentlemen Welcome to How to Help Your Fee-Earners Charge What Theyre

Good Morning Ladies and Gentlemen Welcome to How to Help Your Fee-Earners Charge What Theyre Worth And Get It! Vanessa Ugatti The True Worth Expert Email: vanessa@thetrueworthexpert.com T: 01202 743961 M: 07957 672335 W:

405 views • 11 slides
Worth Working For Celebrating 40 years of independent advice Hope is not optimism, which

Worth Working For Celebrating 40 years of independent advice Hope is not optimism, which

AdviceUK Annual Conference 2019 Worth Working For Celebrating 40 years of independent advice Hope is not optimism, which expects things to turn out well, but something rooted in the conviction that there is good worth working for.

719 views • 47 slides
Graph Resistance and Learning from Pairwise Comparisons pairwise comparisons of items. In

Graph Resistance and Learning from Pairwise Comparisons pairwise comparisons of items. In

Alex Olshevsky Department of ECE, Boston University Joint work with Julien Hendrickx (UC Louvain) and Venkatesh Saligrama (BU) Graph Resistance and Learning from Pairwise Comparisons pairwise comparisons of items. In many contexts,

759 views • 50 slides
Fort Worth Public Art a City of Fort Worth Program Fort Worth Public Art (FWPA) FWPA

Fort Worth Public Art a City of Fort Worth Program Fort Worth Public Art (FWPA) FWPA

Fort Worth Public Art a City of Fort Worth Program Fort Worth Public Art (FWPA) FWPA established by City Ordinance in 2001 Funded by 2% of Bond Programs (Streets and Transportation 1%) City Council-appointed Fort Worth Art Commission

163 views • 15 slides
A New Vision of Assessment Texts Worth Reading Problems Worth Solving Tests Worth Taking NCSA

A New Vision of Assessment Texts Worth Reading Problems Worth Solving Tests Worth Taking NCSA

A New Vision of Assessment Texts Worth Reading Problems Worth Solving Tests Worth Taking NCSA June 2013 1 PARCC States PARCC Priorities 1. Determine whether students are college and career ready or on track 2. Connect to the Common Core

423 views • 41 slides
Correction for multiple comparisons in FreeSurfer 1 Problem of Multiple Comparisons p &lt; 10 -7

Correction for multiple comparisons in FreeSurfer 1 Problem of Multiple Comparisons p &lt; 10 -7

Correction for multiple comparisons in FreeSurfer 1 Problem of Multiple Comparisons p &lt; 10 -7 p &lt; 0.01 p &lt; 0.10 p value is probability that a voxel is falsely activated Threshold too liberal: many false positives Threshold too

230 views • 21 slides
BMI-206 Structure-Structure comparisons Sequence-Structure comparisons Marc A. Marti-Renom

BMI-206 Structure-Structure comparisons Sequence-Structure comparisons Marc A. Marti-Renom

BMI-206 Structure-Structure comparisons Sequence-Structure comparisons Marc A. Marti-Renom Assistant Adjunct Professor Department of Biopharmaceutical Sciences February 3rd, 2005 BMI206 01/19/2005 How to use this lectures Ask! Outline

1.1k views • 95 slides
Asymptotic Algorithm Analysis We can analyse an algorithm without needing to run it, and thus

Asymptotic Algorithm Analysis We can analyse an algorithm without needing to run it, and thus

Topic 6: Algorithm Analysis &amp; Sorting 1 (Version of November 14, 2011) Pierre Flener Computing Science Division Department of Information Technology Uppsala University Sweden Course 1DL201: Program Construction and Data Structures 1

319 views • 12 slides
Dual Pivot Quicksort: Verification and Proof using KeY Jonas Schiffl Karlsruher Institut f ur

Dual Pivot Quicksort: Verification and Proof using KeY Jonas Schiffl Karlsruher Institut f ur

Dual Pivot Quicksort: Verification and Proof using KeY Jonas Schiffl Karlsruher Institut f ur Technologie July 27th, 2016 Introduction Introduction Why verify Dual Pivot Quicksort? Introduction Why verify Dual Pivot Quicksort?

1.02k views • 87 slides
Quick Sort Undoubtedly the most popular sorting algorithm. O(nlog(n)). Arrays

Quick Sort Undoubtedly the most popular sorting algorithm. O(nlog(n)). Arrays

Quick Sort Undoubtedly the most popular sorting algorithm. O(nlog(n)). Arrays faster than mergesort Does not require as much space as merge sort. Recall that merge sort requires twice as much space as original array to

362 views • 11 slides
Sorting Recap and Analysis CSSE 221 Fundamentals of Software Development Honors Rose-Hulman

Sorting Recap and Analysis CSSE 221 Fundamentals of Software Development Honors Rose-Hulman

Sorting Recap and Analysis CSSE 221 Fundamentals of Software Development Honors Rose-Hulman Institute of Technology Announcements Cycle 2 was due Monday Cycle 3 user stories were due Monday Exam on Thursday is optional

295 views • 13 slides
Why Encubation? How to Explain . . . How to Explain . . . What About Human . . . Vladik

Why Encubation? How to Explain . . . How to Explain . . . What About Human . . . Vladik

What Is Encubation What Is Encubation . . . How to Explain . . . Why Encubation? How to Explain . . . How to Explain . . . What About Human . . . Vladik Kreinovich, Rohan Baingolkar, Human Computations . . . Swapnil S. Chauhan, and Human

330 views • 9 slides
Week 6 Oliver Kullmann Dynamic sets Data structures Simple implementa- tion Dynamic sets

Week 6 Oliver Kullmann Dynamic sets Data structures Simple implementa- tion Dynamic sets

CS 270 Algorithms Week 6 Oliver Kullmann Dynamic sets Data structures Simple implementa- tion Dynamic sets 1 Special cases Simple implementation 2 Stacks Implementatio Special cases 3 Queues Implementatio Stacks 4 Tutorial

610 views • 37 slides
1 Dead Code Elimination for SSA Constant Propagation Dead code elimination Goal while a

1 Dead Code Elimination for SSA Constant Propagation Dead code elimination Goal while a

Using Static Single Assignment Form Variable Renaming (cont) Last Time Data Structures Constructing SSA form Stacks[v] v Holds the subscript of most recent definition of variable v, initially empty Counters[v] v Today

224 views • 5 slides
Outline and Reading The Stack ADT (2.1.1) Stacks Applications of Stacks (2.1.1) Array-based

Outline and Reading The Stack ADT (2.1.1) Stacks Applications of Stacks (2.1.1) Array-based

Outline and Reading The Stack ADT (2.1.1) Stacks Applications of Stacks (2.1.1) Array-based implementation (2.1.1) Growable array-based stack (1.5) Stacks 2 Abstract Data Types (ADTs) The Stack ADT An abstract data The Stack ADT

197 views • 4 slides

More recommend