- Rating
- 1
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 2
Read review
Paper summary
The authors propose adding a "phase" parameter to denote elapsed time or task progress and build a theoretical framework relating behavior cloning policies trained with phase conditioning to generative flow matching/diffusion policies which are conditioned on the flow matching process' "time." The authors show on synthetic left/right style obstacle navigation environments that phaseformer empirically improves performance on a set of baseline environments.
Critical strengths
A unified model for behavior cloning and diffusion/flow matching models would be highly beneficial. In particular the ability to design learned policies that traverse the demonstration time marginals in a manner that is more efficient that the original demonstration dataset could be of significant benefit to the field. The authors do not quite investigate that direction fully, but this work is one step in that direction.
Critical weaknesses
The central premise of the paper is essentially the introduction of time or progress-conditioning to a behavior cloned policy. In my view this is not a particularly novel insight. Time-conditioned policies have existed for a long time and it is known that using time-conditioned imitator policy allows for modeling of a non-markovian expert using a markovian state-feedback policy. See e.g. https://arxiv.org/pdf/2307.14619 and specifically remark 2.2.
The introduction and setup are incredibly difficult to read. The notation used and the problem setting are never defined, making it difficult to understand what the setting or dynamics are and what exact claims are being made. (e.g. are we dealing with a continuous time system for eq (1)?, where is the data coming from etc). I think the paper could be majorly improved by a ground-up redesign of the presentation by introducing a general framework and showing how both behavior cloning and conditional flow matching can be recovered for particular choices of systems/parameters, rather than the current ad-hoc approach.
For a highly empirical intervention and to substantiate claims of "pareto-optimality," the experiments are far too toy and do not even cover standard manipulation benchmarks (at a minimum the authors should include robomimic-style tabletop manipulation tasks, or newer environments as those are outdated).
Questions for authors
Consider a one-dimensional state space P_S = P_G = Unif {-1, 1} but where the demonstrations are coupled such that x_0, x_1 are of the form (-1, 1) and (1, -1) (i.e. always oppositely paired) and x_rho = rho x_1 + (1 - rho) x_0. A simple behavior-cloning policy will not move at all while a time-conditioned policy will move to the midpoint and then back to the original start point. Doesn't this suggest that by making the policy time-varying sometimes we can inject extraneous information that yields worse policies?
For other tasks where there is a natural notion of "progress" (as in your toy examples) the phase is already implicitly available to the policy via the state/observation. Do you think that with more careful architecture design (e.g. with proper positional encoding or input feature representation) or with more data the differences between phase-conditioned BC and regular BC can disappear?
Thank you for the expert review and the pointer to Block et al.
Novelty. We agree that time conditioning is not new, and the paper now says so and cites Block et al. (2023, Remark 2.2) and the DMP literature (Sec. 6). Our contribution is the account of what phase buys and what it cannot. A phase-free policy regresses onto the target averaged over its posterior belief about task progress, and the loss it pays, the temporal aliasing A, is exactly the variance of the target under that belief (Sec. 3, Eqs. 9–11). Phase removes A. It cannot remove the label conflict C or choose a branch at a shared input; that needs inputs that differ before the split (Lemma 2, Fig. 6).
Presentation and setting. We rebuilt the presentation along the lines you suggest. Sec. 3 opens with one setting: demonstrations as random paths of robot states over a continuous phase, actions as state velocities, and rollouts solving dx/dρ = π(x, ρ). Flow matching is recovered as the special case of straight-line demonstrations (Lemma 1), and three properties carry over to general demonstrations, each with its assumptions in Table 2. Full definitions are in App. A.1.
Benchmarks. The paper is no longer framed as an empirical method, and Pareto optimality is now a short remark on practical consequences. The experiments test the theory's predictions, which requires controlling the demonstration distribution: we vary start spread and path noise one factor at a time (Fig. 6). Fixed human-demonstration benchmarks do not allow this, and they exercise mode selection little: Mazza et al. (2026) find Push-T close to unimodal given the observation (App. H). SE(3) manipulation is listed as a limitation.
Q1. Can phase make the policy worse? We added your example after Prop. 1 (App. A.2). The phase-conditioned rollout goes to the midpoint and returns; the phase-free optimum is zero, so its rollouts never move. Both end at their starts and neither reproduces the pairing, but with phase the rollouts also match every intermediate marginal. Phase never raises the minimum loss. Reproducing the pairing needs an input that still differs at the crossing, which is Lemma 2.
Q2. Is phase already implicit in the state? Eqs. 9–11 answer this exactly. When phase can be recovered from the input, A = 0 and the two policies coincide, as you suggest. When states are revisited at different phases, A is a floor on the loss of every phase-free function of that input, so no architecture or amount of data removes it. Whether other policies recover progress implicitly, through observation histories or learned representations, is a hypothesis we state in Sec. 6 and do not test.