- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
VPO shifts from "build better models" to "optimize inputs" for vision-based time-series analysis (TSA). This paper formalizes choosing a better visual presentation as a black-box optimization problem over visualization parameters and proposes using an MLLM's visual embeddings inside a Bayesian Optimization loop (VeBO) to efficiently search the combinatorial space. For closed-source MLLMs, the input-level optimization is a practically meaningful method.
Critical strengths
- Model-agnostic and applicable to closed models. VPO can work with API-only models where fine-tuning is impossible. This offers a meaningful practical advantage.
- Insightful sensitivity analysis. The analysis of color and width sensitivity for visualizations provides valuable guidance for understanding model preferences.
Critical weaknesses
- The method has a high computational cost with 50 BO iterations full dataset inference per task-model pair. The optimized visualizations show limited evidence of transferring across tasks or datasets.
- Main results rely on a single dataset, TimeMQA. The cross-dataset results are on a smaller search space without any baselines, and show smaller gains. This raises concerns about generalization and weakens the claim of broad applicability.
- The compared closed-source and open-source Qwen model baselines are not state-of-the-art , raising the question of whether the latest LVM models have better inherent robustness to visualization variations. If stronger models are more robust to visualization variations, the practical significance of VPO may decrease.
- The optimization objective is computed on the evaluation dataset, with no reported held-out test set for the main results. This raises concerns about whether the 50-iteration BO search overfits to the evaluation set rather than identifying genuinely better visualizations.
Questions for authors
Please refer to the critical weaknesses.
5 comments
W3. Results on more recent LVLMs
To examine whether more recent VLMs still benefit from visualization optimization, we have newly evaluated two recent open-weight models: Qwen3.5-9B and InterVL3.5-8B. For each model, we have compared the default visualization with the configuration selected by VeBO. Interestingly, we observed that both models benefited from the optimized visualizations across several tasks. In some cases, the gains were even larger for Qwen3.5-9B than for Qwen2.5-VL-7B. Our results suggest that moving to a more recent VLM make input-level visualization optimization more important. We have added this result to the revised manuscript (Appendix C.1).
| Model | VeBO | Anomaly P↑ | R↑ | F1↑ | Classification P↑ | R↑ | F1↑ | Forecast NMSE v1↓ | v2↓ | OpenQA T/F↑ | MCQ↑ | Overall↑ |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| Qwen3.5-9B | ✗ | 0.5102 | 0.5079 | 0.4776 | 0.1654 | 0.2407 | 0.1866 | 13.44 | 22.65 | 0.7385 | 0.6200 | 0.6652 |
| Qwen3.5-9B | ✓ | 0.5664 | 0.5664 | 0.5664 | 0.3150 | 0.3264 | 0.2893 | 7.69 | 18.09 | 0.7615 | 0.6461 | 0.6902 |
| InternVL3.5-8B | ✗ | 0.3155 | 0.4721 | 0.3299 | 0.2952 | 0.3117 | 0.1490 | 13.15 | 28.86 | 0.7462 | 0.6390 | 0.6799 |
| InternVL3.5-8B | ✓ | 0.5466 | 0.5450 | 0.5411 | 0.2808 | 0.3375 | 0.2816 | 20.09 | 24.87 | 0.7538 | 0.6485 | 0.6887 |
We thank the reviewer for prompting this comparison. We find it particularly interesting that a newer model can sometimes gain more from visualization optimization, and we believe this is worth exploring further.
W4. Clarification on held-out optimization & test set report
We would like to clarify that the term "evaluation dataset" in the original manuscript refers to the validation set, not the test set. Throughout the paper, VPO is optimized on the validation set, while all reported results are evaluated on an unseen test set. We have clarified this distinction in the revised manuscript (Appendix A.3). We have additionally reported the number of validation and test sets below. Following the sample size used in the original TimeMQA benchmark, we sampled 1,400 instances per task for each of the validation and test sets. For FV1 and FV2, we retained only forecasting instances and excluded imputation instances, while QA was restricted to true/false and multiple-choice questions. The table below gives the number of instances used for validation and test in each task. We have clarified this protocol in the revised manuscript (Section 4).
| Task | Held-out | Test |
|---|---|---|
| Anomaly Detection | 1400 | 1400 |
| Classification | 1400 | 1400 |
| Forecasting (V1) | 671 | 706 |
| Forecasting (V2) | 739 | 707 |
| Open QA | 713 | 681 |
Therefore, all reported improvements reflect generalization to unseen test data rather than overfitting to the validation set used for optimization.
Dear Reviewer ZyVc,
We sincerely appreciate the time for the review. If our rebuttal has addressed your concerns, we would be grateful if you took our clarifications and additional results into account in your assessment. We would also welcome any further feedback before the discussion closes.
Best regards,
The Authors
We thank Reviewer ZyVc for the valuable comments and recognizing our work as model-agnostic and applicable to closed models, which is effective method when model fine-tuning is impossible, insightful sensitivity analysis of color and width, which can analyze the performance over visualizations. We have addressed your concerns and questions below.
W1. Computation cost of proposed method
We note that the 50-iteration budget is not specific to VeBO: we applied the same budget to all search-based algorithms in our comparison, from Grid search and Random search to BO-based algorithms such as GoLLuM and standard BO. Thus, the cost of repeated inference on the full validation set is shared by all baselines.
In addition to the runtimes reported in Appendix Table 9 for a search space of 1,536 configurations, we have compared our approach with the efficient fine-tuning (LoRA) below, so that we show the cost-effectiveness of our method compared to the fine-tuning. We have reported the runtimes of the 50-iteration search methods on the full space of 480k candidate configurations. VeBO requires little additional time compared to Random or Grid search, while taking much less time than training-based approaches such as LoRA fine-tuning. This suggests that VeBO offers a favorable trade-off between performance and computational cost. We have clarified these computational considerations and included the corresponding runtime comparisons in the revised manuscript (Appendix C.1).
We additionally report cross-dataset transfer results for each method using Qwen2.5-VL-7B below. Please refer to our response to W2 for details.
W2. Cross-dataset result and generalizability
As requested, we have extended our cross-dataset evaluation to use the same search space of 480k candidate configurations as in our main experiments. Each method used the same search budget to select a visualization configuration for each task on the TimeMQA validation set using Qwen2.5-VL-7B. We then applied the selected configurations directly to the corresponding tasks on TSAQA, MTBench, and ChatTS without re-optimizing on any of the target datasets.
As shown in the table, the configurations selected by VeBO outperformed the default visualizations mostly, those selected by competing methods on most metrics. These results hint that VeBO truly identifies good visualization transferable to unseen datasets with the same tasks. Furthermore, we have examined whether the selected configurations could transfer across models within the same family. We applied the configurations selected using Qwen2.5-VL-7B directly to Qwen3.5-9B without re-optimization.
As shown, the transferred configurations improved performance on most metrics. This suggests that a visualization configuration selected for one model can also benefit another model in the same family. We have added those results to the revised manuscript (Appendix C.1).