MétaCan
Menu
Back to cohort
Record W2974252555 · doi:10.1090/mcom/3567

Unconditional convergence for discretizations of dynamical optimal transport

2020· article· en· W2974252555 on OpenAlexaff
Hugo Lavenant

Bibliographic record

VenueMathematics of Computation · 2020
Typearticle
Languageen
FieldMathematics
TopicGeometric Analysis and Curvature Flows
Canadian institutionsUniversity of British Columbia
FundersAgence Nationale de la Recherche
KeywordsConvergence (economics)Applied mathematicsMathematical optimizationMathematicsMathematical economicsComputer scienceStatistical physicsEconomicsPhysicsMacroeconomics

Abstract

fetched live from OpenAlex

The dynamical formulation of optimal transport, also known as Benamou–Brenier formulation or computational fluid dynamics formulation, amounts to writing the optimal transport problem as the optimization of a convex functional under a PDE constraint, and can handle a priori a vast class of cost functions and geometries. Several discretizations of this problem have been proposed, leading to computations on flat spaces as well as Riemannian manifolds, with extensions to mean field games and gradient flows in the Wasserstein space. In this paper, we provide a framework which guarantees convergence under mesh refinement of the solutions of the space-time discretized problems to the one of the infinite-dimensional problem for quadratic optimal transport. The convergence holds without condition on the ratio between spatial and temporal step sizes, and can handle arbitrary positive measures as input, while the underlying space can be a Riemannian manifold. Both the finite volume discretization proposed by Gladbach, Kopfer, and Maas, as well as the discretization over triangulations of surfaces studied by the present author in collaboration with Claici, Chien, and Solomon, fit in this framework.

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 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.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Theoretical or conceptual · Consensus signal: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.739
Threshold uncertainty score0.359

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
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.048
GPT teacher head0.311
Teacher spread0.263 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designTheoretical or conceptual
Domainnot available
GenreMethods

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".

Quick stats

Citations1
Published2020
Admission routes1
Has abstractyes

Explore more

Same venueMathematics of ComputationSame topicGeometric Analysis and Curvature FlowsFrench-language works237,207