astronomy

Stochastic universal sampling

Stochastic universal sampling is a astronomy topic covered in the lgStudy science library. This page brings together a partial reference excerpt, illustrations, worked examples, real-world applications and a short study plan, so you can understand Stochastic universal sampling rather than just read about it. In short: Stochastic universal sampling (SUS) is a selection technique used in evolutionary algorithms for selecting potentially useful solutions for recombination. It was introduced by James Baker.

Key takeaways

Stochastic universal sampling belongs to astronomy; place it in that map before memorising details.
Learn the definition first, then one example that makes the definition concrete.
Connect Stochastic universal sampling to a quantity you can measure, compute or draw — that is where exam questions come from.
Reproduce the core statement of Stochastic universal sampling from memory before moving on to harder problems.

Reference excerpt

Stochastic universal sampling (SUS) is a selection technique used in evolutionary algorithms for selecting potentially useful solutions for recombination. It was introduced by James Baker. SUS is a development of fitness proportionate selection (FPS) which exhibits no bias and minimal spread. Where FPS chooses several solutions from the population by repeated random sampling, SUS uses a single random value to sample all of the solutions by choosing them at evenly spaced intervals. This gives weaker members of the population (according to their fitness) a chance to be chosen. FPS can have bad performance when a member of the population has a really large fitness in comparison with other members. Using a comb-like ruler, SUS starts from a small random number, and chooses the next candidates from the rest of population remaining, not allowing the fittest members to saturate the candidate space.

Pseudo Code Described as an algorithm, pseudocode for SUS looks like:

SUS(Population, N) F := total fitness of Population N := number of offspring to keep P := distance between the pointers (F/N) Start := random number between 0 and P Pointers := [Start + i*P | i in [0..(N-1)]] return RWS(Population,Pointers)

RWS(Population, Points) Keep = [] for P in Points I := 0 while fitness sum of Population[0..I] < P I++ add Population[I] to Keep return Keep

Where Population[0..I] is the set of individuals with array-index 0 to (and including) I. Here RWS() describes the bulk of fitness proportionate selection (also known as "roulette wheel selection") – in true fitness proportional selection the parameter Points is always a (sorted) list of random numbers from 0 to F. The algorithm above is intended to be illustrative rather than canonical.

See also Fitness proportionate selection Reward-based selection

References

Illustrations

Worked examples

Example 1 — a first encounter with Stochastic universal sampling

Start with the simplest possible case. Write down what Stochastic universal sampling claims or describes in one sentence, then invent the smallest concrete situation in which that sentence is true. In astronomy, the smallest case is usually a single object, a single equation or a single measurement. Check that every symbol or term in your sentence has a meaning in that case.

Example 2 — changing one variable

Take the situation from Example 1 and change exactly one quantity: double it, halve it, or set it to zero. Predict what should happen to Stochastic universal sampling before you calculate. Comparing your prediction with the result is the fastest way to find out whether you understand the idea or only the words.

Example 3 — an exam-style question

Typical questions about Stochastic universal sampling ask you to (a) state it precisely, (b) apply it to given data, and (c) explain a limitation. Practise writing all three answers in under five minutes; the third part is what separates a full-mark answer from an average one.

Applications of Stochastic universal sampling

In research: Stochastic universal sampling appears in astronomy research whenever the underlying quantities have to be modelled precisely. Papers usually cite it as a starting assumption and then explore where it breaks down.
In technology and industry: Engineering practice reuses Stochastic universal sampling in design rules, simulations and safety margins. Knowing the idea lets you read a specification sheet and understand why the numbers look the way they do.
In the classroom: Stochastic universal sampling is common in secondary-school and first-year university syllabi. It links to neighbouring topics Selection (evolutionary algorithm), so understanding it makes those chapters shorter.
In everyday life: Look for Stochastic universal sampling outside the textbook — in sport, cooking, traffic, electronics or the sky above you. An example you found yourself is remembered far longer than one you were given.

Affiliate

Preply — study more efficiently by working with a personal tutor. 50% off.

How to study Stochastic universal sampling in 20 minutes

Read the reference excerpt below once, without taking notes.
Close the page and write down what Stochastic universal sampling means in your own words.
Compare your version with the excerpt and mark what you missed.
Work through the three examples above with pen and paper.
Explain Stochastic universal sampling out loud to somebody else — or to Teacher Smith in the lgStudy chat.

Frequently asked questions

What is Stochastic universal sampling in simple terms?

Stochastic universal sampling (SUS) is a selection technique used in evolutionary algorithms for selecting potentially useful solutions for recombination. It was introduced by James Baker.

Why does Stochastic universal sampling matter?

Because it connects several astronomy ideas at once: it gives you a definition you can apply, a quantity you can calculate, and a way to check whether a result is plausible.

How should I study Stochastic universal sampling?

Read the excerpt, restate it from memory, then work through the examples and applications listed on this page. The five-step study plan above takes about twenty minutes.

What does this page cover?

It gives you a compact reference excerpt plus original lgStudy explanations, examples, applications and study material on Stochastic universal sampling.