- Rating
- 3
- Confidence
- 2
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper studies finite-sample generation risk problem in streaming conditional flow matching, which is caused by condition-wise mode erasure and stale historical data. To mitigate these generation risks, the authors propose a sampling-calibrated model-order framework via an online, sparse MMD program (OMCI-MMD) to maintain the sparse support set, which systematically reduces memory complexity while preserving statistical resolution. Extensive experiments confirm that it significantly mitigates generative hallucinations.
Critical strengths
(1) Fluent writing and strong experimental results.
(2) The theoretical proofs are thorough.
Critical weaknesses
(1) Although the proposed OMCI-MMD provides a principled MMD-based formulation for streaming support management, the empirical evaluation lacks essential baseline comparisons. Specifically, the paper only consider "Retain-All" or "Fixed Small" strategy, while other strategies (e.g., Random Sampling). Without these, it remains unclear whether the performance gains stem from the MMD optimization.
(2) While the paper provides solid theoretical guarantees on sample complexity and bounds the drift-aware error, it lacks a comprehensive empirical evaluation of the computational overhead. Specifically, the runtime cost of executing the kernelized Frank-Wolfe and solving the corrective quadratic program (QP) dynamically in a high-throughput streaming environment is not thoroughly benchmarked against standard baselines (e.g., random sampling).
(3) Minor: The windowed OMCI-MMD framework heavily relies on pre-declared hyper-parameters (e.g., window length and safety factor ), while no sensitivity analysis are provided.
Questions for authors
Please refer to "Critical Weaknesses"
2 comments
(3) Minor: The windowed OMCI-MMD framework heavily relies on pre-declared hyper-parameters (e.g., window length and safety factor), while no sensitivity analysis are provided.
Response to Weakness 3: The revision adds both sweeps, with noise levels bootstrapped from the window and no simulator (Appendix E.3).
Safety factor (, , 60 streams). For from 1.0 to 1.5, OMCI–MMD keeps 8 samples in 60 of 60 streams, with median current-distribution MMD 0.040 (full window: 0.037). At it keeps 7 in 54 of 60 streams, and the error rises to 0.130. The plateau exists because the error curve falls by an order of magnitude between 7 and 8 samples, so any radius in that gap yields the same size.
Window length (; change at ; median MMD to the current distribution over 60 streams, median kept samples in parentheses; Figure 9 and Table 10):
| 100 | 0.164 (7) | 0.159 (7) | 0.158 (7) | 0.162 (7) |
| 250 | 0.069 (8) | 0.054 (8) | 0.059 (8) | 0.061 (8) |
| 500 | 0.137 (8) | 0.038 (8) | 0.044 (8) | 0.042 (8) |
| 1000 | 0.203 (7) | 0.114 (8) | 0.031 (8) | 0.032 (8) |
| 2000 | 0.213 (7) | 0.165 (8) | 0.111 (8) | 0.033 (8) |
Full history has error 0.199, 0.178, 0.150 and 0.120 at the four times. trades noise against reaction time: very short windows are too noisy to resolve the new modes, and long windows are more accurate once stationary but stay stale for up to steps after a change. The selected size alone does not reveal staleness (it reads 8 in stale windows too), which is why the revision adds a data-driven window length. On 60 further streams it matches the best fixed once the change is absorbed, at 0.041, 0.030 and 0.033 for , 3200 and 4000, but does not react faster than just after the change.
Questions
Please refer to "Critical Weaknesses"
Response: Please see our responses above. We would like to express sincere gratitude to the reviewer for the positive assessment and for three concrete requests, each of which is now in the revised PDF. We would like to further comment that the relevance to generative modeling for natural language, in terms of rare fact response accuracy tradeoffs with respect to aggregated perplexity should make plain the impact of these results for flow-based generative models. Thank you for your time and consideration.
Response to Weakness 1: We agree that this comparison belongs in the main text, and the revision adds it (Figure 4; Appendices E.2 and E.2.1; the full tables appear in our response to Reviewer kPvA, Question 2). At the size OMCI–MMD selects, a random subset with optimized weights matches it on the 10-type stream, where a mass-proportional draw of 8 types almost always picks the 8 substantial ones. On a continuous mixture (40 windows), it is 2.8 times worse in MMD (0.245 against 0.087) and 6.6 times worse in Sinkhorn divergence (0.822 against 0.124). An equal-weight reservoir sample is worse still on both.
Whether the gains stem from the MMD optimization therefore has a two-part answer. Against full history and fixed small buffers, the gains come from the per-condition recent target and the selected size, not from the path. At a fixed size, the MMD path outperforms random selection on continuous data, and is comparable to other structured compressors. A new ablation crosses target, size rule and selection (Appendix E.2.1): with the selected size and the current target, the MMD path and a random subset with optimal weights tie (0.040), equal weights are eight times worse, and a size frozen at the change is five times worse. The image and text pilots now include a random-subset arm at OMCI–MMD's size, which reaches a total variation of 0.44 on images and 0.36 on text, against 0.23 and 0.10 for OMCI–MMD (Appendix E.4).
At scale (Section 5, Figure 3; Appendix E.5), the comparison splits by modality. With GPT-2 and SmolLM2-360M fine-tuned on a stream in which each entity gains a new fact at 10% of its mass, the random subset states the new fact in 75.1% and 75.7% of completions, against 96.1% and 99.3% for OMCI–MMD, and is worse in all five paired streams: it omits the fact in 24 of 100 entity-streams, and where it does, accuracy is near zero. There, the guarantee that no resolvable mode is dropped is what matters. On CIFAR-100 with a class-conditional U-Net, the random subset reaches a lower class-law total variation (0.288 against 0.359) and Fréchet distance, at lower recall; both are far better than the window at this training budget (0.647). The paper reports this result as it is.
Response to Weakness 2: Per arrival, OMCI–MMD only updates a running mean: O(n) kernel evaluations with an exact kernel, or O(D) with D random features. The Frank–Wolfe path and its re-weighting QPs run only at reporting checkpoints, and each step scores the candidate pool and solves a simplex QP whose dimension is at most the number of kept samples. Measured on 2 CPU cores, one complete readout takes 0.42 s for a 500-sample window with 512-dimensional features and up to 50 kept samples (0.33 s bootstrap, 0.09 s path). For 2000 samples it takes 5.0 s, dominated by the exact-kernel bootstrap; the path itself takes 0.16 s, or 0.50 s with up to 100 kept samples. Random sampling costs O(1) per arrival, so OMCI–MMD is more expensive; its cost is amortized over the checkpoint interval and runs in parallel across conditions. Appendix E.3 (Table 11) reports these costs and the per-arrival costs (about 1 µs for a reservoir update), next to the generator's training time (6.8 ms per update in our controlled study), and Section 4.3 states the headline figure.