the detection of defective members of large populations
play

The Detection of Defective Members of Large Populations November - PowerPoint PPT Presentation

The Detection of Defective Members of Large Populations November 21, 2019 This is me PhD Student at Stanford, ex-engineer Outline The paper What makes the paper work? How its ideas can be reused Group Testing The setting is World


  1. The Detection of Defective Members of Large Populations November 21, 2019

  2. This is me PhD Student at Stanford, ex-engineer

  3. Outline • The paper • What makes the paper work? • How its ideas can be reused

  4. Group Testing The setting is World War II…

  5. Group Testing The setting is World War II… 🤡

  6. Group Testing The setting is World War II… 🤡 🤡

  7. Group Testing The setting is World War II… 🤡 🤡 🤡

  8. Group Testing The setting is World War II… 🤡 🤡 🤡 🤡

  9. Group Testing The setting is World War II… 🤡 🤡 🤡 🤡 🤡

  10. Group Testing The setting is World War II… 🤡 🤡 🤡 🤡 🤡 🤡

  11. Group Testing The setting is World War II… 🤡 🤡 🤡 🤡 🤡 🤡 🤡

  12. Group Testing The setting is World War II… 🤡 🤡 🤡 🤡 🤡 🤡 🤡 🤣 Sick :(

  13. Group Testing 🤡 🤡 🤡 🤡 💊 🤡 🤡 🤡 🤣 Sick :(

  14. Group Testing 🤡 🤡 🤡 🤡 🤡 🤡 🤡 🤣 💊 Sick :(

  15. Don’t need individual tests 🤡 🤡 🤡 🤡 🤡 🤡 🤡 🤣

  16. Don’t need individual tests 🤡 🤡 🤡 🤡 Ok 🤡 🤡 🤡 🤣

  17. Don’t need individual tests 🤡 🤡 🤡 🤡 Ok 🤡 🤡 🤡 🤣 Sick :(

  18. Don’t need individual tests 🤡 🤡 🤡 🤡 Ok 🤡 🤡 🤡 🤣 Ok Sick :(

  19. Don’t need individual tests 🤡 🤡 🤡 🤡 Ok 🤡 🤡 🤡 🤣 Ok Sick :( We know this person is sick

  20. Need to carefully design tests 🤡 🤡 🤡 🤡 Ok 🤣 🤡 🤡 🤡 Sick :( Ok We can’t distinguish these two

  21. Need to carefully design tests 🤡 🤡 🤡 🤡 Ok 🤡 🤣 🤡 🤡 Sick :( Ok We can’t distinguish these two

  22. Group Testing Problem We have n items, at most s of which are “sick.” Definition: A test returns whether a subset of items includes any sick items or not. Problem: Construct a set of tests which can identify a worst-case set of at most s sick items.

  23. A better design If every column is unique, we win 🤡 🤡 🤡 🤡 🤡 🤡 🤡

  24. A better design If every column is unique, we win 🤡 🤡 🤣 🤡 🤡 🤡 🤡 Ok Ok Sick

  25. A better design If every column is unique, we win 🤡 🤡 🤡 🤡 🤣 🤡 🤡 Ok Sick Sick

  26. A better design If every column is unique, we win 🤡 🤡 🤣 🤡 🤡 🤡 🤡 Ok 1 0 0 1 0 1 1 0 1 0 1 1 0 1 Ok 0 0 1 0 1 1 1 Sick

  27. What we just saw If there is one sick person, we can find them non-adaptively with log n tests!

  28. Dorfman’s Construction This seems hard, so let’s just do something totally random Will show this works with decent probability and O(s 2 log n) tests

  29. Why is s 2 log n tests cool? 100 80 60 40 20

  30. Why is s 2 log n tests cool? Way fewer tests! 100 80 60 40 20

  31. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  32. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  33. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  34. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  35. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  36. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  37. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  38. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  39. Dorfman’s construction 🤡 🤡 🤡 🤡 🤡 🤡 🤡 Include with probability 1/s

  40. First idea: finding healthy people 🤡 🤡 🤣 🤡 🤡 🤡 🤡 Ok Ok Sick

  41. First idea: finding healthy people 🤡 🤡 🤣 🤡 🤡 🤡 🤡 Ok } These tests pass Ok Sick

  42. First idea: finding healthy people 🤡 🤡 🤣 🤡 🤡 🤡 🤡 These people cannot be sick! Ok } These tests pass Ok Sick

  43. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 🤔 🙄 😸 😏 🤖 🥴 Should not be in the test Should be in test

  44. First idea: finding healthy people Math For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 🤔 🙄 time! 😸 😏 🤖 🥴 Should not be in the test Should be in test

  45. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 🤔 What is the probability this happens? 🙄 P(none in test) = 😸 😏 🤖 🥴 Should be in test Should not be in the test

  46. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 in test w/ p. 1/s 🤔 What is the probability this happens? 🙄 P(none in test) = 😸 😏 🤖 🥴 Should be in test Should not be in the test

  47. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 in test w/ p. 1/s 🤔 What is the probability this happens? 🙄 P(none in test) = 😸 😏 in test w/ p. 1/s 🤖 🥴 Should be in test Should not be in the test

  48. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 in test w/ p. 1/s 🤔 What is the probability this happens? 🙄 P(none in test) = 😸 😏 in test w/ p. 1/s 🤖 🥴 in test w/ p. 1/s Should be in test Should not be in the test

  49. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 in test w/ p. 1/s 🤔 What is the probability this happens? 🙄 P(none in test) = (1-1/s) s 😸 😏 in test w/ p. 1/s 🤖 🥴 in test w/ p. 1/s Should be in test Should not be in the test

  50. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 in test w/ p. 1/s 🤔 What is the probability this happens? 🙄 P(none in test) = (1-1/s) s ≈ e -s/s 😸 😏 in test w/ p. 1/s 🤖 🥴 in test w/ p. 1/s Should be in test Should not be in the test

  51. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 in test w/ p. 1/s 🤔 What is the probability this happens? 🙄 P(none in test) = (1-1/s) s ≈ e -s/s ≈ 1/3 😸 😏 in test w/ p. 1/s 🤖 🥴 in test w/ p. 1/s Should be in test Should not be in the test

  52. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 in test w/ p. 1/s 🤔 What is the probability this happens? 🙄 P(none in test) = (1-1/s) s ≈ e -s/s ≈ 1/3 😸 😏 in test w/ p. 1/s 🤖 🥴 Idea: not too many sick people, in test w/ p. 1/s so pretty good probability of missing ‘em all Should be in test Should not be in the test

  53. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 Need this person in test 🤔 🙄 😸 😏 🥴 🤖 Not in test w/ probability 1/3 Should be in test

  54. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 Need this person in test 🤔 What is the probability this happens? 🙄 😸 😏 🥴 P( 🙄 in test) = 1/s 🤖 Not in test w/ probability 1/3 Should be in test

  55. First idea: finding healthy people For each set of sick people, need to be able to prove each other person is healthy 🤡 🤣 🤯 🤔 🙄 What is the probability the test works? 😸 😏 🥴 P(none in test and 🙄 in test) ≈ 1/3s 🤖 Not in test w/ probability 1/3 Should be in test

  56. Repeating tests 🤣 🤯 😸 🤡 🤔 😏 🙄 Works with probability 1/3s … Works with probability 1/3s

  57. Repeating tests 🤣 🤯 😸 🤡 🤔 😏 🙄 Works with probability 1/3s What is the probability no test works? … P(no test works) = (1-1/3s) T Works with probability 1/3s

  58. Repeating tests 🤣 🤯 😸 🤡 🤔 😏 🙄 Works with probability 1/3s What is the probability no test works? … P(no test works) = (1-1/3s) T ≈ e -T/3s Works with probability 1/3s

  59. Repeating tests 🤣 🤯 😸 🤡 🤔 😏 🙄 Works with probability 1/3s What is the probability no test works? … P(no test works) = (1-1/3s) T ≈ e -T/3s ≈ n -2s T = 6s 2 logn Works with probability 1/3s

  60. Union bound 🤣 🤯 😸 🤡 🤔 😏 🙄 We just saw P(no test works for 🙄 and 🤣 , 🤯 , 😸 ) ≈ n -2s

Recommend


More recommend