paper-with-me

홈 › Papers

Unified Precision-Guaranteed Stopping Rules for Contextual Learning

2026-04-09 · Mingrui Ding, Qiuhong Zhao, Siyang Gao, Jing Dong arxiv

Contextual learning seeks to learn a decision policy that maps an individual's characteristics to an action through data collection. In operations management, such data may come from various sources, and a central question is when data collection can stop while still guaranteeing that the learned policy is sufficiently accurate. We study this question under two precision criteria: a context-wise criterion and an aggregate policy-value criterion. We develop unified stopping rules for contextual learning with unknown sampling variances in both unstructured and structured linear settings. Our approach is based on generalized likelihood ratio (GLR) statistics for pairwise action comparisons. To calibrate the corresponding sequential boundaries, we derive new time-uniform deviation inequalities that directly control the self-normalized GLR evidence and thus avoid the conservativeness caused by decoupling mean and variance uncertainty. Under the Gaussian sampling model, we establish finite-sample precision guarantees for both criteria. Numerical experiments on synthetic instances and two case studies demonstrate that the proposed stopping rules achieve the target precision with substantially fewer samples than benchmark methods. The proposed framework provides a practical way to determine when enough information has been collected in personalized decision problems. It applies across multiple data-collection environments, including historical datasets, simulation models, and real systems, enabling practitioners to reduce unnecessary sampling while maintaining a desired level of decision quality.

📄 PDF Abstract BibTeX arXiv:2604.07913

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Early Stopping in Contextual Bandits and Inferences

2025-02-05 · Zihan Cui

Bandit algorithms sequentially accumulate data using adaptive sampling policies, offering flexibility for real-world applications. However, excessive sampling can be costly, motivating the devolopment of early stopping m…

Decision MakingMulti-Armed Bandits

Second-order Confidence Network for Early Classification of Time Series

2023-12-19 · ACM Transactions on Intelligent Systems and Technology 2023 12 · Junwei Lv, Yuqi Chu, Jun Hu, Peipei Li 외

Time series data are ubiquitous in a variety of disciplines. Early classification of time series, which aims to predict the class label of a time series as early and accurately as possible, is a significant but challengi…

Early ClassificationTime Series

Learning Lipschitz Functions by GD-trained Shallow Overparameterized ReLU Neural Networks

2022-12-28 · Ilja Kuzborskij, Csaba Szepesvári

We explore the ability of overparameterized shallow ReLU neural networks to learn Lipschitz, nondifferentiable, bounded functions with additive noise when trained by Gradient Descent (GD). To avoid the problem that in th…

Are sample means in multi-armed bandits positively or negatively biased?

2019-05-27 · NeurIPS 2019 12 · Jaehyeok Shin, Aaditya Ramdas, Alessandro Rinaldo

It is well known that in stochastic multi-armed bandits (MAB), the sample mean of an arm is typically not an unbiased estimator of its true mean. In this paper, we decouple three different sources of this selection bias:…

Multi-Armed BanditsSelection bias

Heuristic Stopping Rules For Technology-Assisted Review

2021-06-18 · Eugene Yang, David D. Lewis, Ophir Frieder

Technology-assisted review (TAR) refers to human-in-the-loop active learning workflows for finding relevant documents in large collections. These workflows often must meet a target for the proportion of relevant document…

Active LearningTAR