Adaptive Threshold Sampling

• Adaptive threshold sampling is a framework where the decision threshold is dynamically adjusted using observed data or system state to optimize sample inclusion.
• It finds applications in sparse sensing, quantized recovery, and event-based acquisition, addressing constraints like memory budgets and varying arrival rates.
• By leveraging threshold recalibration and substitutability, the approach maintains unbiasedness and consistency even when inclusion events are interdependent.

Adaptive threshold sampling denotes a family of sampling and selection procedures in which the threshold governing inclusion, measurement, transmission, or refinement is not fixed in advance but adapted from data, system state, or iteration index. In the most explicit formulation, each item $x_i$ is assigned an auxiliary random priority $R_i$, and inclusion is decided by $Z_i=\mathbf 1(R_i<T_i)$; the technical difficulty is that once $T_i$ depends on the observed stream, inclusion events are no longer independent, so unbiasedness and consistency are no longer automatic. Closely related threshold-adaptive mechanisms also appear in sparse Gaussian sensing, quantized recovery, event-based signal acquisition, tracking, remote estimation, and metric learning, where the adaptive variable is respectively a refinement threshold, quantization threshold, firing threshold, confidence threshold, transmission threshold, or mining threshold (Ting, 2017, Haupt et al., 2010).

1. General threshold-sampling framework

In the general stream-sampling framework, fixed-threshold sampling assigns each item an independent auxiliary random priority $R_i$ and includes the item when

$Z_i=\mathbf 1(R_i<T_i).$

If $T_i$ is fixed in advance, then $\Pr(Z_i=1)=F_i(T_i)$, where $F_i$ is the CDF of $R_i$, and ordinary Poisson-sampling logic applies. For a population total $R_i$0, the Horvitz–Thompson estimator

$R_i$1

is unbiased. The difficulty addressed by adaptive threshold sampling is that in practical streaming settings the threshold must often change with the data because sample-size budgets, memory budgets, arrival rates, and query objectives are not known in advance.

The central device is threshold recalibration. For a subset $R_i$2, the recalibrated thresholding rule is defined by

$R_i$3

so that $R_i$4. This removes the priorities of the coordinates in $R_i$5 from the threshold definition while preserving the remaining randomness. The key structural condition is substitutability: if all items in $R_i$6 are sampled, then

$R_i$7

Under substitutability, adaptive thresholds can be treated as fixed thresholds for a large class of estimators.

The framework also provides simpler sufficient conditions. For monotone rules, singleton substitutability implies full substitutability. Sequential thresholding rules, including stopping-time constructions over sorted priorities, are also covered. Closure properties permit thresholds to be composed: the maximum of 1-substitutable thresholds is 1-substitutable, and the minimum of substitutable thresholds is substitutable. The same paper further notes a priority-threshold duality, since $R_i$8 when $R_i$9, so adaptive priorities can be re-expressed as adaptive thresholds (Ting, 2017).

2. Estimation theory under adaptive thresholds

The estimator theory is organized around polynomial estimators on the sample,

$Z_i=\mathbf 1(R_i<T_i)$0

and around pseudo-Horvitz–Thompson estimators of the form

$Z_i=\mathbf 1(R_i<T_i)$1

The threshold-substitution theorem states that if $Z_i=\mathbf 1(R_i<T_i)$2 is substitutable, then for estimators of the polynomial form one has

$Z_i=\mathbf 1(R_i<T_i)$3

and therefore any estimator that is unbiased for a fixed threshold remains unbiased under the adaptive threshold. This is the main reason adaptive threshold sampling can reuse ordinary independent-threshold estimators rather than requiring custom corrections for each adaptive scheme.

The same logic yields variance estimators that remain valid under adaptive thresholds. For fixed threshold $Z_i=\mathbf 1(R_i<T_i)$4,

$Z_i=\mathbf 1(R_i<T_i)$5

with unbiased estimator

$Z_i=\mathbf 1(R_i<T_i)$6

Because bottom-$Z_i=\mathbf 1(R_i<T_i)$7 and priority-sampling thresholds are substitutable, the same variance estimator remains unbiased when $Z_i=\mathbf 1(R_i<T_i)$8 is the adaptive bottom-$Z_i=\mathbf 1(R_i<T_i)$9 threshold.

A second layer of theory addresses consistency beyond exact unbiasedness. For threshold-dependent empirical objectives

$T_i$0

the paper proves Donsker-type convergence

$T_i$1

under complexity conditions on the function and threshold classes. A direct implication is a consistency-transfer principle: if an estimator is consistent under a deterministic threshold and the adaptive threshold converges in probability to that deterministic threshold, then the estimator remains consistent under adaptive thresholding.

These results support a wide application set. The framework derives samplers for memory budgets rather than sample-size budgets, stratified samples, multiple objectives, distinct counting, sliding windows, and top-$T_i$2 sketches. In the top-$T_i$3 construction, an item’s unbiased count estimate is

$T_i$4

and the global threshold $T_i$5 is chosen as the smallest priority such that at least $T_i$6 items satisfy $T_i$7. This makes both sampling probabilities and sketch size adaptive rather than fixed in advance (Ting, 2017).

3. Multistage threshold sampling for sparse inference

In sparse Gaussian sensing, adaptive threshold sampling takes the form of sequential refinement. Distilled Sensing studies an unknown sparse vector $T_i$8 under white Gaussian noise, with the general adaptive measurement model

$T_i$9

subject to a precision budget

$R_i$0

At stage $R_i$1, the procedure allocates precision uniformly over the surviving set $R_i$2,

$R_i$3

observes $R_i$4, and refines by thresholding at zero,

$R_i$5

After

$R_i$6

stages, a final threshold is applied: $R_i$7

The performance contrast with non-adaptive sampling is sharp. In the non-adaptive model, support recovery and detection require amplitudes on the order of $R_i$8. Under Distilled Sensing, support recovery is possible when $R_i$9 arbitrarily slowly, and reliable detection is possible when

$Z_i=\mathbf 1(R_i<T_i).$0

that is, at constant amplitude. The mechanism is the repeated elimination of null coordinates, which survive with probability about $Z_i=\mathbf 1(R_i<T_i).$1, while signal coordinates are retained with high probability once stage-wise precision becomes large enough. The paper is explicit that the main theorems assume nonnegative signals and coordinate-wise direct observations rather than arbitrary linear measurements (Haupt et al., 2010).

A more practice-oriented threshold-guided design appears in Adaptive Chasing Sampling. The procedure alternates between estimation and sampling: it reconstructs a sparse estimate $Z_i=\mathbf 1(R_i<T_i).$2, forms a thresholded support

$Z_i=\mathbf 1(R_i<T_i).$3

and then concentrates future samples near $Z_i=\mathbf 1(R_i<T_i).$4. The paper reports that its algorithms allow $Z_i=\mathbf 1(R_i<T_i).$5 less number of samples for accurate signal reconstruction and achieve up to $Z_i=\mathbf 1(R_i<T_i).$6 smaller signal reconstruction error under the same noise condition. This suggests a broader pattern: adaptive threshold sampling is often most effective when thresholding is used not as the end of inference but as the control signal for reallocating future sensing effort (Li et al., 2015).

4. Quantization, event-based acquisition, and reconstruction-driven thresholds

In 1-bit acquisition, adaptive threshold sampling appears as threshold design for quantizers rather than inclusion rules for stream items. Each sensor observes

$Z_i=\mathbf 1(R_i<T_i).$7

or in vector form

$Z_i=\mathbf 1(R_i<T_i).$8

and sends the sign bit

$Z_i=\mathbf 1(R_i<T_i).$9

The resulting sign-consistency constraint is

$T_i$0

Recovery is posed as a convex constrained quadratic program in $T_i$1, after which the parameter estimate is obtained by weighted least squares. The adaptive threshold rule is

$T_i$2

with Gaussian perturbation around the current estimate. The paper motivates this by a mutual-information analysis in which the 1-bit channel can benefit from nonzero noise and randomized thresholds, and it states that the method can recover both fixed and time-varying parameters under white or colored Gaussian noise (Khobahi et al., 2018).

In bandlimited-signal acquisition, the threshold is embedded in a time-encoding machine. The reconstruction algorithm is

$T_i$3

with

$T_i$4

Classical convergence uses a global bound on inter-sample spacing. The adaptive construction instead derives a local energy-based sufficient condition. Defining

$T_i$5

a sufficient local condition for convergence is

$T_i$6

The proposed variable-bias, variable-threshold integrate-and-fire TEM enforces this through

$T_i$7

with adaptive laws for $T_i$8 and $T_i$9. A shifted-signal formulation introduces $\Pr(Z_i=1)=F_i(T_i)$0 to suppress excessive firing when $\Pr(Z_i=1)=F_i(T_i)$1. The paper reports, for example, that firings were reduced from $\Pr(Z_i=1)=F_i(T_i)$2 to $\Pr(Z_i=1)=F_i(T_i)$3 by adding the shift, and that adaptive non-uniform sampling maintained accurate reconstruction on synthetic signals, ultrasonic guided-wave signals, and ECG signals (Yashaswini et al., 22 Jan 2026).

Both lines of work share the same structural principle: the threshold is chosen to increase informativeness of the next measurement rather than to enforce a fixed global rate.

5. State-dependent, confidence-dependent, and pair-dependent threshold policies

Several recent systems use adaptive thresholds as online control variables tied to system state rather than to static signal magnitude. The threshold itself may depend on the current frame, the current pair distribution in a mini-batch, or the current mismatch state in a remote-estimation process.

Setting	Adaptive threshold rule	Function
Deep metric learning	$\Pr(Z_i=1)=F_i(T_i)$4 adjusted by AT-ASMS; loss threshold $\Pr(Z_i=1)=F_i(T_i)$5 updated by meta-learning	Rebalance positive and negative pairs
Multi-object tracking	Frame-wise confidence threshold at the largest adjacent drop in sorted scores	Split detections into high- and low-confidence sets
CTMC status sampling	Transmit when $\Pr(Z_i=1)=F_i(T_i)$6	State- and estimate-aware triggering

In deep metric learning, Dual Dynamic Threshold Adjustment Strategy combines a static asymmetric mining rule,

$\Pr(Z_i=1)=F_i(T_i)$7

with a dynamic update driven by the current imbalance of mined pairs: $\Pr(Z_i=1)=F_i(T_i)$8 The same framework also adapts the loss threshold $\Pr(Z_i=1)=F_i(T_i)$9 by a single-step meta-learning update. The paper attributes the gain to reducing redundant negative pairs, increasing useful positive pairs, and adapting thresholds to the evolving embedding space, and reports competitive performance on CUB200, Cars196, and SOP (Jiang et al., 2024).

In multi-object tracking, adaptive confidence thresholding replaces ByteTrack’s fixed split between high- and low-confidence detections. For each frame, the detection scores are sorted in decreasing order, and the threshold index is chosen by

$F_i$0

with threshold equal to the score at that location. ByteTrack’s two-stage association then remains unchanged. The method is explicitly frame-wise, preserves running time comparable to ByteTrack, and achieves performance comparable to ByteTrack with tuned thresholds while avoiding manual tuning (Ma et al., 2023).

In CTMC remote estimation under AoII, the threshold becomes part of an optimal control policy. For mismatch state $F_i$1, the optimal estimation- and state-aware transmission policy triggers a transmission when

$F_i$2

The thresholds therefore depend on both the true source state and the monitor estimate, yielding up to $F_i$3 distinct thresholds. The policy is derived through a constrained semi-Markov decision process and a Lagrangian approach, with multi-regime phase-type distributions used to analyze cycle durations and AoII areas. Lower-complexity relaxations include the estimation-aware transmission policy and the single-threshold policy (Cosandal et al., 2024).

6. Related adaptive-threshold methods and scope limits

The literature also uses adaptive thresholds in settings that are adjacent to, but not identical with, data-acquisition sampling. In low-rank recovery, Adaptive Singular Value Thresholding replaces the fixed SVT threshold with an iteration-dependent schedule

$F_i$4

so that singular values below $F_i$5 are zeroed out at iteration $F_i$6. The paper reports lower relative reconstruction error than SVT and, in examples such as a $F_i$7 matrix of rank $F_i$8 with observation ratio $F_i$9, recovery in $R_i$0 iterations with relative error $R_i$1, compared with $R_i$2 iterations and error $R_i$3 for SVT (Zarmehi et al., 2017).

In sparse covariance estimation, adaptive thresholding is entry-specific rather than sample-specific. The estimator

$R_i$4

uses a distinct threshold for each covariance entry, where $R_i$5 estimates the variability of $R_i$6. The paper shows that the estimator adaptively achieves the optimal rate of convergence over a weighted sparse covariance class, while universal thresholding is sub-optimal over the same parameter spaces (Cai et al., 2011).

In robust importance sampling, adaptive winsorization chooses a truncation level from a grid $R_i$7 by the Balancing Principle. The winsorized variable is

$R_i$8

and the selected threshold $R_i$9 is the smallest $R_i$00 whose estimates are mutually stable across all larger thresholds. The paper provides an oracle inequality and reports smaller mean squared error and mean absolute deviation than leading alternatives in several examples (Orenstein, 2018).

In Gaussian sequence estimation, adaptive threshold estimation by FDR uses the Benjamini–Hochberg rule to choose the threshold level for smooth threshold estimators. The paper proves adaptive minimaxity over strong and weak $R_i$01 balls with $R_i$02, including the $R_i$03 regime when $R_i$04, provided the minimax risk lies between $R_i$05 and $R_i$06 for some $R_i$07 (Jiang et al., 2013).

A recurring misconception is that any adaptive sampling policy is an adaptive threshold sampling policy. The distinction is explicit in the DQN-based multi-sensor adaptive sampling paper: the method learns a sampling policy by reinforcement learning, with action selection

$R_i$08

except during $R_i$09-greedy exploration, and reward

$R_i$10

The paper compares against threshold-triggered sampling, but it states that the proposed method does not use an explicit threshold as the decision rule. This boundary is important: adaptive threshold sampling is a specific subclass of adaptive sampling in which a threshold remains the central control variable, whether that threshold acts on priorities, measurements, confidences, AoII, losses, or singular values (Huang et al., 12 Apr 2025).