AdaHorizon: Uncertainty-Driven Adaptive Planning

• AdaHorizon is an uncertainty-driven adaptive planning algorithm that dynamically adjusts the execution horizon to balance computational efficiency and performance.
• It uses predictive uncertainty metrics—such as ensemble variance and MAD between action predictions—to decide when to replan and avoid compounding errors.
• Empirical results demonstrate up to 90% reductions in model calls and significant performance gains in both offline reinforcement learning and vision-language-action robotics.

Adaptive-Horizon Ensembler (AdaHorizon) is a family of uncertainty-driven adaptive planning algorithms designed to maximize both computational efficiency and task performance in sequential decision making. AdaHorizon dynamically selects the number of open-loop actions to execute before replanning, leveraging model and prediction uncertainty to minimize unnecessary computation and mitigate open-loop degradation. Its instantiations span offline reinforcement learning with generative models (Jutras-Dubé et al., 2024) and high-throughput vision-language-action robotics (Chopra et al., 7 Nov 2025), where it substantially reduces planning overhead without compromising outcome quality.

1. Core Principles and Problem Setting

AdaHorizon addresses the computational limitations inherent in planning with complex generative models or large transformer-based action models. Standard continuous replanning approaches offer strong correction capabilities but incur expensive model queries at every step, yielding high computational cost. Conversely, fixed-horizon open-loop execution achieves speed but suffers from compounding errors as sensory uncertainty accumulates.

The formal substrate is the Markov Decision Process (MDP) with state space $\mathcal{S}$, action space $\mathcal{A}$, and reward $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$. In offline RL (Jutras-Dubé et al., 2024), a fixed dataset $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$ is provided; no further environment interaction is permitted. The agent seeks a policy $\pi: \mathcal{S} \rightarrow \mathcal{A}$ that maximizes expected reward.

Within vision-language-action (VLA) planning (Chopra et al., 7 Nov 2025), the challenge is to robustly sequence action chunks in high-dimensional, multimodal state spaces, minimizing intervention frequency under nonstationary uncertainty.

2. Uncertainty Quantification and Adaptive Horizon Control

The distinguishing feature of AdaHorizon is the explicit, stepwise measurement of predictive uncertainty to trigger replanning. In generative RL frameworks (Jutras-Dubé et al., 2024), this uncertainty $u_t$ is estimated from a deep ensemble of $M$ inverse dynamics models $f_{\phi_m}$, trained on the same experience buffer with different random seeds. Each model returns a mean action prediction $\mu_{\phi_m}(x_t)$ and, if NLL-trained, its predictive variance $\sigma^2_{\phi_m}(x_t)$. Total predictive uncertainty is decomposed as:

$\mathcal{A}$0

where the first term is the mean aleatoric uncertainty and the second the epistemic ensemble variance. For MSE-only ensembles, the uncertainty simplifies to $\mathcal{A}$1.

In robot VLA systems (Chopra et al., 7 Nov 2025), AdaHorizon fuses the outputs of continuous and discrete action prediction heads, computing a mean absolute difference (MAD) metric for each chunk index $\mathcal{A}$2:

$\mathcal{A}$3

where $\mathcal{A}$4 and $\mathcal{A}$5 denote the $\mathcal{A}$6-th dimensions of the continuous and discrete action predictions, respectively. This MAD is used as an actionable proxy for disagreement-induced uncertainty.

3. Adaptive-Horizon Execution Logic

The core mechanism is a thresholding control law that adaptively shortens or extends the planning horizon based on moment-to-moment uncertainty estimates.

Offline RL / Generative Model Setting (Jutras-Dubé et al., 2024):

• From the current state $\mathcal{A}$7, generate a long-horizon rollout $\mathcal{A}$8.
• At each step $\mathcal{A}$9 up to $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$0, compute $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$1.
• Execute $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$2 as long as $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$3 and $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$4. If $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$5 (threshold), trigger replanning.
• Empirically, $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$6 is tuned to balance open-loop degradation against computational savings, typically admitting only $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$710% of steps requiring new rollouts.

Vision-Language-Action Setting (Chopra et al., 7 Nov 2025):

• For each chunk of $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$8 predicted actions, enforce a minimum open-loop segment $$R: \mathcal{S} \times \mathcal{A} \rightarrow \mathbb{R}$$9 (e.g. 4).
• Replanning is requested if $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$0 for some $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$1. Repeated short-horizon requests count towards an "abort-to-full-chunk" safeguard, activating a global reset if task ambiguity is high.
• Beyond $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$2, any chunk index $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$3 where $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$4 truncates the current chunk, adaptively setting the execution horizon $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$5.

4. Stepwise Algorithmic Structure

The AdaHorizon policy can be summarized as follows:

Generative RL Implementation (Jutras-Dubé et al., 2024): $f_{\phi_m}$0

VLA Chunking Implementation (Chopra et al., 7 Nov 2025):

1. For $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$6 in $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$7, compute $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$8.
2. If $\mathcal{D} = \{\tau^{i}\}_{i=1}^{N}$9 with $\pi: \mathcal{S} \rightarrow \mathcal{A}$0, increment replan counters.
3. If abort-to-full-chunk criteria met, return full chunk.
4. Build truncation mask $\pi: \mathcal{S} \rightarrow \mathcal{A}$1.
5. Set $\pi: \mathcal{S} \rightarrow \mathcal{A}$2 as the largest $\pi: \mathcal{S} \rightarrow \mathcal{A}$3 s.t. all $\pi: \mathcal{S} \rightarrow \mathcal{A}$4 and $\pi: \mathcal{S} \rightarrow \mathcal{A}$5.
6. Return first $\pi: \mathcal{S} \rightarrow \mathcal{A}$6 discrete actions for execution.

5. Hyperparameterization and Tuning

AdaHorizon’s effectiveness depends on judicious threshold setting:

Parameter	Role and Typical Value
$\pi: \mathcal{S} \rightarrow \mathcal{A}$7	Horizon/chunk size per model call (e.g., $\pi: \mathcal{S} \rightarrow \mathcal{A}$8)
$\pi: \mathcal{S} \rightarrow \mathcal{A}$9	Uncertainty cutoff (RL setting, tuned per domain)
$u_t$0	High MAD threshold (early chunk), $u_t$1
$u_t$2	MAD threshold for open-loop truncation
$u_t$3	Minimum open-loop segment (prevents small chunks)
$u_t$4	Counters for abort-to-full-chunk logic

In practice, $u_t$5 to avoid spurious early replans, and $u_t$6 is fixed to balance latency and robustness. Thresholds are tuned on held-out validation domains.

6. Empirical Performance and Computational Impact

AdaHorizon achieves its principal goal of vastly reducing expensive model queries with minimal or no fidelity loss.

Key Results in RL Planning (Jutras-Dubé et al., 2024):

• On OpenAI Gym (Hopper, Walker, etc.), AdaHorizon reduces model (DDPM) calls by up to $u_t$7, e.g., saving $u_t$8 neural forward evaluations on Hopper-Medium whilst improving normalized return from $u_t$9 (baseline) to $M$0.
• Wall-clock speedup: $M$1 over continuous replanning baselines.
• Return drop is typically $M$2; in some cases, performance marginally exceeds stepwise replanning due to reduced compounding of model-induced drift.

Key Results in VLA Robotics (Chopra et al., 7 Nov 2025):

• On LIBERO Spatial, AdaHorizon attains $M$3 success, a $M$4 absolute improvement over the strongest ensembler baseline.
• On the full LIBERO suite, AdaHorizon yields a $M$5 uplift in average success rate.
• Real-world pick-and-place: $M$6 in-distribution, $M$7 out-of-distribution improvement versus prior methods.
• The ensembler’s computational overhead is negligible: $M$8 ms per chunk, maintaining $M$9 Hz overall inference rates.

7. Limitations, Comparative Context, and Extensions

AdaHorizon is subject to several domain- and method-specific constraints:

• No formal worst-case performance bounds; the threshold parameters must be tuned empirically.
• Limitations in representational capacity for complex real-world dynamics or high-dimensional sensory streams; robustness to domain shift is not addressed.
• The MAD metric is unnormalized and may be sensitive to action scaling across dimensions, requiring manual weighting or further refinement.

Potential extensions include:

• Learned or Bayesian threshold selection to replace fixed cutoffs.
• Incorporation of cost-to-go predictors or miniature MPCs for more globally optimal horizon selection.
• Dimension-weighted disagreement metrics, particularly important when combining translational, rotational, and gripper actions in robotics.
• Multi-scale chunking or hierarchical horizon adaptation for flexible control granularity.

Comparison with alternative replanning regimes confirms the efficacy of AdaHorizon: continuous replanning guarantees maximal responsiveness but minimum efficiency; static-horizon execution optimizes speed at the expense of potential catastrophic open-loop drift. AdaHorizon occupies an empirically validated intermediate regime, yielding up to 95% savings in model evaluation with performance competitive or superior to the strongest stepwise baselines (Jutras-Dubé et al., 2024, Chopra et al., 7 Nov 2025).