Non-Probability Sampling Network for Stochastic Human Trajectory
Prediction
- URL: http://arxiv.org/abs/2203.13471v1
- Date: Fri, 25 Mar 2022 06:41:47 GMT
- Title: Non-Probability Sampling Network for Stochastic Human Trajectory
Prediction
- Authors: Inhwan Bae, Jin-Hwi Park, Hae-Gon Jeon
- Abstract summary: Capturing multimodal natures is essential for incorporating pedestrian trajectory prediction.
We introduce the Quasi-Carlo method, ensuring uniform coverage on the sampling space, as an alternative to the conventional random sampling.
We take an additional step ahead by a learnable sampling network into the existing networks for trajectory prediction.
- Score: 16.676008193894223
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Capturing multimodal natures is essential for stochastic pedestrian
trajectory prediction, to infer a finite set of future trajectories. The
inferred trajectories are based on observation paths and the latent vectors of
potential decisions of pedestrians in the inference step. However, stochastic
approaches provide varying results for the same data and parameter settings,
due to the random sampling of the latent vector. In this paper, we analyze the
problem by reconstructing and comparing probabilistic distributions from
prediction samples and socially-acceptable paths, respectively. Through this
analysis, we observe that the inferences of all stochastic models are biased
toward the random sampling, and fail to generate a set of realistic paths from
finite samples. The problem cannot be resolved unless an infinite number of
samples is available, which is infeasible in practice. We introduce that the
Quasi-Monte Carlo (QMC) method, ensuring uniform coverage on the sampling
space, as an alternative to the conventional random sampling. With the same
finite number of samples, the QMC improves all the multimodal prediction
results. We take an additional step ahead by incorporating a learnable sampling
network into the existing networks for trajectory prediction. For this purpose,
we propose the Non-Probability Sampling Network (NPSN), a very small network
(~5K parameters) that generates purposive sample sequences using the past paths
of pedestrians and their social interactions. Extensive experiments confirm
that NPSN can significantly improve both the prediction accuracy (up to 60%)
and reliability of the public pedestrian trajectory prediction benchmark. Code
is publicly available at https://github.com/inhwanbae/NPSN .
Related papers
- Practical Probabilistic Model-based Deep Reinforcement Learning by
Integrating Dropout Uncertainty and Trajectory Sampling [7.179313063022576]
This paper addresses the prediction stability, prediction accuracy and control capability of the current probabilistic model-based reinforcement learning (MBRL) built on neural networks.
A novel approach dropout-based probabilistic ensembles with trajectory sampling (DPETS) is proposed.
arXiv Detail & Related papers (2023-09-20T06:39:19Z) - Unsupervised Sampling Promoting for Stochastic Human Trajectory
Prediction [10.717921532244613]
We propose a novel method, called BOsampler, to adaptively mine potential paths with Bayesian optimization in an unsupervised manner.
Specifically, we model the trajectory sampling as a Gaussian process and construct an acquisition function to measure the potential sampling value.
This acquisition function applies the original distribution as prior and encourages exploring paths in the long-tail region.
arXiv Detail & Related papers (2023-04-09T19:15:14Z) - Estimating Regression Predictive Distributions with Sample Networks [17.935136717050543]
A common approach to model uncertainty is to choose a parametric distribution and fit the data to it using maximum likelihood estimation.
The chosen parametric form can be a poor fit to the data-generating distribution, resulting in unreliable uncertainty estimates.
We propose SampleNet, a flexible and scalable architecture for modeling uncertainty that avoids specifying a parametric form on the output distribution.
arXiv Detail & Related papers (2022-11-24T17:23:29Z) - Diverse Human Motion Prediction via Gumbel-Softmax Sampling from an
Auxiliary Space [34.83587750498361]
Diverse human motion prediction aims at predicting multiple possible future pose sequences from a sequence of observed poses.
Previous approaches usually employ deep generative networks to model the conditional distribution of data, and then randomly sample outcomes from the distribution.
We propose a novel sampling strategy for sampling very diverse results from an imbalanced multimodal distribution.
arXiv Detail & Related papers (2022-07-15T09:03:57Z) - Continuous and Distribution-free Probabilistic Wind Power Forecasting: A
Conditional Normalizing Flow Approach [1.684864188596015]
We present a data-driven approach for probabilistic wind power forecasting based on conditional normalizing flow (CNF)
In contrast with the existing, this approach is distribution-free (as for non-parametric and quantile-based approaches) and can directly yield continuous probability densities.
arXiv Detail & Related papers (2022-06-06T08:48:58Z) - Uncertainty estimation of pedestrian future trajectory using Bayesian
approximation [137.00426219455116]
Under dynamic traffic scenarios, planning based on deterministic predictions is not trustworthy.
The authors propose to quantify uncertainty during forecasting using approximation which deterministic approaches fail to capture.
The effect of dropout weights and long-term prediction on future state uncertainty has been studied.
arXiv Detail & Related papers (2022-05-04T04:23:38Z) - Stochastic Trajectory Prediction via Motion Indeterminacy Diffusion [88.45326906116165]
We present a new framework to formulate the trajectory prediction task as a reverse process of motion indeterminacy diffusion (MID)
We encode the history behavior information and the social interactions as a state embedding and devise a Transformer-based diffusion model to capture the temporal dependencies of trajectories.
Experiments on the human trajectory prediction benchmarks including the Stanford Drone and ETH/UCY datasets demonstrate the superiority of our method.
arXiv Detail & Related papers (2022-03-25T16:59:08Z) - Boost Test-Time Performance with Closed-Loop Inference [85.43516360332646]
We propose to predict hard-classified test samples in a looped manner to boost the model performance.
We first devise a filtering criterion to identify those hard-classified test samples that need additional inference loops.
For each hard sample, we construct an additional auxiliary learning task based on its original top-$K$ predictions to calibrate the model.
arXiv Detail & Related papers (2022-03-21T10:20:21Z) - Unrolling Particles: Unsupervised Learning of Sampling Distributions [102.72972137287728]
Particle filtering is used to compute good nonlinear estimates of complex systems.
We show in simulations that the resulting particle filter yields good estimates in a wide range of scenarios.
arXiv Detail & Related papers (2021-10-06T16:58:34Z) - Multivariate Probabilistic Regression with Natural Gradient Boosting [63.58097881421937]
We propose a Natural Gradient Boosting (NGBoost) approach based on nonparametrically modeling the conditional parameters of the multivariate predictive distribution.
Our method is robust, works out-of-the-box without extensive tuning, is modular with respect to the assumed target distribution, and performs competitively in comparison to existing approaches.
arXiv Detail & Related papers (2021-06-07T17:44:49Z) - Sampling-free Variational Inference for Neural Networks with
Multiplicative Activation Noise [51.080620762639434]
We propose a more efficient parameterization of the posterior approximation for sampling-free variational inference.
Our approach yields competitive results for standard regression problems and scales well to large-scale image classification tasks.
arXiv Detail & Related papers (2021-03-15T16:16:18Z)
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.