- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
SPECTRA is a force-aware diffusion policy that trains two independent experts: a force-blind coarse policy restricted to the lowest k=3 DCT coefficients, and a force-conditioned fine policy that predicts the full spectrum. Per-coefficient standardization (“EqualSNR”) is applied before diffusion. A small MLP gate sees only the recent force history and picks one expert per action chunk. The gate is trained on which frozen expert has lower offline prediction error on held-out demos, so no contact labels are needed. Experiments use six simulated tasks (ManiSkill ports in MuJoCo, plus MimicGen) and five real OpenArm tasks.
Critical strengths
- Clear, well-motivated idea. Adding force is useful for contact-rich manipulation, and its usefulness depends on whether the policy can express fast corrections. The idea to combine force input with high-frequency actions is a sensible framing. The method is also a simple, modular design without much overhead.
- SPECTRA beats both of its own experts. Comparing Fig. 3 and Table 1, it beats both the coarse-only and fine-only policies on every simulated task shown.
- Informative ablations. The comparisons cross backbone (DP/FM), representation (action/DCT), and force strategy (none/always/gated), with full real-robot tables in the appendix.
Critical weaknesses
- SPECTRA shows limited improvement over success rates over most real world tasks as shown in Figure 5.
- The hypothesis H4 is under-evaluated. Section 4.1.1 promises fixed or contact-triggered routing comparisons with the same experts, but no results appear. The “generic gating” baseline uses different policies, so it is not a controlled comparison.
- Lack of comparisons with existing force-aware policies. There's no comparison with prior works like Reactive Diffusion Policy[1], ACP[2], making it hard to justify the effectiveness of the paper's method over other alternatives.
- Incremental novelty. DCT action chunks, per-coefficient standardization (EqualSNR), and error-based gating (Gated Memory Policy) are each standard modules.
[1] Xue, Han, et al. "Reactive diffusion policy: Slow-fast visual-tactile policy learning for contact-rich manipulation." arXiv preprint arXiv:2503.02881 (2025).
[2] Hou, Yifan, et al. "Adaptive compliance policy: Learning approximate compliance for diffusion guided control." 2025 IEEE International Conference on Robotics and Automation (ICRA). IEEE, 2025.
Questions for authors
- Routing controls. What do random, fixed-probability, force-threshold, and contact-triggered routing give when using the same coarse and fine experts? Section 4.1.1 describes these comparisons, but no results appear.
- Can you provide a visualization of the gate value during a few robot rollouts? I would expect higher values during contact and lower values in free space.
- Gate inputs. Does adding vision, proprioception, or task phase as inputs to gate training helps?
- What are the inference latency and memory cost of keeping two experts plus the gate?
Response to Reviewer rFZ9 (1/2)
We thank the reviewer for recognizing the practical motivation, the interaction between force feedback and action bandwidth, and the improvements demonstrated in simulation and on the real robot. We provide additional routing experiments and clarify the relationship to the suggested methods below.
1. Additional routing-gate comparisons
Table 1 already compares fixed force conditioning, generic force gating, and SPECTRA. With the DP backbone and DCT representation, always using the force-conditioned fine policy achieves 52.9% mean success, while generic force gating achieves 50.0%, compared with 65.8% for SPECTRA across six tasks.
We additionally evaluate random routing and gripper-triggered routing between the coarse and fine policies. The latter uses changes in gripper open/closed state as a contact-related heuristic. We also evaluate bandwidth-only gating between two force-blind action policies to further distinguish the contributions.
Task success rates (%).
Across these five tasks, SPECTRA achieves 71.0% mean success, compared with 44.5% for random routing and 56.5% for gripper-triggered routing. SPECTRA outperforms both alternatives on every task, with improvements of 15–40 percentage points over random routing and 5–27.5 points over gripper-triggered routing.
These results support learning when each expert is useful: introducing two policies and a switching mechanism alone does not recover SPECTRA’s performance. The bandwidth-only comparison further shows that removing force conditioning from both action generators reduces mean success from 71.0% to 60.5%, supporting the combined design.
We will incorporate these results and make the evaluated routing rules explicit, including identifying gripper-triggered selection as an interaction heuristic rather than direct contact detection.