- Rating
- 2
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes a framework for Bayesian optimization with vector-valued, and potentially infinite-dimensional, measurements, allowing one to exploit structure in complex measurements and efficiently adapt to changing objectives. Frequentist confidence bounds are derived under structural assumptions on the kernel and noise, yielding sublinear regret rates resembling those of scalar Bayesian optimization for popular kernels. The benefits of vector-valued measurements are illustrated in experiments on synthetic and simulation data.
Critical strengths
- Relevant problem and framework. Exploiting structure in complex, possibly infinite-dimensional, observations is a practically relevant problem that the paper motivates well. The proposed framework is sound and models the problem well.
- Sound contribution. The joint contribution of Theorems 1-3 showing that standard Bayesian optimization methods extend to infinite-dimensional measurements in a natural way is interesting and appears novel. I consider this conceptual contribution the strongest argument for acceptance. The derivations appear sound.
Critical weaknesses
- Technical novelty and signposting. The proofs of Theorems 1-3 rely mostly on standard techniques and prior work, and the signposting and framing of the contribution overstate the technical contribution. In particular, Theorem 1 appears to be a direct specialization of Theorem E.23 in Massiani et al. (2025). I therefore find that the framing of the KRR uncertainty bound as a central contribution oversells the actual contribution. The prose in Appendix D stating that the proof merely “follows the same structure as Chowdhury & Gopalan (2021); Massiani et al. (2025), adapted to a general vector-valued setting” is misleading because Massiani et al. (2025) already operate in a general vector-valued setting and provide the main nontrivial step for the proof essentially verbatim. Once the uncertainty bound of Theorem 1 is established, the fact that the measurement space is infinite-dimensional is no substantial obstruction over the finite-dimensional case anymore, so concluding Theorem 2 appears straightforward with the established technique of Chowdhury & Gopalan (2021). Similarly, the UBD assumption makes lifting Lemma 1 of Chowdhury & Gopalan (2021) to the setting of Theorem 3 straightforward. Overall, I think the paper would benefit from explaining more clearly its technical contribution, or framing the contribution more explicitly around combining existing techniques resulting in a new framework. Combining known results/techniques in a new way can still be a substantial contribution but the signposting should reflect this accurately.
- Comparison with prior work. While the significance of high-dimensional measurements is well-motivated, the discussion of related work is currently insufficient to convincingly support the novelty claims for the proposed framework. Most notably, the frameworks of [1] and [2] already target Bayesian optimization with high-dimensional measurements but are missing in the related work. An explicit discussion of these methods is warranted to judge whether the novelty is purely in the extension to the infinite-dimensional case, or for exploiting structure across high-dimensional measurements more broadly. Since the experiments appear to use up to 50-dimensional samplings of infinite-dimensional measurements, it seems that the finite-dimensional methods of [1] and [2] are directly applicable here. Seeing how these methods compare to the proposed algorithm would help to better illustrate the significance of the contribution.
[1] Maddox et al. “Bayesian optimization with high-dimensional outputs” (2021)
[2] Huang et al. “Combinatorial Bandit Bayesian Optimization for Tensor Outputs” (2026)
Questions for authors
- Can you clarify whether your Theorem 1 is a direct consequence of Theorem E.23 in Massiani et al. (2025) once you identify , , , and , or whether your result requires a genuinely new argument to accommodate the measurement operator under your assumptions?
- Can you explain how your results compare to those of [1,2] and what applications your framework supports that theirs does not?
- You repeatedly call the assumptions “mild”, but argue mildness only for each assumption individually. Can you explain why the combination of assumptions, particularly UBD and the specific separability assumption around Theorem 3 together with realizability, is still mild?