Metraipolis › archive › dc_cfa61ec13f45

Reduced Cost Influence Functions for Predict-then-Optimize under Noisy Data — arXiv:2611.02086

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.02086
License (as archived)
CC0-1.0
Archived
2026-11-03T11:25:16.379Z
SHA-256 of the archived text
96fc0dbc47b7e07fcf56e43c77f2017f2a4bf18ee97ad6e17ae6b8fadac08995
Stable URL of this page
https://metraipolis.com/documento/dc_cfa61ec13f45

How to cite

Reduced Cost Influence Functions for Predict-then-Optimize under Noisy Data — arXiv:2611.02086 — arXiv (en), https://arxiv.org/abs/2611.02086 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_cfa61ec13f45 (Metraipolis archive dc_cfa61ec13f45, sha256 96fc0dbc47b7e07fcf56e43c77f2017f2a4bf18ee97ad6e17ae6b8fadac08995)
BibTeX
@misc{dccfa61ec13f45,
  title = {Reduced Cost Influence Functions for Predict-then-Optimize under Noisy Data — arXiv:2611.02086},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.02086},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_cfa61ec13f45; sha256 96fc0dbc47b7e07fcf56e43c77f2017f2a4bf18ee97ad6e17ae6b8fadac08995},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.02086. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

Machine learning models deployed in decision-making pipelines, from vehicle routing to dynamic pricing to clinical decision support, must remain reliable in the face of low-quality training data. We study a predict-then-optimize setting in which an upstream model predicts the cost vector of a downstream linear program, with a large pool of noisy training data supplemented by a small curated set of clean data. We introduce Reduced Cost Influence Functions (RCIFs), which combine influence functions from robust statistics with the geometry of linear optimization to estimate how each training point shifts downstream decisions. Building on this, we propose a reweighting algorithm that uses RCIFs to downweight harmful training points and reduce downstream regret. Experiments on random linear programs and shortest-path problems show that our approach reduces regret, and accompanying theory characterizes properties of RCIFs and identifies regimes favorable to our method relative to baselines.

Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno).
Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG).
Pagina del lavoro: https://arxiv.org/abs/2611.02086 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-03T11:02:37.847Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).