good predictions are worth a few comparisons
play

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

Sep 27, 2023 •143 likes •936 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 April 2016 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 1/16 A case

  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 April 2016 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 1/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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? N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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 N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

  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? N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 2/16

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

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

  33. What “really” happens in the processor... optimized min/max search // RAND_ARRAY: an array of length N // filled with random integers min = RAND_ARRAY[0]; max = RAND_ARRAY[0]; for(i=0; i<N; i+=2){ //assume N is even a1 = RAND_ARRAY[i]; a2 = RAND_ARRAY[i+1]; if (a1 < a2) { if (a1 < min) min = a1; if (a2 > max) max = a2; } else { if (a2 < min) min = a2; if (a1 > max) max = a1; } } N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 3/16

  34. What “really” happens in the processor... sample of assembly code ( gcc -O0 ) mov esi, dword ptr [rbp - 60] cmp esi, dword ptr [rbp - 64] jge LBB2_8 mov eax, dword ptr [rbp - 60] cmp eax, dword ptr [rbp - 12] jge LBB2_5 mov eax, dword ptr [rbp - 60] mov dword ptr [rbp - 12], eax LBB2_5: mov eax, dword ptr [rbp - 64] cmp eax, dword ptr [rbp - 16] jle LBB2_7 ... N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 3/16

  35. What “really” happens in the processor... sample of assembly code ( gcc -O0 ) ◮ Each instruction mov esi, dword ptr [rbp - 60] cmp esi, dword ptr [rbp - 64] can be decomposed: jge LBB2_8 mov eax, dword ptr [rbp - 60] cmp eax, dword ptr [rbp - 12] ◮ Most modern jge LBB2_5 processors are pipelined mov eax, dword ptr [rbp - 60] mov dword ptr [rbp - 12], eax ◮ Instructions LBB2_5: mov eax, dword ptr [rbp - 64] are parallelized cmp eax, dword ptr [rbp - 16] jle LBB2_7 ... simple 5 stages pipeline: N. Auger , C. Nicaud , C. Pivoteau Good predictions are worth... 3/16

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 March 2016 Carine Pivoteau Good predictions are worth... 1/11 A case study Find both the

1.11k views • 66 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
On Human Predictions with Explanations and Predictions of Machine Learning Models: A Case Study

On Human Predictions with Explanations and Predictions of Machine Learning Models: A Case Study

On Human Predictions with Explanations and Predictions of Machine Learning Models: A Case Study on Deception Detection Vivian Lai and Chenhao Tan @vivwylai | @chenhaotan vivlai.github.io | chenhaot.com University of Colorado Boulder

391 views • 24 slides
Lecture 5: Short and Medium term predictions and risks in politics and economics David Aldous

Lecture 5: Short and Medium term predictions and risks in politics and economics David Aldous

Lecture 5: Short and Medium term predictions and risks in politics and economics David Aldous February 3, 2016 How good are people at predictions for short- and medium-term politics and economics? Here we are not thinking of routine

812 views • 29 slides
We may not be young, we may not be pretty, we may not be right good, but were here

We may not be young, we may not be pretty, we may not be right good, but were here

We may not be young, we may not be pretty, we may not be right good, but were here and were worth protecting : THE PLANNING POLICY CONTEXT TO THE PROTECTION OF HISTORIC PARKS AND GARDENS VICTORIA THOMSON HEAD OF PLANNING ADVICE

622 views • 43 slides
Competing as an Innovation Community Some things worth knowing Some things worth considering

Competing as an Innovation Community Some things worth knowing Some things worth considering

Competing as an Innovation Community Some things worth knowing Some things worth considering Presented by: Jonathan Aberman Terry Clower Dean, Business School Northern Virginia Chair Marymount University Director, Center for Regional

352 views • 12 slides
Cross-Study Comparisons of Findings Related to States AA -MAS: Implications for Practice and

Cross-Study Comparisons of Findings Related to States AA -MAS: Implications for Practice and

Cross-Study Comparisons of Findings Related to States AA -MAS: Implications for Practice and Policy SUE RIG NEY , DISCUSSANT N A T I O N A L C O N F E R E N C E O N S T U D E N T A S S E S S M E N T D E T R O I T 2 0 1 0 Good News

217 views • 8 slides
Fred Yarur Nothing in the world is worth having or worth doing unless it means effort, pain,

Fred Yarur Nothing in the world is worth having or worth doing unless it means effort, pain,

Fred Yarur Nothing in the world is worth having or worth doing unless it means effort, pain, difficulty -T. Roosevelt 1. 2. 3. 4. 5. Repeat Acquire Estimate Sell Schedule Survey Qualify Produce Refer 2. 1. 3. 4. 5.

910 views • 55 slides
Passages worth the dig Passages worth the dig Matt 7.1-5 Judge not, that ye not be judged

Passages worth the dig Passages worth the dig Matt 7.1-5 Judge not, that ye not be judged

Passages worth the dig Passages worth the dig Matt 7.1-5 Judge not, that ye not be judged David Capes Senior Research Fellow Lanier Theological Library Judge Not . . . Really David Kinnamon, Barna Group Gabe Lyons, Fermi Project

390 views • 15 slides
Research Ethics Tyson S. Barrett, PhD PSY 3500 Was it worth it?

Research Ethics Tyson S. Barrett, PhD PSY 3500 Was it worth it?

Research Ethics Tyson S. Barrett, PhD PSY 3500 Was it worth it? https://www.britannica.com/event/Tuskegee-syphilis-study Was it worth it? Milgram (1963) Was it worth it? Milgram (1963) &quot;In a large number of cases, the degree of

165 views • 5 slides

More recommend