- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
TACD introduces a data-free, few-step text-to-motion distillation by controlling persistent near-terminal supervision amplification on fixed grids. Based on π-Flow’s single-knot version, the authors find that the inverse-square weights on clean-motion prediction errors induced by velocity matching will degrade training, especially when querying near the clean sample. To address this, TACD moves teacher queries away from these endpoints using a manual margin. Validation includes coefficient ablation, gradient analysis, various T2M quality metrics on different datasets, and deployment measurements with two large-scale text-to-motion generative models, i.e., HY-Motion and Kimodo.
Critical strengths
This work is easy to understand.
Critical weaknesses
Limited methodological novelty of endpoint amplification control.: The inverse-square amplification arising from clean-sample prediction in velocity matching, as well as its mitigation through loss-weight clipping, has been explicitly recognized and addressed in prior work. For example:
- FrameFlow [1, Sec. 2.2] explicitly identifies exploding losses caused by the factor and addresses them through a simple clipping strategy.
- MultiFlow [2, Code] adopts the same stabilization strategy.
- Phased dmd [3, Eq. 13] addresses a related inverse-square singularity in subinterval score matching through coefficient clipping.
- JiT [4, Sec. 4.3] similarly clips the denominator when converting clean predictions into velocities.
These examples suggest that endpoint amplification and its mitigation are established considerations in generative modeling, often handled as part of the training recipe rather than as standalone methodological contributions. Furthermore, the paper's own ablations (Tab.5) show that conventional weight capping and direct endpoint matching achieve comparable performance to TACD's proposed grid modification. It remains unclear what substantive methodological advance the proposed step-size-dependent rule offers beyond these existing stabilization techniques.
The reported failure may be largely induced by the authors' choice of supervision grid. In particular, the uncapped baseline deterministically queries a near-clean endpoint at every iteration, whereas the original π-Flow implementation uses randomized intermediate queries and includes a nonzero micro-window to avoid near-clean queries in its released training configurations, which also restricts the query range.
Reference: [1] Yim, Jason, et al. "Fast protein backbone generation with se (3) flow matching." arXiv preprint arXiv:2310.05297 (2023). [2] Campbell, Andrew, et al. "Generative flows on discrete state-spaces: Enabling multimodal flows with applications to protein co-design." ICML 2024. [3] Fan, Xiangyu, et al. "Phased dmd: Few-step distribution matching distillation via score matching within subintervals." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2026. [4] Li, Tianhong, and Kaiming He. "Back to basics: Let denoising generative models denoise." Proceedings of the IEEE/CVF Conference on Computer Vision and Pattern Recognition. 2026.
Questions for authors
What is the advantage of the proposed step-size-dependent bound over existing stabilization techniques? Prior work has already addressed inverse-square amplification through denominator or loss-weight clipping. Moreover, Table 5 shows that conventional weight capping (FID 1.011) and direct endpoint matching (FID 1.029) perform comparably to TACD's grid modification (FID 1.041).
6 comments
Response to Reviewer CQSF (2/3): why 4K², and the supervision grid (W2)
Why 4K². In the student's update (Sec. 3.1), step k uses the velocity (x̂₁ − x_k)/(1 − t_k), so an error in its clean-motion prediction enters that velocity with squared weight (1 − t_k)⁻². That is the same form as the coefficient b = (1 − s)⁻² that velocity matching gives a query at s (Sec. 3.2). On the uniform grid, every query before the final step has b at most 4 times its own step's weight; the worst case is the end of the second-to-last step. The midpoint rule gives the final step the same factor at every K: b ≤ 4K² = 4(1 − t_{K−1})⁻². A fixed bound C gives the final step a factor of C/K² instead, which grows 16-fold from eight steps to two (the clip at 100: 1.6 at K = 8, 25 at K = 2). This bounds the coefficient ratio, not quality directly. In the comparison of comment 1/3, every rule within the factor 4 stays in the best group; beyond it, results vary.
W2: the supervision grid and π-Flow's micro-window. We agree that π-Flow's released configs keep every query at least 3/128 from the clean end. For the single-knot DX policy the window average equals the instantaneous velocity (App. B), so the window's only effect is a terminal margin, the mechanism we identify. Its bound (b ≤ 1,820) is fixed, while 4K² is 256 at eight steps and 16 at two. We ran π-Flow's own schedules with the paper's student, teacher calls and budget. FID ↓, mean ± SD over three seeds; "every seed" means the paired difference has the same sign on all three seeds:
| queries | K = 8 | K = 4 | K = 2 |
|---|---|---|---|
| uniform | .765 ± .015 | 1.168 ± .057 | 4.77 ± .23 |
| uniform + TACD | .755 ± .032 (tie) | 1.080 ± .046 (every seed) | 3.53 ± .05 (every seed) |
| stratified | .742 ± .017 | 1.086 ± .043 | 4.62 ± .23 |
| stratified + TACD | .700 ± .009 (every seed) | 1.003 ± .067 (every seed) | 3.43 ± .08 (every seed) |
Random queries without a window still put a query with b > 4K² into 93% (uniform) or 100% (stratified) of updates, up to 10⁶. π-Flow's released recipe (random queries, 3/128 window) at two steps, with R@1, R@3 and MM-Dist as three-seed means that improve on every seed:
| π-Flow's released recipe, K = 2 | FID ↓ s42 / s43 / s44 | mean ± SD | R@1 ↑ | R@3 ↑ | MM-Dist ↓ |
|---|---|---|---|---|---|
| released window | 3.81 / 3.50 / 3.56 | 3.62 ± .16 | .395 | .697 | 3.77 |
| final segment bounded by 4K² | 3.26 / 3.23 / 3.17 | 3.22 ± .04 | .405 | .709 | 3.69 |
At two steps, bounding the released window's final segment by 4K² lowers FID by 11% on every seed; at eight steps stratified + TACD (.700 ± .009) is our best result. With π-Flow's uniform and stratified queries (first table), the bound lowers FID on every seed in five of the six cells and ties in the sixth, and the gradients are steadier: the 99th-percentile norm is about 3× lower at eight steps and 8-12× lower at two (general response 1/2).
So the deterministic grid makes the failure extreme (2.49 vs 1.04 at eight steps). The failure itself, and the bound's FID gain, remain under π-Flow's random queries at four and two steps, and grow as the step count drops.
In the revision we will:
- add these tables to the appendix;
- add the derivation of 4K² to Sec. 3.3;
- add FrameFlow, MultiFlow and Phased DMD to Sec. 2, next to JiT and Hong et al. (2026), which the paper already cites for the inverse-square factor and capped weights;
- update the contrast between the grid and random sampling (Secs. 1-3) with these statistics.
Response to Reviewer CQSF (3/3): the same rule on three more flow teachers (W1)
Is the bound a recipe detail of one setup? W1 notes that terminal-weight control is usually handled inside a training recipe. To check that the step-tied rule is not specific to HY-Motion, we applied it unchanged to three more flow teachers of different designs. The rule has no constant to tune: each student's final-segment query is capped at its midpoint, so b ≤ 4K² for that student's own K. Each student was distilled for 8k updates with three seeds and scored with its teacher's own evaluator:
- MotionHiFlow: a latent DiT that samples in three temporal stages (14 velocity calls); the bound is applied at the end of each stage.
- MoGeFlow-L: a flow over part-level code embeddings; the bound is applied before its final snap to codes.
- MARDM: we distil only the flow head inside each of its 18 masked-autoregressive steps.
FID; "teacher" is the teacher itself sampled with that many steps; students are three-seed means:
| model | steps | teacher | no bound | TACD |
|---|---|---|---|---|
| MotionHiFlow | 14 calls (default) | .032 | ||
| 6 | .043 | .042 | .034 | |
| 3 | 2.03 | 1.89 | .045 | |
| MoGeFlow-L | 96 (default, our run) | .071 | ||
| 8 | .630 | .190 | .090 | |
| 4 | 1.45 | 1.51 | .143 | |
| MARDM (flow head) | adaptive (default) | .125 | ||
| 8 | .191 | .129 | .144 | |
| 4 | .230 | .192 | .143 |
Every difference between the two student columns has the same sign on all three seeds, and at every step count the TACD student beats the teacher sampled with the same number of steps. As on HY-Motion, every unbounded run stays finite and completes all 8k updates under the usual gradient clipping; the failure shows only in sample quality. Without the bound, MotionHiFlow's 3-step student stays close to the teacher's own 3-step result, and MoGeFlow-L's 4-step student is ten times worse than with it. With the bound, MotionHiFlow's 6-step student is near the 14-call default, and MoGeFlow-L's 8-step student is within .02 of its 96-step default. On each of these teachers the gain is largest at the fewer steps, as on HY-Motion. On MARDM at eight steps, where the unbounded head is already close to the teacher's adaptive default, the bound costs .015.
Response to Reviewer CQSF (1/3): what a step-tied bound adds over existing stabilizers (Q, W1)
Thank you for the review and the precise pointers to prior work. The inverse-square factor and its clipping are established in prior work. TACD's contribution is to tie terminal-weight control to the student's step size and to examine its consequences for few-step on-policy distillation. Table 5's controlled interventions test whether terminal weighting drives the degradation; the new cross-step experiments and the derivation (here and in general response 2/2) address how to choose the bound, and comment 3/3 applies the same rule to three more flow teachers.
Table 5. Its weight-capping row is conventional coefficient clipping, set at the step-tied level C = 4K² = 256 (Sec. 4): TACD's bound applied to the coefficient rather than to the grid. Table 5 therefore compares three ways to stay under one bound: grid cap 1.041, endpoint matching 1.029, coefficient at 4K² 1.011, against 2.486 unbounded. Restoring C = 10⁶ on the capped grid, without moving any query, returns FID to 2.669. TACD's rule is the step-tied bound b ≤ 4K² (Sec. 3.3); moving the query is how the paper applies it to flow teachers.
Prior constants. Written as bounds on b = (1 − s)⁻², the stabilizers you cite use fixed constants:
None is tied to the sampler's step count.
The failure they would need to catch is not an overflow. The unbounded student is numerically stable. Unit-norm gradient clipping binds on at least 799 of 800 logged updates, the median pre-clip norm is 245-263 (5.0-6.1 for the bounded students), and no update overflows. FID is still 2.4× worse (2.486 vs 1.041), and at the end of training 96.6% of its gradient norm sits on the final segment. An overflow guard does not see this failure, so it gives no reason to pick a particular bound.
What the step-tied bound adds: one rule across step counts. Same student, teacher, grid and budget; FID ↓; ± = SD over three seeds; † = seed 42 only (at K = 2 its % is against the grid rule's seed 42, 9.73); other cells are the paper's three-seed means:
At eight steps every fixed constant we ran on the grid lands at 1.00-1.07, so an eight-step sweep cannot tell a safe constant from an unsafe one. At two steps they separate: the clips at 100 and 400 and δ = 1/32, the best margin at eight steps, are worse on every seed and on all five metrics, and the cap at 4,096 is back near the unbounded student. The clip-100 student's gradient norms match ours (median 7.4 vs 7.2), so nothing in training flags it. Every bound at or below 4K² stays in the best group at both step counts; the constants that fail are too loose for the step count.