mlsanityData to 7 Oct 2026

What is the Right Notion of Distance between Predict-then-Optimize Tasks?

arXiv 2409.06997 ↗First posted 11 Sep 2024cs.LG cs.AIcited by 2

Not on the map. Why?

Abstract (arXiv)

Comparing datasets is a fundamental task in machine learning, essential for various learning paradigms-from evaluating train and test datasets for model generalization to using dataset similarity for detecting data drift. While traditional notions of dataset distances offer principled measures of similarity, their utility has largely been assessed through prediction error minimization. However, in Predict-then-Optimize (PtO) frameworks, where predictions serve as inputs for downstream optimization tasks, model performance is measured through decision regret rather than prediction error. In this work, we propose OTD3 (Optimal Transport Decision-aware Dataset Distance), a novel dataset distance that incorporates downstream decisions in addition to features and labels. We show that traditional feature-label distances lack informativeness in PtO settings, while OTD3 more effectively captures adaptation success. We also derive a PtO-specific adaptation bound based on this distance. Empirically, we show that our proposed distance accurately predicts model transferability across three different PtO tasks from the literature. The code is available at https://github.com/paularodr/OTD3.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 26 of its 46 references that are in the map. First posted on arXiv 11 Sep 2024.

Builds on

26 of 46 references.

References · 26

  1. 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
  2. 2019Differentiable Convex Optimization Layerscited by 458
  3. 2017Smart "Predict, then Optimize"cited by 332
  4. 2017Joint Distribution Optimal Transportation for Domain Adaptationcited by 280
  5. 2018Melding the Data-Decisions Pipeline: Decision-Focused Learning for Combinatorial Optimizationcited by 220
  6. 2020Geometric Dataset Distances via Optimal Transportcited by 157
  7. 2019Transferability and Hardness of Supervised Classification Taskscited by 125
  8. 2019A Wasserstein-type distance in the space of Gaussian Mixture Modelscited by 75
  9. 2023LAVA: Data Valuation without Pre-Specified Learning Algorithmscited by 69
  10. 2023OpenDataVal: a Unified Benchmark for Data Valuationcited by 55
  11. 2019Hierarchical Optimal Transport for Document Representationcited by 53
  12. 2019A Principled Approach for Learning Task Similarity in Multitask Learningcited by 32
14 more
  1. 2022PyEPO: A PyTorch-based End-to-End Predict-then-Optimize Library for Linear and Integer Programmingcited by 32
  2. 2017Structured Optimal Transportcited by 30
  3. 2023Active learning for data streams: a surveycited by 29
  4. 2020Automatically Learning Compact Quality-aware Surrogates for Optimization Problemscited by 22
  5. 2018Generalizing Point Embeddings using the Wasserstein Space of Elliptical Distributionscited by 20
  6. 2023Estimate-Then-Optimize versus Integrated-Estimation-Optimization versus Sample Average Approximation: A Stochastic Dominance Perspectivecited by 19
  7. 2018Wasserstein regularization for sparse multi-task regressioncited by 18
  8. 2023Leaving the Nest: Going Beyond Local Loss Functions for Predict-Then-Optimizecited by 18
  9. 2020Differentiable Top-k Operator with Optimal Transportcited by 17
  10. 2019Learning Embeddings into Entropic Wasserstein Spacescited by 15
  11. 2022Decision-Focused Learning without Differentiable Optimization: Learning Locally Optimized Decision Lossescited by 12
  12. 2023TaskMet: Task-Driven Metric Learning for Model Learningcited by 11
  13. 2023Active Learning For Contextual Linear Optimization: A Margin-Based Approachcited by 6
  14. 2024Decision-Focused Evaluation of Worst-Case Distribution Shiftcited by 4

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.