- Rating
- 4(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
The paper proposes DP-TS, in which a Dirichlet process prior is defined over the data distribution, as opposed to standard BNNs which work on the neural-network weights. At each step, DP-TS trains one network on randomly weighted observations plus synthetic prior points, then evaluates the network's predicted minimum. The objective is to maintain exploration in unobserved regions without needing an ensemble, which requires preventing the uncertainty estimate from collapsing in the absence of data (the "data void").
Critical strengths
- The method is simple and yet can provide useful uncertainty evaluation from a single network
- The experimental results are strong and the inclusion of higher-dimensional problems (32d and 60d) demonstrates some level of scaling.
Critical weaknesses
- W.1: How (25) follows from the referenced papers on universal approximation of continuous functions should be stated more clearly
- W.2: The paper's abstract highlights that the method is "hyperparameter-free": although the absence of exploration coefficient is useful, there are several other hyper-parameters in the method. Similarly, while the idealised method can be seen as exact, in practice, finite AdamW training still makes it approximate.
- W.3: The methods performance is strong, but the GP still does better in one case in Table 1, so the superiority of the method is not uniform.
- W.4: From the title, I would expect a more general-purpose alternative to BNNs, but the scalability to standard ML tasks is not obvious. This is clearer in the abstract.
Questions for authors
- See W.1
- How stable are the gains across random seeds, prior concentration, prior dispersion, and atom count?
- In Figure 2, the green trajectory appears to pass through several obstacle discs. Is this really collision-free?
3 comments
I would like to thank the authors for addressing my concerns, I have increased my score.
The authors might want to discuss the relationship with related work: Vashishtha, S. (2026). Bayesian Neural Networks via Dirichlet Process Priors on the Data-Generating Distribution for Randomized Value Functions in Deep Reinforcement Learning. arXiv preprint arXiv:2610.27570. but since this is clearly concurrent, it does not affect the novelty of the present submission.
Dear Reviewer gi93,
We sincerely thank you for your engagement during the discussion period and for raising your score in support of our work!
Thank you also for pointing out the concurrent paper by Vashishtha (TMLR, 2026) on data-space DP priors for randomized value functions in deep reinforcement learning. In the currently revised manuscript (Sections 1, 2, and 3), we have explicitly cited and discussed its relationship to our work. Specifically, we clarify how our paper builds upon the data-space DP-BNN formulation to develop Single-Network DP Thompson Sampling (DP-TS) for continuous black-box optimization, establishing the formal Doob martingale belief structure, the horizon-independent information ratio and Random Feature regret bounds (Section 4), and candidate-manifold base measures for high-dimensional continuous control and deceptive-funnel optimization (Section 5).
We deeply appreciate your constructive feedback and support throughout the review process.
Best regards.
Response to Reviewer gi93
Thank you for the thoughtful assessment and the specific questions regarding theoretical scope, hyperparameter sensitivities, and the trajectory experiments.
On Eq. (25) and empirical void spread (W1): We removed the universal-approximation argument. Theorem 1 is now formally stated for an idealized local kernel smoother where the averaging identity holds exactly, showing the baseline spread injected by P₀. For the trained neural network, we measure the property across 10 seeds: far from data (d > 7), across-draw spread remains 1.5–2× higher than bootstrap and 4–5× higher than MC-dropout, with both methods contracting near data (full numbers in Table 3 and Figure 4, Appendix B).
Clarifying "hyperparameter-free" and finite approximations (W2): We appreciate this correction. We have dropped the phrase "hyperparameter-free" and now explicitly say "free of ad-hoc acquisition trade-off parameters" (such as β_t in GP-UCB). In Section 3, we catalog all surrogate hyperparameters (α, σ₀, T, μ₀, network architecture, and training budget) and explicitly define each draw as an approximate posterior sample over the regression functional, noting finite truncation T, finite-epoch SGD, and exchangeability as approximations.
Acknowledging where DP-TS does not lead (W3): We have made this explicit in the paper. DP-TS is designed for deceptive, multimodal landscapes where the global optimum lies in the data void. On smooth, unimodal valleys like Rosenbrock 4D, local trust-region methods (TuRBO-1 at 8.1 ± 2.8) naturally outperform global exploration (DP-TS at 31.8 ± 9.6; Table 4, Appendix D.1). Our distance sweep (Figure 1, Section 5.1) highlights this trade-off: when initial points happen to surround the optimum (f = 0), local baselines win (0.04–0.14 vs 0.24 on Ackley); but in the data void (f ≥ 0.75), local baselines degrade by orders of magnitude while DP-TS remains stable. DP-TS also reliably escapes the deceptive 4D Lunacek funnel (Table 6, Figure 2) where TuRBO-1 and BNN stay trapped.
Scope, title, abstract, and calibrated tone (W4): We agree completely. We revised the title to "Data-Space Dirichlet Process Bayesian Neural Networks for Epistemic Exploration in the Data Void" to clarify upfront that our focus is active sequential exploration rather than general-purpose supervised learning. We also overhauled the Abstract and Introduction to explicitly anchor the work in Bayesian optimization, disclose working approximations upfront (finite T, finite-epoch SGD), and systematically purge hyperbolic phrasing and sensationalist headings across the entire paper.
Stability across seeds and hyperparameters (Q2):
Rover trajectory feasibility and collision avoidance (Q3): The schematic in our earlier draft has been replaced in Section 5.2 (Figure 3) with 30-waypoint trajectories across 10 evaluation seeds (t ∈ {0, 15, 35, 75, 150, 500}) after resolving an unsquared curvature penalty in the benchmark and scaling prior dispersion by W_prior ~ Beta(α, t):