Distribution Steering via Sliced Optimal Transport Control

• URL: http://arxiv.org/abs/2608.12828v1
• Date: Thu, 13 Aug 2026 05:00:59 GMT
• Title: Distribution Steering via Sliced Optimal Transport Control
• Abstract summary: Distribution steering seeks feedback laws that drive the state law of a system between prescribed initial and terminal distributions.<n>We develop a finite-horizon control framework based on sliced optimal transport.<n>We prove that the randomized controller converges to the averaged sliced flow as the sampling period vanishes.
• Score: 2.1485350418225244
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Distribution steering seeks feedback laws that drive the state law of a dynamical system between prescribed initial and terminal distributions. Optimal transport provides a natural geometric approach, but its implementation generally requires a transport map or coupling in the full state space. Sliced optimal transport avoids this full-dimensional construction through one-dimensional projections. Yet, the resulting projected maps specify only directional displacements and do not by themselves prescribe a realizable feedback law. To this end, we develop a finite-horizon control framework based on sliced optimal transport. At each sampling instant, a projected optimal transport map defines a directional terminal condition, whose minimum-energy realization yields a randomized single-direction controller. Averaging over projection directions gives a deterministic sliced feedback. For the single-integrator dynamics, the averaged feedback makes the sliced Wasserstein distance to the target non-increasing. For Gaussian endpoint laws, it is affine, preserves Gaussianity, and steers the mean and covariance to their prescribed terminal values. We further identify a law-dependent gain that yields linear decay of the sliced Wasserstein distance together with an explicit characterization of the control energy. We also prove that the randomized controller converges to the averaged sliced flow as the sampling period vanishes. Finally, we extend the construction to linear dynamical systems. Reachability-normalized coordinates allow instantaneous realization of the sliced velocity for uniformly fully actuated systems, while local controllability Gramians provide exact finite-step realization for general controllable systems. Numerical examples illustrate the resulting distributional flows.

Related papers

• Coupled Optimal Transport with Landmark Constraints [64.98367856457412]
  An optimal transport (OT) model seeks a map or plan between distributions by minimizing a prescribed transport cost or distortion.<n>This paper proposes a novel coupled OT framework that leverages a small number of annotated landmarks to guide the recovery of an underlying deformation.<n>The proposed framework provides a principled connection between landmark-based registration and transport-based distribution matching.
  arXiv  Detail & Related papers  (2026-08-20T08:28:13Z)
• Beckmann Transport Models: From Autonomous Flows to One-Step Maps [47.88178310873025]
  We propose an instantiation of flow matching that relies on a time-independent velocity field to map between two distributions.<n>We also show that the one-step generative map associated with this flow is the unique solution of a simple conservation equation.
  arXiv  Detail & Related papers  (2026-08-03T04:45:52Z)
• Reward Transport: Property Control in Flow Matching via Noise-Space Alignment [30.541631728490202]
  We show that coupling in flow matching can embed controllable structure directly into the learned flow field.<n>We introduce Reward Transport, which uses optimal transport coupling at training time to align a scalar noise-space coordinate with molecular rewards.<n> Empirically, on ZINC-250K and Guaca, sweeping the scalar induces monotone control of logP and consistent QED control over its operating range.
  arXiv  Detail & Related papers  (2026-06-13T00:17:15Z)
• Self-Consistent Generative Paths via Admissible Random Variational Transport [14.74009385288423]
  We study a complementary question: when is a generated probability path self-consistent?<n>We define a self-consistent generative path as a random fixed point of admissible local variational transport corrections.<n>The resulting theory turns endpoint matching into path self-consistency testing.
  arXiv  Detail & Related papers  (2026-06-08T02:56:06Z)
• Learning Direct Control Policies with Flow Matching for Autonomous Driving [32.505127447635864]
  Flow-matching planner for autonomous driving generates actionable trajectories defined by acceleration and curvature.<n>Model is conditioned on a bird's-eye-view (BEV) control profiles of the surrounding scene.<n>We train exclusively on urban scenarios collected from a 2D traffic simulator with reactive agents.
  arXiv  Detail & Related papers  (2026-05-14T13:37:48Z)
• Sliced Wasserstein Steering between Gaussian Measures [2.1485350418225244]
  We develop a sliced feedback controller for distribution steering.<n>The evolving law is projected onto one-dimensional directions on the sphere.<n>We show that the developed controller steers the law to the prescribed target.
  arXiv  Detail & Related papers  (2026-04-14T08:03:17Z)
• An Eulerian Perspective on Straight-Line Sampling [0.0]
  We study dynamic measure transport for generative modeling, specifically, flows induced by processes that bridge a specified source and target distribution.<n>We ask emphwhich processes produce straight-line flows -- i.e., flows whose pointwise acceleration vanishes and thus are exactly integrable with a first-order method?<n>We provide a concise PDE characterization of straightness as a balance between conditional acceleration and the divergence of a weighted covariance (Reynolds) tensor.
  arXiv  Detail & Related papers  (2025-10-13T17:33:58Z)
• Normalizing flows as approximations of optimal transport maps via linear-control neural ODEs [49.1574468325115]
  We consider the problem of recovering the $Wimat$-optimal transport map T between absolutely continuous measures $mu,nuinmathcalP(mathbbRn)$ as the flow of a linear-control neural ODE.
  arXiv  Detail & Related papers  (2023-11-02T17:17:03Z)
• Adaptive Annealed Importance Sampling with Constant Rate Progress [68.8204255655161]
  Annealed Importance Sampling (AIS) synthesizes weighted samples from an intractable distribution. We propose the Constant Rate AIS algorithm and its efficient implementation for $alpha$-divergences.
  arXiv  Detail & Related papers  (2023-06-27T08:15:28Z)
• Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
  We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
  arXiv  Detail & Related papers  (2022-06-29T22:19:03Z)
• Variational Transport: A Convergent Particle-BasedAlgorithm for Distributional Optimization [106.70006655990176]
  A distributional optimization problem arises widely in machine learning and statistics. We propose a novel particle-based algorithm, dubbed as variational transport, which approximately performs Wasserstein gradient descent. We prove that when the objective function satisfies a functional version of the Polyak-Lojasiewicz (PL) (Polyak, 1963) and smoothness conditions, variational transport converges linearly.
  arXiv  Detail & Related papers  (2020-12-21T18:33:13Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.