An efficient numerical algorithm for the L2 optimal transport problem with periodic densities
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.
Bibliographic record
Abstract
We present an extension of the numerical method of Loeper and Rapetti (2005, Numerical solution of the Monge–Ampère equation by a Newton's algorithm. C.R. Acad. Sci. Paris, I, 319–324) for the Monge–Ampère equation to non-uniform target densities and adopt it to solve the optimal transport problem with quadratic cost. The method employs a damped Newton algorithm to solve the Monge–Ampère equation. We show that the algorithm converges for sufficiently large damping coefficients, for the case where the source and target densities are sufficiently smooth, periodic and bounded away from zero. At each Newton iteration, we solve a non-constant coefficient linear partial differential equation. To improve the efficiency of the procedure, we use an analytically preconditioned fast Fourier transform method coupled with GMRES (Strain, J. (1994) Fast spectrally-accurate solution of variable-coefficients elliptic problems. Proc. Amer. Math. Sci., 122, 843–850) to solve this equation, as opposed to a more straightforward approach based on a second-order finite-difference discretization combined with biconjugate gradient used in the original LOEPER and RAPETTI paper. Finally, we present some numerical experiments in image processing to demonstrate the efficiency of the method.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it