Pith. sign in

REVIEW 3 major objections 5 minor 173 references

Faster Algorithms for Multimarginal Optimal Transport

T0 review · 3 major / 5 minor · reviewed 2026-08-11 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗ Review JSON

Pith's one-line read Discrete multimarginal optimal transport admits a classical $O(m^2 n^m \varepsilon^{-1}\mathrm{polylog})$-time algorithm returning an exactly feasible coupling, and quantum algorithms estimate the value or return implicit couplings in…

desk verdict The classical packing reduction is the real contribution and is sound; the quantum Sinkhorn branch is conditional on an unproved log-sum-exp primitive, but the paper as a whole deserves refereeing. read the letter →

arxiv 2608.09513 v1 pith:AWSIIQZI submitted 2026-08-10 quant-ph cs.DSmath.OC

Brandon Augustino , Yue Sun , Atithi Acharya , Shouvanik Chakrabarti , Junhyung Lyle Kim , Shree Hari Sureshbabu , Charlie Che This is my paper · ORCID
classification quant-phcs.DSmath.OC
keywords multimarginaloptimaltransportpositivepackinglinearprogramquantumSinkhornprojectedsubgradientmethodentropicregularizationquerycomplexityspeedupWassersteinbarycenters
verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

The paper studies discrete multimarginal optimal transport (MOT), where $m$ probability distributions supported on $n$ points are coupled to minimize a general cost tensor, a problem that underlies Wasserstein barycenters, matching in teams, and density-functional theory. Its central claim is a classical randomized algorithm that returns an exactly feasible coupling whose transportation cost is within an additive $\varepsilon$ of the MOT value in time $O(m^2 n^m \varepsilon^{-1}\mathrm{polylog}(m,n,\varepsilon^{-1}))$, the first bound that is simultaneously linear in the tensor dimension $n^m$ and in the inverse accuracy. It further claims two quantum algorithms: a projected subgradient method that estimates the MOT value without producing a coupling in $\tilde O(m^3 n^{m/2+1}\varepsilon^{-2})$ time, and a quantum multimarginal Sinkhorn method that outputs an implicit Gibbs-potential description of an $\varepsilon$-optimal coupling in $\tilde O(m^8 n^{(m+1)/2}\varepsilon^{-5})$ time. Matching-style lower bounds are also claimed: $\Omega(n^m/(1+\varepsilon n))$ classical cost queries and $\Omega(\sqrt{n^m/(1+\varepsilon n)})$ quantum cost queries for any $\varepsilon<1/2$. If these claims hold, general MOT is solvable at the cost of writing down the coupling, and quantum algorithms genuinely reduce the dimensional dependence whenever cost entries are accessible coherently.

What carries the argument

The argument is carried by three machines. First, the packing reduction with rank-one completion: all marginal deficits $d_k$ of a feasible packing share the same mass, so $D=\tau^{1-m}d_1\otimes\cdots\otimes d_m$ closes every marginal at once, turning a multiplicative packing approximation into an additive MOT approximation at no extra cost. Second, quantum maximum finding inside projected subgradient descent: the dual objective $F(y)=\max_i(\sum_k y_{k,i_k}-C_i)-b^\top y$ has subgradients of the form $a_i-b$ with $\|a_i-b\|_2\le 2\sqrt{m}$, and finding the maximizing index over $N=n^m$ entries in $O(\sqrt{N})$ queries is what makes the value estimate sublinear. Third, quantum log-sum-exp fiber estimation in a randomized Sinkhorn scheme: each block update needs $\log q_{k,a}$, which is a log-sum over $n^{m-1}$ entries minus a log-sum over all $n^m$ entries; the quantum LOGSUMEXP primitive estimates both in roughly $\sqrt{n^{m-1}}/\alpha$ and $\sqrt{n^m}/\alpha$ coherent evaluations, and the noisy descent analysis, with a potential-range bound $R_K=\log(K_{\max}/K_{\min})+\log(1/\mu_{\min})$, keeps the iteration count at $O(m^2\bar R_K/\delta)$. The lower bounds are a fourth piece: partitioning $[n]^m$ into shifted matchings and blocks of size about $\varepsilon n$ reduces promised search on $\Omega(n^m/(1+\varepsilon n))$ items to MOT.

What would settle it

Run the quantum LOGSUMEXP subroutine of Lemma 5.1 on a single fiber of size $d=n^{m-1}$ with known answer, with array entries stored in the specified quantum-readable form, and count the actual coherent queries and fixed-point operations needed to reach accuracy $\delta$; if the count grows like $d$ rather than like $\sqrt{d}/\delta$, then Lemma 5.2 and Theorem 5.1 are refuted. For the classical claim, one can take a small random MOT instance with known optimum, run the packing solver with $\delta=\varepsilon/\Delta$, and verify both the completion's exact feasibility and that the observed runtime tracks $m^2 n^m \kappa_C$.

Watch

Extended reading notes

Core claim

On its own terms, the paper's discovery is that discrete MOT is exactly a positive packing LP, not merely an LP that resembles one. The primal cost $\min_{X\in U(\mu)}\langle C,X\rangle$ is replaced by $\max\{\langle U\mathbf{1}-C,X\rangle : \mathrm{Proj}_k(X)\le \mu_k\}$, and the loss from using a partial feasible packing is repaired exactly: the deficit vectors $d_k=\mu_k-\mathrm{Proj}_k(X)$ all have equal total mass $\tau$, so $D=\tau^{1-m}d_1\otimes\cdots\otimes d_m$ is a nonnegative rank-one tensor whose marginals are exactly the deficits, and $X+D$ is a true coupling. A $(1-\delta)$-optimal packing therefore rounds to a coupling of cost at most $\mathrm{MOT}(C,\mu)+\delta\Delta$, yielding the classical near-linear runtime. For the value, the dual is written as the nonsmooth convex function $F(y)=\max_{i\in[n]^m}(\sum_k y_{k,i_k}-C_i)-b^\top y$; quantum maximum finding over the $n^m$ indices supplies subgradients in $O(\sqrt{N})$ queries, and projected subgradient descent on a ball of radius $\|C\|_\infty\sqrt{mn}$ gives the sublinear value estimate. For the entropy-regularized problem, the block update $\beta_{k,a}\leftarrow\beta_{k,a}+\log\mu_{k,a}-\log q_{k,a}$ requires only log-marginals, and a quantum log-sum-exp estimator computes those over fibers of size $n^{m-1}$ in $O(m n^{(m-1)/2}\alpha^{-1})$ time, with a noisy-coordinate-descent analysis showing convergence to residual $\delta$; standard entropic-to-unregularized rounding converts this into the implicit-coupling guarantee.

Load-bearing premise

The quantum speedups assume that cost values and current iterate arrays can be read in quantum superposition with polylogarithmic overhead per entry, and that the quantum log-sum-exp subroutine truly costs $O(\sqrt{d}/\delta)$ coherent evaluations; if either fails, the sublinear quantum claims collapse, while the classical packing algorithm does not depend on this.

Editorial extensions

If this is right

  • For general MOT with $m$ marginals on $n$ points, an exactly feasible coupling with cost at most $\mathrm{MOT}(C,\mu)+\varepsilon$ can be computed in $O(m^2 n^m \kappa_C \log(mn\kappa_C)\log\kappa_C)$ arithmetic operations with high probability, where $\kappa_C=\max\{1,\|C\|_\infty/\varepsilon\}$.
  • The quantum projected subgradient method estimates the MOT value without a coupling in $\tilde O(m^3 n^{m/2+1}\kappa_C^2)$ time, which is sublinear in $n^m$ for $m\ge 3$.
  • The quantum multimarginal Sinkhorn method outputs scaling potentials for a Gibbs tensor whose rounding has cost at most $\mathrm{MOT}(C,\mu)+\varepsilon$, in $\tilde O(m^8 n^{(m+1)/2}\kappa_C^5)$ time, with an additional $O(n^m)$ classical cost if the explicit coupling tensor must be materialized.
  • Any randomized classical algorithm needs $\Omega(n^m/(1+\varepsilon n))$ cost queries and any quantum algorithm needs $\Omega(\sqrt{n^m/(1+\varepsilon n)})$ cost queries, so at constant accuracy the $n^{m-1}$ dimensional dependence is unavoidable classically.
  • For bimarginal MOT, $m=2$, the quantum Sinkhorn specialization gives $\tilde O(n^{3/2}(\|C\|_\infty/\varepsilon)^5+n^2)$, a modest quantum speedup in $n$ over the classical near-linear-in-$n^2$ baseline.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

  • Beyond the paper's explicit theorems, the packing reduction is exact, so any future improvement to general positive packing solvers would transfer directly to MOT without modifying the rounding argument.
  • The $O(\sqrt{N})$ subgradient evaluation hints that quantum speedups could transfer to other linear programs with sparse columns and entry-query cost access, a direction the paper does not pursue.
  • The lower-bound construction places fine-precision MOT at the level of unstructured search, suggesting that practical quantum advantage will require exploiting cost structure such as low rank, metric, or geometric form rather than relying on the generic oracle.
  • The large $m^8$ factor in quantum Sinkhorn versus $m^2$ classically should be tested at small $m$ before claiming an end-to-end quantum advantage in practice.
Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Referee Report

3 major / 5 minor

Summary. The manuscript gives classical and quantum approximation algorithms for discrete multimarginal optimal transport (MOT). The classical result reduces MOT to a positive packing LP on the marginal-incidence matrix, solves the packing problem with the Allen-Zhu--Orecchia solver, and exactly restores marginals by a rank-one completion, yielding an explicit coupling in O(m^2 n^m (||C||_∞/ε) polylog) time. The first quantum algorithm applies projected subgradient descent to the MOT dual, using quantum maximum finding to evaluate the nonsmooth dual objective, and estimates the MOT value in O(m^3 n^{m/2+1} (||C||_∞/ε)^2 polylog) time. The second quantum algorithm randomizes multimarginal Sinkhorn updates, using a quantum LOGSUMEXP primitive to estimate fiber log-sums without materializing the tensor; it returns scaling potentials for an approximate entropic coupling in O(m^5 n^{(m+1)/2} ...) time, and after the standard entropic-to-unregularized reduction the paper claims an implicit unregularized approximation in O(m^8 n^{(m+1)/2} (||C||_∞/ε)^5 polylog) time. Finally, query lower bounds of Ω(n^m/(1+εn)) for randomized classical algorithms and Ω(sqrt(n^m/(1+εn))) for quantum algorithms are proved by reduction from promised unstructured search.

Significance. The classical packing reduction is the paper's strongest contribution: Theorem 3.2 gives an exact equality between MOT and a packing LP, Lemma 3.1's rank-one completion is elementary and correct, and Corollary 3.1 improves on previous near-linear-in-N methods in its combined dimension and accuracy dependence. The QPSM value algorithm is also internally coherent: the dual geometry in Lemma 4.1 supplies the needed ball radius and Lipschitz constant, and the runtime follows from standard projected-subgradient theory. The lower-bound construction in Section 6 is clean and correctly interpolates between the n^{m-1} and n^m regimes. The quantum Sinkhorn branch is more conditional: its exponents rest on an unproved LOGSUMEXP specialization, and the unregularized reduction is largely delegated to [LHCJ22]. If Lemma 5.1 is supplied with a complete proof, the claimed quantum speedups are significant; as written, that part should be treated as a conditional result.

major comments (3)
  1. [Section 5, Lemma 5.1] The claimed complexity of the quantum multimarginal Sinkhorn method (Theorem 5.1 and Corollary 5.2) is carried by the LOGSUMEXP primitive, but the lemma is presented only as a 'specialized' version of [Nie24, Theorem 13.3.2] with no proof and no statement of the cited theorem's hypotheses and constants. The asserted runtime is polylogarithmic in B and 1/γ, which is a strong claim because the target log((1/r)∑ a_j e^{w_j}) ranges over an interval of length O(B) and the weights can be as small as γ. If the true query complexity of the primitive contains a factor 1/√γ, e^{O(B)}, or any similar dependence, then the per-fiber estimation cost in Lemma 5.2 changes and with it the ε^{-5} and n^{(m+1)/2} exponents in Corollary 5.2. Since this is a load-bearing step for one of the two quantum speedups, the manuscript should either prove Lemma 5.1 in full or state the exact theorem from [Nie24], including all constants and coherence assumptions, and verify that the rescaled Gibbs tensor and the potentials used in Section 5.2 satisfy those hypotheses.
  2. [Section 5, Corollary 5.2] The proof delegates three load-bearing steps to [LHCJ22]: the entropic-bias bound η m log n, the rounding bound O(||C||_∞ δ) for a coupling with total marginal error δ, and the marginal perturbation of [LHCJ22, Algorithm 3]. The first two are cited as Theorems 4.4-4.5, but the algorithm here produces noisy potentials from randomized coordinate updates rather than the exact or greedy Sinkhorn iterates analyzed in that paper. Please state the relevant results with their hypotheses and confirm that the noise level from Theorem 5.1 (α_upd, α_cert) is compatible with the cited rounding and perturbation bounds; otherwise the ε dependence in Corollary 5.2 is not established.
  3. [Section 4, Theorem 4.1] The proof asserts that a fixed-point precision B = polylog(m,n,1+κ_C) makes the accumulated arithmetic error at most ε/8, and that the final estimate eF satisfies |eF - F(ȳ)| ≤ ε/8, but no derivation is given for the accumulation over T = O(mMκ_C^2) iterations and over the quantum max-finding comparisons. Since the final guarantee is for the real MOT value and the certificate A^T ŷ ≤ c is stated for the represented LP, the manuscript should give the explicit precision bookkeeping, or a short lemma, showing that the ε/8 slacks are not violated by the projection, averaging, and final-shift steps.
minor comments (5)
  1. [Abstract and Section 1.1] The displayed quantum Sinkhorn runtime contains an unmatched closing parenthesis: O(m^8 n^{(m+1)/2} ε^{-5} polylog(...)))$; remove the extra ')'.
  2. [Table 1] The entry 'QSinkhorneO' is missing a space, and the eO notation is used in the table before it is explicitly defined in the text; please define it in the caption or before the table.
  3. [Section 5.2, Lemma 5.1] The factor log^2(e/γ) should be defined precisely; if 'e' denotes the base of the natural logarithm, write it as (1+ln(1/γ))^2 or specify the convention so that it is not confused with the accuracy parameter ε.
  4. [Section 1.1] The sentence 'For more details; the entropy-regularized multimgarginal Sinkhorn guarantee...' contains a semicolon splice and the typo 'multimgarginal'; please correct both.
  5. [Section 4, cost-entry model] The paragraph introducing O_C describes both a direct tensor-entry oracle and a structured implementation via a coherent evaluator for c; please clarify which oracle is assumed for each theorem, since the lower bounds of Section 6 apply only to the unstructured query model.

Circularity Check

0 steps flagged · score 0.0 of 10

No significant circularity: the classical packing reduction, quantum subgradient method, and quantum Sinkhorn analysis are each derived from stated external benchmarks or proven in-paper, with no fitted parameter renamed as a prediction.

full rationale

The paper's central derivations are self-contained against external benchmarks rather than circular. The classical result (Section 3) reduces MOT to a packing LP using B = U1 - C, proves the exact identity P* = U - MOT(C,mu) in Theorem 3.2 directly from the primal and packing LPs, and converts the multiplicative packing guarantee to the additive MOT guarantee through that identity in Theorem 3.3. There is no fitted parameter: the packing solver is an external oracle from Allen-Zhu and Orecchia [AZO19], and the rank-one completion in Lemma 3.1 is exact and verified entrywise. The quantum projected subgradient method (Section 4) uses the standard dual reformulation, an in-paper proof of the Lipschitz and ball-radius bounds in Lemma 4.1, and the external quantum maximum-finding primitive; it does not invoke any result whose conclusion includes the MOT estimate. The quantum Sinkhorn branch (Section 5) relies on the external LOGSUMEXP primitive stated in Lemma 5.1 and specialized from [Nie24, Thm 13.3.2], and on the external multimarginal Sinkhorn and rounding framework of [LHCJ22]; those are prior independent works, not the authors' own cited results, and the target bounds are not used as assumptions. The only self-citation, [KAH+26], appears in Section 2.2 and is explicitly described as not needed: the paper instead computes subgradients directly, so the self-citation carries no load-bearing weight. The lower bound in Section 6 is an independent search reduction. There is no self-definitional step, no fitted input called a prediction, no uniqueness theorem imported from the authors' prior work, and no ansatz smuggled in via self-citation. The skeptic's concern about Lemma 5.1 is a question about the correctness or scope of an external cited primitive, not a circular reduction, and therefore does not raise the circularity score.

Assumptions & free parameters 0 free parameters · 8 assumptions · 0 invented entities

No free parameters are fitted to data; epsilon, eta, and delta are accuracy and regularization inputs chosen by the algorithm. All entities involved are standard algorithmic constructs, not new physical or mathematical objects. The main external dependencies are prior solver and rounding theorems, listed as axioms.

assumptions (8)
  • standard math Finite-dimensional LP strong duality for (MOT-P) and (MOT-D).
    Used throughout Sections 3 and 4 to equate primal and dual values; standard since the primal has a feasible product coupling and bounded objective.
  • standard math Allen-Zhu-Orecchia positive packing LP solver (Theorem 3.1) returns (1-delta)-optimal solutions in O((M+N+nnz(A))/delta log...) time.
    External theorem invoked in Section 3.2; the classical runtime depends on it.
  • standard math Projected subgradient method convergence bound (Theorem 2.1) with step size R/(G sqrt(T)).
    Used in Theorem 4.1 to control the iteration count for the dual optimization.
  • standard math Quantum maximum finding (Durr-Hoyer) succeeds with O(sqrt(N) log(1/q)) queries.
    Used in Lemma 4.2 to find the maximizing tensor index for each subgradient.
  • standard math Quantum LOGSUMEXP primitive of Nieuwboer [Nie24, Thm 13.3.2] achieves the stated sqrt(d)/delta accuracy with polylog failure overhead.
    Load-bearing for the quantum Sinkhorn algorithm; the proof is not reproduced in this paper.
  • standard math Entropic rounding and marginal perturbation theorems of Lin et al. [LHCJ22, Theorems 4.4-4.5 and Algorithm 3] convert marginal error delta and entropic bias into additive MOT error.
    Used in Corollary 5.2 to go from entropic MOT to unregularized MOT; not re-derived.
  • domain assumption Full-support hypothesis: all marginal masses are positive for the quantum upper bounds.
    Needed in Proposition 4.2 to bound dual optima and in Section 5.1 for strict positivity of the Gibbs optimizer; zero-mass points are pruned first.
  • domain assumption Coherent fixed-point cost-entry oracle with polylog overhead for evaluating C_i and current arrays.
    Defines the quantum query model in Section 4.2; without it the quantum sublinear bounds do not apply.

how reviews work

0 comments
Cite this review

Pith. "Pith review of Faster Algorithms for Multimarginal Optimal Transport." pith.science (2026). https://pith.science/paper/AWSIIQZI

@misc{pith2026260809513,
  author       = {Pith},
  title        = {Pith review of: Faster Algorithms for Multimarginal Optimal Transport},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/AWSIIQZI}},
  note         = {Machine review of arXiv:2608.09513}
}
abstract

We study algorithms for approximating the multimarginal optimal transport (MOT) distance, a generalization of the classic optimal transport distance, between $m$ discrete probability distributions each supported on at most $n$ points. We give a classical algorithm that computes a coupling between these marginals whose expected transportation cost is within an additive $\varepsilon > 0$ of the MOT distance in time $O(m^2 n^m \varepsilon^{-1}\mathrm{polylog}(m,n,\varepsilon^{-1}))$. This is, to our knowledge, the first bound for general MOT problems with simultaneous linear dependence on the dimension $n^m$ and on the accuracy parameter $\varepsilon^{-1}$, improving the prior state of the art. On the quantum side, we give two algorithms that achieve speedups in dimension, though with worse accuracy dependence than classical approaches. First, we construct a quantum projected subgradient method for estimating the MOT distance within an additive $\varepsilon >0$ with runtime $O( m^3 n^{\frac{m}{2}+1} \varepsilon^{-2} \mathrm{polylog}(m,n,\varepsilon^{-1}))$. This algorithm works with the linear programming dual of the MOT problem, and does not return a coupling. We also give a quantum multimarginal Sinkhorn algorithm for entropy-regularized MOT. This algorithm returns an implicit description of an approximately optimal coupling with runtime $O(m^8n^{\frac{m+1}{2}} \varepsilon^{-5} \mathrm{polylog}(m,n,\varepsilon^{-1})))$ after the usual reduction from entropic MOT to unregularized MOT. We also record query lower bounds: for any precision $\varepsilon<1/2$, randomized classical algorithms require $\Omega(n^m/(1+\varepsilon n))$ queries and quantum algorithms require $\Omega(\sqrt{n^m/(1+\varepsilon n)})$ queries.

Discussion (0). Continue with ORCID to comment.

Reference graph

Works this paper leans on

173 extracted references · 59 canonical work pages

  1. [1]

    2017 , publisher=

    First-order methods in optimization , author=. 2017 , publisher=

    2017

  2. [2]

    arXiv preprint quant-ph/0005055 , year=

    Quantum amplitude amplification and estimation , author=. arXiv preprint quant-ph/0005055 , year=

    arXiv

  3. [3]

    arXiv preprint arXiv:1603.08675 , year=

    Quantum recommendation systems , author=. arXiv preprint arXiv:1603.08675 , year=

    arXiv

  4. [4]

    Mathematische Annalen , volume=

    Markov-komposition und eine anwendung auf martingale , author=. Mathematische Annalen , volume=. 1972 , publisher=

    1972

  5. [5]

    , title =

    Strassen, V. , title =. The Annals of Mathematical Statistics , volume =

  6. [6]

    IEEE Access , volume=

    Dotmark--a benchmark for discrete optimal transport , author=. IEEE Access , volume=. 2016 , publisher=

    2016

  7. [7]

    Fernando G.S.L. Brand. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , editor =. 2019 , volume =

    2019

  8. [8]

    Journal of Machine Learning Research , volume=

    Pot: Python optimal transport , author=. Journal of Machine Learning Research , volume=

Show all 173 references
  1. [9]

    Quantum singular value transformation & its algorithmic applications , author=

  2. [10]

    arXiv preprint arXiv:2201.12324 , year=

    Optimal transport tools (ott): A jax toolbox for all things wasserstein , author=. arXiv preprint arXiv:2201.12324 , year=

    arXiv

  3. [11]

    A quantum view on convex optimization , author =

  4. [12]

    Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=

    Quantum singular value transformation and beyond: exponential improvements for quantum matrix arithmetics , author=. Proceedings of the 51st Annual ACM SIGACT Symposium on Theory of Computing , pages=

  5. [13]

    1983 , publisher=

    Problem complexity and method efficiency in optimization , author=. 1983 , publisher=

    1983

  6. [14]

    arXiv preprint quant-ph/9607014 , year=

    A quantum algorithm for finding the minimum , author=. arXiv preprint quant-ph/9607014 , year=

    arXiv

  7. [15]

    arXiv preprint arXiv:2503.17356 , year=

    Fast Convex Optimization with Quantum Gradient Methods , author=. arXiv preprint arXiv:2503.17356 , year=

    arXiv

  8. [16]

    In preparation , year=

    Sublinear quantum algorithms for optimal transport , author=. In preparation , year=

  9. [17]

    and Andersen, Knud D

    Andersen, Erling D. and Andersen, Knud D. , editor=. The. High Performance Optimization , pages=. 2000 , publisher=

    2000

  10. [18]

    Che, Charlie and Lin, Hanxuan and Yang, Yudong and Hu, Guofan and Fang, Lei , journal=

  11. [19]

    and Bernstein, Ethan and Brassard, Gilles and Vazirani, Umesh , title =

    Bennett, Charles H. and Bernstein, Ethan and Brassard, Gilles and Vazirani, Umesh , title =. SIAM Journal on Computing , volume =. 1997 , doi =. https://doi.org/10.1137/S0097539796300933 , abstract =

    1997 doi

  12. [20]

    Mathematical Programming , volume=

    Lower complexity bounds of first-order methods for convex-concave bilinear saddle-point problems , author=. Mathematical Programming , volume=

  13. [21]

    Physical Review A , volume=

    Grover’s quantum searching algorithm is optimal , author=. Physical Review A , volume=. 1999 , publisher=

    1999

  14. [22]

    Matrix exponentiated gradient updates for on-line learning and

    Tsuda, Koji and R. Matrix exponentiated gradient updates for on-line learning and. Journal of Machine Learning Research , volume=

  15. [23]

    Quantum , volume=

    Faster quantum and classical SDP approximations for quadratic binary optimization , author=. Quantum , volume=. 2022 , publisher=

    2022

  16. [24]

    SIAM Journal on Computing , volume=

    Quantum speedups for linear programming via interior point methods , author=. SIAM Journal on Computing , volume=

  17. [25]

    International Journal of Computer Vision , volume=

    The earth mover's distance as a metric for image retrieval , author=. International Journal of Computer Vision , volume=. 2000 , publisher=

    2000

  18. [26]

    Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1 , pages =

    Mueller, Jonas and Jaakkola, Tommi , title =. Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1 , pages =. 2015 , publisher =

    2015

  19. [27]

    Machine Learning , volume=

    Wasserstein discriminant analysis , author=. Machine Learning , volume=. 2018 , publisher=

    2018

  20. [28]

    Panaretos and Yoav Zemel , journal =

    Victor M. Panaretos and Yoav Zemel , journal =. AMPLITUDE AND PHASE VARIATION OF POINT PROCESSES , urldate =

  21. [29]

    ACM Transactions on Graphics (ToG) , volume=

    Solomon, Justin and De Goes, Fernando and Peyr. ACM Transactions on Graphics (ToG) , volume=. 2015 , publisher=

    2015

  22. [30]

    Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1 , pages =

    Lloyd, James Robert and Ghahramani, Zoubin , title =. Proceedings of the 29th International Conference on Neural Information Processing Systems - Volume 1 , pages =. 2015 , publisher =

    2015

  23. [31]

    Proceedings of the 34th International Conference on Machine Learning , pages =

    Martin Arjovsky and Soumith Chintala and L. Proceedings of the 34th International Conference on Machine Learning , pages =. 2017 , editor =

    2017

  24. [32]

    Interpretable distribution features with maximum testing power , year =

    Jitkrittum, Wittawat and Szab\'. Interpretable distribution features with maximum testing power , year =. Proceedings of the 30th International Conference on Neural Information Processing Systems , pages =

  25. [33]

    Annales de l'Institut Henri Poincaré, Probabilités et Statistiques , doi =

    Bigot, Jérémie and Gouet, Raúl and Klein, Thierry and Lopez, Alfredo , year =. Annales de l'Institut Henri Poincaré, Probabilités et Statistiques , doi =

  26. [34]

    InterStat , volume=

    Testing for equal distributions in high dimension , author=. InterStat , volume=. 2004 , publisher=

    2004

  27. [35]

    Bonneel, Nicolas and Van De Panne, Michiel and Paris, Sylvain and Heidrich, Wolfgang , booktitle=

  28. [36]

    IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=

    Nonnegative matrix factorization with earth mover's distance metric for image analysis , author=. IEEE Transactions on Pattern Analysis and Machine Intelligence , volume=. 2011 , publisher=

    2011

  29. [37]

    Mathematical Programming , volume=

    Primal-dual subgradient methods for convex problems , author=. Mathematical Programming , volume=. 2009 , publisher=

    2009

  30. [38]

    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=

    Much faster algorithms for matrix scaling , author=. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , pages=. 2017 , organization=

    2017

  31. [39]

    Mathematical Programming , volume=

    Nearly linear-time packing and covering lp solvers: Achieving width-independence and-convergence , author=. Mathematical Programming , volume=. 2019 , publisher=

    2019

  32. [40]

    Advances in Neural Information Processing Systems , volume=

    Fast Zeroth-Order Convex Optimization with Quantum Gradient Methods , author=. Advances in Neural Information Processing Systems , volume=

  33. [41]

    and Madry, Aleksander and Tsipras, Dimitris and Vladu, Adrian , booktitle=

    Cohen, Michael B. and Madry, Aleksander and Tsipras, Dimitris and Vladu, Adrian , booktitle=. 2017 , organization=

    2017

  34. [42]

    Proceedings of the 31st International Conference on Neural Information Processing Systems , pages =

    Altschuler, Jason and Weed, Jonathan and Rigollet, Philippe , title =. Proceedings of the 31st International Conference on Neural Information Processing Systems , pages =. 2017 , isbn =

    2017

  35. [43]

    arXiv preprint arXiv:1812.11104 , year=

    Entropic approximation for multi-dimensional martingale optimal transport , author=. arXiv preprint arXiv:1812.11104 , year=

    arXiv

  36. [44]

    Advances in Neural Information Processing Systems , volume=

    Practical large-scale linear programming using primal-dual hybrid gradient , author=. Advances in Neural Information Processing Systems , volume=

  37. [45]

    Mathematical Programming , volume=

    Faster first-order primal-dual methods for linear programming using restarts and sharpness , author=. Mathematical Programming , volume=. 2023 , publisher=

    2023

  38. [46]

    Journal of Mathematical Imaging and Vision , volume=

    A first-order primal-dual algorithm for convex problems with applications to imaging , author=. Journal of Mathematical Imaging and Vision , volume=. 2011 , publisher=

    2011

  39. [47]

    SIAM Journal on Financial Mathematics , volume=

    Robust pricing and hedging of options on multiple assets and its numerics , author=. SIAM Journal on Financial Mathematics , volume=. 2021 , publisher=

    2021

  40. [48]

    Guerrero, Julio and Orlando, Giuseppe , journal=

  41. [49]

    Calibration of local‐stochastic volatility models by optimal transport , volume =

    Guo, Ivan and Loeper, Grégoire and Wang, Shiyi , year =. Calibration of local‐stochastic volatility models by optimal transport , volume =. Mathematical Finance , publisher =. doi:10.1111/mafi.12335 , number =

    doi

  42. [51]

    Mathematical Finance , volume=

    Calibration of local-stochastic volatility models by optimal transport , author=. Mathematical Finance , volume=. 2022 , publisher=

    2022

  43. [52]

    Available at SSRN 4248643 , year=

    Polynomial Chaos Expansion Efficient Evaluation and Estimation of Computational Models , author=. Available at SSRN 4248643 , year=

  44. [53]

    Choi, Jaehyuk , journal=

  45. [54]

    International Journal of Theoretical and Applied Finance , volume=

    Automated option pricing: Numerical methods , author=. International Journal of Theoretical and Applied Finance , volume=. 2013 , publisher=

    2013

  46. [55]

    Lu, Haihao and Yang, Jinwen , journal=

  47. [56]

    Foundations and Trends

    Computational optimal transport: With applications to data science , author=. Foundations and Trends. 2019 , publisher=

    2019

  48. [57]

    Bulletin de l’institut International de Statistique , volume=

    Multiple classifications in social accounting , author=. Bulletin de l’institut International de Statistique , volume=

  49. [58]

    arXiv preprint arXiv:2210.16456 , year=

    Flows, scaling, and entropy revisited: a unified perspective via optimizing joint distributions , author=. arXiv preprint arXiv:2210.16456 , year=

    arXiv

  50. [59]

    Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

    A deterministic linear program solver in current matrix multiplication time , author=. Proceedings of the Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=. 2020 , organization=

    2020

  51. [60]

    2018 , editor =

    Dvurechensky, Pavel and Gasnikov, Alexander and Kroshnin, Alexey , booktitle =. 2018 , editor =

    2018

  52. [61]

    Theory of Computing, 8(6) 121-164 , year=

    The Multiplicative weights method: a meta-algorithm and its applications , author=. Theory of Computing, 8(6) 121-164 , year=

  53. [62]

    Journal of the ACM (JACM) , volume=

    A combinatorial, primal-dual approach to semidefinite programs , author=. Journal of the ACM (JACM) , volume=. 2016 , publisher=

    2016

  54. [63]

    Guyon, Julien , journal=

  55. [64]

    2024 , publisher=

    Guyon, Julien , journal=. 2024 , publisher=

    2024

  56. [65]

    2006 , publisher=

    Efficient algorithms for online convex optimization and their applications , author=. 2006 , publisher=

    2006

  57. [66]

    Foundations and Trends

    Introduction to online convex optimization , author=. Foundations and Trends. 2016 , publisher=

    2016

  58. [67]

    Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing , pages=

    A deterministic strongly polynomial algorithm for matrix scaling and approximate permanents , author=. Proceedings of the Thirtieth Annual ACM Symposium on Theory of Computing , pages=

  59. [68]

    2024 , school=

    Classical and quantum algorithms for scaling problems , author=. 2024 , school=

    2024

  60. [69]

    Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2 , pages =

    Cuturi, Marco , title =. Proceedings of the 27th International Conference on Neural Information Processing Systems - Volume 2 , pages =. 2013 , publisher =

    2013

  61. [70]

    , title =

    Lin, Tianyi and Ho, Nhat and Cuturi, Marco and Jordan, Michael I. , title =. Journal of Machine Learning Research , month =. 2022 , issue_date =

    2022

  62. [71]

    arXiv preprint arXiv:2406.09959 , year=

    Computation of Robust Option Prices via Structured Multi-Marginal Martingale Optimal Transport , author=. arXiv preprint arXiv:2406.09959 , year=

    arXiv

  63. [72]

    Foundations of Modern Probability , ISBN =

    Kallenberg, Olav , year =. Foundations of Modern Probability , ISBN =. doi:10.1007/978-3-030-61871-1 , journal =

    doi

  64. [73]

    On the translocation of masses , author=. Dokl. Akad. Nauk. USSR (NS) , volume=

  65. [74]

    and Akritas, Evgenia K

    Akritas, Alkiviadis G. and Akritas, Evgenia K. and Malaschonok, Genadii I. , year =. Mathematics and Computers in Simulation , publisher =. doi:10.1016/s0378-4754(96)00035-3 , number =

    doi

  66. [75]

    arXiv preprint arXiv:2309.03988 , year=

    Worst-case analysis of restarted primal-dual hybrid gradient on totally unimodular linear programs , author=. arXiv preprint arXiv:2309.03988 , year=

    arXiv

  67. [76]

    The power of block-encoded matrix powers: improved regression techniques via faster

    Shantanav Chakraborty and Andr. The power of block-encoded matrix powers: improved regression techniques via faster. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , pages =. 2019 , volume =

    2019

  68. [77]

    Proceedings of the 33rd International Conference on Neural Information Processing Systems , articleno =

    Carmon, Yair and Jin, Yujia and Sidford, Aaron and Tian, Kevin , title =. Proceedings of the 33rd International Conference on Neural Information Processing Systems , articleno =. 2019 , publisher =

    2019

  69. [78]

    Quantum , volume=

    Quantum algorithms and lower bounds for convex optimization , author=. Quantum , volume=. 2020 , publisher=

    2020

  70. [79]

    The annals of mathematical statistics , volume=

    A relationship between arbitrary positive matrices and doubly stochastic matrices , author=. The annals of mathematical statistics , volume=. 1964 , publisher=

    1964

  71. [80]

    Quantum , volume=

    Convex optimization using quantum oracles , author=. Quantum , volume=. 2020 , publisher=

    2020

  72. [81]

    48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) , pages =

    van Apeldoorn, Joran and Gribling, Sander and Li, Yinan and Nieuwboer, Harold and Walter, Michael and de Wolf, Ronald , title =. 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) , pages =. 2021 , volume =. doi:10.4230/LIPIcs.ICALP.2021.110 , annote =

    2021 doi

  73. [82]

    39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) , pages =

    Gribling, Sander and Nieuwboer, Harold , title =. 39th International Symposium on Theoretical Aspects of Computer Science (STACS 2022) , pages =. 2022 , volume =. doi:10.4230/LIPIcs.STACS.2022.35 , annote =

    2022 doi

  74. [83]

    On the ergodic convergence rates of a first-order primal–dual algorithm , volume =

    Chambolle, Antonin and Pock, Thomas , year =. On the ergodic convergence rates of a first-order primal–dual algorithm , volume =. Mathematical Programming , publisher =. doi:10.1007/s10107-015-0957-3 , number =

    doi

  75. [84]

    Quantum , volume=

    Hamiltonian simulation by qubitization , author=. Quantum , volume=. 2019 , publisher=

    2019

  76. [85]

    On the interlacing property for singular values and eigenvalues , journal =

    João Filipe Queiró , abstract =. On the interlacing property for singular values and eigenvalues , journal =. 1987 , issn =. doi:https://doi.org/10.1016/0024-3795(87)90136-4 , url =

    1987 doi

  77. [86]

    , volume=

    Wright, Stephen J. , volume=. Primal-. 1997 , publisher=

    1997

  78. [87]

    Journal of the ACM (JACM) , volume=

    Solving linear programs in the current matrix multiplication time , author=. Journal of the ACM (JACM) , volume=. 2021 , publisher=

    2021

  79. [88]

    Path finding methods for linear programming: Solving linear programs in

    Lee, Yin Tat and Sidford, Aaron , booktitle=. Path finding methods for linear programming: Solving linear programs in. 2014 , organization=

    2014

  80. [89]

    Mathematical Programming , volume=

    A polynomial time primal network simplex algorithm for minimum cost flows , author=. Mathematical Programming , volume=. 1997 , publisher=

    1997

  81. [90]

    , journal=

    Tarjan, Robert E. , journal=. 1997 , publisher=

    1997

  82. [91]

    2020 59th IEEE Conference on Decision and Control (CDC) , pages=

    Multimarginal optimal transport by accelerated alternating minimization , author=. 2020 59th IEEE Conference on Decision and Control (CDC) , pages=. 2020 , organization=

    2020

  83. [92]

    Meyer , journal =

    Carl D. Meyer , journal =. Generalized Inversion of Modified Matrices , urldate =

  84. [93]

    Towards optimal running times for optimal transport , journal =

    Jose Blanchet and Arun Jambulapati and Carson Kent and Aaron Sidford , keywords =. Towards optimal running times for optimal transport , journal =. 2024 , issn =. doi:https://doi.org/10.1016/j.orl.2023.11.007 , url =

    2024 doi

  85. [94]

    SIAM Journal on Financial Mathematics , volume =

    Guo, Ivan and Loeper, Gr\'. SIAM Journal on Financial Mathematics , volume =. 2022 , doi =. https://doi.org/10.1137/20M1375905 , abstract =

    2022 doi

  86. [95]

    and Spielman, Daniel A

    Daitch, Samuel I. and Spielman, Daniel A. , title =. 2008 , isbn =. doi:10.1145/1374376.1374441 , booktitle =

    2008

  87. [96]

    2003 , publisher=

    Combinatorial optimization: polyhedra and efficiency , author=. 2003 , publisher=

    2003

  88. [97]

    2019 , note=

    Quantum algorithms for zero-sum games , author=. 2019 , note=

    2019

  89. [98]

    Proceedings of the 40th International Conference on Machine Learning , articleno =

    Bouland, Adam and Getachew, Yosheb and Jin, Yujia and Sidford, Aaron and Tian, Kevin , title =. Proceedings of the 40th International Conference on Machine Learning , articleno =. 2023 , publisher =

    2023

  90. [99]

    Proceedings of the 37th International Conference on Neural Information Processing Systems , articleno =

    Gao, Minbo and Ji, Zhengfeng and Li, Tongyang and Wang, Qisheng , title =. Proceedings of the 37th International Conference on Neural Information Processing Systems , articleno =. 2023 , publisher =

    2023

  91. [100]

    Proceedings of the AAAI Conference on Artificial Intelligence , volume=

    Sublinear classical and quantum algorithms for general matrix games , author=. Proceedings of the AAAI Conference on Artificial Intelligence , volume=

  92. [101]

    Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=

    Optimizing quantum optimization algorithms via faster quantum gradient computation , author=. Proceedings of the Thirtieth Annual ACM-SIAM Symposium on Discrete Algorithms , pages=. 2019 , organization=

    2019

  93. [102]

    SIAM Journal on Optimization , volume=

    A spectral bundle method for semidefinite programming , author=. SIAM Journal on Optimization , volume=. 2000 , publisher=

    2000

  94. [103]

    Mathematical Programming , volume=

    Smooth minimization of non-smooth functions , author=. Mathematical Programming , volume=. 2005 , publisher=

    2005

  95. [104]

    Games and Economic Behavior , volume=

    Adaptive game playing using multiplicative weights , author=. Games and Economic Behavior , volume=. 1999 , publisher=

    1999

  96. [105]

    Journal of Computer and System Sciences , volume=

    A decision-theoretic generalization of on-line learning and an application to boosting , author=. Journal of Computer and System Sciences , volume=. 1997 , publisher=

    1997

  97. [106]

    , title =

    Bregman, Lev M. , title =. USSR Computational Mathematics and Mathematical Physics , volume =. 1967 , publisher=

    1967

  98. [107]

    Mathematical Programming , volume=

    Cyclic subgradient projections , author=. Mathematical Programming , volume=. 1982 , publisher=

    1982

  99. [108]

    Proceedings of the twelfth annual conference on Computational learning theory , pages=

    Additive models, boosting, and inference for generalized divergences , author=. Proceedings of the twelfth annual conference on Computational learning theory , pages=

  100. [109]

    arXiv preprint arXiv:1912.13213 , year=

    A modern introduction to online learning , author=. arXiv preprint arXiv:1912.13213 , year=

    1912 arXiv

  101. [110]

    Information and Computation , volume=

    Exponentiated gradient versus gradient descent for linear predictors , author=. Information and Computation , volume=. 1997 , publisher=

    1997

  102. [111]

    Proceedings of the twelfth Annual Conference on Computational Learning Theory , pages=

    Boosting as entropy projection , author=. Proceedings of the twelfth Annual Conference on Computational Learning Theory , pages=

  103. [112]

    Foundations and Trends

    Convex optimization: Algorithms and complexity , author=. Foundations and Trends. 2015 , publisher=

    2015

  104. [113]

    1999 , publisher=

    Convex analysis and variational problems , author=. 1999 , publisher=

    1999

  105. [114]

    , author=

    On general minimax theorems. , author=. Pacific Journal of Mathematics , volume=. 1958 , publisher=

    1958

  106. [115]

    Zur Theorie der Gesellschaftsspiele , url =

    Neumann, John von , journal =. Zur Theorie der Gesellschaftsspiele , url =

  107. [116]

    SIAM Journal on Optimization , volume=

    Prox-method with rate of convergence O (1/t) for variational inequalities with Lipschitz continuous monotone operators and smooth convex-concave saddle point problems , author=. SIAM Journal on Optimization , volume=. 2004 , publisher=

    2004

  108. [117]

    2012 , publisher=

    Handbook of Semidefinite Programming: Theory, Algorithms, and Applications , author=. 2012 , publisher=

    2012

  109. [118]

    2021 , publisher=

    Topics in optimal transportation , author=. 2021 , publisher=

    2021

  110. [119]

    Operations Research Letters , volume=

    A sublinear-time randomized approximation algorithm for matrix games , author=. Operations Research Letters , volume=. 1995 , publisher=

    1995

  111. [120]

    ESAIM: Control, Optimisation and Calculus of Variations , volume=

    An optimal matching problem , author=. ESAIM: Control, Optimisation and Calculus of Variations , volume=. 2005 , publisher=

    2005

  112. [121]

    Economic theory , volume=

    Matching for teams , author=. Economic theory , volume=. 2010 , publisher=

    2010

  113. [122]

    Probability Theory and Related Fields , volume=

    Martingale optimal transport and robust hedging in continuous time , author=. Probability Theory and Related Fields , volume=. 2014 , publisher=

    2014

  114. [123]

    ESAIM: Mathematical Modelling and Numerical Analysis , volume=

    Multi-marginal optimal transport: theory and applications , author=. ESAIM: Mathematical Modelling and Numerical Analysis , volume=

  115. [124]

    Gangbo and A

    W. Gangbo and A. Swiech , title =. Communications on Pure and Applied Mathematics , volume =

  116. [125]

    Pass , title =

    B. Pass , title =. ESAIM: Mathematical Modelling and Numerical Analysis , volume =

  117. [126]

    Topics in Optimal Transportation , publisher =

    Villani, C. Topics in Optimal Transportation , publisher =

  118. [127]

    Carlier and I

    G. Carlier and I. Ekeland , title =. Economic Theory , volume =

  119. [128]

    Seidl and P

    M. Seidl and P. Gori-Giorgi and A. Savi , title =. Physical Review A , volume =

  120. [129]

    Physical Review A , volume =

    Buttazzo, Giuseppe and Pascale, Luigi De and Gori-Giorgi, Paola , title =. Physical Review A , volume =

  121. [130]

    Communications on Pure and Applied Mathematics , volume =

    Cotar, Codina and Friesecke, Gero and Kl\"uppelberg, Claudia , title =. Communications on Pure and Applied Mathematics , volume =

  122. [131]

    C. B. Mendl and L. Lin , title =. Physical Review B , volume =

  123. [132]

    Brenier , title =

    Y. Brenier , title =. Journal of the American Mathematical Society , volume =

  124. [133]

    Brenier , title =

    Y. Brenier , title =. Communications on Pure and Applied Mathematics: A Journal Issued by the Courant Institute of Mathematical Sciences , volume =

  125. [134]

    Brenier , title =

    Y. Brenier , title =. Physica D: Nonlinear Phenomena , volume =

  126. [135]

    Dolinsky and M

    Y. Dolinsky and M. H. Soner , title =. Probability Theory and Related Fields , volume =

  127. [136]

    Galichon and P

    A. Galichon and P. Henry-Labordere and N. Touz , title =. The Annals of Applied Probability , volume =

  128. [137]

    Choi and M

    Y. Choi and M. Choi and M. Kim and J-W. Ha and S. Kim and J. Choo , title =. CVPR , pages =

  129. [138]

    Proceedings of the 33rd International Conference on Neural Information Processing Systems , articleno =

    Cao, Jiezhang and Mo, Langyuan and Zhang, Yifan and Jia, Kui and Shen, Chunhua and Tan, Mingkui , title =. Proceedings of the 33rd International Conference on Neural Information Processing Systems , articleno =. 2019 , publisher =

    2019

  130. [139]

    Mi and J

    L. Mi and J. Bento , title =. ArXiv Preprint: 2001.11114 , year =

    2001 arXiv

  131. [140]

    Hui and X

    L. Hui and X. Li and J. Chen and H. He and J. Yang , title =. ICPR , pages =

  132. [141]

    46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , pages =

    Joran van Apeldoorn and Andr. 46th International Colloquium on Automata, Languages, and Programming (ICALP 2019) , pages =. 2019 , volume =. doi:10.4230/LIPIcs.ICALP.2019.99 , annote =

    2019 doi

  133. [142]

    van Apeldoorn, Joran and Gily. Quantum. Quantum , volume=. 2020 , publisher=

    2020

  134. [143]

    2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , editor =

    Quantum speed-ups for solving semidefinite programs , author=. 2017 IEEE 58th Annual Symposium on Foundations of Computer Science (FOCS) , editor =. 2017 , organization=

    2017

  135. [144]

    He and W

    Z. He and W. Zuo and M. Kan and S. Shan and X. Chen , title =. IEEE Transactions on Image Processing , volume =

  136. [145]

    SIAM Journal on Mathematical Analysis , volume =

    Agueh, Martial and Carlier, Guillaume , title =. SIAM Journal on Mathematical Analysis , volume =. 2011 , doi =. https://doi.org/10.1137/100805741 , abstract =

    2011 doi

  137. [146]

    2014 , editor =

    Cuturi, Marco and Doucet, Arnaud , booktitle =. 2014 , editor =

    2014

  138. [147]

    SIAM Journal on Scientific Computing , volume =

    Benamou, Jean-David and Carlier, Guillaume and Cuturi, Marco and Nenna, Luca and Peyr\'. SIAM Journal on Scientific Computing , volume =. 2015 , doi =. https://doi.org/10.1137/141000439 , abstract =

    2015 doi

  139. [148]

    2022 , publisher=

    Apers, Simon and de Wolf, Ronald , journal=. 2022 , publisher=

    2022

  140. [149]

    ESAIM: Mathematical Modelling and Numerical Analysis , volume =

    Guillaume Carlier and Adam Oberman and Edouard Oudet , title =. ESAIM: Mathematical Modelling and Numerical Analysis , volume =

  141. [150]

    Dunson , title =

    Sanvesh Srivastava and Cheng Li and David B. Dunson , title =. Journal of Machine Learning Research , year =

  142. [151]

    Model-independent bounds for option prices—a mass transport approach , volume =

    Beiglb\". Model-independent bounds for option prices—a mass transport approach , volume =. Finance and Stochastics , publisher =. 2013 , month = apr, pages =. doi:10.1007/s00780-013-0205-8 , number =

    2013 doi

  143. [152]

    , year =

    Hobson, David G. , year =. Robust hedging of the lookback option , volume =. Finance and Stochastics , publisher =. doi:10.1007/s007800050044 , number =

    doi

  144. [153]

    Frédéric and Tan, Xiaolu , year =

    Bonnans, J. Frédéric and Tan, Xiaolu , year =. A Model-Free No-arbitrage Price Bound for Variance Options , volume =. Applied Mathematics & Optimization , publisher =. doi:10.1007/s00245-013-9197-1 , number =

    doi

  145. [154]

    Brown, Haydyn and Hobson, David and Rogers, L. C. G. , year =. Robust Hedging of Barrier Options , volume =. Mathematical Finance , publisher =. doi:10.1111/1467-9965.00116 , number =

  146. [155]

    Computational methods for martingale optimal transport problems , volume =

    Guo, Gaoyue and Obłój, Jan , year =. Computational methods for martingale optimal transport problems , volume =. The Annals of Applied Probability , publisher =. doi:10.1214/19-aap1481 , number =

    doi

  147. [156]

    Martingale optimal transport duality , volume =

    Cheridito, Patrick and Kiiski, Matti and Pr\". Martingale optimal transport duality , volume =. Mathematische Annalen , publisher =. 2020 , month = jan, pages =. doi:10.1007/s00208-019-01952-y , number =

    2020 doi

  148. [157]

    Complete duality for martingale optimal transport on the line , volume =

    Beiglb\". Complete duality for martingale optimal transport on the line , volume =. The Annals of Probability , publisher =. doi:10.1214/16-aop1131 , number =

    doi

  149. [158]

    Dual attainment for the martingale transport problem , volume =

    Beiglb\". Dual attainment for the martingale transport problem , volume =. Bernoulli , publisher =. doi:10.3150/17-bej1015 , number =

    doi

  150. [159]

    Computation of Optimal Transport and Related Hedging Problems via Penalization and Neural Networks , volume =

    Eckstein, Stephan and Kupper, Michael , year =. Computation of Optimal Transport and Related Hedging Problems via Penalization and Neural Networks , volume =. Applied Mathematics &; Optimization , publisher =. doi:10.1007/s00245-019-09558-1 , number =

    doi

  151. [160]

    Geometry of vectorial martingale optimal transportations and duality , volume =

    Lim, Tongseok , year =. Geometry of vectorial martingale optimal transportations and duality , volume =. Mathematical Programming , publisher =. doi:10.1007/s10107-023-01954-4 , number =

    doi

  152. [161]

    Mathematical Finance , volume=

    Cuchiero, Christa and Gazzani, Guido and M. Mathematical Finance , volume=. 2025 , publisher=

    2025

  153. [162]

    De March, Hadrien and Henry-Labordere, Pierre , journal=

  154. [163]

    2006 , publisher=

    Carr, Peter and Wu, Liuren , journal=. 2006 , publisher=

    2006

  155. [164]

    2018 , publisher=

    Jacquier, Antoine and Martini, Claude and Muguruza, Aitor , journal=. 2018 , publisher=

    2018

  156. [165]

    2020 , publisher=

    Guyon, Julien , journal=. 2020 , publisher=

    2020

  157. [166]

    Mathematical Finance: An International Journal of Mathematics, Statistics and Financial Economics , volume=

    A consistent pricing model for index options and volatility derivatives , author=. Mathematical Finance: An International Journal of Mathematics, Statistics and Financial Economics , volume=. 2013 , publisher=

    2013

  158. [167]

    2014 , publisher=

    Baldeaux, Jan and Badran, Alexander , journal=. 2014 , publisher=

    2014

  159. [168]

    2014 , publisher=

    Papanicolaou, Andrew and Sircar, Ronnie , journal=. 2014 , publisher=

    2014

  160. [169]

    Commodities , pages=

    Volatility is rough , author=. Commodities , pages=. 2022 , publisher=

    2022

  161. [170]

    Risk , year =

    Guyon, Julien and Mustapha, Samir , title =. Risk , year =

  162. [171]

    2017 , publisher=

    Guyon, Julien and Menegaux, Romain and Nutz, Marcel , journal=. 2017 , publisher=

    2017

  163. [172]

    2025 , publisher=

    Jacquier, Antoine and Muguruza, Aitor and Pannier, Alexandre , journal=. 2025 , publisher=

    2025

  164. [173]

    2020 , month=

    Gatheral, Jim and Jusselin, Paul and Rosenbaum, Mathieu , journal=. 2020 , month=

    2020

  165. [174]

    2025 , publisher=

    Abi Jaber, Eduardo and Illand, Camille and Li, Shaun , journal=. 2025 , publisher=

    2025

Pith tools

Reviewed August 11, 2026 · model on record in the stance chip above.