Heteroscedastic Diffusion for Multi-Agent Trajectory Modeling
- URL: http://arxiv.org/abs/2605.10717v1
- Date: Mon, 11 May 2026 15:26:14 GMT
- Title: Heteroscedastic Diffusion for Multi-Agent Trajectory Modeling
- Abstract summary: Multi-agent trajectory modeling traditionally focuses on forecasting, often neglecting more general tasks like trajectory completion.<n>We introduce U2Diffine, a unified diffusion model built to perform trajectory completion while simultaneously offering state-wise heteroscedastic uncertainty estimates.<n>Our method outperforms state-of-the-art solutions in both trajectory completion and forecasting across four challenging sports datasets.
- Score: 18.081497075992406
- License: http://creativecommons.org/licenses/by/4.0/
- Abstract: Multi-agent trajectory modeling traditionally focuses on forecasting, often neglecting more general tasks like trajectory completion, which is essential for real-world applications such as correcting tracking data. Existing methods also generally predict agents' states without offering any state-wise measure of heteroscedastic uncertainty. Moreover, popular multi-modal sampling methods lack error probability estimates for each generated scene under the same prior observations, which makes it difficult to rank the predictions at inference time. We introduce U2Diffine, a unified diffusion model built to perform trajectory completion while simultaneously offering state-wise heteroscedastic uncertainty estimates. This is achieved by augmenting the standard denoising loss with the negative log-likelihood of the predicted noise, and then propagating the latent space uncertainty to the real state space using a first-order Taylor approximation. We also propose U2Diff, a faster baseline that avoids gradient computation during sampling. This approach significantly increases inference speed, making it as efficient as a standard generative-only diffusion model. For post-processing, we integrate a Rank Neural Network (RankNN) that enables error probability estimation for each generated mode, demonstrating strong correlation with ground truth errors. Our method outperforms state-of-the-art solutions in both trajectory completion and forecasting across four challenging sports datasets (NBA, Basketball-U, Football-U, Soccer-U), underscoring the effectiveness of our uncertainty and error probability estimation.
Related papers
- Distributionally Faithful Imputation via Positive Semi-Definite Kernel Density Estimation [55.47411235954028]
We recast imputation under missing completely at random as density estimation from masked observations.<n>We obtain a convex empirical risk problem with closed form marginals, solvable by a Newton interior point method.<n>The resulting PSD Impute model yields both single and multiple imputations from the same fitted density.
arXiv Detail & Related papers (2026-07-08T15:51:05Z) - GLIDE: Graph-guided Leap Inference for Diffusion Estimation of Spatio-Temporal Point Processes [19.756452407351986]
We propose a conditional diffusion framework for temporal-temporal point processes (STPPs)<n>GLIDE organizes historical events into a multi-scale historical graph and encodes spatial topology through a dual-stream architecture.<n> Experiments on multiple real-world datasets show that GLIDE improves both distribution fitting and next-event prediction, with the largest gains appearing on the spatial side.
arXiv Detail & Related papers (2026-05-31T14:56:24Z) - VMU-Diff: A Coarse-to-fine Multi-source Data Fusion Framework for Precipitation Nowcasting [9.702321405779513]
Existing methods rely on single-source radar data to build either deterministic or probabilistic models.<n>This paper proposes a novel coarse-to-fine Vision Mamba Unet and residual Diffusion (VMU-Diff) based precipitation nowcasting framework.<n> Experiments on SWAN datasets demonstrate the improvements of our method over state-of-the-art methods.
arXiv Detail & Related papers (2026-05-14T09:05:30Z) - Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching [60.37045080890305]
We provide the first analysis of the sample complexity for flow-matching based generative models.<n>We decompose the velocity field estimation error into neural-network approximation error, statistical error due to the finite sample size, and optimization error due to the finite number of optimization steps for estimating the velocity field.
arXiv Detail & Related papers (2025-12-01T05:14:25Z) - SimDiff: Simpler Yet Better Diffusion Model for Time Series Point Forecasting [8.141505251306622]
Diffusion models have recently shown promise in time series forecasting.<n>They often fail to achieve state-of-the-art point estimation performance.<n>We propose SimDiff, a single-stage, end-to-end framework for point estimation.
arXiv Detail & Related papers (2025-11-24T16:09:55Z) - SynCast: Synergizing Contradictions in Precipitation Nowcasting via Diffusion Sequential Preference Optimization [62.958457694151384]
We introduce preference optimization into precipitation nowcasting for the first time, motivated by the success of reinforcement learning from human feedback in large language models.<n>In the first stage, the framework focuses on reducing FAR, training the model to effectively suppress false alarms.
arXiv Detail & Related papers (2025-10-22T16:11:22Z) - Unified Uncertainty-Aware Diffusion for Multi-Agent Trajectory Modeling [13.993231805213354]
We introduce U2Diff, a textbfunified diffusion model designed to handle trajectory completion.<n>We also incorporate a Rank Neural Network in post-processing to enable textbferror probability estimation for each generated mode.<n>Our method outperforms the state-of-the-art solutions in trajectory completion and forecasting across four challenging sports datasets.
arXiv Detail & Related papers (2025-03-24T11:46:58Z) - Robust Representation Consistency Model via Contrastive Denoising [83.47584074390842]
randomized smoothing provides theoretical guarantees for certifying robustness against adversarial perturbations.<n> diffusion models have been successfully employed for randomized smoothing to purify noise-perturbed samples.<n>We reformulate the generative modeling task along the diffusion trajectories in pixel space as a discriminative task in the latent space.
arXiv Detail & Related papers (2025-01-22T18:52:06Z) - DiffSF: Diffusion Models for Scene Flow Estimation [17.512660491303684]
We propose DiffSF that combines transformer-based scene flow estimation with denoising diffusion models.
We show that the diffusion process greatly increases the robustness of predictions compared to prior approaches.
By sampling multiple times with different initial states, the denoising process predicts multiple hypotheses, which enables measuring the output uncertainty.
arXiv Detail & Related papers (2024-03-08T14:06:15Z) - Quantifying Uncertainty in Deep Spatiotemporal Forecasting [67.77102283276409]
We describe two types of forecasting problems: regular grid-based and graph-based.
We analyze UQ methods from both the Bayesian and the frequentist point view, casting in a unified framework via statistical decision theory.
Through extensive experiments on real-world road network traffic, epidemics, and air quality forecasting tasks, we reveal the statistical computational trade-offs for different UQ methods.
arXiv Detail & Related papers (2021-05-25T14:35:46Z) - Improving Uncertainty Calibration via Prior Augmented Data [56.88185136509654]
Neural networks have proven successful at learning from complex data distributions by acting as universal function approximators.
They are often overconfident in their predictions, which leads to inaccurate and miscalibrated probabilistic predictions.
We propose a solution by seeking out regions of feature space where the model is unjustifiably overconfident, and conditionally raising the entropy of those predictions towards that of the prior distribution of the labels.
arXiv Detail & Related papers (2021-02-22T07:02:37Z)
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.