Posterior Behavioral Cloning (PostBC)

• Posterior Behavioral Cloning (PostBC) is a pretraining framework that models the posterior distribution of demonstrator policies to guarantee nonzero action probabilities.
• It integrates Bayesian posterior estimation with classical Behavioral Cloning to balance exploitation and exploration, enhancing reinforcement learning finetuning.
• Empirical results in robotics and multi-task settings demonstrate that PostBC improves sample efficiency and success rates compared to standard BC policies.

Posterior Behavioral Cloning (PostBC) is a pretraining framework for policies based on demonstration data that ensures demonstrator action coverage—a critical property for effective reinforcement learning (RL) finetuning. Unlike standard Behavioral Cloning (BC), which fits a policy by directly matching observed demonstrator actions, PostBC explicitly models the posterior distribution of the demonstrator’s policy given the dataset. This approach systematically guarantees that the pretrained policy assigns nonzero probability to all actions in a manner consistent with demonstrator uncertainty, thus providing a strong foundation for RL finetuning and improving downstream sample efficiency, especially in robotics and related domains (Wagenmaker et al., 18 Dec 2025).

1. Limitations of Classical Behavioral Cloning for Policy Initialization

Standard BC fits a policy $\pi^{BC}$ via Maximum Likelihood or MAP estimation. In tabular settings, this estimator is defined as:

$$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$

where $T_h(s,a)$ is the number of times action $a$ appeared in state $s$ at step $h$ within the demonstration dataset $D$.

When $T_h(s,a)=0$, the BC policy assigns zero probability to the unseen action, preventing any subsequent RL procedure relying on rollouts of $\pi^{BC}$ from discovering or optimizing over that action, irrespective of its optimality. Formally, demonstrator action coverage is defined by $\gamma > 0$ such that

$$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$0

for the unknown demonstrator $$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$1. Failure to achieve coverage ($$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$2) implies that even infinite RL rollouts cannot match demonstrator performance if a demonstrator action is omitted. While adding uniform random exploration can increase coverage, the mixing weight necessary to maintain BC’s suboptimality rate ($$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$3) yields negligible coverage in large action spaces and does not offer a practical solution (Wagenmaker et al., 18 Dec 2025).

2. Posterior Behavioral Cloning Objective and Theoretical Justification

PostBC conceptualizes the demonstrator’s true policy $$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$4 as a random variable under a uniform prior over all Markov policies. Given data $$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$5, PostBC constructs the posterior over $$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$6 and defines the pretraining target:

$$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$7

With a uniform Dirichlet prior of weight $$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$8 (Dirichlet–multinomial setting), the posterior mean is

$$\pi^{BC}_h(a|s) = \begin{cases} \frac{T_h(s,a)}{T_h(s)} & T_h(s) > 0 \ \frac1{|A|} & T_h(s)=0 \end{cases}$$9

This ensures that every action, including unseen ones, receives nonzero probability mass reflecting posterior uncertainty. To interpolate between high-confidence exploitation (as in BC) and conservative exploration, a mixture policy is used:

$T_h(s,a)$0

with $T_h(s,a)$1, where $T_h(s,a)$2 is the action set cardinality, $T_h(s,a)$3 is the time horizon, and $T_h(s,a)$4 is the size of $T_h(s,a)$5 (Wagenmaker et al., 18 Dec 2025).

For continuous actions, a generative model $T_h(s,a)$6 (e.g., a diffusion model) is adopted, and posterior uncertainty is injected by perturbing each $T_h(s,a)$7 demonstration pair by sampled noise $T_h(s,a)$8:

$T_h(s,a)$9

3. Coverage Guarantees and Optimality

By judiciously mixing BC with the Dirichlet-posterior, PostBC attains demonstrator action coverage $a$0 while retaining BC’s suboptimality rate $a$1 (with $a$2 the number of states). No estimator with equivalent BC-level performance can achieve higher $a$3. In states with little data, high entropy ensures all actions are covered; in data-rich states, the solution concentrates near the empirical BC estimates. This near-optimal trade-off between exploration and exploitation enables PostBC-initialized policies to be more viable starting points for RL finetuning than pure BC counterparts.

4. Practical Algorithm and Implementation

Implementation of PostBC involves two critical components: posterior covariance estimation and BC policy fitting with noise. Covariance is estimated using bootstrap ensembling:

1. For each ensemble member $a$4, generate a bootstrap dataset $a$5 by resampling demonstrations.
2. Train a regressor $a$6 mapping states to actions on $a$7.
3. Compute the ensemble mean $a$8 and statewise covariance

$a$9

With $s$0 typically set to $s$1.

For BC fitting, a diffusion model $s$2 is trained with likelihood maximization on perturbed data: for each minibatch, add $s$3 noise to actions before gradient updates. Typical architectures include diffusion UNets or transformers with $s$4–$s$5 layers, and models are trained for several thousand epochs (Wagenmaker et al., 18 Dec 2025).

5. Integration with RL Finetuning Workflows

PostBC policies are directly integrated into diverse RL finetuning pipelines:

• Diffusion‐SAC (DSRL): A Soft Actor-Critic framework using the pretrained diffusion model as the stochastic actor, initializing the RL actor with PostBC weights, then updating actor and critic online with task reward.
• Diffusion‐PPO (DPPO): Employs the pretrained diffusion model in an on-policy Proximal Policy Optimization (PPO) loop, refining the weights using collected rollouts.
• Best‐of‐$s$6 (BoN) + IQL: Deploys the pretrained policy to generate rollouts with binary success feedback, fits an Implicit Q-Learning critic $s$7, and at evaluation samples $s$8 actions from the pretrained policy, selecting the one with maximal estimated $s$9. PostBC initialization replaces BC in this protocol (Wagenmaker et al., 18 Dec 2025).

6. Empirical Evaluation in Robotic and Multi-Task Domains

Comprehensive experiments demonstrate the efficacy of PostBC pretraining:

• Robomimic (Single-Task): On tasks such as “Square,” PostBC achieves $h$0 DSRL success in $h$120k steps (vs. $h$240k for BC). BoN-32 sampling gives success rates of $h$3 (PostBC), $h$4 (BC), and $h$5 (ValueDICE).
• Libero (Multi-Task): A single PostBC policy pretrained on $h$6 kitchen tasks increases BoN average success from $h$7 (BC) to $h$8, halving the required RL rollouts for equivalent performance.
• Real WidowX Arm: On “Put corn in pot” and “Pick up banana” (10 demos/task), PostBC improves pretrain success (7–4/20 vs. BC’s 3–4/20) and finetune success (13–16/20 vs. BC’s 5–10/20 with BoN-4) (Wagenmaker et al., 18 Dec 2025).

7. Extensions and Open Directions

PostBC’s pretrained performance is never worse and often slightly higher than BC, notwithstanding injected exploration noise. As the demonstration dataset size increases, the PostBC estimator converges to BC, providing a natural transition across data regimes. The posterior sampling paradigm underlying PostBC suggests straightforward applicability to other domains where BC pretraining precedes RL-style finetuning, including RLHF in LLMs. A key outstanding problem is the identification of sufficient conditions on a pretrained policy’s coverage parameter to guarantee end-to-end sample efficiency for specific RL finetuning algorithms, beyond current necessary conditions (Wagenmaker et al., 18 Dec 2025).