- Rating
- 3
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
The authors proposed a camera-controlled video generator for exploration from one image and re-shooting from a source video. It builds on Wan2.1-I2V-14B and combines three contributions. (1) A synthetic lattice and environment map that turns camera motion into image-aligned conditioning. (2) A Sparse retrieval selects historical chunks while retaining their full-resolution attention keys and values. (3) A few-step sampler uses three students and a teacher-feature adversarial loss to preserve camera control during distillation. Wonder improves average video-quality scores and camera-pose errors over the selected baselines on their own benchmarks. Its memory ablation improves revisit consistency over a sliding window, with higher throughput than dense history attention. The central I2V results are encouraging; source-event preservation and interactive runtime need more direct evaluation.
Critical strengths
- A coherent design for control, memory, and fast generation. The components address related failure modes: camera cues must survive distillation, and the student must learn to use sparse history. The authors provide enough ablations to back their design choices. e.g. replacing the coordinate field with pose embeddings increases rotational RPE from 0.0784 to 0.1726; removing the control regularizer raises it to 0.1905. These are substantial changes under the reported controlled setup.
2:**Encouraging results and a useful memory trade-off. ** Table 1 reports the best average quality and lowest camera-pose errors among the evaluated methods in both settings. The memory comparison is particularly helpful: sparse retrieval reaches 21.9 dB revisit PSNR at 16 FPS, compared with 22.4 dB at 8.7 FPS for dense attention and 16.3 dB at 16 FPS for a sliding window. This suggests that retaining detailed historical information can improve revisits without paying the full dense-attention cost at the tested horizon.
3: Pixel-Space Coordinate Field provides clear visual cues for camera control. The representation turns camera motion into a signal aligned with the video grid. The lattice supplies translation and parallax cues, while the colored environment map supplies rotation cues. Because the scaffold is synthetic, the signal remains available when the camera explores unseen regions.
Critical weaknesses
(1): Preserving the source video's dynamics is a central V2V claim, but Table 1 reports generic video quality and estimated camera errors. These can improve even when a generated person or object performs a different action from the source. Dynamic degree is 1 for both V2V methods, so it does not distinguish event preservation.
(2): The method uses synthetic geometry, so its scale may not match the actual scene. The evaluation also rescales camera paths, making it hard to tell whether the same command produces consistent movement across scenes. It would help to test scenes with known scale and check how scaffold spacing and focal length affect the results.
(3) Table 2 supports the complete coordinate field, but does not separate the lattice from the environment map. It remains unclear how much of the gain comes from translation cues, rotation cues, or simply providing dense visual conditioning. Separating these two components and comparing against dense camera-ray conditioning through the same input route and under the same training budget would clarify.
Minor: (1)The abstract emphasizes real-time generation and stable latency, but Table 2 measures throughput only at the 60-second mark. Appendix B describes multi-GPU deployment without the inference GPU count, output resolution, memory use, or end-to-end response latency.
Questions for authors
Together with the concerns in the weakness section, I have listed the following questions for the author to answer:
- Can you measure whether generated V2V actions and their timing match the source, separately from whether the output simply contains motion?
- What are the revisit delays and matching protocol behind Table 2, and how does consistency change as those delays increase?
- What GPU configuration and resolution achieve 16 FPS, and what are the measured response latency and total memory use at several rollout lengths?
- What retrieval budget and sparsity settings are used, and does Appendix B.4 retain all historical chunks outside the active rolling cache?
2 comments
Reply to Reviewer kmwT (Part 2/2)
w.r.t. revisit delay and matching protocol for revisit PSNR (questions 2)
The revisit delays in Table 2 are 50s (total length is 60s, 0-5s the camera changes to reach the target position, 5-55s the camera goes to see other areas excluding the target view, 55-60s the camera comes back to the target position). We directly calculate the PSNR between the frames generated by two-time visits since we know which frame is the first visit and which frame is the second one (the matching protocol). In the table below, we additionally study the revisit changes as those delays increase (the first visit happens during 0-5s, and the revisit happens in the last 5s). As shown in the table below, the consistency remains robust against different delays. We have added these discussions to the paper (Sec. E.1).
| Total Length | 123K (20s) | 246K (40s) | 369K (60s) |
|---|---|---|---|
| Revisit PSNR | 22.5 | 22.8 | 21.9 |
w.r.t. runtime configuration and measurements (question 3)
The FPS is measured under a single H200 node (8x GPUs). We run our method at a resolution of 480p, with a batch size of 1, together with our runtime optimization discussed in Appendix B.4. The KV cache is distributed over GPUs along the head dimension to reduce per-GPU storage. For I2V, we save the KV cache at BF16 precision. For V2V, we need to additionally store the KV cache for the source video. To accommodate that, we store the two KV caches in the FP8 E4M3 format, following RELIC. This gives the same per-GPU KV-cache memory usage for I2V and V2V (Sec. B.4, Sec. E.1).
The FPS is measured over 10 independent runs. Specifically, for each run, we let Wonder run until it reaches a 1-minute rollout and record the latency for every chunk (i.e a chunk corresponds to 8 RGB frames). We report FPS using the latency of the slowest chunk over 10 runs, which sets a lower bound on throughput. In our experiments, for I2V, the slowest chunk takes 484ms to generate and gives a throughput of 16.5 FPS. For V2V, the slowest chunk takes 497ms to generate and gives a throughput of 16.1 FPS. We round it to 16FPS. We have clarified our setup in the updated manuscript (Sec. E.7).
In the Table below, we additionally report the response latency (max observed latency over 10 rollouts) and total memory usage at several rollout lengths. We have added these discussions to the paper (Table 7).
| Number of Tokens (I2V) | 30K (5s) | 123K (20s) | 246K (40s) | 369K (60s) |
|---|---|---|---|---|
| Latency (ms) | 441 | 457 | 462 | 484 |
| Total Mem. per GPU (GB) | 88.7 | 97.4 | 112.2 | 125.3 |
| Number of Tokens (V2V) | 30K (5s) | 123K (20s) | 246K (40s) | 369K (60s) |
|---|---|---|---|---|
| Latency (ms) | 447 | 455 | 472 | 497 |
| Total Mem. per GPU (GB) | 88.9 | 98.7 | 113.0 | 127.5 |
w.r.t. retrieval budget, sparsity setting, and history cache retention (question 4)
We select top-7 chunks (14 latent frames) for both I2V and V2V setup. For I2V, the model reads the very first sink chunk, the two most recent chunks, and 7 selected chunks, resulting in 10 active chunks read at full resolution. For V2V, the model additionally reads the initial source chunk and the current source chunk, resulting in 12 chunks read. For Appendix B.4, yes, we retain all historical chunks outside the active rolling cache.
Reply to Reviewer kmwT (Part 1/2)
Thank you for your detailed review and constructive suggestions! Please note our top-level comments and additional experimental results in the updated PDF. Below, we address your questions and concerns.
w.r.t. source video dynamics preservation (weakness 1 & question 1)
Thanks for your suggestions. We extend Table 1 with additional metrics to evaluate dynamic preservation from the source video. We use: (1) A VLM (Qwen3-VL) to evaluate frame-wise dynamics preservation by rating each pair of frames between 0 and 1 (0 means not preserved and 1 means perfectly preserved) and report the average score. (2) Video-level Human Preference Rate from 8 participants by showing them 10 random triplets of source, results from InSpatio-world and Wonder side-by-side. The order of our method and the baseline is randomly determined for each sample. Participants were asked to select a winner based on the dynamic preservation. As shown in the table below, Wonder achieves better dynamic preservation performance. We have included the experimental setup and reported results in Sec. E.5 of the revised manuscript.
w.r.t. scene scale (weakness 2)
We'd like to clarify that our method does not suffer from the scale issue, as it always interprets the input camera path as metric-scale value. This is because (1) we use a metric camera estimator (DA3Metric-Large) to estimate intrinsics and metric-scale camera movement for each training video. (2) The synthetic 3D scaffold is constructed with a fixed grid spacing in metric units (i.e., center-to-center spacing of 1m). (3) To create the conditional video for a training sample, we render the scaffold using the estimated intrinsics (i.e., its focal length) and its metric-scale trajectories. During training, the model therefore learns metric camera motion. During inference, we use the same estimator to estimate intrinsics from the input image or the first frame of the input video, and to render conditioning videos using the estimated intrinsics and user-provided trajectories. Wonder will again treat the input camera as metric-scale values and generate video accordingly. We have revised our manuscript to make this part clearer (Sec. 3.1) and provide samples in Figures 14 & 15.
w.r.t. rescaling camera path in evaluation (weakness 2)
We rescale camera trajectories because other baseline methods did not produce videos in metric scale. Therefore, we follow RELIC (Hong et al., 2025) to adapt an alignment step for a fair comparison. Here, we extend Table 1 and report results in metric scale (without an additional alignment step) below, which shows significant variance between models. We have revised our manuscript to make this part clearer and included this metric (Sec. 4.1, Sec. E.8).
w.r.t. effects of lattice and environment map and comparison with dense-ray baseline (weakness 3)
We conduct additional ablations on each component of the coordinate field and compare it with the pluck ray. As shown in the table below and Figure 18 in the paper, with the environment map but without the lattice, the model fails to respond to translation. With lattice but without an environment map, the accuracy over rotation is reduced. The best performance is obtained by using the complete coordinate field.
We also trained a Plücker-ray variant with the same budget (Table 2), and our representation improves all four metrics:
We have added the discussion to the revised manuscript (Sec. E.6).