From GEV to ResLogit: Spatially Correlated Discrete Choice Models for Pedestrian Movement Prediction

• URL: http://arxiv.org/abs/2603.01325v1
• Date: Sun, 01 Mar 2026 23:50:33 GMT
• Title: From GEV to ResLogit: Spatially Correlated Discrete Choice Models for Pedestrian Movement Prediction
• Abstract summary: We formulate the pedestrian next step choice as a spatial discrete choice defined by a grid of speed adjustment and heading change.<n>In dense, high frequency spatial choice sets, learning based residual corrections can capture proximity induced correlation more effectively than analyst specified GEV nesting structures.
• Score: 1.8262547855491453
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: High frequency pedestrian motion forecasting when interacting with autonomous vehicles (AVs) can be enhanced through the use of behavioural frameworks, such as discrete choice models, that can explicitly account for correlation among similar movement alternatives. We formulate the pedestrian next step choice as a spatial discrete choice defined by a grid of speed adjustment and heading change. Using naturalistic pedestrian-AV encounters from nuScenes and Argoverse 2 (1 sec decision interval), we estimate a multinomial logit baseline and four spatial generalized extreme value (GEV) specifications (SCL, GSCL, SCNL, and GSCNL). We then compare them to a residual neural network logit (ResLogit) model that learns cross alternative effects while retaining an interpretable linear utility component. Across the evaluated data, spatial GEV structures yield only marginal improvements over multinomial logit, whereas ResLogit achieves a substantially better fit and produces behaviourally coherent errors concentrated among neighbouring grid cells. The results suggest that in dense, high frequency spatial choice sets, learning based residual corrections can capture proximity induced correlation more effectively than analyst specified GEV nesting structures, while maintaining interpretability.

Related papers

• A Deep Learning Model for Spatially Clustered Data via Differentiable Cluster Assignment [2.5782420501870296]
  A nonparametric estimator is proposed to learn the partition and the cluster-specific regression functions jointly.<n>A real data analysis is provided to demonstrate the validity and effectiveness of the proposed method.
  arXiv  Detail & Related papers  (2026-08-15T01:39:56Z)
• XGRVFL-MV: Residual-Coupled Graph-Embedded Multi-View Random Vector Functional Link Network with FleXi Guardian Loss [2.2418940049493368]
  This paper proposes a Residual-Coupled Graph-Embedded Multi-View RVFL model with fleXi guardian loss (XGRVFL-MV) for multi-view classification.<n>The proposed model constructs RVFL representation for each view, incorporates graph embedding with intrinsic and penalty graphs constructed using the Local Fisher Discriminant Analysis weighting scheme.<n>A residual-coupling term is introduced to encourage consistency among view-specific prediction residuals while preserving view-specific representations.
  arXiv  Detail & Related papers  (2026-07-25T11:00:23Z)
• Behaviour-Conditioned Neural Processes for Adaptive Residential Short-Term Load Forecasting [1.1240669509034296]
  This work investigates whether inferred behavioural structure can be embedded within a Neural Process-based probabilistic model.<n>We propose a behaviour-conditioned Attentive Neural Process framework that treats each load profile as a forecasting task.<n>Experiments on the Smart Grid, Smart City dataset use user-disjoint train/validation/test splits, variable context lengths, and multi-step forecast horizons.
  arXiv  Detail & Related papers  (2026-07-17T17:48:22Z)
• Clipping Bottleneck: Stabilizing RLVR via Stochastic Recovery of Near-Boundary Signals [83.0127582612634]
  Near-boundary Rescue (NSR) is a minimal, plug-and-play modification that retains out-of-bound tokens to recover lost signals.<n>NSR substantially improves training stability and delivers consistent gains over strong baselines such as DAPO and GSPO.
  arXiv  Detail & Related papers  (2026-05-21T16:45:31Z)
• Uncertainty-Guided Conservative Propagation for Structured Inference in Vessel Segmentation [10.73944733412427]
  Uncertainty-Guided Conservative Propagation (UGCP) is a plug-in module for vessel segmentation.<n> Predictive uncertainty guides reliable regions to support ambiguous regions.<n> structure-aware modulation and source-based stabilization reduce unreliable propagation and excessive drift.
  arXiv  Detail & Related papers  (2026-05-19T22:31:13Z)
• GRAFT: Decoupling Ranking and Calibration for Survival Analysis [12.400774220062303]
  We propose GRAFT, a novel AFT model that decouples prognostics ranking from calibration.<n>GRAFT's hybrid architecture combines a linear AFT model with a non-linear residual neural network, and it also integrates gates for automatic, end-to-end feature selection.<n>In public benchmarks, GRAFT outperforms baselines in discrimination and calibration, while remaining robust and sparse in high-noise settings.
  arXiv  Detail & Related papers  (2026-02-08T09:32:24Z)
• Learning to Guide Local Search for MPE Inference in Probabilistic Graphical Models [7.287294240824019]
  Most Probable Explanation (MPE) inference in Probabilistic Graphical Models (PGMs) is a fundamental yet computationally challenging problem.<n>We propose a neural amortization framework for improving local search in repeated-Query regime.<n>We provide theoretical intuition linking distance-reducing move selection to improved promise during neighbor selection.
  arXiv  Detail & Related papers  (2026-02-01T22:43:28Z)
• LARGE: A Locally Adaptive Regularization Approach for Estimating Gaussian Graphical Models [2.3696387635465608]
  We develop Locally Adaptive Regularization for Graph Estimation (LARGE)<n>LARGE is an approach to adaptively learn nodewise tuning parameters to improve graph estimation and selection.<n>We demonstrate the practical utility of our method by estimating brain connectivity from a real fMRI data set.
  arXiv  Detail & Related papers  (2026-01-14T18:37:50Z)
• Interpretable and Adaptive Node Classification on Heterophilic Graphs via Combinatorial Scoring and Hybrid Learning [1.2691047660244335]
  Graph neural networks (GNNs) achieve strong performance on homophilic graphs but often struggle underphily, where adjacent nodes frequently belong to different classes.<n>We propose an interpretable and adaptive framework for semi-supervised node classification based on explicit inference rather than deep message passing.<n> Experiments on heterophilic and transitional benchmarks demonstrate competitive performance with modern GNNs while offering advantages in interpretability, tuna, and computational efficiency.
  arXiv  Detail & Related papers  (2025-12-22T20:50:44Z)
• Neural Optimal Transport Meets Multivariate Conformal Prediction [58.43397908730771]
  We propose a framework for conditional vectorile regression (CVQR)<n>CVQR combines neural optimal transport with quantized optimization, and apply it to predictions.
  arXiv  Detail & Related papers  (2025-09-29T19:50:19Z)
• ReDiSC: A Reparameterized Masked Diffusion Model for Scalable Node Classification with Structured Predictions [64.17845687013434]
  We propose ReDiSC, a structured diffusion model for structured node classification.<n>We show that ReDiSC achieves superior or highly competitive performance compared to state-of-the-art GNN, label propagation, and diffusion-based baselines.<n> Notably, ReDiSC scales effectively to large-scale datasets on which previous structured diffusion methods fail due to computational constraints.
  arXiv  Detail & Related papers  (2025-07-19T04:46:53Z)
• SGCN:Sparse Graph Convolution Network for Pedestrian Trajectory Prediction [64.16212996247943]
  We present a Sparse Graph Convolution Network(SGCN) for pedestrian trajectory prediction. Specifically, the SGCN explicitly models the sparse directed interaction with a sparse directed spatial graph to capture adaptive interaction pedestrians. visualizations indicate that our method can capture adaptive interactions between pedestrians and their effective motion tendencies.
  arXiv  Detail & Related papers  (2021-04-04T03:17:42Z)
• Canny-VO: Visual Odometry with RGB-D Cameras based on Geometric 3D-2D Edge Alignment [85.32080531133799]
  This paper reviews the classical problem of free-form curve registration and applies it to an efficient RGBD visual odometry system called Canny-VO. Two replacements for the distance transformation commonly used in edge registration are proposed: Approximate Nearest Neighbour Fields and Oriented Nearest Neighbour Fields. 3D2D edge alignment benefits from these alternative formulations in terms of both efficiency and accuracy.
  arXiv  Detail & Related papers  (2020-12-15T11:42:17Z)
• Autoregressive Score Matching [113.4502004812927]
  We propose autoregressive conditional score models (AR-CSM) where we parameterize the joint distribution in terms of the derivatives of univariable log-conditionals (scores) For AR-CSM models, this divergence between data and model distributions can be computed and optimized efficiently, requiring no expensive sampling or adversarial training. We show with extensive experimental results that it can be applied to density estimation on synthetic data, image generation, image denoising, and training latent variable models with implicit encoders.
  arXiv  Detail & Related papers  (2020-10-24T07:01:24Z)
• Self-Guided Adaptation: Progressive Representation Alignment for Domain Adaptive Object Detection [86.69077525494106]
  Unsupervised domain adaptation (UDA) has achieved unprecedented success in improving the cross-domain robustness of object detection models. Existing UDA methods largely ignore the instantaneous data distribution during model learning, which could deteriorate the feature representation given large domain shift. We propose a Self-Guided Adaptation (SGA) model, target at aligning feature representation and transferring object detection models across domains.
  arXiv  Detail & Related papers  (2020-03-19T13:30:45Z)

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.