MétaCan
Menu
Back to cohort
Record W2157989893 · doi:10.1017/fms.2015.20

THE MULTI-MARGINAL OPTIMAL PARTIAL TRANSPORT PROBLEM

2015· preprint· en· W2157989893 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueForum of Mathematics Sigma · 2015
Typepreprint
Languageen
FieldMathematics
TopicGeometric Analysis and Curvature Flows
Canadian institutionsUniversity of AlbertaUniversity of Toronto
FundersDivision of Mathematical SciencesUniversity of AlbertaNational Science Foundation
KeywordsUniquenessMathematical optimizationMonotonic functionExploitMathematicsMarginal costMathematical economicsComputer scienceEconomics

Abstract

fetched live from OpenAlex

We introduce and study a multi-marginal optimal partial transport problem. Under a natural and sharp condition on the dominating marginals, we establish uniqueness of the optimal plan. Our strategy of proof establishes and exploits a connection with another novel problem, which we call the Monge–Kantorovich partial barycenter problem (with quadratic cost). This latter problem has a natural interpretation as a variant of the factories-and-mines description of optimal transport. We then turn our attention to various analytic properties of these two problems. Of particular interest, we show that monotonicity of the active marginals with respect to the amount $m$ of mass to be transported can fail, a surprising difference from the two-marginal case.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.003
metaresearch head score (Gemma)0.001
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: Theoretical or conceptual
GenreCandidate signal: Methods · Consensus signal: Methods
Teacher disagreement score0.278
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0030.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0000.000

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.

Opus teacher head0.059
GPT teacher head0.309
Teacher spread0.249 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it