23 April 2024 in Quality and Reliability Engineering International
Sequential sampling methods are often used to estimate functions describing models subjected to time‐intensive simulations or expensive experiments. These methods provide guidelines for point selection in the domain to capture maximum information about the function. However, in most sequential sampling methods, determining a new point is a time‐consuming process. In this paper, we propose a new method, named Sieve, to sequentially select points of an initially unknown function based on the definition of proper intervals. In contrast with existing methods, Sieve does not involve function estimation at each iteration. Therefore, it presents a greater computational efficiency for achieving a given accuracy in estimation. Sieve brings in tools from computational geometry to subdivide regions of the domain efficiently. Further, we validate our proposed method through numerical simulations and two case studies on the calibration of internal combustion engines and the optimal exploration of an unknown environment by a mobile robot.
1 January 2026 in INFORMS Journal on Data Science
Active learning (AL) is commonly used in applications where labeling data are expensive or time consuming. In practice, however, labels are often noisy because of varying labeler expertise and anno...
4 November 2026 in INFORMS Journal on Data Science
Active learning (AL) is commonly used in applications where labeling data are expensive or time consuming. In practice, however, labels are often noisy because of varying labeler expertise and annotation uncertainty, especially for complex or ambiguous samples. Learning from such imperfectly labeled data can degrade classifier performance. We propose an AL framework that explicitly accounts for label noise by optimally assigning labelers and selecting samples to minimize labeling error. Our approach, which is called optimal labeler assignment and sampling (OLAS), uses a noise model that depends on both labeler accuracy and model uncertainty to guide these decisions. We develop two tractable optimization formulations: one for assigning samples to labelers to minimize worst-case noise and another for selecting samples while controlling overall label noise. Theoretical results provide closed-form solutions under mild conditions. Empirical evaluations on benchmark data sets and a real-world warranty claim classification problem show that OLAS achieves the highest or near-highest classification accuracy among existing AL strategies across most settings using only a single label per sample.