Noisy group testing quick and efficient
Download
1 / 37

Noisy Group Testing (Quick and Efficient) - PowerPoint PPT Presentation


  • 93 Views
  • Uploaded on

Noisy Group Testing (Quick and Efficient). Sheng Cai , Mayank Bakshi , Sidharth Jaggi The Chinese University of Hong Kong. Mohammad Jahangoshahi Sharif University of Technology. q. q. Group Testing. Adaptive vs. Non-adaptive. What’s known. [CCJS11].

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about ' Noisy Group Testing (Quick and Efficient)' - zocha


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
Noisy group testing quick and efficient

Noisy Group Testing (Quick and Efficient)

  • ShengCai, MayankBakshi, SidharthJaggi

    The Chinese University of Hong Kong

  • Mohammad Jahangoshahi

  • Sharif University of Technology


q

q

Group Testing

Adaptive vs. Non-adaptive

What’s known

[CCJS11]

For Pr(error)< ε , Lower bound of number of tests:

Chun Lam Chan; Pak HouChe; Jaggi, S.; Saligrama, V.; , "Non-adaptive probabilistic group testing with noisy measurements: Near-optimal bounds with efficient algorithms,"  49th Annual Allerton Conference on Communication, Control, and Computing, pp.1832-1839, 28-30 Sept. 2011

[CCJS11]


This work

# Tests

Adaptive

Non-Adaptive

Lower

bound

Two-Stage Adaptive

[NPR12]

O(poly(D)log(N)),O(D2log(N))

O(DN),O(Dlog(N))

O(Dlog(N))

Lower bound

Decoding complexity

O(Dlog(N))






Testing matrix
Testing Matrix

IN

OUT

Negative

0

Positive

1






Multiplicity d 03
Multiplicity (d = 0)

d = 0

No positive tests





Multiplicity d 13
Multiplicity (d = 1)

d = 1

50% positive tests





Multiplicity d 23
Multiplicity (d = 2)

d = 2

75% positive tests

Statistical Difference!




Localization1
Localization

Signature

Test Outcome

BSC (q) Channel

Expander Codes

Decoder

Particular

Signature



Nail good partioning
Nail: “Good” Partioning

N items

D defectives



Adaptive group testing1
Adaptive Group Testing

Groups

Decaying geometrically

Tests


Adaptive group testing2
Adaptive Group Testing

The number of unidentified defectives <


Adaptive group testing3
Adaptive Group Testing

Tests of size

Coupon Collection


Non adaptive group testing
Non-Adaptive Group Testing

Groups

constant fraction of “Good” groups

Tests



Non adaptive group testing2
Non-Adaptive Group Testing

Independent partitions

Coupon Collection

Tests


2 stage adaptive group testing
2-Stage Adaptive Group Testing

Groups (Birthdays)


2 stage adaptive group testing1
2-Stage Adaptive Group Testing

Non-adaptive

Group Testing

+

Tests


Summary of this work

# Tests

O(Dlog(N))

Decoding complexity

O(Dlog(N))


Thank you
Thank you謝謝


ad