Pith. sign in

REVIEW 1 cited by

End-to-End Learning for Fair Multiobjective Optimization Under Uncertainty

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2402.07772 v1 pith:LP45PF37 submitted 2024-02-12 cs.AI

classification cs.AI
keywords optimizationdecisionparametricend-to-endfairlearningnondifferentiableproblem
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Many decision processes in artificial intelligence and operations research are modeled by parametric optimization problems whose defining parameters are unknown and must be inferred from observable data. The Predict-Then-Optimize (PtO) paradigm in machine learning aims to maximize downstream decision quality by training the parametric inference model end-to-end with the subsequent constrained optimization. This requires backpropagation through the optimization problem using approximation techniques specific to the problem's form, especially for nondifferentiable linear and mixed-integer programs. This paper extends the PtO methodology to optimization problems with nondifferentiable Ordered Weighted Averaging (OWA) objectives, known for their ability to ensure properties of fairness and robustness in decision models. Through a collection of training techniques and proposed application settings, it shows how optimization of OWA functions can be effectively integrated with parametric prediction for fair and robust optimization under uncertainty.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Decision-Focused Continual Learning for Seaport Power-Logistics Scheduling: Generalization across Varying Tasks

    cs.LG 2025-11 conditional novelty 5.0 of 10

    A continual-learning variant of decision-focused learning, regularized by Fisher information and a differentiable KNN surrogate, improves port power-logistics scheduling across a changing stream of tasks.

Pith tools