- Rating
- 1
- Confidence
- 3
- Informativeness
- 1
- Presentation
- 1
- Soundness
- 1
Read review
Paper summary
The article considers the very recent BOBA method (Kelly et al 2025, only available on openreview and arXiv) for dynamic Bayesian optimisation where there is time-dependence in the target function. The application that is being considered is where a controller wants to adjust x over time to maintain f(x,t) at a fixed predetermined level f*. A natural way to encode this objective is to maximise -|f(x,t)-f*|. The article makes the following main points:
- BOBA as "published" does not correctly balance exploration and exploitation due to a scale mismatch.
- BOBA cannot optimise sensibly when the target is the largest (or smallest) possible value that could be achieved.
- A modification to BOBA is an improvement
- Optimising -(f(x,t)-f*) (i.e. not taking the absolute value) results in better performance. The article also presents a digital twin methodology for controlling the anaesthetic state of a patient through surgery, and runs some experiments against this digital twin (as well as standard BO benchmarks). The results are rather inconclusive.
Critical strengths
The dynamic BO setting is interesting and understudied
Taking on the building of a digital twin based on surgical data, and releasing methodology to allow reproduction of this approach, is valuable
Critical weaknesses
BOBA has, so far as I can tell, not a single citation yet, so it is a bizarre start point for an article.
It is not clear if the scale mismatch reported from the original BOBA "publication" is endemic or simply related to the scale of your experiments
That BOBA, one particular method, cannot optimise well when the target is at the extremal range should surely suggest you try a different BO approach, rather than change the thing you try to optimise.
I cannot ascertain why optimising the signed difference can work. Surely you are now just optimising f(x,t) instead of targeting f*?
Questions for authors
What is going on in the GP and acquisition function? The description lacks precision, so I really struggled to work out what was going on.
In Prop 1, I struggle to see any situation to which it applies. sigma_t will of course vary across x (although I am not sure exactly what you mean by sigma_t since you never define it). Optimising any non-greedy acquisition function will need to trade off mu_t(x) and sigma_t(x).
What is actually the solution here? It reads as if you have tried something, and seen some inconclusive results, and submitted it. That doesn't make for an ICLR paper.
Thank you for your comemnts. We have rewritten the parts that were hard to follow.
Why start from BOBA?
Is the scale mismatch endemic?
Why change what is optimised rather than the method?
Optimising the signed difference just optimises f. It does not. The GP models h = g - y*, and GREEDY-H queries the candidate whose predicted h is closest to zero, approaching the target from either side. Fig. 1 shows one state under both encodings (Sec. 4).
The GP and acquisition were unclear. Sec. 2.1 now describes the loop step by step, Sec. 2.2 the acquisition, and App. B the implementation.
sigma_t was undefined, and Prop. 1 never applies because sigma varies.
What is the solution? Model the signed residual, query the candidate predicted closest to target, and use a forgetting surrogate when the response drifts. On the twin, this approach: