독서리서치레이더투자 프레임워크
로그인 / 회원가입
← 읽기로 돌아가기
뉴스간단한 요점1 분 소요DisconfirmAI 편집부

GP-BTS removes the batch-size Q factor from regret bounds without initial uncertainty sampling

Shion Takeno and Shogo Iwazaki self-report that in parallel Gaussian process Bayesian optimization, GP-BTS achieves a regret upper bound without the multiplicative batch-size Q factor, with no initial uncertainty sampling stage.

검증됨 2026-09-18 06:26 GMT+8

In parallel Gaussian process Bayesian optimization, GP-BTS achieves a regret upper bound without the multiplicative batch-size Q factor, without the initial uncertainty sampling stage required by existing analyses — and the noiseless bound is tighter. This is a self-reported result by Shion Takeno and Shogo Iwazaki.

Previous analyses required an initial uncertainty sampling stage first, which the authors say is often ineffective in practice.

The conclusion is self-reported by the authors: GP-BTS's regret upper bound carries no multiplicative factor of the batch size Q, and the noiseless bound is tighter.

Boundary: the results are not peer-reviewed, and v2 revised Lemma 4.2 of v1; the preprint was submitted August 17 and revised as v2 on September 16 (arXiv:2608.16492).

출처

  • arxiv.org↗
리서치 계속하기 →
로그인 / 회원가입
독서리서치레이더투자 프레임워크