Table of Contents
Fetching ...

An $(ε,δ)$-accurate level set estimation with a stopping criterion

Hideaki Ishibashi, Kota Matsui, Kentaro Kutsukake, Hideitsu Hino

TL;DR

This work addresses level set estimation for costly black-box functions by introducing an acquisition function that directly targets classification difficulty and a stopping criterion with probabilistic guarantees. By modeling the unknown function with a Gaussian process, the method computes misclassification probabilities and a margin-based undetermined region to drive queries, while the stopping rule ensures the estimated level-set triplet is $\\epsilon$-accurate with probability at least $1-\\delta$. It further provides lower bounds for performance metrics such as the F-score and demonstrates competitiveness relative to established methods on synthetic benchmarks and a real-world red-zone estimation task in silicon ingots. The approach enables substantial reductions in function evaluations through principled early stopping, with practical implications for adaptive experimental design in materials quality and related domains.

Abstract

The level set estimation problem seeks to identify regions within a set of candidate points where an unknown and costly to evaluate function's value exceeds a specified threshold, providing an efficient alternative to exhaustive evaluations of function values. Traditional methods often use sequential optimization strategies to find $ε$-accurate solutions, which permit a margin around the threshold contour but frequently lack effective stopping criteria, leading to excessive exploration and inefficiencies. This paper introduces an acquisition strategy for level set estimation that incorporates a stopping criterion, ensuring the algorithm halts when further exploration is unlikely to yield improvements, thereby reducing unnecessary function evaluations. We theoretically prove that our method satisfies $ε$-accuracy with a confidence level of $1 - δ$, addressing a key gap in existing approaches. Furthermore, we show that this also leads to guarantees on the lower bounds of performance metrics such as F-score. Numerical experiments demonstrate that the proposed acquisition function achieves comparable precision to existing methods while confirming that the stopping criterion effectively terminates the algorithm once adequate exploration is completed.

An $(ε,δ)$-accurate level set estimation with a stopping criterion

TL;DR

This work addresses level set estimation for costly black-box functions by introducing an acquisition function that directly targets classification difficulty and a stopping criterion with probabilistic guarantees. By modeling the unknown function with a Gaussian process, the method computes misclassification probabilities and a margin-based undetermined region to drive queries, while the stopping rule ensures the estimated level-set triplet is $\\epsilon$-accurate with probability at least $1-\\delta$. It further provides lower bounds for performance metrics such as the F-score and demonstrates competitiveness relative to established methods on synthetic benchmarks and a real-world red-zone estimation task in silicon ingots. The approach enables substantial reductions in function evaluations through principled early stopping, with practical implications for adaptive experimental design in materials quality and related domains.

Abstract

The level set estimation problem seeks to identify regions within a set of candidate points where an unknown and costly to evaluate function's value exceeds a specified threshold, providing an efficient alternative to exhaustive evaluations of function values. Traditional methods often use sequential optimization strategies to find -accurate solutions, which permit a margin around the threshold contour but frequently lack effective stopping criteria, leading to excessive exploration and inefficiencies. This paper introduces an acquisition strategy for level set estimation that incorporates a stopping criterion, ensuring the algorithm halts when further exploration is unlikely to yield improvements, thereby reducing unnecessary function evaluations. We theoretically prove that our method satisfies -accuracy with a confidence level of , addressing a key gap in existing approaches. Furthermore, we show that this also leads to guarantees on the lower bounds of performance metrics such as F-score. Numerical experiments demonstrate that the proposed acquisition function achieves comparable precision to existing methods while confirming that the stopping criterion effectively terminates the algorithm once adequate exploration is completed.

Paper Structure

This paper contains 29 sections, 6 theorems, 58 equations, 10 figures, 1 algorithm.

Key Result

Theorem 3.1

If we assume that $\tilde{H}_{\theta}$,$\tilde{L}_{\theta}$ and $\tilde{U}_{\theta}$ are determined by using the classification rule of Eqs. eq:classification_rule_H,eq:classification_rule_L and eq:classification_rule_D, then the following inequality holds:

Figures (10)

  • Figure 1: The proposed method selects a candidate point that is difficult to classify and has a low probability of containing the true function value in the margin region and stops LSE when the condition is satisfied.
  • Figure 2: F-scores using each acquisition function and stoped timings with the proposed (Ours), F-score sampling (FS) and fully classified (FC) criteria. (a)--(c) LSE for test functions. (d), (e) Red zone estimation of silicon ingots for solar cells.
  • Figure 3: True probability and its lower bound in Branin function.
  • Figure 4: True probability and its lower bound in Rosenbrock function.
  • Figure 5: True probability and its lower bound in Rosenbrock function.
  • ...and 5 more figures

Theorems & Definitions (9)

  • Theorem 3.1
  • Proposition 3.2
  • Corollary 3.3
  • Lemma A.1
  • proof
  • Lemma A.2
  • proof
  • Proposition A.3
  • proof