cs.LGMay 11, 2023

Active Learning For Contextual Linear Optimization: A Margin-Based Approach

Authors: Mo Liu, Paul Grigas, Heyuan Liu, Zuo-Jun Max Shen

Organizations: Department of Statistics and Operations Research, University of North Carolina, Chapel Hill, NC, 27599 · Department of Industrial Engineering and Operations Research, University of California, Berkeley, Berkeley, CA, 94720

Abstract

We develop the first active learning method for contextual linear optimization. Specifically, we introduce a label acquisition algorithm that sequentially decides whether to request the ``labels'' of feature samples arriving in an unlabeled data stream, where the labels correspond to the objective coefficients in the linear optimization problem. The label acquisition rule is guided by the decision loss induced by the predicted coefficients, known as the Smart Predict-then-Optimize (SPO) loss. Motivated by the structure of the SPO loss, our algorithm uses the distance to degeneracy as a margin-based criterion for label acquisition. The algorithm processes incoming feature samples in batches, acquiring within each batch only the labels of samples whose distance to degeneracy falls below a rejection threshold. We derive non-asymptotic bounds for direct SPO-loss minimization over a general hypothesis class and for surrogate-loss minimization over a linear prediction class. These bounds demonstrate that, under certain natural conditions, our margin-based active learning algorithm requires fewer labels than supervised learning to achieve the same excess population risk for the chosen training loss. We provide concrete examples in which these conditions hold under continuous (sub-)Gaussian noise. Finally, we present numerical evidence demonstrating the practical value of our approach in applications such as personalized pricing and shortest-path problems.

Figures & tables

Appendix figures & tables26 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Active Learning for Stochastic Contextual Linear Bandits

    May 24, 2026Emma Brunskill, Ishani Karmarkar, Zhaoqi LiActive LearningAdaptive Sampling

  2. Towards optimal selection schedules for online active learning

    Oct 16, 2026Hugo Cui, Francesca Mignacco, Francesco MoriActive LearningLinear Classification

  3. The Approximation Ratio for the Risk of Myopic Bayesian Active Learning for Linear Regression

    Jul 7, 2026Stephen MussmannActive LearningLinear Regression