Lesson plan

Adaptive sampling

Adaptive sampling is an approach to sampling that uses heuristics to provide efficiency. The term adaptive sampling represents a general approach to the problem of sampling, rather than being a special method itself, meaning it can be combined with suitable other approaches/methods. In some real world problems, sampling is implicitly/explicitly needed and used to obtain practical solutions. The sampling process will need resources and efficient usage of these resources is usually crucial. This is why there are multiple sampling methods instead of the brute-force approach. Let f(x) be a function that is to be sampled. For simplicity, let C(x,s) be the cost for sample x given the previous set of samples s (For simplicity, we can assume that C(x,s) is constant since sampling cost usually does not depend on the previous samples and the sampling input x to the function. In time-critical systems, where the cost for each sample is strongly related to computation time; usually there are other parameters to the function C like the current time...); and G(x, s) be the gain (anti-cost) from sampling the function at x, given the set of previous samples s. For example, it can be assumed that G(x, s)=0 if x has already been sampled. The sampling problem is then maximizing our cumulative gain minus cumulative cost.…

Back to article

Article summary

Adaptive sampling is an approach to sampling that uses heuristics to provide efficiency. The term adaptive sampling represents a general approach to the problem of sampling, rather than being a special method itself, meaning it can be combined with suitable other approaches/methods. In some real world problems, sampling is implicitly/explicitly needed and used to obtain practical solutions. The sampling process will need resources and efficient usage of these resources is usually crucial. This is why there are multiple sampling methods instead of the brute-force approach. Let f(x) be a function that is to be sampled. For simplicity, let C(x,s) be the cost for sample x given the previous set of samples s (For simplicity, we can assume that C(x,s) is constant since sampling cost usually does not depend on the previous samples and the sampling input x to the function. In time-critical systems, where the cost for each sample is strongly related to computation time; usually there are other parameters to the function C like the current time...); and G(x, s) be the gain (anti-cost) from sampling the function at x, given the set of previous samples s. For example, it can be assumed that G(x, s)=0 if x has already been sampled. The sampling problem is then maximizing our cumulative gain minus cumulative cost.…

Key claims

No claims recorded.

Discussion questions

  1. Summarise the article in your own words. Which single claim would you verify first, and why?
  2. Which claim in this article is most likely to be revised as the sources update? How would you check its current status?
  3. If two sources disagreed about one of these facts, what would you need in order to trust one over the other?

Bibliography

No sources recorded.

Key claims and bibliography are generated from the same tracked claims and sources as the article page.