Sharp Convergence Rates of Empirical Unbalanced Optimal Transport for Spatio-Temporal Point Processes

• URL: http://arxiv.org/abs/2509.04225v1
• Date: Thu, 04 Sep 2025 13:55:01 GMT
• Title: Sharp Convergence Rates of Empirical Unbalanced Optimal Transport for Spatio-Temporal Point Processes
• Abstract summary: We analyze empirical plug-in estimators for unbalanced optimal transport formalisms.<n>We find near minimax rate optimality of the empirical Kantorovich-Rubinstein distance.
• Score: 0.0
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: We statistically analyze empirical plug-in estimators for unbalanced optimal transport (UOT) formalisms, focusing on the Kantorovich-Rubinstein distance, between general intensity measures based on observations from spatio-temporal point processes. Specifically, we model the observations by two weakly time-stationary point processes with spatial intensity measures $\mu$ and $\nu$ over the expanding window $(0,t]$ as $t$ increases to infinity, and establish sharp convergence rates of the empirical UOT in terms of the intrinsic dimensions of the measures. We assume a sub-quadratic temporal growth condition of the variance of the process, which allows for a wide range of temporal dependencies. As the growth approaches quadratic, the convergence rate becomes slower. This variance assumption is related to the time-reduced factorial covariance measure, and we exemplify its validity for various point processes, including the Poisson cluster, Hawkes, Neyman-Scott, and log-Gaussian Cox processes. Complementary to our upper bounds, we also derive matching lower bounds for various spatio-temporal point processes of interest and establish near minimax rate optimality of the empirical Kantorovich-Rubinstein distance.

Related papers

• Uniform-in-time Propagation-of-Chaos for Stein Variational Gradient Descent [16.01291417072387]
  We study uniform-in-time propagation-of-chaos for continuous-time Stein Variational Gradient Descent flows.<n>For broad distributional metrics, we introduce a cutoff strategy which combines finite-time propagation-of-chaos estimates up to an $N$-dependent horizon.<n>We also develop a finite-dimensional theory for matrix-valued finite-rank kernels.
  arXiv  Detail & Related papers  (2026-06-30T20:27:39Z)
• Isotropic random walks and Brownian diffusion on complex projective space [0.0]
  We show that isotropic random walks on the complex projective space provide a canonical and analytically tractable-geometric framework for the exploration of quantum-state space.<n>The approach combines harmonic analysis on compact rank-one symmetric spaces with pure-state evolution and yields explicit analytical expressions for transition kernels, fidelity statistics, and geometric observables associated with the Fubini--Study metric.
  arXiv  Detail & Related papers  (2026-06-09T20:49:10Z)
• Robust Correlation-Induced Localization Under Time-Reversal Symmetry Breaking [0.0]
  We study Anderson localization in a one-dimensional disordered system with long-range correlated hopping decaying as $1/ra$ with complex hopping amplitudes.<n>We find analytically a corelation-induced algebraic localization that is robust to a finite strength of the time-reversal-symmetry-breaking parameter.
  arXiv  Detail & Related papers  (2026-04-02T17:58:41Z)
• Deriving Hyperparameter Scaling Laws via Modern Optimization Theory [55.63126290312615]
  We study modern first-order boundss for methods based on the Linear Minimization Oracle (LMO)<n>Treating bounds in recent literature as a proxy and minimizing them across different tuning regimes yields closed-form power-law schedules for learning rate, momentum, and batch size.<n>Our results draw particular attention to the interaction between momentum and batch-size scaling, suggesting that optimal performance may be achieved with several scaling strategies.
  arXiv  Detail & Related papers  (2026-03-16T22:21:27Z)
• Revisiting Zeroth-Order Optimization: Minimum-Variance Two-Point Estimators and Directionally Aligned Perturbations [57.179679246370114]
  We identify the distribution of random perturbations that minimizes the estimator's variance as the perturbation stepsize tends to zero.<n>Our findings reveal that such desired perturbations can align directionally with the true gradient, instead of maintaining a fixed length.
  arXiv  Detail & Related papers  (2025-10-22T19:06:39Z)
• Statistical guarantees for continuous-time policy evaluation: blessing of ellipticity and new tradeoffs [2.926192989090622]
  We study the estimation of the value function for continuous-time Markov diffusion processes.<n>Our work provides non-asymptotic statistical guarantees for the least-squares temporal-difference method.
  arXiv  Detail & Related papers  (2025-02-06T18:39:03Z)
• Bounds in Wasserstein Distance for Locally Stationary Processes [0.29771206318712146]
  We introduce a novel conditional probability distribution estimator specifically tailored for locally stationary (LSP) data.<n>We rigorously establish convergence rates for the NW-based conditional probability estimator under the Wasserstein metric.<n>We conduct extensive numerical simulations on synthetic datasets and provide empirical validations using real-world data.
  arXiv  Detail & Related papers  (2024-12-04T15:51:22Z)
• Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis [56.442307356162864]
  We study the theoretical aspects of score-based discrete diffusion models under the Continuous Time Markov Chain (CTMC) framework.<n>We introduce a discrete-time sampling algorithm in the general state space $[S]d$ that utilizes score estimators at predefined time points.<n>Our convergence analysis employs a Girsanov-based method and establishes key properties of the discrete score function.
  arXiv  Detail & Related papers  (2024-10-03T09:07:13Z)
• Symmetry operations and Critical Behaviour in Classical to Quantum Stochastic Processes [0.0]
  We show that the relaxation processes unfold very differently for the different quantum extensions.<n>We find a rather ambiguous relation between the coherence measure based on the L1-norm and the speed of the relaxation process.
  arXiv  Detail & Related papers  (2024-09-14T03:01:54Z)
• Kinetic Interacting Particle Langevin Monte Carlo [0.0]
  This paper introduces and analyses interacting underdamped Langevin algorithms, for statistical inference in latent variable models. We propose a diffusion process that evolves jointly in the space of parameters and latent variables. We provide two explicit discretisations of this diffusion as practical algorithms to estimate parameters of statistical models.
  arXiv  Detail & Related papers  (2024-07-08T09:52:46Z)
• Sampling and estimation on manifolds using the Langevin diffusion [45.57801520690309]
  Two estimators of linear functionals of $mu_phi $ based on the discretized Markov process are considered.<n>Error bounds are derived for sampling and estimation using a discretization of an intrinsically defined Langevin diffusion.
  arXiv  Detail & Related papers  (2023-12-22T18:01:11Z)
• Kernel-based off-policy estimation without overlap: Instance optimality beyond semiparametric efficiency [53.90687548731265]
  We study optimal procedures for estimating a linear functional based on observational data. For any convex and symmetric function class $mathcalF$, we derive a non-asymptotic local minimax bound on the mean-squared error.
  arXiv  Detail & Related papers  (2023-01-16T02:57:37Z)
• Computationally Efficient PAC RL in POMDPs with Latent Determinism and Conditional Embeddings [97.12538243736705]
  We study reinforcement learning with function approximation for large-scale Partially Observable Decision Processes (POMDPs) Our algorithm provably scales to large-scale POMDPs.
  arXiv  Detail & Related papers  (2022-06-24T05:13:35Z)
• Spatio-Temporal Variational Gaussian Processes [26.60276485130467]
  We introduce a scalable approach to Gaussian process inference that combinestemporal-temporal filtering with natural variational inference. We derive a sparse approximation that constructs a state-space model over a reduced set of inducing points. We show that for separable Markov kernels the full sparse cases recover exactly the standard variational GP.
  arXiv  Detail & Related papers  (2021-11-02T16:53:31Z)
• Estimation of Stationary Optimal Transport Plans [4.662321040754878]
  We study optimal transport problems in which finite-valued quantities evolve dynamically over time in a stationary fashion. We introduce estimators of both optimal joinings and the optimal joining cost. We extend the consistency and rate analysis to an entropy-penalized version of the optimal joining problem.
  arXiv  Detail & Related papers  (2021-07-25T17:46:21Z)
• On the Convergence of Stochastic Extragradient for Bilinear Games with Restarted Iteration Averaging [96.13485146617322]
  We present an analysis of the ExtraGradient (SEG) method with constant step size, and present variations of the method that yield favorable convergence. We prove that when augmented with averaging, SEG provably converges to the Nash equilibrium, and such a rate is provably accelerated by incorporating a scheduled restarting procedure.
  arXiv  Detail & Related papers  (2021-06-30T17:51:36Z)
• The Convergence Indicator: Improved and completely characterized parameter bounds for actual convergence of Particle Swarm Optimization [68.8204255655161]
  We introduce a new convergence indicator that can be used to calculate whether the particles will finally converge to a single point or diverge. Using this convergence indicator we provide the actual bounds completely characterizing parameter regions that lead to a converging swarm.
  arXiv  Detail & Related papers  (2020-06-06T19:08:05Z)

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.