atlas

Research map / Multi-agent systems and games / Human-AI and goal-conditioned

Generating Origin-Destination Matrices in Neural Spatial Interaction Models

NeurIPS 2024 · Multi-agent systems and games › Human-AI and goal-conditioned · approach: Interactive multi-agent trajectory prediction · 1 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's full text. Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Proposes GeNSIT, a framework that jointly samples discrete origin-destination matrices under summary-statistic constraints (via Gibbs Markov basis sampling) while neurally calibrating Harris-Wilson-driven spatial interaction model parameters, scaling linearly in the number of OD pairs.

Problem

Generating discrete origin-destination matrices for agent-based models subject to partially observed summary statistics; existing methods work on continuous intensity relaxations with discretisation errors, or are computationally expensive MCMC.

Approach

Combine a neural-network-calibrated Spatial Interaction Model coupled with the Harris-Wilson SDE (solved by Euler-Maruyama) with closed-form or Gibbs Markov basis sampling of the discrete contingency table, with a Joint scheme passing table information into the NN loss, giving linear-in-IJ cost.

Key results

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use GeNSIT Joint instead of SIM-MCMCCambridge ODM, total constrained · Cambridge ODM, total constrainedSRMSE: 0.70 -> 2.43Hurt
Use GeNSIT Joint instead of SIM-MCMCCambridge ODM, total constrained · Cambridge ODM, total constrained99% CP: 68% -> 31%Hurt
Use GeNSIT Joint instead of SIT-MCMCCambridge ODM, singly constrained · Cambridge ODM, singly constrainedSRMSE: 0.61 -> 0.43Helped
Use GeNSIT Joint instead of SIT-MCMCCambridge ODM, singly constrained · Cambridge ODM, singly constrained99% CP: 72% -> 93%Helped
Use GeNSIT Joint instead of SIT-MCMCCambridge ODM, doubly constrained · Cambridge ODM, doubly constrainedSRMSE: 0.59 -> 0.55Hurt
Use GeNSIT Joint instead of SIT-MCMCCambridge ODM, doubly constrained · Cambridge ODM, doubly constrained99% CP: 86% -> 89%Helped
Fix 10% of cells in addition to row and column margins (ablation)GeNSIT Joint · Cambridge ODM, doubly constrained with 10% cells fixedSRMSE: 0.55 -> 0.43Helped
Fix 20% of cells in addition to row and column margins (ablation)GeNSIT Joint · Cambridge ODM, doubly constrained with 20% cells fixedSRMSE: 0.55 -> 0.38Helped
Pass table information to the loss (Joint rather than Disjoint) (ablation)GeNSIT, Washington ODM · Washington ODM, total and training-cell constrainedSRMSE: 2.39±0.09 -> 2.37±0.08Helped
Pass table information to the loss (Joint rather than Disjoint) (ablation)GeNSIT, Washington ODM · Washington ODM, total and training-cell constrained99% CP: 47%±1% -> 44%±1%Hurt
Use GeNSIT table estimates rather than continuous SIM-NN estimatesWashington ODM · Washington ODM, total and training-cell constrainedSRMSE: 2.47±0.00 -> 2.37±0.08Helped
Use GeNSIT table estimates rather than continuous GMEL estimatesWashington ODM · Washington ODM, total and training-cell constrained99% CP: 5%± 1% -> 44%±1%Helped

Surprising findings

Limitations

Experimental setup

Datasets: Cambridge UK census ODM (ONS population census) Washington DC commuting ODM

Benchmarks: Cambridge UK ODM Washington DC ODM synthetic ODM scalability

Metrics: SRMSE 99% coverage probability (CP) SSI computation time

Baselines: SIM-MCMC SIM-NN SIT-MCMC GMEL

Builds on: Harris-Wilson SDE spatial interaction models Markov basis MCMC (Diaconis-Sturmfels) SIM-NN

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy