Why Extractors? Why Extractors? … Extractors, and the closely related “Dispersers”, exhibit some of the most “random-like” properties of explicitly constructed combinatorial structures. In turn, extractors and dispersers have many applications in “removing randomness” in various settings, and in making randomized constructions explicit …
20
Embed
Why Extractors? … Extractors, and the closely related “Dispersers”, exhibit some of the most “random-like” properties of explicitly constructed combinatorial.
This document is posted to help you gain knowledge. Please leave a comment to let me know what you think about it! Share it to your friends and learn new things together.
Transcript
Why Extractors?Why Extractors?
… Extractors, and the closely related “Dispersers”, exhibit some of the most “random-like” properties of explicitly constructed combinatorial structures. In turn, extractors and dispersers have many applications in “removing randomness” in various settings, and in making randomized constructions explicit …
Santa Clause and his (Un)- Santa Clause and his (Un)- Biased ElvesBiased Elves
The Story of Randomized The Story of Randomized Computations and Weak Computations and Weak
Random SourcesRandom Sources
The Computational Tasks of Santa The Computational Tasks of Santa (and Atnas) Clause(and Atnas) Clause
Sampling, Simulations, Algorithms (e.g.
Approximated TSP).
• Distributed Computations
• Cryptography
Santa’s Source of RandomnessSanta’s Source of Randomness
A coin please …
But the North Pole is no Fairyland …But the North Pole is no Fairyland …
A coin please …
Hey Santa, you can use my cat !!
Thanks Erwin but I’ve grown attached to my elves …
Pure Randomness in Nature?Pure Randomness in Nature?
Deterministic ExtractionDeterministic Extraction
source of biased correlated bits almost uniform outputEXT
Assume b1 b2 … bi … are i.i.d. 0/1 variables and bi =1 with some probability p < 1 then translate
01 1
10 0
Other “easy” sources: markov chains [vN51,Eli72,Blu84], two independent sources [SV84,Vaz85,CG85] , bit-fixing sources [CGH+85,BBR85,BL85,LLS87,CDH+00], some efficiently samplable sources [TV00].
Can this Work for all Sources?Can this Work for all Sources?
If b1 b2 … bi … are 0/1 variables s.t. bi =1 with prob.
p = p(b1 b2 … bi-1)[½-, ½+]
cannot deterministically extract even a single bit !!
A single SV-Source is sufficient to simulate BPP
• Can use even weaker sources [ChorGo88, CohenWi89, …]
ExtractorsExtractors [[ , 93 , 93]]
• X has min-entropy k if x Pr[X = x] 2-k (i.e. no likely elements).
• Nonconstructive & optimal [NZ,RT]: extract all the
randomness (i.e. m k+d) using d log n truly random bits ( =.01)
EXT
Distribution on {0,1}n w/k “bits of randomness”
d truly random bits
m bits distance from uniform
Where Does the Seed Come From?Where Does the Seed Come From?
• If “truly” random bits exist but expensive ...
• Sometimes we can just enumerate over all 2d seeds:
Let A be some probabilistic procedure and e an element from the weak random source.
Run A(Ext(e,0…0)) , … , A(Ext(e,1…1))
“combine” the outputs (majority, median, best, …).
• In particular: can simulate BPP using a weak source [Zuc90].
Weak Sources in (Space Bounced) Weak Sources in (Space Bounced) ComputationsComputations
• Thm [NZ93] Let A be a (randomized) space S machine (i.e. A can be in 2s configurations).
If A uses poly(S) random bits it can be fully derandomized in space O(S).
• Basic idea: Let A read a random 2S bit string x. Since A remembers at most S bits, x still contains (roughly) S bits of entropy (independent of A’s state). Can recycle:
Gx,y x, Ext(x,y)
Applications of Extractors• Randomized algorithms w/ weak random sources.
• Pseudorandom generators [NZ93,RR99,STV99]
• Randomness efficient sampling and deterministic amplification [Zuc97]