betaFeedback

WorksComputer Science

Stochastic Self-Distillation for Flow-Based Vision-Language-Action Models

Abstract

Flow-based vision-language-action (VLA) models achieve strong performance in robotics through imitation learning, yet fine-tuning them with on-policy reinforcement learning (RL) is limited. In group-based RL methods like Group Relative Policy Optimization (GRPO), every rollout step requires multi-step ODE integration, and the sampler's limited stochasticity leads to rollout groups with low variance. We propose VLA-SSD, which addresses both high inference latency and limited stochasticity. In particular, our method self-distills a pretrained flow-matching action head into a stochastic one-step policy by conditioning a single-jump generator on a Brownian path. We derive a conditional action density via our stochastic one-step policy, enabling efficient post-training via likelihood-ratio RL algorithms. We show that distilling VLA-SSD from the π0π_0 VLA reduces the action head's forward-pass time by a factor of 7.7, at the cost of a 5.5% relative decrease in the success rate on the LIBERO benchmark. However, by leveraging the increased sample diversity of VLA-SSD during group generation, post-training a π0.5π_{0.5} VLA using GRPO yields a 20.6% relative improvement.

Introduction

Vision–language–action (VLA) models have achieved significant advances by leveraging knowledge from pre-trained vision–language models in robotics ([6, 13]). However, state-of-the-art VLAs have yet to achieve comparable generalization to other foundation models due to their reliance on imitation learning from expert demonstrations for adaptation to embodiments and environments ([3, 14] (Physical Intelligence et al. 2025; NVIDIA et al. 2025; Shukor et al. 2025)). Frontier flow-based VLAs generate continuous action chunks with a flow-matching action head ([3] (Physical Intelligence et al. 2025)). Yet, enabling them to improve via on-policy reinforcement learning (RL) is still limited by the inference time of multi-step ODE integration and a lack of stochasticity.

To improve efficiency, one-step flow-based policies have been introduced for continuous control ((Zhan et al., 2026; Ziakas et al., 2026)), replacing multi-step ODE integration with a single transport step learned via self-distillation ([4, 12, 5] (Song et al. 2023)). However, in RL methods using multi-sample advantage estimation, such as Group Relative Policy Optimization (GRPO), the baseline is derived directly from a group of trajectories given the current state. Because flow-matching rely entirely on the initial random noise draw for stochasticity, they restrict the action diversity within the sampled group, resulting in a degraded training signal ((Shao et al., 2024)). To enable exploration, existing approaches increase sample diversity by introducing an external noise network or reverting to multi-step samplers that inject noise at each integration step ([7, 16] (Zhang et al. 2025)).

In this work, we address both the efficiency and stochasticity limitations of current VLAs by learning a stochastic one-step policy via self-distillation. We propose VLA-SSD, a method that utilizes Itô flow maps ((Pan et al., 2026)) to distill a multi-step flow-matching VLA head into a one-step stochastic policy. In contrast to prior work, we introduce stochasticity directly through self-distillation rather than relying on an external noise network or a multi-step sampler. To enable likelihood-ratio policy optimization such as GRPO, we derive a conditional action density that requires only a single additional Jacobian-vector product to approximate. In our experiments, we first distill VLA-SSD from π0.5\pi_{0.5}, achieving a 7.7× faster action head with a 0.3-point drop in success rate, while reducing zero-variance groups from 63% to 35% relative to the original sampler. Leveraging the stochasticity and efficiency of VLA-SSD, we post-train it with GRPO, reaching 93.0% on LIBERO, a 15.9-point gain over the SFT checkpoint, and matching four-step GRPO with πRL\pi_{\mathrm{RL}} (91.5%) while generating each action chunk 3.2× faster during training rollouts.

Figure 1. Left: an ODE sampler and Flow-SDE spend KK action-expert evaluations per chunk; VLA-SSD spends one and keeps the spread of the SDE. Right: for a fixed ss and a0a_0, the Itô flow map conditions on a Brownian path W(k)W^{(k)}, so GG paths give GG different one-step actions with different returns, and the GRPO group carries gradient; at σ=0\sigma=0 all GG coincide.

In summary, our main contributions are as follows:

  • One-Step Stochastic VLA Policies: We introduce VLA-SSD, a novel self-distillation framework that converts multi-step flow-matching VLA heads into efficient, one-step stochastic policies using Itô flow maps.

  • Density Evaluation for Likelihood-Ratio Optimization: To overcome the lack of tractable likelihoods in flow-based models, we derive a closed-form conditional action density that evaluates efficiently via a single Jacobian-vector product.

  • Efficient Policy Distillation: We demonstrate that distilling VLA-SSD from π0.5\pi_{0.5} yields a 7.7× faster action head with a minimal 0.3-point performance drop, while mitigating the exploration bottleneck by reducing zero-variance groups from 63% to 35%.

  • RL Post-Training: When post-trained with GRPO, VLA-SSD reaches a 93.0% success rate on LIBERO, a 15.9-point gain over the SFT checkpoint, matching the standard four-step πRL\pi_{\mathrm{RL}} baseline while accelerating training rollouts by 3.2×.

Preliminaries

Markov decision process. We consider a Markov decision process (MDP) (Sutton & Barto, 1998) M=(S,A,r,P,γ)\mathcal{M}=(\mathcal{S},\mathcal{A},r,P,\gamma) with state space S\mathcal{S}, action space A⊆Rd\mathcal{A} \subseteq\mathbb{R}^{d}, reward function r(s,a)r(s,a), transition kernel P(s′∣s,a)P(s' \mid s,a), and discount factor γ∈[0,1]\gamma\in[0,1]. The state s∈Ss \in\mathcal{S} consists of the visual observations, the proprioceptive state, and the language instruction; the action a∈Aa \in\mathcal{A} is a chunk of HH consecutive actions. A policy π(a∣s)\pi(a \mid s) is evaluated by its expected return J(π)=Eπ[∑τ=0Tγτr(sτ,aτ)]\mathcal{J}(\pi)=\mathbb{E}_{\pi}\left[\sum_{\tau=0}^{T}\gamma^{\tau}r(s^{\tau},a^{\tau})\right], where τ\tau indexes decision steps and TT is the episode horizon. We consider episodic manipulation tasks with a sparse binary reward, r(sτ,aτ)=1r(s^{\tau},a^{\tau})=1 at the decision step at which the task is first completed and 0 otherwise, and take γ=1\gamma=1, so that the return of an episode is R=∑τr(sτ,aτ)∈{0,1}R=\sum_{\tau}r(s^{\tau},a^{\tau}) \in\{0,1\}. Throughout, τ\tau denotes MDP time; the flow time t∈[0,1]t \in[0,1] introduced next indexes the generation of a single action chunk and is distinct from τ\tau.

Flow-matching policies. A generative policy a1∼π1(⋅∣s)a_1 \sim\pi_1(\cdot\mid s) can be formulated as a transport from a reference measure p0∈P(Rd)p_0 \in\mathcal{P}(\mathbb{R}^d) to a target action distribution p1∈P(Rd)p_1 \in\mathcal{P}(\mathbb{R}^d). The transport is defined by a state-conditioned flow ψt(⋅∣s)\psi_t(\cdot\mid s) that solves the following ODE:

ddtψt(a0∣s)=vt(ψt(a0∣s)∣s),ψ0(a0∣s)=a0,(1)\frac{\mathrm{d}}{\mathrm{d}t}\psi_t(a_0 \mid s) = v_t(\psi_t(a_0 \mid s) \mid s), \qquad\psi_0(a_0 \mid s) = a_0, \tag*{(1)}

where vtv_t is a time-dependent velocity field. The terminal map induces the policy π1(⋅∣s)=[ψ1(⋅∣s)]#p0\pi_1(\cdot\mid s) = [\psi_1(\cdot\mid s)]_{\#}p_0; it is deterministic for fixed a0a_0 and ss, while sampling a0∼p0a_0 \sim p_0 induces a distribution over actions. To train the flow policy, we define a conditional probability path pt(⋅∣z,s)p_t(\cdot\mid z, s) using the endpoints z=(a0,a1)z = (a_0, a_1) and the linear interpolation at=(1−t)a0+ta1a_t = (1-t)a_0 + ta_1. The velocity field is learned by regressing against the target conditional velocity vt∗(at∣z,s)v_t^*(a_t \mid z, s) using the conditional flow-matching objective [17, 1]:

LCFM=Et,q(z∣s),pt(at∣z,s)∥vt(at∣s)−vt∗(at∣z,s)∥22=Et,q(z∣s),pt(at∣z,s)∥vt(at∣s)−(a1−a0)∥22,\mathcal{L}_{\mathrm{CFM}} = \mathbb{E}_{t,q(z\mid s),p_t(a_t\mid z,s)}\lVert v_t(a_t\mid s)-v_t^*(a_t\mid z,s)\rVert_2^2 = \mathbb{E}_{t,q(z\mid s),p_t(a_t\mid z,s)}\lVert v_t(a_t\mid s)-(a_1-a_0)\rVert_2^2,

where q(z∣s)q(z \mid s) is a coupling over the endpoints z=(a0,a1)z = (a_0, a_1)—e.g., independent coupling q(z∣s)=p0(a0)p1(a1∣s)q(z \mid s) = p_0(a_0)p_1(a_1 \mid s)—and in the last equality we substitute the analytic conditional velocity vt∗(at∣z,s)=a1−a0v_t^*(a_t \mid z, s) = a_1-a_0 for the linear interpolant.

Flow map policies. Instead of solving the ODE, we parameterize and learn its two-time solution operator, referred to as the flow map [11, 12, 4, 1] (Song et al. 2023; Ziakas et al. 2026). For 0≤r≤t≤10 \le r \le t \le1, let Xr,t(⋅∣s):Rd→RdX_{r,t}(\cdot\mid s) : \mathbb{R}^d \to\mathbb{R}^d denote the flow map associated with the ODE in eq. (1). It transports an action from time rr to tt and satisfies the jump condition

Xr,t(ar∣s)=at.(2)X_{r,t}(a_r \mid s) = a_t. \tag*{(2)}

The one-step policy draws a0∼p0a_0 \sim p_0 and returns a1=X0,1(a0∣s)a_1 = X_{0,1}(a_0 \mid s), inducing the action distribution

π(⋅∣s)=[X0,1(⋅∣s)]#p0.(3)\pi(\cdot\mid s) = [X_{0,1}(\cdot\mid s)]_{\#}p_0. \tag*{(3)}

Following Boffi et al. [4], we parameterize the flow map using the average action velocity ur,tu_{r,t}:

Xr,t(ar∣s)=ar+(t−r)ur,t(ar∣s),ur,t(ar∣s)=1t−r∫rtvζ(aζ∣s) dζ.(4)X_{r,t}(a_r \mid s) = a_r + (t-r)u_{r,t}(a_r \mid s), \qquad u_{r,t}(a_r \mid s) = \frac{1}{t-r}\int_r^t v_\zeta(a_\zeta\mid s)\,\mathrm{d}\zeta. \tag*{(4)}

Thus, Xr,tX_{r,t} represents a finite jump of size t−rt-r along the ODE trajectory. On the diagonal, the average velocity recovers the instantaneous velocity,

ut,t(at∣s)=vt(at∣s).(5)u_{t,t}(a_t \mid s) = v_t(a_t \mid s). \tag*{(5)}

This diagonal relation connects the finite-time flow map to the instantaneous flow-matching velocity. We use it to construct the training objective for the stochastic map in § 3.1.

Group relative policy optimization. GRPO (Shao et al., 2024) is an on-policy reinforcement learning algorithm that replaces the learned value baseline of actor–critic methods with a Monte Carlo baseline computed within a group of rollouts. At each decision step τ\tau, the policy samples an action chunk aτ∼πθ(⋅∣sτ)a^\tau\sim\pi_\theta(\cdot\mid s^\tau), and the objective of § 2 reduces to J(θ)=Eπθ[R]\mathcal{J}(\theta) = \mathbb{E}_{\pi_\theta}[R] with the binary return R∈{0,1}R \in\{0,1\}. GRPO samples a group of NN trajectories from the same task and initial state, and assigns to every decision step of trajectory ii an advantage A^i\hat{A}_i obtained by normalizing its return within the group:

A^i=Ri−Rˉstd⁡(R)+κ,Rˉ=1N∑j=1NRj.(6)\hat{A}_i = \frac{R_i-\bar{R}}{\operatorname{std}(R)+\kappa}, \qquad\bar{R} = \frac{1}{N}\sum_{j=1}^{N}R_j. \tag*{(6)}

If all NN returns in a group coincide, A^i=0\hat{A}_i = 0 for all members; we term such groups degenerate, as they consume rollout computation but contribute no gradient. Using these advantages, GRPO updates the policy by minimizing a PPO-style (Schulman et al., 2017) clipped surrogate:

Lclip(θ)=−E[min⁡(ρτ(θ)A^,clip⁡(ρτ(θ),1−ϵ,1+ϵ)A^)],ρτ(θ)=πθ(aτ∣sτ)πθold(aτ∣sτ).(7)\mathcal{L}_{\mathrm{clip}}(\theta) = -\mathbb{E}\left[\min\left(\rho^\tau(\theta)\hat{A},\operatorname{clip}\left(\rho^\tau(\theta),1-\epsilon,1+\epsilon\right)\hat{A}\right)\right], \qquad\rho^\tau(\theta) = \frac{\pi_\theta(a^\tau\mid s^\tau)}{\pi_{\theta_{\mathrm{old}}}(a^\tau\mid s^\tau)}. \tag*{(7)}

Method

Stochastic Flow Map Policies

Introducing stochasticity via Itô maps. While standard flow maps enable one-step generation, their stochasticity is limited to the initial random noise a0a_0. To this end, we extend the flow map in eq. (4) to an Itô map, which takes an intermediate action and a realization of a standard Brownian motion WW over [0,1][0,1] as inputs and predicts a future action on the same stochastic path Pan et al. (2026). Evaluated from r=0r=0 to t=1t=1, it defines a stochastic one-step policy. In practice, we condition the network on a finite-dimensional representation of WW.

Following the Itô-map construction of Pan et al. (2026), its martingale component MtM_t captures the Brownian noise accumulated from time 0 to tt, weighted by the diffusion profile β(t)\beta(t) and scaled by the noise level σ\sigma:

Mt=σ∫0tβ(ζ) dWζ,ΔMr,t=Mt−Mr,(8)M_t = \sigma\int_0^t \beta(\zeta)\,\mathrm{d}W_\zeta,\qquad\Delta M_{r,t} = M_t - M_r, \tag*{(8)}

where β(t)\beta(t) is the diffusion profile and σ≥0\sigma\ge0 is the noise scale. The Itô map then combines a path-dependent average drift with the martingale increment ΔMr,t\Delta M_{r,t}:

Fr,tθ(a;W∣s)=a+(t−r)Gr,tθ(a;W∣s)+ΔMr,t,(9)F^\theta_{r,t}(a; W \mid s) = a + (t-r)G^\theta_{r,t}(a; W \mid s) + \Delta M_{r,t}, \tag*{(9)}

where Gr,tθG^\theta_{r,t} approximates the path-conditioned average finite-variation term in the Itô-map decomposition. At σ=0\sigma=0, the martingale MtM_t vanishes and the stochastic construction reduces to the deterministic flow map in eq. (4). For each action coordinate, we use the truncated Karhunen–Loève expansion Wt=∑k=1Lϕk(t)ξkW_t=\sum_{k=1}^{L}\phi_k(t)\xi_k, where ξ∼N(0,IL)\xi\sim\mathcal{N}(0,I_L). The increment is then linear in the coefficients,

ΔMr,t=σc(r,t)Tξ,ck(r,t)=∫rtβ(ζ)ϕ˙k(ζ) dζ,(10)\Delta M_{r,t} = \sigma c(r,t)^\mathsf{T}\xi,\qquad c_k(r,t)=\int_r^t\beta(\zeta)\dot{\phi}_k(\zeta)\,\mathrm{d}\zeta, \tag*{(10)}

so ΔMr,w+ΔMw,t=ΔMr,t\Delta M_{r,w}+\Delta M_{w,t}=\Delta M_{r,t} holds pathwise for r≤w≤tr\le w\le t, and the same ξ\xi conditions GθG^\theta on every subinterval. In practice, we discretize the time-changed Brownian representation rather than the driving Brownian motion directly, using ck(r,t)=ϕk((1−r)2)−ϕk((1−t)2)c_k(r,t)=\phi_k((1-r)^2)-\phi_k((1-t)^2) for β(t)=2(1−t)\beta(t)=\sqrt{2(1-t)}; see section D. All finite-dimensional density calculations use these coefficients. For m=ΔM0,1m=\Delta M_{0,1}, the stochastic policy is

a1=a0+G0,1θ(a0;W∣s)+m.(11)a_1=a_0+G^\theta_{0,1}(a_0;W\mid s)+m. \tag*{(11)}

Self-distillation. Starting from the pretrained velocity field, we train the Itô map without an external teacher [5] (Ziakas et al. 2026). On the diagonal r=tr=t, the drift Gt,tθG^\theta_{t,t} is independent of the Brownian path, and we evaluate it using the zero path Gt,tθ(a;0∣s)G^\theta_{t,t}(a;0\mid s). Compared with standard flow matching, its regression target includes the score correction of the marginal-preserving SDE. Under β(t)=2(1−t)\beta(t)=\sqrt{2(1-t)}, this target becomes a1−(1+σ2)a0a_1-(1+\sigma^2)a_0; the derivation is given in section B. Following Boffi et al. [4], we consider Lagrangian (LSD), Eulerian (ESD), and progressive (PSD) self-distillation. These enforce consistency at the transported endpoint, at the starting point, and between direct and composed jumps, respectively (see section A).

In this work, we use Lagrangian self-distillation (LSD) [4] (Pan et al. 2026). At fixed ara_r and Brownian coefficients ξ\xi, let

y=Fr,tθ(ar;W∣s)(12)y=F^\theta_{r,t}(a_r;W\mid s) \tag*{(12)}

denote the transported action. LSD matches the endpoint derivative of the finite-variation component to the diagonal drift evaluated at yy. The diagonal loss is

LDiag=E[∥Gt,tθ(at;0∣s)−(a1−(1+σ2)a0)∥22].(13)\mathcal{L}_{\mathrm{Diag}}=\mathbb{E}\left[\left\|G^\theta_{t,t}(a_t;0\mid s)-(a_1-(1+\sigma^2)a_0)\right\|_2^2\right]. \tag*{(13)}

The LSD loss is

LLSD=Er<t,ar,ξ[∥Gr,tθ(ar;W∣s)+(t−r)∂tGr,tθ(ar;W∣s)−sg⁡(Gt,tθ(y;0∣s))∥22].(14)\mathcal{L}_{\mathrm{LSD}}=\mathbb{E}_{r<t,a_r,\xi}\left[\left\|G^\theta_{r,t}(a_r;W\mid s)+(t-r)\partial_tG^\theta_{r,t}(a_r;W\mid s)-\operatorname{sg}\left(G^\theta_{t,t}(y;0\mid s)\right)\right\|_2^2\right]. \tag*{(14)}

Here, sg⁡\operatorname{sg} denotes a stop-gradient. The derivative is taken at fixed ara_r and ξ\xi on the finite-variation component

Fr,tθ(ar;W∣s)−ΔMr,t=ar+(t−r)Gr,tθ(ar;W∣s),F^\theta_{r,t}(a_r;W\mid s)-\Delta M_{r,t}=a_r+(t-r)G^\theta_{r,t}(a_r;W\mid s),

so the martingale increment itself is not differentiated.

At σ=0\sigma= 0, the score correction and martingale component vanish, and eq. (14) reduces to deterministic flow-map self-distillation. We use LSD because the Eulerian objective does not identify the Itô map (Pan et al., 2026, Prop. 2), while the progressive objective requires two sequential forward passes. The full objective is LDiag+λLLSD\mathcal{L}_{\mathrm{Diag}} + \lambda\mathcal{L}_{\mathrm{LSD}}; implementation details are provided in section D.

On-Policy Optimization of Stochastic Flow Maps

Intractable action likelihood. To optimize our policy via likelihood-ratio RL, we need a tractable closed-form evaluation for the conditional action density πθ(a1∣s)\pi_\theta(a_1 \mid s). Since continuous flow-based models lack this, prior work converts the flow model into a discrete-time Markov process and computes likelihood ratios over KK intermediate Gaussian denoising steps rather than the final action [7] (Zhang et al. 2025). Our approach bypasses this limitation by deriving an auxiliary-variable conditional density. To do so, we isolate the Gaussian component of the Brownian path that generates the martingale increment mm in eq. (11), enabling us to treat the one-step action as an invertible transformation of a single Gaussian variable, conditioned on the remaining path randomness.

To isolate the martingale increment mm from the rest of the Brownian path, we project the path’s random coefficients into two independent components. Let c=c(0,1)≠0c = c(0,1) \ne0 be the full-interval coefficient from eq. (10), and define its unit direction e=c/∥c∥2e = c/\lVert c\rVert_2. For each action coordinate j=1,…,dj = 1,\ldots,d, the increment is mj=σcTξjm_j = \sigma c^{\mathsf{T}}\xi_j. We decompose the underlying standard Gaussian ξj\xi_j into a component parallel to ee (which perfectly determines mjm_j) and an orthogonal remainder ξ⊥,j\xi_{\perp,j}:

ξj=emjσ∥c∥2+ξ⊥,j,ξ⊥,j=(IL−eeT)ξj.(15)\xi_j = e\frac{m_j}{\sigma\lVert c\rVert_2} + \xi_{\perp,j}, \qquad\xi_{\perp,j} = (I_L - ee^{\mathsf{T}})\xi_j. \tag*{(15)}

Let m=(m1,…,md)m = (m_1,\ldots,m_d) and ξ⊥=(ξ⊥,1,…,ξ⊥,d)\xi_\perp= (\xi_{\perp,1},\ldots,\xi_{\perp,d}). We group all the randomness that we want to condition on into a single auxiliary variable h=(a0,ξ⊥)h = (a_0,\xi_\perp). Because orthogonal projections of a standard Gaussian are independent, the additive noise follows m∼N(0,ΣId)m \sim\mathcal{N}(0,\Sigma I_d) with variance Σ=σ2∥c∥22\Sigma= \sigma^2\lVert c\rVert_2^2, completely independent of ξ⊥\xi_\perp. Since the initial latent a0a_0 is also drawn independently, mm is independent of the entire auxiliary variable hh.

Conditioned on (s,h)(s,h), the Brownian path is fully determined by mm, so the action in eq. (11) is a function of mm alone,

a1=Tθ(m;s,h)=a0+gθ(m;s,h)+m,(16)a_1 = T_\theta(m;s,h) = a_0 + g_\theta(m;s,h) + m, \tag*{(16)}

where gθ(m;s,h)g_\theta(m;s,h) is the full-jump drift Gθ,0,10G^0_{\theta,0,1} evaluated on the reconstructed path and Jθ=∂gθ/∂mJ_\theta= \partial g_\theta/\partial m is its Jacobian. Given a stored rollout (s,a1,h)(s,a_1,h), the following proposition gives the density of a1a_1 under updated parameters θ\theta, using the change of variables of invertible residual networks [2, 8].

Proposition 1 (Conditional action density). Assume σ>0\sigma> 0 and sup⁡m∥Jθ(m;s,h)∥2<1\sup_m \lVert J_\theta(m;s,h)\rVert_2 < 1. Then m∼N(0,ΣId)m \sim\mathcal{N}(0,\Sigma I_d) independently of hh, with Σ=σ2∥c∥22\Sigma= \sigma^2\lVert c\rVert_2^2, the map Tθ(⋅;s,h)T_\theta(\cdot;s,h) is invertible, and

log⁡πθ(a1∣s,h)=log⁡N(mθ∗;0,ΣId)−log⁡det⁡(Id+Jθ(mθ∗;s,h)),(17)\log\pi_\theta(a_1 \mid s,h) = \log\mathcal{N}(m_\theta^*;0,\Sigma I_d) - \log\det(I_d + J_\theta(m_\theta^*;s,h)), \tag*{(17)}

where mθ∗=Tθ−1(a1;s,h)m_\theta^* = T_\theta^{-1}(a_1;s,h).

Proof sketch. The action is generated by a1=a0+gθ(m;s,h)+ma_1 = a_0 + g_\theta(m;s,h) + m. The randomness comes from the initial latent a0a_0 and the Brownian coefficients ξ\xi. As shown above, splitting ξ\xi isolates the additive noise m∼N(0,ΣId)m \sim\mathcal{N}(0,\Sigma I_d), which is entirely independent of the auxiliary variable h=(a0,ξ⊥)h = (a_0,\xi_\perp). The full proof is in section C.

To evaluate eq. (17) in practice, we approximate the updated preimage with one fixed-point iteration initialized at the stored rollout increment, and retain the first-order term log⁡det⁡(Id+Jθ)≈tr⁡(Jθ)\log\det(I_d + J_\theta) \approx\operatorname{tr}(J_\theta). We estimate this trace with a single Hutchinson probe, requiring one additional Jacobian-vector product, and reuse the same probe for the old and updated policies to reduce variance in their score difference. The resulting score approximates the conditional log-density; the inverse update and scoring formula are provided in section C and eq. (30).

Likelihood ratios with auxiliary variables. Theorem 1 gives the action density conditioned on the auxiliary variable h=(a0,ξ⊥)h=(a_0,\xi_\perp), rather than the marginal density πθ(a1∣s)\pi_\theta(a_1 \mid s). Let ν(h)\nu(h) denote the distribution of hh, which is independent of θ\theta. The marginal policy is

πθ(a1∣s)=∫ν(h)πθ(a1∣s,h) dh.(18)\pi_\theta(a_1 \mid s)=\int\nu(h)\pi_\theta(a_1 \mid s,h)\,\mathrm{d}h. \tag*{(18)}

We equivalently define the augmented policy

πˉθ(h,a1∣s)=ν(h)πθ(a1∣s,h).(19)\bar{\pi}_\theta(h,a_1 \mid s)=\nu(h)\pi_\theta(a_1 \mid s,h). \tag*{(19)}

The augmented policy samples the pair (h,a1)(h,a_1), while the environment receives only a1a_1. Marginalizing out hh therefore recovers eq. (18), so πˉθ\bar{\pi}_\theta and πθ\pi_\theta induce the same trajectory distribution and expected return J\mathcal{J}.

Because ν(h)\nu(h) is independent of θ\theta,

∇θlog⁡πˉθ(h,a1∣s)=∇θlog⁡πθ(a1∣s,h),πˉθ(h,a1∣s)πˉθold(h,a1∣s)=πθ(a1∣s,h)πθold(a1∣s,h).(20)\nabla_\theta\log\bar{\pi}_\theta(h,a_1 \mid s)=\nabla_\theta\log\pi_\theta(a_1 \mid s,h), \qquad\frac{\bar{\pi}_\theta(h,a_1 \mid s)}{\bar{\pi}_{\theta_{\mathrm{old}}}(h,a_1 \mid s)}=\frac{\pi_\theta(a_1 \mid s,h)}{\pi_{\theta_{\mathrm{old}}}(a_1 \mid s,h)}. \tag*{(20)}

Consequently, before the approximations in section C, the policy-gradient estimator constructed from the conditional density is unbiased for ∇θJ\nabla_\theta\mathcal{J}. The augmented and marginal formulations optimize the same expected-return objective, although their likelihood-ratio variances and clipped surrogate objectives can differ.

The auxiliary variable sampled during rollout is stored and reused when rescoring the recorded action; the Brownian path is never resampled. Using the approximate score from eq. (30), the likelihood ratio is

ρ~i(θ)=exp⁡[ℓ~θ(aiτ∣siτ,hiτ)−ℓ~θold(aiτ∣siτ,hiτ)].(21)\widetilde{\rho}_i(\theta)=\exp\left[\widetilde{\ell}_\theta(a_i^\tau\mid s_i^\tau,h_i^\tau)-\widetilde{\ell}_{\theta_{\mathrm{old}}}(a_i^\tau\mid s_i^\tau,h_i^\tau)\right]. \tag*{(21)}

where ii indexes trajectories and τ\tau indexes decision steps.

GRPO. For each update, we collect groups of NN trajectories from the same task and initial environment state. Group members use independent initial latents a0a_0 and Brownian coefficients ξ\xi, and the auxiliary variables sampled at every decision step are stored for policy rescoring. Episode returns are converted into the group-normalized advantages in eq. (6). The Brownian path increases action diversity beyond that provided by a0a_0 alone. Without this additional stochasticity, the policy more frequently produces zero-variance groups, for which all advantages vanish; section 4.3 measures this effect. We minimize the clipped GRPO surrogate in eq. (7) using the approximate likelihood ratio ρ~i(θ)\widetilde{\rho}_i(\theta) from eq. (21). The stored auxiliary variable hiτh_i^\tau is reused when evaluating both the old and updated policies. Training details are provided in section D.

Experiments

The experiments evaluate the end-to-end performance of VLA-SSD and analyze its underlying mechanics. We first evaluate the final on-policy reinforcement learning success rates and computational efficiency against multi-step baselines (section 4.2). We then analyze the source of the one-step policy’s sample diversity and its impact on the GRPO signal (section 4.3). Finally, we ablate the initial self-distillation phase to isolate the impact of different consistency objectives on the base policy (section 4.4).

Experimental Setup

Model and checkpoints. We use π0.5\pi_{0.5} (Physical Intelligence et al., 2025), a 3.3B-parameter VLA model with a 300M-parameter action expert serving as the flow-matching head described in section 3. The vision–language backbone is kept frozen throughout training. All runs start from the SFT checkpoints released with πRL\pi_{\mathrm{RL}} ([7]), so differences from its published numbers come from the post-SFT procedure alone. On LIBERO, reinforcement learning starts from the few-shot checkpoint (77.1%), as in πRL\pi_{\mathrm{RL}}; on MetaWorld the released checkpoint scores 51.8% under our protocol.

Benchmarks and protocol. LIBERO ([18]) is evaluated on its four ten-task suites (spatial, object, goal, long) with 500 episodes per suite; a four-suite mean therefore averages 2,000 episodes. and has a standard error of 0.5–0.7 points. MetaWorld MT50 (Yu et al., 2020) is evaluated on 50 tasks ×\times 10 fixed reset states at horizon 100, following πRL\pi_{\mathrm{RL}}. Unless stated otherwise, success rates are deterministic evaluations.

PolicySamplerPassesForward (ms)LIBEROMetaWorld
π0.5\pi_{0.5} SFTODE, K=10K=101058.477.151.8
πRL\pi_{\mathrm{RL}}, GRPOSDE, K=4K=4424.591.5—
πRL\pi_{\mathrm{RL}}, PPOSDE, K=4K=4424.598.370.7
Itô student (ours)Itô, K=1K=117.668.649.0
Itô + GRPO (ours)Itô, K=1K=117.693.072.0

Table 1. Main results. Success on the LIBERO four-suite mean and MetaWorld MT50 (ours at σ=0\sigma=0); passes is action-expert evaluations per chunk, forward its time per chunk on one A100. πRL\pi_{\mathrm{RL}} rows are its published numbers from the same SFT checkpoints. Bold is best per column.

Baselines. We compare against πRL\pi_{\mathrm{RL}}’s GRPO with Flow-SDE and PPO with Flow-Noise at their operating depth K=4K=4, using the results that work reports on the same checkpoints and protocol; against the deterministic flow map distilled with the same recipe at σ=0\sigma=0; and against the released ODE sampler at K=4K=4 and K=10K=10. We also evaluate a four-step ReinFlow-style PPO baseline (Appendix § 13).

Training. Distillation uses the Lagrangian objective, with the sampling interval gradually expanded over the first quarter of training, L=5L=5 Karhunen–Loève modes, and σ=0.1\sigma=0.1. We use the profile β(t)=2(1−t)\beta(t)=\sqrt{2(1-t)}, for which the diagonal correction in eq. (13) equals the constant σ2\sigma^2. GRPO runs in RLinf (Yu et al., 2025) on four A100 GPUs with groups of N=8N=8 rollouts sharing a task and initial state. Section D provides all settings.

Main Results: On-Policy RL Performance

On both benchmarks in table 1, the performance improvement from GRPO far exceeds the initial drop caused by one-step distillation. The final policy improves over the released SFT checkpoint by 15.9 percentage points on LIBERO and 20.2 points on MetaWorld. Under GRPO, our one-step policy achieves 93.0% on LIBERO, outperforming πRL\pi_{\mathrm{RL}}’s four-step GRPO policy (91.5%). While four-step PPO achieves a higher 98.3% on LIBERO, it requires the substantial overhead of training an additional vision–language critic. On MetaWorld, our one-step GRPO policy achieves 72.0%, outperforming the four-step PPO baseline (70.7%).

Analysis: Stochasticity and Sample Diversity

Source of sample diversity. Table 2 distinguishes variation induced by the initial latent from variation introduced during generation by fixing a0a_0 (Figure 2). Both the ODE sampler and the deterministic map are deterministic conditional on a0a_0, and their effective rank drops to zero when a0a_0 is fixed. With independently sampled latents, the ODE sampler has an effective rank of 3.2. The Itô map retains a similar rank with fixed and free latents (18.5 and 18.2), showing that substantial diversity can be generated through the Brownian path alone. Its fixed-latent rank exceeds that of four-step Flow-SDE (14.3) and matches that of isotropic Gaussian output noise. Their effects on return variation nevertheless differ, as examined next.

End-effector trajectories for deterministic, Itô, and Flow-SDE samplers

Figure 2. End-effector trajectories with (a) independent and (b) shared initial latents a0a_0. Fixing a0a_0 collapses the deterministic samples, while the stochastic samplers retain diversity. The distilled models shown use an earlier student checkpoint.

Zero-variance groups. The group-relative reward term in GRPO provides no learning signal when all members of a group obtain identical returns. Success rates are similar across samplers (83.1–84.6%), whereas the fraction of zero-variance groups varies. The ODE sampler and deterministic map produce zero return variance in 62.5% and 56.2% of groups, respectively. Isotropic output noise reduces this fraction to 47.9%, and four-step Flow-SDE to 45.8%. The Itô map yields the lowest observed fraction, 35.4%, despite having a similar effective rank to the isotropic control. This suggests that its sample diversity translates more effectively into within-group return variation. Under binary rewards, a lower zero-variance fraction corresponds to a larger proportion of groups providing a group-relative learning signal

Retention under training noise. Exploration noise is useful only if the noisy policy still succeeds often enough for groups to contain both outcomes. On MetaWorld the Itô student attains 36.8% under the training noise σ=0.1\sigma=0.1 against 49.0% deterministically, a retention of 75%; after GRPO the figures are 55.4% and 72.0%, a retention of 77%. For comparison, πRL\pi_{\mathrm{RL}} reports that Flow-SDE at K=1K=1 retains 14.7% of its deterministic success and 86% at K=4K=4, which is why that method is trained at four steps.

SamplerEffective rankGRPO groups
Free a0a_0Fixed a0a_0SR (%)Zero-var.
π0.5\pi_{0.5} ODE, K=10K=103.20.084.40.625
Flow-SDE, K=4K=413.714.384.60.458
Deterministic map, K=1K=110.30.084.40.562
+ N(0,0.12I)\mathcal{N}(0,0.1^2 I) noise18.518.584.40.479
Itô map, K=1K=1, σ=0.1\sigma=0.118.218.583.10.354

Table 2. Sample diversity and GRPO signal. Effective rank measures action diversity with free or fixed initial latent a0a_0; zero-variance is the fraction of rollout groups with identical returns. SR denotes success rate. Multi-step samplers use the SFT checkpoint; one-step samplers use its distilled student.

Exploration during GRPO. All runs on each benchmark started from the same distilled checkpoint. We evaluated success after 100 optimizer updates with exploration noise turned off. First, we varied only the rollout noise scale. The default σ=0.10\sigma=0.10 gave the highest success rate on both benchmarks among the three scales tested. Second, we trained a one-step control with the same GRPO settings, disabling the Brownian-path input and increment and adding independent isotropic Gaussian noise to the output. The Itô policy led by 2.0 percentage points on LIBERO and 0.4 on MT50.

Training conditionLIBERO success (%)MT50 success (%)
(a) Rollout noise scale for the Itô policy
σ=0.05\sigma=0.0569.1058.80
σ=0.10\sigma=0.10 (default)73.5059.40
σ=0.20\sigma=0.2065.1555.20
(b) One-step GRPO policies
Itô map73.5059.40
Isotropic output noise71.5059.00

Table 3. Effect of rollout noise scale and noise source on task success after 100 GRPO optimizer updates.

Ablation: Impact of Self-Distillation

Distillation loss. Distilled from the full-demonstration π0.5\pi_{0.5} checkpoint, the one-step Itô student attains 96.55% on the LIBERO four-suite mean against the ten-step teacher’s 96.85%, with the residual concentrated on the long-horizon suite. Evaluated at K=1K=1 and K=5K=5, the same checkpoint varies by less than ±2\pm2 points, indicating that the student approximates the solution operator over the interval rather than a single endpoint. The loss is larger when the teacher is weaker: 8.5 points from the few-shot LIBERO checkpoint (77.1 → 68.6) and 2.8 points on MetaWorld (51.8 → 49.0), the two starting points of § 4.2.

The LIBERO comparison in table 1 uses ten ODE steps for the SFT teacher (77.1%) and one step for the distilled student (68.6%). Holding sampling depth fixed at one step, self-distillation raises pre-RL success from 40.55% to 68.60% (section E).

The order of training also matters: distilling from the converged SFT checkpoint rather than jointly from the π0.5\pi_{0.5} base raised a matched-budget student from 12.2% to 42.7% at K=1K=1.

Consistency objective and map. Table 4 compares deterministic and Itô maps under three consistency objectives using the π0\pi_0 teacher. The Lagrangian and progressive objectives yield one-step performance reductions of 2.9–6.2 percentage points, with the largest reductions on the long-horizon suite. The Eulerian objective exhibits substantially larger reductions, consistent with reduced accuracy of first-order extrapolation from the diagonal as ∣t−r∣\lvert t-r\rvert increases. LSD achieves the highest mean success for both maps and is used throughout. Under LSD, the Itô map achieves 88.95%, compared with 91.30% for the deterministic map, indicating a 2.35-percentage-point performance trade-off associated with the stochastic formulation. Its exploration properties are analyzed in § 4.3.

MapObjectiveForward (ms)spatialobjectgoallongmean
π0\pi_0 teacher, K=10K=10—58.496.898.895.885.294.15
Deterministic flow mapLSD7.696.296.094.079.091.30
PSD7.696.495.493.677.890.80
ESD7.690.276.877.026.067.50
Itô flow map, σ=0.1\sigma=0.1LSD7.694.293.691.077.088.95
PSD7.696.691.290.873.287.95
ESD7.685.476.862.637.265.50

Table 4. One-step distillation from π0\pi_0 on LIBERO, 500 episodes per suite, all students evaluated at K=1K=1. The teacher is πRL\pi_{\mathrm{RL}}’s full-dataset SFT π0\pi_0 checkpoint at K=10K=10; the deterministic map under ESD is MeanFlow [12]. Forward is the action head’s time per chunk on one A100. Bold marks the best objective for each map; the standard error on each mean is about 0.7 points.

Related Work

Reinforcement fine-tuning of generative policies

Building on pretrained VLAs [6, 13, 3] (Physical Intelligence et al. 2025), online RL has been explored for autoregressive action generation [20, 15]. For diffusion and flow policies, DPPO optimizes the denoising chain with PPO (Ren et al., 2025), while ReinFlow and πRL\pi_{\mathrm{RL}} introduce stochastic denoising transitions for likelihood-based fine-tuning, retaining multi-step generation [7] (Zhang et al. 2025). In image generation, Flow-GRPO and DanceGRPO apply GRPO through ODE-to-SDE conversion [19] (Xue et al. 2025); Flow-Map GRPO extends this approach to few-step generators through anchored stochastic composition [16]. Complementary critic-based approaches optimize a fixed policy’s latent-noise distribution (DSRL) (Wagenmaker et al., 2025), update flow maps through critic-guided trust regions (Flow Map QQ-Guidance) (Ziakas et al., 2026), or combine value calibration with action filtering (FORCE) (Zhang et al., 2026). Our work enables GRPO fine-tuning of a one-step stochastic VLA through its conditional action density, avoiding a multi-step denoising chain.

One-step generation and stochastic flow maps

Diffusion and flow policies model multimodal robot actions through iterative sampling [10, 3]. Consistency models, shortcut models, MeanFlow, and flow-map methods replace iterative integration with learned finite-time transport [11, 12, 4, 1] (Song et al. 2023), including self-distillation from the map’s own diagonal [5]. In robotics, Consistency Policy and SnapFlow distill policies into few-step or one-step samplers (Prasad et al., 2024; Luan et al., 2026), while Let It Be Simple enables one-step decoding through high-noise training [9]. These maps are deterministic given the initial noise. Stochastic extensions include Meta Flow Maps for reward-conditioned posterior sampling (Potaptchik et al., 2026) and Itô maps for Brownian-path-conditioned SDE transitions (Pan et al., 2026). We build on Itô maps to combine one-step VLA generation with explicit exploration and conditional-density-based on-policy optimization.

Conclusion

We presented VLA-SSD, which distills a flow-matching VLA into a one-step stochastic policy based on Itô flow maps and fine-tunes it with GRPO. The Brownian path provides exploration with an explicit noise scale, and the derived conditional density makes the policy usable in likelihood-based on-policy updates. On LIBERO and MetaWorld MT50, the result matches multi-step GRPO fine-tuning with πRL\pi_{\mathrm{RL}} using just one action-expert evaluation per chunk instead of four. Regarding limitations, our approximate likelihood scoring relies on a first-order truncation of the log-determinant. In addition, while GRPO avoids the heavy memory overhead of a vision–language critic, it does not match the peak absolute sample efficiency of critic-based PPO on LIBERO. However, because physical robot rollouts operate in real-time and constitute the primary bottleneck of on-policy RL, the 3.2×3.2 \times faster rollout generation provided by VLA-SSD is particularly valuable for real-world deployment. Translating this framework to real-robot fine-tuning is the natural next step. Finally, investigating adaptive step sizing—where the model defaults to the one-step Itô map but allocates additional sampling steps for complex, high-precision maneuvers—presents an exciting direction for bridging one-step and multi-step continuous control.

Acknowledgments

This work was supported by UKRI (EP/Y037111/1) as part of the ProSafe project (EU Horizon 2020, MSCA, grant no. 101119358).

Consistency Objectives for Flow-Map Distillation

This appendix states the three self-distillation objectives of section 3.1 in full, in the notation of section 2, and records the properties that motivate the choice made in the main text. Throughout, the flow map is parameterized as Xr,tθ(ar∣s)=ar+(t−r)ur,tθ(ar∣s)X^\theta_{r,t}(a_r \mid s)=a_r+(t-r)u^\theta_{r,t}(a_r \mid s) for 0≤r≤t≤10 \le r \le t \le1, the diagonal ut,tθu^\theta_{t,t} is trained by LDiag\mathcal{L}_{\mathrm{Diag}} in eq. (13), and sg denotes a stop-gradient; conditioning on ss and the superscript θ\theta are suppressed where unambiguous.

Origin of the conditions. The exact solution operator Xr,tX_{r,t} of the ODE ddtat=vt(at)\frac{\mathrm{d}}{\mathrm{d}t}a_t=v_t(a_t) satisfies the jump condition Xr,t(ar)=atX_{r,t}(a_r)=a_t and the semigroup property Xw,t∘Xr,w=Xr,tX_{w,t}\circ X_{r,w}=X_{r,t} for r≤w≤tr\le w\le t. Differentiating the jump condition with respect to the endpoint tt gives ∂tXr,t(ar)=vt(Xr,t(ar))\partial_tX_{r,t}(a_r)=v_t(X_{r,t}(a_r)); differentiating with respect to the start time rr and using ddrXr,t(ar)=0\frac{\mathrm{d}}{\mathrm{d}r}X_{r,t}(a_r)=0 gives ∂tXr,t(ar)+∂tXr,t(ar)vr(ar)=0\partial_tX_{r,t}(a_r)+\partial_tX_{r,t}(a_r)v_r(a_r)=0. Each of these identities, together with the semigroup property, yields a residual that vanishes for the exact map and can be minimized for the parameterized map, with the diagonal ut,t=vtu_{t,t}=v_t serving as the teacher [4, 5] (Ziakas et al. 2026).

Lagrangian self-distillation (LSD). Writing y=Xr,t(ar)y=X_{r,t}(a_r) for the transported state,

LLSD=Er<t,ar[∥∂tXr,t(ar)−sg⁡(ut,t(y))∥22],∂tXr,t=ur,t+(t−r)∂tur,t.(22)\mathcal{L}_{\mathrm{LSD}}=\mathbb{E}_{r<t,a_r}\left[\left\|\partial_tX_{r,t}(a_r)-\operatorname{sg}(u_{t,t}(y))\right\|_2^2\right],\qquad\partial_tX_{r,t}=u_{r,t}+(t-r)\partial_tu_{r,t}. \tag*{(22)}

The condition matches the endpoint derivative of the map to the instantaneous velocity evaluated at the transported state, so the map is supervised along the trajectory it generates. The time derivative ∂tur,t\partial_t u_{r,t} is obtained by a Jacobian-vector product with respect to the scalar tt, and the target requires one additional evaluation of the diagonal at yy.

Eulerian self-distillation (ESD).

LESD=Er<t,ar[∥∂tXr,t(ar)+sg⁡(∇Xr,t(ar)ur,r(ar))∥22],∂rXr,t=−ur,t+(t−r)∂rur,t.(23)\mathcal{L}_{\mathrm{ESD}}=\mathbb{E}_{r<t,a_r}\left[\left\|\partial_t X_{r,t}(a_r)+\operatorname{sg}\left(\nabla X_{r,t}(a_r)u_{r,r}(a_r)\right)\right\|_2^2\right], \qquad\partial_r X_{r,t}=-u_{r,t}+(t-r)\partial_r u_{r,t}. \tag*{(23)}

The condition transports the map along the characteristics of the diagonal field at the start point, so both the residual and its target are evaluated at ara_r rather than at the transported state. The spatial term ∇Xr,t(ar)ur,r(ar)\nabla X_{r,t}(a_r)u_{r,r}(a_r) is a Jacobian-vector product in the action argument. For the average-velocity parameterization, removing the stop-gradient and expanding ∇Xr,tur,r=ur,r+(t−r)∇ur,tur,r\nabla X_{r,t}u_{r,r}=u_{r,r}+(t-r)\nabla u_{r,t}u_{r,r} shows that the ESD gradient coincides with that of MeanFlow (Geng et al. [12]) up to the choice of teacher for the instantaneous velocity; see Ziakas et al. (2026, App. B).

Progressive self-distillation (PSD).

LPSD=Er<t,ar,α[∥Xw,t(Xr,w(ar))−sg⁡(Xr,t(ar))∥22],w=(1−α)r+αt,α∼U[0,1].(24)\mathcal{L}_{\mathrm{PSD}}=\mathbb{E}_{r<t,a_r,\alpha}\left[\left\|X_{w,t}\left(X_{r,w}(a_r)\right)-\operatorname{sg}\left(X_{r,t}(a_r)\right)\right\|_2^2\right], \qquad w=(1-\alpha)r+\alpha t,\quad\alpha\sim\mathcal{U}[0,1]. \tag*{(24)}

The condition enforces the semigroup property directly: a jump from rr to tt must agree with the composition of two shorter jumps through an intermediate time ww. It requires no derivative of the network but two sequential forward passes on the left-hand side, and it constrains the off-diagonal map only through other off-diagonal evaluations, so the diagonal enters indirectly.

Diagonal Target of the Itô Map

Throughout this derivation, we fix the conditioning state ss and assume independent endpoint coupling, q(a0,a1∣s)=p0(a0)p1(a1∣s)q(a_0,a_1\mid s)=p_0(a_0)p_1(a_1\mid s), with p0=N(0,Id)p_0=\mathcal{N}(0,I_d). We suppress the dependence on ss below.

The diagonal loss in eq. (13) regresses the zero-path diagonal drift onto the drift of the SDE that shares marginals with the flow-matching ODE. For the interpolant at=(1−t)a0+ta1a_t=(1-t)a_0+ta_1, the marginal path ptp_t of the ODE ddtat=vt(at)\frac{\mathrm{d}}{\mathrm{d}t}a_t=v_t(a_t) is also the marginal path of the SDE

dat=[vt(at)+12σ2β(t)2∇log⁡pt(at)]dt+σβ(t)dWt,(25)\mathrm{d}a_t=\left[v_t(a_t)+\frac{1}{2}\sigma^2\beta(t)^2\nabla\log p_t(a_t)\right]\mathrm{d}t+\sigma\beta(t)\mathrm{d}W_t, \tag*{(25)}

for any diffusion profile σβ(t)\sigma\beta(t), since the added diffusion and the score correction cancel in the Fokker–Planck equation. Conditioned on the endpoint a1a_1, the interpolant is Gaussian with mean ta1ta_1 and covariance (1−t)2Id(1-t)^2I_d, so the conditional score is ∇log⁡pt(at∣a1)=−(at−ta1)/(1−t)2=−a0/(1−t)\nabla\log p_t(a_t\mid a_1)=-(a_t-ta_1)/(1-t)^2=-a_0/(1-t). Substituting the conditional velocity a1−a0a_1-a_0 and the conditional score gives the regression target

a1−a0−σ2β(t)22(1−t)a0=a1−(1+σ2β(t)22(1−t))a0,(26)a_1-a_0-\frac{\sigma^2\beta(t)^2}{2(1-t)}a_0=a_1-\left(1+\frac{\sigma^2\beta(t)^2}{2(1-t)}\right)a_0, \tag*{(26)}

which is the target in eq. (13); as for conditional flow matching, regressing onto the conditional target recovers the marginal drift in expectation. The coefficient remains bounded as t→1t\to1 provided that β(t)2/(1−t)\beta(t)^2/(1-t) remains bounded. With the profile β(t)=2(1−t)\beta(t)=\sqrt{2(1-t)} used in our experiments, the coefficient reduces to the constant 1+σ21+\sigma^2, and the Brownian variance accumulated over [0,1][0,1] is σ2∫01β(t)2 dt=σ2\sigma^2\int_0^1\beta(t)^2\,\mathrm{d}t=\sigma^2 in the continuum; section D gives the truncated value used in practice.

Density diagnostics. At the end of distillation the Brownian pathway’s output projection is of order 3×10−43\times10^{-4}; consequently the variance 2∣(Jθ+Jθ⊤)/2∣F2≤2∥Jθ∥F22\lvert(J_\theta+J_\theta^\top)/2\rvert_F^2\leq2\lVert J_\theta\rVert_F^2 of the single-probe trace estimator and the truncation error ≤∥Jθ∥F2/[2(1−∥Jθ∥2)]\leq\lVert J_\theta\rVert_F^2/[2(1-\lVert J_\theta\rVert_2)] of the first-order log-determinant in eq. (30), under ∥Jθ∥2<1\lVert J_\theta\rVert_2<1, are both below 10−610^{-6} nats per chunk. At the first minibatch of every run the ratio ρ~i\widetilde{\rho}_i equals one to floating-point precision and the mean Jacobian correction is indistinguishable from zero. These values are measured at the start of training; the pathway norm was not logged during reinforcement learning.

Proof of the Conditional-Density Proposition

Proof of theorem 1. For each action coordinate, eTξj\mathbf{e}^{\mathsf{T}}\xi_j and (IL−eeT)ξj(I_L-\mathbf{e}\mathbf{e}^{\mathsf{T}})\xi_j are independent Gaussian projections. Since mj=σ∥c∥2eTξjm_j=\sigma\lVert c\rVert_2\mathbf{e}^{\mathsf{T}}\xi_j, the coordinates of mm are independent and m∼N(0,ΣId)m\sim\mathcal{N}(0,\Sigma I_d), where Σ=σ2∥c∥22\Sigma=\sigma^2\lVert c\rVert_2^2. Because a0a_0 is sampled independently of the Brownian coefficients, mm is independent of h=(a0,ξ⊥)h=(a_0,\xi_{\perp}).

Fix (s,h)(s,h) and an action a1a_1. A preimage of a1a_1 under TθT_\theta satisfies

m=a1−a0−gθ(m;s,h).m=a_1-a_0-g_\theta(m;s,h).

The right-hand side is a contraction under the assumption of the theorem, so the Banach fixed-point theorem guarantees a unique solution mθ⋆m_\theta^\star. Therefore, Tθ(⋅;s,h)T_\theta(\cdot;s,h) is invertible. Its Jacobian is

∂Tθ∂m=Id+Jθ(m;s,h),\frac{\partial T_\theta}{\partial m}=I_d+J_\theta(m;s,h),

which is nonsingular because ∥Jθ(m;s,h)∥2<1\lVert J_\theta(m;s,h)\rVert_2<1. Applying the change-of-variables formula to m∼N(0,ΣId)m\sim\mathcal{N}(0,\Sigma I_d) gives eq. (17).

The proposition provides the exact density conditioned on the auxiliary variable hh; the marginal action density πθ(a1∣s)\pi_\theta(a_1\mid s) remains intractable. We next approximate the inverse and log-determinant required to evaluate the conditional density.

Approximating policy scoring. After a policy update, the stored increment m(0)m^{(0)} need not generate the recorded action under the updated parameters. The updated preimage satisfies the fixed-point equation

m=a1−a0−gθ(m;s,h).(27)m=a_1-a_0-g_\theta(m;s,h). \tag*{(27)}

Starting from the stored increment m(0)m^{(0)}, we approximate the updated preimage using one fixed-point iteration:

mθ(1)=a1−a0−gθ(m(0);s,h).(28)m_\theta^{(1)}=a_1-a_0-g_\theta(m^{(0)};s,h). \tag*{(28)}

Under the contraction assumption of theorem 1, the Jacobian correction to the conditional log-density admits the convergent trace expansion

C(J)=∑k=1∞(−1)kktr⁡(Jk),J=Jθ(mθ⋆;s,h).(29)C(J)=\sum_{k=1}^{\infty}\frac{(-1)^k}{k}\operatorname{tr}(J^k),\qquad J=J_\theta(m_\theta^\star;s,h). \tag*{(29)}

We retain its first-order term and estimate the trace using a Hutchinson probe ω∼N(0,Id)\omega\sim\mathcal{N}(0,I_d):

ℓ~θ(a1∣s,h)=−∥mθ(1)∥222Σ−d2log⁡(2πΣ)−ωTJθ(m(0);s,h)ω.(30)\widetilde{\ell}_\theta(a_1\mid s,h)=-\frac{\lVert m_\theta^{(1)}\rVert_2^2}{2\Sigma}-\frac{d}{2}\log(2\pi\Sigma)-\omega^{\mathsf{T}}J_\theta(m^{(0)};s,h)\omega. \tag*{(30)}

The final term requires one Jacobian-vector product. At θ=θold\theta=\theta_{\mathrm{old}}, the fixed-point update recovers the stored increment exactly, mθold(1)=m(0)m_{\theta_{\mathrm{old}}}^{(1)}=m^{(0)}. We use the same probe ω\omega for the old and updated policies to reduce variance in the likelihood ratio. Thus, eq. (30) is used as an approximate policy score rather than an exact likelihood.

Scoring accuracy across RL checkpoints. At early, middle, and late stages of GRPO training, we replayed eight LIBERO action chunks for each pair of pre- and post-update policies. We recomputed the approximate log-ratios in FP32 and compared them with reference values obtained using a converged inverse and an explicit Jacobian. On these samples, the mean absolute error was below 0.0002 at all three checkpoints.

RL checkpointMean absolute log-ratio error (FP32)
Early0.000181
Middle0.000070
Late0.000061

Table 5. FP32 log-ratio error across GRPO checkpoints.

Implementation Details

Model. The action expert of π0.5\pi_{0.5} is extended with two additive pathways, each a two-layer MLP of width 1024 with swish activation and a zero-initialised output layer, so that the extended model reproduces the pretrained velocity at initialisation. The interval pathway embeds t−rt-r with a sinusoidal positional encoding (periods 4×10−34 \times10^{-3} to 44); the path pathway projects the martingale increment ΔMr,t\Delta M_{r,t} through the action input projection, mean-pools it over the horizon, adds the interval encoding, and passes the sum through the MLP. Both outputs enter the expert through its adaptive RMS-norm conditioning, not as additional tokens. The vision–language backbone (SigLIP and Gemma-2B) is frozen; the action expert, its projections, and the two pathways are trained, all in bfloat16 under FSDP without parameter sharding. The expert predicts a chunk of 10 steps in a 32-dimensional padded action space; the first 5 steps of the first 7 dimensions are executed, and the conditional density is evaluated on these d=5×7=35d = 5 \times7 = 35 coordinates only.

Brownian path. Each of the dd coordinates carries an independent standard Brownian motion BB on [0,1][0,1], represented by its first L=5L = 5 Karhunen–Loève modes, B(q)=∑k=1Lϕk(q) ξkB(q) = \sum_{k=1}^{L} \phi_k(q)\,\xi_k with ϕk(q)=2sin⁡(ωkq)/ωk\phi_k(q) = \sqrt{2}\sin(\omega_kq)/\omega_k, ωk=(k−12)π\omega_k = (k - \frac{1}{2})\pi, and ξ∼N(0,IL)\xi\sim\mathcal{N}(0,I_L). The diffusion profile β(t)=2(1−t)\beta(t) = \sqrt{2(1-t)} is implemented as the time change Mt=σ[B(1)−B((1−t)2)]M_t = \sigma\left[B(1) - B((1-t)^2)\right], so that the increment of eq. (10) is the closed-form difference ΔMr,t=σ[B((1−r)2)−B((1−t)2)]\Delta M_{r,t} = \sigma\left[B((1-r)^2) - B((1-t)^2)\right] with ck(r,t)=ϕk((1−r)2)−ϕk((1−t)2)c_k(r,t) = \phi_k((1-r)^2) - \phi_k((1-t)^2); no quadrature is used. For the full jump, ∥c(0,1)∥22=∑k=152/ωk2=0.9596\lVert c(0,1)\rVert_2^2 = \sum_{k=1}^{5} 2/\omega_k^2 = 0.9596, so the realized variance in eq. (17) is Σ=0.9596 σ2\Sigma= 0.9596\,\sigma^2 rather than its continuum limit σ2\sigma^2; the same truncation is used at training and at scoring, since a mismatch would bias every importance ratio.

Distillation. The student is initialised from the π0.5\pi_{0.5} SFT checkpoint and trained for 1,000 optimizer steps on 4 A100 GPUs with global batch 128 (micro-batch 4), AdamW with β=(0.9,0.95)\beta= (0.9, 0.95), ϵ=10−8\epsilon= 10^{-8}, weight decay 10−1010^{-10}, and gradient clipping at 1.0. The learning rate is warmed up linearly to 5×10−65 \times10^{-6} over the run. The objective is LDiag+λLLSD\mathcal{L}_{\mathrm{Diag}} + \lambda\mathcal{L}_{\mathrm{LSD}} with λ=1\lambda= 1, where the consistency term is switched on after the first 5% of steps; the consistency residual is not normalised and is typically one to two orders of magnitude larger than the diagonal residual, so λ=1\lambda= 1 does not correspond to an equal weighting of the two terms. Interval endpoints are drawn as r=mid−p δ/2r = \mathrm{mid} - p\,\delta/2, t=mid+p δ/2t = \mathrm{mid} + p\,\delta/2, where mid and δ\delta are the midpoint and length of the interval between two independent U[0,1]U[0,1] draws, and pp increases linearly from 0 at 5% of the run to 1 at 25%; a quarter of each batch is forced to the full interval (r,t)=(0,1)(r,t) = (0,1). The noise scale is ramped linearly from 0 to σ=0.1\sigma= 0.1 over the first 30% of the run and held fixed thereafter. The checkpoint at step 600 is used.

Reinforcement learning. GRPO runs in RLinf on 4 A100 GPUs. Each iteration collects 8 groups of N=8N = 8 rollouts on LIBERO (32 parallel environments, two rollout epochs) and 32 groups on MetaWorld, with the same task and initial state within a group, K=1K = 1, and σ=0.1\sigma= 0.1 applied in full from the first iteration. Episodes run for at most 500 environment steps on LIBERO and 100 on MetaWorld; the return is 1 at the step of first success and 0 otherwise. Groups whose mean return lies outside [0.1,0.9][0.1, 0.9] are discarded, which removes degenerate groups before the update. Advantages use κ=10−6\kappa= 10^{-6} and are normalised across the batch; the clipped objective uses ϵ=0.2\epsilon= 0.2 with a dual clip at 3.0, token-mean aggregation, no entropy bonus, and no KL penalty. Each iteration performs one pass over the retained rollout chunks in minibatches of 256 with micro-batch 64, using AdamW with learning rate 10−610^{-6}, β=(0.9,0.95)\beta= (0.9, 0.95), weight decay 0.010.01, and gradient clipping at 1.0, without warmup or decay. The Jacobian-vector products in eqs. (14) and (30) are computed by forward-mode automatic differentiation.

Training budget and wall-clock time. The original Itô + GRPO runs collected 64 rollouts per iteration on LIBERO and 256 on MT50. We report the full training budgets below.

BenchmarkRL iterationsOptimizer updatesRollouts collected
LIBERO60015,00038,400
MT503007,50076,800

Table 6. Training budgets for the original Itô + GRPO runs.

End-to-end RL time includes policy scoring. The Itô times are estimates for the original 600-iteration LIBERO run and 300-iteration MT50 run.

Training methodLIBERO (hours)MT50 (hours)
Itô + GRPO (estimated)33.349.3
Isotropic output noise + GRPO74.872.1

Table 7. End-to-end GRPO training time, including policy scoring.

Evaluation. LIBERO is evaluated on the four ten-task suites with 500 episodes per suite in 500 parallel environments; MetaWorld MT50 on 50 tasks with 10 fixed reset states each, following πRL\pi_{\mathrm{RL}}. Forward times in table 1 are wall-clock times of the action head per chunk on one A100.

Successful Rollouts. We visualize successful rollouts of the one-step VLA-SSD policy (Itô map, K=1K=1, σ=0\sigma=0 at evaluation) on the four LIBERO suites and on MetaWorld MT50. Each figure shows uniformly spaced frames from a single successful episode, from the initial state to the step at which success is registered.

LIBERO-Spatial, task 4 rollout

Figure 3. LIBERO-Spatial, task 4. Pick up the black bowl in the top drawer of the wooden cabinet and place it on the plate.

LIBERO-Spatial, task 7 rollout

Figure 4. LIBERO-Spatial, task 7. Pick up the black bowl on the stove and place it on the plate.

LIBERO-Object, task 0 rollout

Figure 5. LIBERO-Object, task 0. Pick up the alphabet soup and place it in the basket.

LIBERO-Object, task 7 rollout

Figure 6. LIBERO-Object, task 7. Pick up the milk and place it in the basket.

LIBERO-Goal, task 0 rollout

Figure 7. LIBERO-Goal, task 0. Open the middle drawer of the cabinet.

LIBERO–Goal task 5

Figure 8. LIBERO–Goal, task 5. Push the plate to the front of the stove.

LIBERO–Long task 2

Figure 9. LIBERO–Long, task 2. Turn on the stove and put the moka pot on it.

LIBERO–Long task 4

Figure 10. LIBERO–Long, task 4. Put the white mug on the left plate and put the yellow and white mug on the right plate.

assembly-v3

Figure 11. assembly-v3 (MetaWorld MT50). Pick up a nut and place it onto a peg.

basketball-v3

Figure 12. basketball-v3 (MetaWorld MT50). Dunk the basketball into the basket.

button-press-topdown-v3

Figure 13. button-press-topdown-v3 (MetaWorld MT50). Press a button from the top.

drawer-open-v3

Figure 14. drawer-open-v3 (MetaWorld MT50). Open a drawer.

Shelf-place-v3 (MetaWorld MT50)

Figure 15. shelf-place-v3 (MetaWorld MT50). Pick and place a puck onto a shelf.

Window-open-v3 (MetaWorld MT50)

Figure 16. window-open-v3 (MetaWorld MT50). Push and open a window.

Effect of Self-Distillation Before GRPO

Both LIBERO runs started from the same π0.5\pi_{0.5} SFT checkpoint. We applied self-distillation before GRPO in one run and trained the other directly with one-step Itô + GRPO. We kept the GRPO settings fixed and evaluated both policies with one-step sampling and exploration noise turned off. The distilled policy started from a higher success rate and retained a 21.45-percentage-point lead after 100 optimizer updates.

Training pipelineBefore RLAfter 100 updates
Self-distillation followed by one-step GRPO68.6073.50
Direct one-step GRPO40.5552.05

Table 1 (PDF p. 19). LIBERO success (%).

Comparison with Four-Step ReinFlow-Style PPO

On each benchmark, both methods started from the same π0.5\pi_{0.5} SFT checkpoint before method-specific training. We evaluated both policies on the same initial states after 100 optimizer updates. At this checkpoint, VLA-SSD led by 32.95 percentage points on LIBERO and 4.00 points on MT50.

BenchmarkMethodPassesSuccess (%)Head time (ms/chunk)
LIBEROVLA-SSD + GRPO173.507.6
ReinFlow-style PPO440.5568.5
MT50VLA-SSD + GRPO159.407.6
ReinFlow-style PPO455.4080.0

Table 2 (PDF p. 19).

References

  1. [1]Michael S. Albergo, Nicholas M. Boffi, and Eric Vanden-Eijnden. Stochastic Interpolants: A Unifying Framework for Flows and Diffusions. arXiv preprint arXiv:2303.08797, 2023. URL https://arxiv.org/abs/2303.08797. 3, 9
  2. [2]Jens Behrmann, Will Grathwohl, Ricky T. Q. Chen, David Duvenaud, and Joern-Henrik Jacobsen. Invertible residual networks. In Proceedings of the 36th International Conference on Machine Learning, volume 97, pp. 573–582. PMLR, 2019. 5arxiv.org/abs/1811.00995
  3. [3]Kevin Black, Noah Brown, Danny Driess, Adnan Esmail, Michael Equi, Chelsea Finn, Niccolo Fusai, Lachy Groom, Karol Hausman, Brian Ichter, Szymon Jakubczak, Tim Jones, Liyiming Ke, Sergey Levine, Adrian Li-Bell, Mohith Mothukuri, Suraj Nair, Karl Pertsch, Lucy Xiaoyang Shi, James Tanner, Quan Vuong, Anna Walling, Haohuan Wang, and Ury Zhilinsky. π₀: A Vision-Language-Action Flow Model for General Robot Control. arXiv preprint arXiv:2410.24164, 2024. URL https://arxiv.org/abs/2410.24164. 1, 9
  4. [4]Nicholas M. Boffi, Michael S. Albergo, and Eric Vanden-Eijnden. Flow map matching with stochastic interpolants: A mathematical framework for consistency models. arXiv preprint arXiv:2406.07507, 2024. URL https://arxiv.org/abs/2406.07507. 1, 3, 4, 9, 13
  5. [5]Nicholas M. Boffi, Michael S. Albergo, and Eric Vanden-Eijnden. How to build a consistency model: Learning flow maps via self-distillation. arXiv preprint arXiv:2505.18825, 2025. URL https://arxiv.org/abs/2505.18825. 1, 4, 9, 13
  6. [6]Anthony Brohan, Noah Brown, Justice Carbajal, Yevgen Chebotar, Xi Chen, Krzysztof Choro-manski, Tianli Ding, Danny Driess, Avinava Dubey, Chelsea Finn, Pete Florence, Chuyuan Fu, Montse Gonzalez Arenas, Keerthana Gopalakrishnan, Kehang Han, Karol Hausman, Alexander Herzog, Jasmine Hsu, Brian Ichter, Alex Irpan, Nikhil Joshi, Ryan Julian, Dmitry Kalashnikov, Yuheng Kuang, Isabel Leal, Lisa Lee, Tsang-Wei Edward Lee, Sergey Levine, Yao Lu, Henryk Michalewski, Igor Mordatch, Karl Pertsch, Kanishka Rao, Krista Reymann, Michael Ryoo, Grecia Salazar, Pannag Sanketi, Pierre Sermanet, Jaspiar Singh, Anikaith Singh, Radford Socratic, Huong Tran, Vincent Vanhoucke, Quan Vuong, Ayzaan Wahid, Stefan Welker, Paul Wohlhart, Jialin Wu, Fei Xia, Ted Xiao, Peng Xu, Sichun Xu, Tianhe Yu, and Brianna Zitkovich. RT-2: Vision-Language-Action Models Transfer Web Knowledge to Robotic Control. arXiv preprint arXiv:2307.15818, 2023. URL https://arxiv.org/abs/2307.15818. 1, 9
  7. [7]Kang Chen, Zhihao Liu, Tonghe Zhang, Zhen Guo, Si Xu, Hao Lin, Hongzhi Zang, Xiang Li, Quanlu Zhang, Zhaofei Yu, Guoliang Fan, Tiejun Huang, Yu Wang, and Chao Yu. π_RL: Online RL Fine-tuning for Flow-based Vision-Language-Action Models. arXiv preprint arXiv:2510.25889, 2025. URL https://arxiv.org/abs/2510.25889. 1, 5, 6, 9
  8. [8]Ricky T. Q. Chen, Jens Behrmann, David K. Duvenaud, and Joern-Henrik Jacobsen. Residual flows for invertible generative modeling. In Advances in Neural Information Processing Systems, volume 32, 2019. 5arxiv.org/abs/1906.02735
  9. [9]Yitong Chen, Shiduo Zhang, Jingjing Gong, and Xipeng Qiu. Let It Be Simple: One-Step Action Generation for Vision-Language-Action Models. arXiv preprint arXiv:2606.05737, 2026. URL https://arxiv.org/abs/2606.05737. 9
  10. [10]Cheng Chi, Siyuan Feng, Yilun Du, Zhenjia Xu, Eric Cousineau, Benjamin CM Burchfiel, and Shuran Song. Diffusion Policy: Visuomotor Policy Learning via Action Diffusion. In Proceedings of Robotics: Science and Systems, 2023. doi: 10.15607/RSS.2023.XIX.026. URL https://www.roboticsproceedings.org/rss19/p026.html. 9DOI
  11. [11]Kevin Frans, Danijar Hafner, Sergey Levine, and Pieter Abbeel. One Step Diffusion via Shortcut Models. In The Thirteenth International Conference on Learning Representations, 2025. URL https://openreview.net/forum?id=OlzB6LnXcS. 3, 9arxiv.org/abs/2410.12557
  12. [12]Zhengyang Geng, Mingyang Deng, Xingjian Bai, J. Zico Kolter, and Kaiming He. Mean Flows for One-step Generative Modeling. arXiv preprint arXiv:2505.13447, 2025. URL https://arxiv.org/abs/2505.13447. 1, 3, 9, 14
  13. [13]Moo Jin Kim, Karl Pertsch, Siddharth Karamcheti, Ted Xiao, Ashwin Balakrishna, Suraj Nair, Rafael Rafailov, Ethan Foster, Grace Lam, Pannag Sanketi, Quan Vuong, Thomas Kollar, Benjamin Burchfiel, Russ Tedrake, Dorsa Sadigh, Sergey Levine, Percy Liang, and Chelsea Finn. OpenVLA: An Open-Source Vision-Language-Action Model. arXiv preprint arXiv:2406.09246, 2024. URL https://arxiv.org/abs/2406.09246. 1, 9
  14. [14]Moo Jin Kim, Chelsea Finn, and Percy Liang. Fine-Tuning Vision-Language-Action Models: Optimizing Speed and Success. arXiv preprint arXiv:2502.19645, 2025. URL https://arxiv.org/abs/2502.19645. 1
  15. [15]Haozhan Li, Yuxin Zuo, Jiale Yu, Yuhao Zhang, Zhaohui Yang, Kaiyan Zhang, Xuekai Zhu, Yuchen Zhang, Tianxing Chen, Gangu Cui, Dehui Wang, Dingxiang Luo, Yuchen Fan, Youbang Sun, Jia Zeng, Jiangmiao Pang, Shanghang Zhang, Yu Wang, Yao Mu, Bowen Zhou, and Ning Ding. SimpleVLA-RL: Scaling VLA Training via Reinforcement Learning. arXiv preprint arXiv:2509.09674, 2025. URL https://arxiv.org/abs/2509.09674. 9
  16. [16]Zhiqi Li, Wen Zhang, and Bo Zhu. Flow-Map GRPO: Reinforcement Learning for Few-Step Flow-Map Generators via Anchored Stochastic Composition. arXiv preprint arXiv:2607.00535, 2026. URL https://arxiv.org/abs/2607.00535. 1, 9
  17. [17]Yaron Lipman, Ricky T. Q. Chen, Heli Ben-Hamu, Maximilian Nickel, and Matt Le. Flow Matching for Generative Modeling. In The Eleventh International Conference on Learning Representations, 2023. URL https://openreview.net/forum?id=PqvMRDCJ9t9. 3arxiv.org/abs/2210.02747
  18. [18]Bo Liu, Yifeng Zhu, Chonkai Gao, Yihao Feng, Qiang Liu, Yuke Zhu, and Peter Stone. LIBERO: Benchmarking Knowledge Transfer for Lifelong Robot Learning. In Advances in Neural Information Processing Systems 36, Datasets and Benchmarks Track, 2023. URL https://arxiv.org/abs/2306.03310. 6
  19. [19]Jie Liu, Gongye Liu, Jiajun Liang, Yangguang Li, Jiaheng Liu, Xintao Wang, Pengfei Wan, Di Zhang, and Wanli Ouyang. Flow-GRPO: Training Flow Matching Models via Online RL. arXiv preprint arXiv:2505.05470, 2025. URL https://arxiv.org/abs/2505.05470. 9
  20. [20]Guanxing Lu, Wenkai Guo, Chubin Zhang, Yuheng Zhou, Haonan Jiang, Zifeng Gao, Yansong Tang, and Ziwei Wang. VLA-RL: Towards Masterful and General Robotic Manipulation with Scalable Reinforcement Learning. arXiv preprint arXiv:2505.18719, 2025. URL https://arxiv.org/abs/2505.18719. 9

Paper details

vlnc:W_8p7yjmnb
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 0

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

Not recorded for this paper

View statement
Looking for related papers…
Contents