Inverse Optimization: Closed-form Solutions, Geometry and Goodness of\n fit
Bibliographic record
Abstract
In classical inverse linear optimization, one assumes a given solution is a\ncandidate to be optimal. Real data is imperfect and noisy, so there is no\nguarantee this assumption is satisfied. Inspired by regression, this paper\npresents a unified framework for cost function estimation in linear\noptimization comprising a general inverse optimization model and a\ncorresponding goodness-of-fit metric. Although our inverse optimization model\nis nonconvex, we derive a closed-form solution and present the geometric\nintuition. Our goodness-of-fit metric, $\\rho$, the coefficient of\ncomplementarity, has similar properties to $R^2$ from regression and is\nquasiconvex in the input data, leading to an intuitive geometric\ninterpretation. While $\\rho$ is computable in polynomial-time, we derive a\nlower bound that possesses the same properties, is tight for several important\nmodel variations, and is even easier to compute. We demonstrate the application\nof our framework for model estimation and evaluation in production planning and\ncancer therapy.\n
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.024 |
| Meta-epidemiology (narrow) | 0.002 | 0.001 |
| Meta-epidemiology (broad) | 0.002 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.001 | 0.004 |
| Scholarly communication | 0.003 | 0.004 |
| Open science | 0.002 | 0.004 |
| Research integrity | 0.003 | 0.003 |
| Insufficient payload (model declined to judge) | 0.004 | 0.001 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".