Newshot

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

Summary

arXiv:2305.06584v3 Announce Type: replace 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 minimizat…

Original text(via arXiv cs.LG)

Computer Science > Machine Learning

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

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.
Subjects:Machine Learning (cs.LG) ; Optimization and Control (math.OC); Machine Learning (stat.ML)
Cite as:arXiv:2305.06584 [cs.LG]
(or arXiv:2305.06584v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2305.06584 arXiv-issued DOI via DataCite

Submission history

Access Paper:

  • HTML (experimental)

Additional Features

  • Audio Summary

Current browse context:

References & Citations

  • Google Scholar
  • Semantic Scholar

BibTeX formatted citation

Bookmark

Bibliographic and Citation Tools

Code, Data and Media Associated with this Article

Demos

Recommenders and Search Tools

arXivLabs: experimental projects with community collaborators

arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.

Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.

Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.

The text above was extracted automatically from the source page and may miss images, tables or code blocks. The original is authoritative.

Published by arXiv cs.LG
This site only summarises and aggregates; copyright stays with the original author. Headlines and summaries follow the source — where they differ, the original wins.
Read the original ↗