Boundary Variance Inflation Causes Acquisition Bias in Gaussian Processes
arXiv:2606. 07561v1 Announce Type: new Abstract: Gaussian processes with stationary kernels on bounded domains exhibit inflated posterior variance near the boundary.
arXiv:2606. 07561v1 Announce Type: new Abstract: Gaussian processes with stationary kernels on bounded domains exhibit inflated posterior variance near the boundary.
arXiv:2512. 22999v2 Announce Type: replace-cross Abstract: We consider problems of parameter estimation where design variables can be actively optimized to maximize information gain.
The paper introduces a joint contour location (jCL) method for actively learning input configurations that simultaneously achieve specified responses across multiple computer experiments. By employing two distinct acquisition schemes—one for exploration and one for exploitation—along with a decision rule, the approach balances learning across multiple response surfaces and provides a natural stopping criterion when no solution exists. The method is demonstrated with Gaussian processes, multitask GPs, and deep GPs, outperforming existing single-response contour location strategies and optimization-based alternatives.
The paper introduces KENDO, a unified framework that combines Ensemble Gaussian Processes with disagreement‑aware acquisition strategies to address hyperparameter selection in Bayesian optimization and active learning. By replacing costly hyperparameter sampling with a kernel ensemble and adaptive Bayesian weighting, KENDO‑BO and KENDO‑AL provide self‑correcting mechanisms tailored to their respective tasks. Experiments on synthetic and real‑world benchmarks show that KENDO‑BO matches or outperforms state‑of‑the‑art methods while cutting computational cost up to fivefold, and KENDO‑AL delivers better predictive calibration with up to 27‑times speedup compared to MCMC‑based baselines.
arXiv:2607. 05522v1 Announce Type: cross Abstract: 3D Gaussian splatting (3DGS) is a strong representation for real-time novel-view synthesis, but its standard training pipeline relies on point estimates and hand-tuned heuristics, providing no native uncertainty or principled complexity control.
arXiv:2511. 16340v2 Announce Type: replace Abstract: Efficient Gaussian process (GP) inference is critical for sequential decision-making tasks such as active learning, online prediction, and Bayesian optimization.
arXiv:2509. 23385v5 Announce Type: replace-cross Abstract: Simulation-based inference (SBI) is transforming experimental sciences by enabling parameter estimation in complex non-linear models from simulated data.
arXiv:2606. 25197v1 Announce Type: new Abstract: Learning effective policies for adaptive data acquisition remains challenging: posterior-based methods rely on surrogate models and posterior approximations that can be misspecified or biased, while direct policy-learning methods map from historical observations and fail to exploit available model representations, making learning harder.
arXiv:2601. 07094v2 Announce Type: replace-cross Abstract: Bayesian optimization (BO) iteratively fits a Gaussian process (GP) surrogate to accumulated evaluations and selects new queries via an acquisition function.
arXiv:2606. 31184v1 Announce Type: cross Abstract: Adaptive experiments for average treatment effects (ATE) require randomized allocations balancing valid inference with statistical efficiency.
The paper introduces a new approach to source distribution estimation (SDE) in simulation-based science, addressing limitations of existing methods that rely on a fixed surrogate likelihood. By employing an expectation‑maximization framework, the authors iteratively train an amortized posterior on fresh simulations (E‑step) and refit the source distribution to the posterior’s average (M‑step). Two parameterizations are explored: separate source and posterior flows, and a single shared conditional flow, with experiments on three benchmark tasks showing improved performance over fixed surrogate and iterated baseline methods, notably achieving higher data‑space C2ST scores on the Lotka–Volterra benchmark.
arXiv:2607. 23404v1 Announce Type: new Abstract: Self-driving laboratories increasingly rely on multi-fidelity Bayesian optimization (MFBO) to balance cheap, approximate evaluations against scarce, expensive ones, with a predictive surrogate at its core.