Optimal Transport Protocol Overview

• Optimal Transport Protocol is a systematic framework defining how mass or probability is moved between endpoints while minimizing a cost under explicit geometric, thermodynamic, or statistical constraints.
• It spans diverse methodologies including deterministic maps, couplings, stochastic paths, and learned transport maps, applicable in thermodynamic control, networked resource allocation, and machine learning.
• Case studies illustrate its use in minimizing excess work in finite-time systems, distributed negotiation over networks, and adaptive particle-based approximations to balance endpoint matching with optimal path planning.

An optimal transport protocol is a prescribed procedure for moving mass, probability, or resources between specified endpoints while minimizing a cost compatible with the admissible dynamics. Across the literature, the protocol may be realized as a transport map, a coupling, a path in probability space, a control law on a thermodynamic manifold, a distributed negotiation scheme over a network, or a learned stochastic map; the optimized quantity may be transport cost, excess work, entropy production, drift effort, or a task-specific objective (Moradi, 8 Jan 2025). In this broad sense, the term does not denote a single canonical algorithm. It denotes a structured prescription for how transport is carried out, under explicit geometric, statistical, or physical constraints (Zhong et al., 2024).

1. Conceptual scope and mathematical foundations

At the most classical level, optimal transport is posed either in Monge form, through a measurable map $T$ satisfying $T_{\#}\mathbb P=\mathbb Q$, or in Kantorovich form, through a coupling or transport plan $P$ satisfying prescribed marginals. A standard discrete formulation is

$$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$

with cost matrix $C_{ij}=c(x_i,y_j)$ and coupling polytope $U(a,b)$ (Moradi, 8 Jan 2025). The corresponding dual problem introduces Kantorovich potentials and complementary slackness, so the protocol can be described equivalently by primal couplings or by dual potentials (Moradi, 8 Jan 2025).

In dynamic settings, the protocol is a path rather than a static coupling. For two densities $\rho_A,\rho_B$ on $\mathbb R^d$, the Benamou–Brenier representation writes

$$\mathcal W_2^2[\rho_A,\rho_B] = \min_{\rho_s,\phi_s} \left\{ \int_0^1\!\!\int \rho_s(x)\,|\nabla\phi_s(x)|^2\,dx\,ds \ \middle|\ \frac{\partial \rho_s}{\partial s}=\nabla\cdot(\rho_s\nabla\phi_s),\ \rho_0=\rho_A,\ \rho_1=\rho_B \right\},$$

so the protocol is the pair $(\rho_s,\phi_s)$ or, equivalently, the density path and its gradient velocity field (Zhong et al., 2024). In overdamped diffusion, the same continuity-equation structure appears in stochastic thermodynamics, where the local mean velocity $T_{\#}\mathbb P=\mathbb Q$0 or scalar potential $T_{\#}\mathbb P=\mathbb Q$1 determines the evolution of the density (Walker et al., 2023).

This common structure explains why the phrase “optimal transport protocol” appears in otherwise different literatures. In some works it is a finite-time driving protocol $T_{\#}\mathbb P=\mathbb Q$2 for a Brownian system; in others it is a distributed transport law for agents, a sequence of ADMM negotiations over network edges, or a learned stochastic transport map $T_{\#}\mathbb P=\mathbb Q$3 (Zhong et al., 2024). Taken together, these usages suggest that the essential object is not the formalism itself, but the rule that realizes endpoint matching while optimizing a cost on admissible trajectories.

2. Thermodynamic and finite-time minimum-work protocols

A prominent usage of the term arises in stochastic thermodynamics. For overdamped Langevin dynamics with control parameters $T_{\#}\mathbb P=\mathbb Q$4, the finite-time objective is the work

$T_{\#}\mathbb P=\mathbb Q$5

or, more commonly, the excess work $T_{\#}\mathbb P=\mathbb Q$6 (Zhong et al., 2024). In the slow-driving regime,

$T_{\#}\mathbb P=\mathbb Q$7

where $T_{\#}\mathbb P=\mathbb Q$8 is the friction tensor. Geodesics of this metric minimize the quadratic action and yield the standard thermodynamic-geometry result $T_{\#}\mathbb P=\mathbb Q$9 for large $P$0 (Zhong et al., 2024).

The central claim of “Beyond Linear Response: Equivalence between Thermodynamic Geometry and Optimal Transport” is stronger than a perturbative analogy. For overdamped Langevin dynamics in arbitrary dimension, the friction metric is exactly the pullback of the $P$1-Wasserstein metric to the equilibrium submanifold

$P$2

so thermodynamic geometry and optimal transport geometry have the same line element, geodesics, and geodesic distances on that submanifold (Zhong et al., 2024). With exact endpoint equilibration, the finite-time minimum-work problem is equivalent to optimal transport between $P$3 and $P$4, and the exact protocol takes the form

$P$5

The first term encodes the equilibrium path; the second is a counterdiabatic forcing that makes the density follow that path in finite time (Zhong et al., 2024).

Beyond linear response, the paper proposes a control-space representation of the exact correction: $P$6 where $P$7 is the friction metric and $P$8 is the Fisher information metric (Zhong et al., 2024). This geodesic-counterdiabatic protocol is exact for harmonic potentials, reproduces non-monotonic optimal protocols in a linearly biased double well, and explains discontinuous jumps at $P$9 and $$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$0 as switching of the counterdiabatic component rather than as mysterious singularities (Zhong et al., 2024). A common misconception is therefore that the thermodynamic geodesic alone remains exact at finite speed; the paper shows that finite-time optimality generally requires the additional Fisher-metric-mediated term (Zhong et al., 2024).

The same finite-time viewpoint was realized experimentally with optically trapped microparticles. There, the dissipated work

$$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$1

obeys

$$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$2

and the experiment achieved this bound for thermodynamically optimal transport, including finite-time information erasure where the excess dissipation beyond the Landauer bound is exactly determined by the Wasserstein distance (Oikawa et al., 3 Mar 2025). The protocol is constructed by prescribing $$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$3 and $$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$4, building the Wasserstein geodesic by monotone rearrangement and displacement interpolation, reconstructing the time-dependent potential from the Fokker–Planck equation, and implementing that potential with scanning optical tweezers (Oikawa et al., 3 Mar 2025).

A related finite-time control problem appears for an active colloidal particle near a no-slip wall. There, the protocol is an open-loop trap-center trajectory $$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$5 parameterized by Chebyshev polynomials and optimized by a genetic algorithm. The method recovers the bulk Schmiedl–Seifert optimum in the limits of zero activity and infinite wall separation, but near the wall it shows that the boundary breaks the time-reversal symmetry of the optimal protocol found in bulk solutions (Maurya et al., 18 Mar 2026). This result indicates that environment-specific hydrodynamic structure can qualitatively reshape finite-time optimal transport protocols even when the objective remains minimum mean work (Maurya et al., 18 Mar 2026).

3. Entropy production, stochastic transport, and anomalous relaxation

In another thermodynamic usage, an optimal transport protocol is the admissible controlled dynamics that minimizes entropy production over a finite time. For an overdamped Brownian particle on a potential landscape, the continuity equation

$$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$6

and the cost

$$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$7

lead to the Benamou–Brenier statement

$$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$8

so minimal entropy production is the transport criterion in the continuous diffusive setting (Walker et al., 2023).

“Optimal transport and anomalous thermal relaxations” uses this structure to compare resource-efficient transport with Mpemba-like fast relaxation. In the continuous case, the key relation

$$\min_{P} \left\{ \langle C, P \rangle : P1_m = a,\ P^\top1_n = b,\ P \in \mathbb{R}_+^{n \times m} \right\},$$9

implies that a trajectory that is closer to equilibrium at large but finite $C_{ij}=c(x_i,y_j)$0 has generally dissipated more entropy by that time, not less (Walker et al., 2023). The paper therefore concludes that, for overdamped diffusion with fixed endpoint potentials and sufficiently large finite times, Strong Mpemba and optimal transport generically do not coincide (Walker et al., 2023). In a three-state fully connected Markov jump system, by contrast, the flow cost $C_{ij}=c(x_i,y_j)$1 can be minimized at the same protocol parameter $C_{ij}=c(x_i,y_j)$2 that produces the Strong Mpemba effect, so fast relaxation and optimal transport can coincide in the discrete case (Walker et al., 2023). A recurrent misconception is accordingly that faster relaxation is automatically more transport-efficient; this literature shows that the answer depends strongly on the system class (Walker et al., 2023).

A different stochastic transport protocol appears in Guided Harmonic Path-Integral Diffusion. There, the protocol is a low-dimensional guidance process

$C_{ij}=c(x_i,y_j)$3

which specifies a moving harmonic potential

$C_{ij}=c(x_i,y_j)$4

inside a linearly solvable stochastic optimal transport problem with hard terminal law $C_{ij}=c(x_i,y_j)$5 and soft path cost

$C_{ij}=c(x_i,y_j)$6

The protocol shapes trajectory geometry while preserving exact endpoint matching, and the optimal drift is obtained analytically from forward and backward Green functions (Chertkov, 5 Dec 2025). In this setting, “optimal transport protocol” refers not to a single transport plan, but to a learnable centerline-and-stiffness law that governs a family of stochastic trajectories under exact terminal constraints (Chertkov, 5 Dec 2025).

4. Distributed, networked, and propagation-based protocols

In multi-agent and networked settings, the protocol is often a distributed procedure rather than a single closed-form map. “Distributed Online Optimization for Multi-Agent Optimal Transport” defines a two-stage transport protocol: distributed online primal–dual estimation of the Kantorovich potential from the current collective distribution to the target distribution, followed by a proximal transport update in which each agent moves a bounded distance along the optimal transport geodesic implied by that potential (Krishnan et al., 2018). At the measure level, the stagewise law

$C_{ij}=c(x_i,y_j)$7

drives $C_{ij}=c(x_i,y_j)$8 weakly to $C_{ij}=c(x_i,y_j)$9, while the finite-agent implementation replaces the continuum dual by a graph-restricted primal–dual problem over Voronoi neighbors (Krishnan et al., 2018). The protocol is therefore explicitly recursive, online, and local.

A distinct network formulation appears in “Fair and Distributed Dynamic Optimal Transport for Resource Allocation over Networks.” There the transport variables are multi-period edge flows $U(a,b)$0 on a bipartite supplier–receiver graph, and fairness is added through

$U(a,b)$1

with proportional-fairness choice

$U(a,b)$2

The resulting problem is solved by a fully distributed ADMM negotiation protocol in which each target computes a local fair allocation proposal, each source computes a local utility-cost proposal, and each edge updates a consensus shipment by averaging the two proposals (Hughes et al., 2021). In this usage, an optimal transport protocol is an iterative bargaining mechanism whose convergence reproduces the centralized fair optimum under the paper’s convexity assumptions (Hughes et al., 2021).

“Label Propagation Through Optimal Transport” broadens the meaning further. Its Optimal Transport Propagation (OTP) method constructs a complete bipartite edge-weighted graph between labeled and unlabeled samples from an entropic OT coupling, normalizes that coupling into an affinity matrix, converts the edge weights into class probabilities, and incrementally enlarges the labeled set using an entropy-based certainty score

$U(a,b)$3

The protocol repeats OT computation, certainty filtering, pseudo-label acceptance, and relabeling until $U(a,b)$4 (Hamri et al., 2021). Here, the transport plan is not merely a similarity measure; it is the propagation medium itself (Hamri et al., 2021).

5. Learned, particle-based, and structured approximations

Several recent works use “optimal transport protocol” for learned or approximate procedures that avoid direct high-dimensional OT solvers. Neural Optimal Transport parameterizes a general transport plan by a stochastic map

$U(a,b)$5

and optimizes the saddle objective

$U(a,b)$6

with strong and weak transport costs handled in the same framework (Korotin et al., 2022). The associated protocol is the alternating update of a potential network $U(a,b)$7 and a mapping network $U(a,b)$8, where the target marginal is enforced implicitly through the OT dual rather than by a soft penalty (Korotin et al., 2022). The paper’s universal approximation theorem for stochastic transport maps makes this a protocol for learning plans, not only deterministic Monge maps (Korotin et al., 2022).

Adaptive Optimal Transport is sample-based and adversarial. It minimizes the KL divergence between the transported source law and the target law through a minimax problem

$U(a,b)$9

with the transport map constrained to Brenier form $\rho_A,\rho_B$0 (Essid et al., 2018). Rather than solve one global problem directly, it composes simple local maps between intermediate distributions linked by displacement interpolation. This produces a local-to-global transport protocol in which adaptive Gaussian features in $\rho_A,\rho_B$1 detect where the pushforward condition fails, while local terms in $\rho_A,\rho_B$2 repair the mismatch (Essid et al., 2018).

“Approximating the Optimal Transport Plan via Particle-Evolving Method” takes a different route. It replaces hard marginal constraints by KL penalties,

$\rho_A,\rho_B$3

derives the Wasserstein gradient flow of this constrained entropy transport problem, and realizes the flow as an interacting particle system whose empirical measure approximates the coupling (Liu et al., 2021). The particle update combines transport-cost descent with KDE-based approximations of $\rho_A,\rho_B$4 and $\rho_A,\rho_B$5, so the protocol is directly defined on samples from the joint plan rather than on a discretized ambient grid (Liu et al., 2021).

Two other structured approximations constrain the transport architecture itself. “Making transport more robust and interpretable by moving data through a small number of anchor points” factorizes the coupling through source anchors, target anchors, and an anchor-to-anchor plan,

$\rho_A,\rho_B$6

thereby inducing a low-rank, multi-step transport protocol with improved robustness and interpretability (Lin et al., 2020). “Efficient Transferable Optimal Transport via Min-Sliced Transport Plans” instead learns a slicer $\rho_A,\rho_B$7 and solves

$\rho_A,\rho_B$8

so that one-dimensional OT along the optimized slice induces a conditional transport plan in ambient space (Liu et al., 24 Nov 2025). The paper’s transferability theorem shows that, under small Wasserstein perturbations of the source and target distributions, optimal slicers remain close, supporting warm-start transfer and amortized one-shot matching (Liu et al., 24 Nov 2025).

6. Specialized machine-learning protocols and recurrent themes

In machine learning, the term can denote an end-to-end training framework rather than a physical transport law. PROTOCOL—PaRtial Optimal TranspOrt-enhanced COntrastive Learning—reformulates imbalanced multi-view clustering as a partial OT self-labeling problem with progressive transported mass $\rho_A,\rho_B$9, a virtual cluster for unassigned mass, and weighted KL regularization of cluster marginals (Xue et al., 14 Jun 2025). Its core objective is

$\mathbb R^d$0

with only a fraction of total mass confidently assigned early in training and that fraction increased over time (Xue et al., 14 Jun 2025). The resulting POT labels feed into feature-level logit adjustment and class-level class-sensitive contrastive learning, so the protocol combines partial transport, pseudo-labeling, and representation rebalancing in a single training loop (Xue et al., 14 Jun 2025).

Across these literatures, several recurring themes emerge. First, endpoint matching and path optimality are distinct: some protocols enforce the final law exactly and optimize the path subject to that hard constraint, while others relax marginal constraints and recover exact OT only asymptotically or approximately (Chertkov, 5 Dec 2025). Second, “optimal” depends on the chosen cost functional: minimum transport cost, minimum excess work, minimum entropy production, minimum flow cost, or minimum integrated guide cost are not interchangeable objectives (Walker et al., 2023). Third, the protocol may live in very different spaces—configuration space, probability space, control space, graph space, or representation space—even when the underlying geometric language is Wasserstein or OT-based (Krishnan et al., 2018).

A plausible implication is that “optimal transport protocol” is best understood as a family of problem-dependent prescriptions unified by transport geometry rather than by a single algorithmic template. In thermodynamic control, it often means a geodesic or geodesic-counterdiabatic law on an equilibrium manifold (Zhong et al., 2024). In stochastic guidance, it may be a low-dimensional protocol $\mathbb R^d$1 shaping path ensembles under exact terminal matching (Chertkov, 5 Dec 2025). In distributed systems, it can be a negotiation or primal–dual update rule over local variables (Hughes et al., 2021). In modern machine learning, it may be a learned map, a factorized plan, a slice-selection rule, or a partial-assignment curriculum (Korotin et al., 2022). This plurality is not a terminological accident; it reflects the fact that OT supplies a geometry and a variational principle, while the protocol specifies how that principle is operationalized in a given domain.