go-v.orgcodex
Menu
Page tools

codex · Chemistry

Adaptive sampling

Adaptive sampling is a family of sampling strategies in which the procedure for selecting the sample may depend on values observed earlier in the process. In a conventional design, the whole sample is fixed before data collection begins. An adaptive design uses gathered information to decide where to sample next, for example around sites where a rare species has been found, or in regions where a function changes rapidly. Because each observation has a cost, whether in field time, laboratory work or computation, concentrating effort where it is most informative can give more precise estimates or more accurate models for the same budget. Adaptive sampling is used in several fields.

In survey statistics, adaptive cluster sampling is used to survey rare, clustered populations, particularly in ecology and environmental science. Other uses include the sequential design of computer experiments for surrogate models, adaptive importance sampling in Monte Carlo methods, environmental monitoring with autonomous underwater vehicles and other mobile robots, and molecular dynamics simulations of protein folding. 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.

Which usually comes down to sampling the function n times until the next sample's estimated/deterministic cost C(x,s) is larger than the gain G(x,s) of that sample. Adaptive sampling then assumes that given necessary knowledge about the problem, there is a theoretically optimal sequence s of samples that will maximize the information (gain) induced by that sample; and it is possible to estimate s using heuristics. Adaptive sampling usually focuses on estimating the next optimal sample input x, given the previous set of samples. Thus, being adaptive to the current knowledge about the function.

Wikipedia contributors, "Adaptive sampling", Wikipedia, revision 1385971556, retrieved 20 November 2026, source, CC BY-SA 4.0.

More Chemistry · Search the codex