- Rating
- 3
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This work proposes to take physical time (the observation cadence) into account through exponential decay (a local ODE) for robot memory.
So at inference time, the robot’s memory adjusts its “retention” to the real physical cadence, even for cadences not seen in training, hence better performance.
Neither the exponential decay nor the use of irregular physical time is new (see GRU-D, LTC and CfC). The novelty lies in combining this with robot memory.
Experiments show that simply feeding the cadence as an input does not help when training uses a single fixed cadence. In simulation, TFP shows gains over the other memories under changed cadences, but on the real robot it is only compared with policies without memory.
Critical strengths
-
The idea is interesting and natural: robot memory should evolve with physical time, not with the number of observations. TFP implements it as a small plug-in memory that works with two very different backbones, a Diffusion Policy trained from scratch and π0.5.
-
The mechanism is tested directly. With the trained weights fixed, feeding a constant 0.1 s interval instead of the measured one sharply reduces success. Rescaling the supplied clock delays or advances the robot’s actions accordingly, and probes recover the time since an event from the memory.
Critical weaknesses
-
The comparison does not show whether a learned memory could do the same. All models are trained at a single fixed cadence, so baselines that take the interval as an input (GRU+Δt, the learned Δt gate) never see it vary and cannot learn to use it for sure. Training the baselines with varied cadences would show how much of TFP’s advantage comes from its built-in decay (or it is more like a data problem, once we have data, the model learns itself).
-
The real-robot experiments show that memory helps, not that physical time does. TFP is compared only with memoryless reactive policies, at the training cadence, where a step-counting memory such as a GRU could also time the tasks.
Questions for authors
Basically same as weakness:
-
If GRU+Δt, the learned Δt gate, or a Mamba-style SSM were trained with varied observation intervals, would they match TFP? Cuz that parameterization should be sufficiently rich. Ideally the collected data should also just have irregular time cadence, so what I wonder is that how bad those baselines generalize, even with the right data.
-
On the real robot, it is the same thing, the current experiments demonstrate the memory helps, which is kinda expected. Would be great to have a simple comparison to a step-counting memory (e.g., a GRU) and TFP with the interval fixed at 0.1.
Response to Reviewer BbDV
We thank the reviewer for pointing out that our original real-robot comparison did not isolate the contribution of physical-time dynamics from persistent memory. We have conducted additional experiments to address both concerns.
1. Mixed-Cadence Training
We additionally evaluate mixed-cadence training on π0.5 Button Press, using resampled observation schedules and measured intervals during training.
TFP achieves the highest mean success (93.0%), compared with 89.0% for S4D+Δt. While S4D+Δt performs slightly better at 10 Hz, TFP achieves higher success under all three non-reference schedules. Thus, training with varied observation intervals alone does not fully reproduce TFP's performance.
2. Additional Real-Robot Comparisons
Following the reviewer's suggestion, we added a plain GRU baseline and a fixed-interval TFP variant to the five Galaxea A1 tasks. Together with the time-aware recurrent and state-space baselines reported in our additional experiments, the results are:
All methods use the same Diffusion Policy backbone and real-robot task protocol, with 20 evaluation trials per task.
Plain GRU does not receive explicit time intervals and serves as an observation-count-based memory baseline. TFP fixed-0.1 uses a constant nominal interval, whereas TFP measured uses the actual elapsed time between consecutive policy queries.
TFP measured achieves 64% average success, outperforming Plain GRU by 16 percentage points and TFP fixed-0.1 by 14 points. It also achieves higher success than both variants on all five tasks.
The relatively small difference between Plain GRU and TFP fixed-0.1 (48% vs. 50%) suggests that the improvement is not explained simply by introducing a different recurrent memory architecture. The additional gain with measured intervals provides evidence that accounting for actual elapsed physical time benefits real-robot manipulation.
Together, these experiments address the role of both persistent history and measured physical time in TFP, beyond simply adding recurrent memory or providing Δt as an input feature.