- Rating
- 2
- Confidence
- 4
- Informativeness
- 1
- Presentation
- 3
- Soundness
- 2
Read review
Paper summary
This paper aims to design a method that goes beyond the autoregressive scheme and enables the trajectories on the generated road network to strictly abide by the transfer laws on the road network. But in fact, this is essentially what the classic route choice modeling research in traditional transportation aims to solve, so it is not a brand-new research direction. The method design is ingeniously designed, which can ensure that the generated trajectory is correct in considering the overall general direction while guaranteeing the randomness of the generated trajectory. A relatively good trade-off has been achieved between constraint modeling and distribution modeling. The experimental results reported in this paper also prove that the method does indeed outperform the existing SOTA baselines in some statistical indicators.
Critical strengths
- The method is designed well. By modeling a distribution over future movements, it estimates the trajectory’s overall direction and uses this information to guide decisions at the current intersection. Combined with a data-driven learning approach, this design produces trajectories that reflect the transition patterns observed in the training data while maintaining a coherent overall direction. The method also incorporates strict constraints to ensure that all generated transitions are valid on the road network.
- The paper presents a rigorous and well-developed formalization, demonstrating technical sophistication and a deep understanding of the problem, particularly its local decision-making structure. The presentation is thorough while remaining clear and readable.
- The experimental design is comprehensive and rigorous. Even setting aside the reported results, the evaluation protocol itself provides a sound basis for assessing the model’s performance across multiple dimensions.
Critical weaknesses
- The problem addressed in this paper differs substantially from conventional trajectory generation. With both the origin and destination specified, the task effectively reduces to route choice, where the central concern is minimizing travel costs while accounting for user-equilibrium effects. This may explain why even Dijkstra’s algorithm, which does not learn from data, performs reasonably well relative to the other baselines across the reported metrics. The paper should thoroughly discuss its relationship to route-choice research and clearly position its contribution within that scope, rather than presenting it as a contribution to general trajectory generation. Even with this substantial reframing, the claimed paradigm shift in trajectory generation remains unsubstantiated.
- Although the method incorporates some clever design choices, the overall framework lacks elegance, and it is difficult to extract transferable insights that could inform research beyond this specific task. From a technical perspective, the contribution falls short of the level of generality expected at ICLR. The design is highly task-specific, and its broader applicability is limited.
- Several aspects of the experimental results warrant closer scrutiny. For example, in the main-text ablation study, removing certain components leaves the backbone and the remaining proposed modules unable to outperform even Dijkstra’s algorithm, despite the latter requiring no learning from data. In addition, the standard deviations reported in Tables 14–18 of the appendix show unexpectedly similar values in some cases and unexplained inconsistencies in others. These patterns raise concerns about the reliability of the reported results and require further clarification.
Questions for authors
- How do autoregressive methods, such as the most basic Markov, incorporate origin and destination constraints to ensure fair comparison?
- How does the parameter in Formula 11 affect the performance in the subsequent experimental table?
8 comments
FORESIGHT also uses candidate-conditioned re-anticipation during learning. For each legal movement candidate (), it forms an updated hypothetical prefix and predicts a continuation,
$ \hat R_{t+1}^{(s')}=\mathcal F_\theta(c_t\oplus s',g). $
The corresponding continuation prediction errors are weighted by the current transition probabilities in the learning objective. This connects the learned next-transition distribution to downstream predictive behavior. These candidate-conditioned continuations are not claims about true counterfactual outcomes or causal effects; nor are they required to be supplied as inputs to the Transition Network's base forward scores.
Accordingly, the contribution is not road-network feasibility alone, but the integration of explicit anticipation, feasible probabilistic selection, candidate-conditioned continuation learning, and closed-loop re-anticipation. We will clarify this positioning in the Introduction and Related Work, including its relationship to stochastic route-choice methods that already account for downstream route information.
2. Generality and Transferability of AGM (CW2)
We understand the concern that FORESIGHT's architecture is specialized to discrete road networks. We distinguish the general modeling principle of AGM from the domain-specific components of its FORESIGHT realization.
2.1 A transferable generative abstraction
Consider a sequential generative problem with a realized context (), conditioning information (), a feasible decision set (), and a context-update operator (). An AGM-style construction can be expressed as
$ \hat R_t=\mathcal F_\theta(c_t,z), $
$ q_t(a)=\mathcal T_\phi(a\mid c_t,\hat R_t,\mathcal A_t), \qquad a\in\mathcal A_t, $
$ a_t\sim q_t,\qquad c_{t+1}=\mathcal U(c_t,a_t). $
The key modeling choice is to explicitly predict information about subsequent evolution before constructing the current feasible-decision distribution, and to rebuild that prediction after the realized decision is appended to the context. This establishes a separation between (i) future anticipation, (ii) current decision distribution, and (iii) state update and re-anticipation.
In FORESIGHT, (), the decision set is derived from outgoing road-network connections (with STOP allowed only at the destination), and a finite-horizon decoder realizes the anticipation operator. These choices are specific to road-network trajectories. The abstraction itself does not require a road graph: another application could supply a different feasible decision set and predictive representation, including for continuous or hybrid decisions.
We emphasize the scope of this statement. An abstract formulation is not evidence of empirical transfer. We demonstrate AGM through FORESIGHT on discrete road networks, and we do not claim that the present experiments establish effectiveness in other domains. Those extensions would require appropriate architectures, constraint definitions, and independent evaluation.
2.2 Relation to autoregressive generation and planning
AGM does not introduce a new probability chain rule or establish a strictly more expressive family of trajectory distributions. A sufficiently expressive autoregressive model can, in principle, represent the same conditional distribution. The difference is an explicit inductive bias and information-processing mechanism: an anticipated downstream representation participates in forming the current decision distribution, rather than downstream dependence being handled solely within a direct next-step predictor.
This design also shares a broad closed-loop intuition with receding-horizon planning, where future predictions are revised after actions are executed. The objectives, however, need not be the same. Conventional shortest-path optimization seeks a minimum-cost route under specified costs; FORESIGHT learns a distribution of observed route choices, including heterogeneous and non-optimal behaviors. The anticipated continuation can be viewed intuitively as learned guidance for a generative decision, but it is not an admissible A* cost-to-go heuristic and provides no optimality guarantee.
Therefore, the transferable insight we claim is the explicit separation and coupling of anticipation and current probabilistic decision-making within a repeated closed-loop generation process, not a universal advantage over autoregression or planning. We will sharpen this distinction and appropriately limit broader applicability claims in the revised manuscript.
3. Interpretation of Dijkstra and Ablation Results (CW3)
3.1 Why Dijkstra can be competitive
The reviewer correctly observes that Dijkstra can be competitive on some reported metrics, including against certain ablated variants. This is an important reference result. A shortest-path method has a strong structural prior and directly optimizes path cost; depending on the OD pairs and evaluation metric, a shortest path can resemble a reference trajectory closely even without learning from data.
However, a good cost-minimizing route is not equivalent to a learned distribution over route choices. For a fixed OD pair, deterministic Dijkstra does not itself represent the observed frequencies of alternative paths, heterogeneous preferences, or non-shortest behaviors. FORESIGHT targets these statistical properties while enforcing legal transitions. We therefore do not claim that FORESIGHT must outperform Dijkstra on every metric or every OD condition. Dijkstra is a meaningful optimization-based reference against which the added value of learned distribution modeling should be assessed.
3.2 What the ablation results do—and do not—establish
The relevant mechanisms in FORESIGHT serve different, coupled functions:
- Future anticipation constructs an explicit predictive representation of downstream evolution available to the current transition decision.
- The topology-constrained Transition Network transforms the current context and anticipation into probabilities over legal candidate movements.
- Candidate-conditioned continuation learning couples the immediate transition probabilities to predictive errors along continuations associated with hypothetical legal movements.
- Re-anticipation after execution refreshes the predicted downstream context using the newly realized history.
Consequently, removing or modifying one mechanism changes not only the information available to that mechanism but also the interactions through which the complete model is trained or used. For example, eliminating anticipation removes downstream predictive information from transition scoring; removing continuation-based learning eliminates a training signal that relates the immediate choice distribution to subsequent predictive behavior. Such variants should be understood as ablated configurations of a coupled architecture, not as separately optimized route-choice models.
The fact that some variants underperform Dijkstra is not evidence that Dijkstra and FORESIGHT solve identical modeling objectives, nor does it establish that every component individually improves every metric. It shows that retaining only part of the intended mechanism may not suffice to recover the complete model's empirical behavior. We will revise the experimental discussion to explain the specific functional role of each ablated mechanism and to avoid interpreting these results as proof of independent component-wise gains.
Q1. How do autoregressive methods, especially the basic Markov baseline, incorporate OD constraints?
Our evaluation distinguishes a common OD-conditioned testing protocol from the conditioning information used internally by each model. All methods are evaluated on the same fixed set of 5,000 test conditions, each specifying an origin, destination, and reference trajectory. Generation budgets and failure-accounting rules are aligned, and incomplete or unsuccessful generations are counted rather than replaced until a successful path is obtained.
The basic Markov baseline estimates local transition probabilities from training trajectories:
$ P(X_{t+1}\mid X_t), $
rather than explicitly modeling
$ P(X_{t+1}\mid X_t,g). $
It starts from the specified origin. Under the evaluation's terminal constraint, STOP is permitted only when the current state is the specified destination; arriving at that state does not by itself force an immediate stop. The destination does not enter the Markov baseline's intermediate next-state probability calculation. Thus, this baseline is a local-transition statistical reference, not a fully goal-conditioned autoregressive generator.
We agree that identical OD test conditions do not imply identical model-level conditioning capabilities. Comparisons against the basic Markov model should therefore not be interpreted as isolating the effect of anticipation from the effect of destination conditioning. We will make each baseline's inputs, transition restrictions, stopping behavior, and role in the comparison explicit in the revised evaluation description.
We thank the reviewer for the careful assessment and for recognizing the strengths of FORESIGHT's methodological design, formalization, and evaluation protocol. We appreciate the opportunity to clarify the relationship to classical route-choice modeling, the transferable principle behind Anticipatory Generative Modeling (AGM), the interpretation of the ablation results, and the baseline and parameter settings. We also address the privacy concerns raised in the review.
1. Relationship to Classical Route-Choice Modeling (CW1)
1.1 Problem scope: generative route choice under OD conditions
We agree that destination-conditioned trajectory generation on road networks is closely related to classical route-choice modeling. Given an origin and destination (OD), a generated trajectory can indeed be interpreted as a sampled route among feasible alternatives. We do not claim that OD-constrained route choice is a new problem. Our contribution concerns the generative mechanism used to learn and sample complete trajectories from observed mobility data.
It is also useful to distinguish individual route choice from user-equilibrium traffic assignment. Individual route-choice models describe how travelers select among available routes; user-equilibrium models additionally study network-level interactions in which aggregate flows affect route costs. FORESIGHT addresses the former, at the level of observed individual trajectories. It does not model congestion-dependent network equilibrium or seek to establish user-equilibrium conditions.
Classical route-choice research includes deterministic shortest-path methods, stochastic utility-based approaches, and data-driven models. We therefore do not suggest that classical methods are exclusively deterministic or that learning heterogeneous route preferences is unique to FORESIGHT. Our objective is to learn a conditional distribution over complete, road-network-feasible trajectories,
Pθ(X0:τ∣o,g,G),
where (G) denotes the road network and (τ) is the variable termination time. The target distribution concerns complete trajectories from (o) to (g), while incomplete generations are accounted for separately as failures in evaluation. The distribution should reflect multiple plausible routes, including observed non-shortest alternatives and the statistical structure of route choices under the same OD conditions. In contrast, a deterministic shortest-path algorithm returns a cost-minimizing route for its specified edge costs; it does not itself model a distribution learned from observed route choices.
Thus, we position FORESIGHT as a generative modeling approach to destination-conditioned route choice, rather than presenting route selection under OD constraints as a newly introduced task. The distinctive contribution lies in how the current generative decision is constructed.
1.2 Explicit future anticipation in current transition selection
A standard sequential generator can directly parameterize a next-state distribution from the realized prefix (ct) and destination (g):
P(St+1∣ct,g).
We do not claim that this factorization is inadequate or that autoregressive models cannot, in principle, represent long-range dependencies. AGM retains sequential factorization but introduces a different computational organization of each transition decision.
FORESIGHT first constructs a provisional representation of future evolution,
R^t=Fθ(ct,g),
and then uses this anticipation to form a distribution over the topologically legal next states,
$q_t(s')=\mathcal T_\phi(s'\mid c_t,\hat R_t,\mathcal U_t), \qquad s'\in\mathcal U_t.$
Here, (\mathcal U_t) is the feasible candidate set derived from the current road-network state. Following the selected transition, the realized prefix is updated and anticipation is recomputed:
$ c_t\ \longrightarrow\ \hat R_t\ \longrightarrow\ q_t\ \longrightarrow S_{t+1}\ \longrightarrow\ c_{t+1}\ \longrightarrow\ \hat R_{t+1}. $
The anticipated continuation is neither a known future trajectory nor a path that the model commits to following. It is learned predictive information used to inform the probability of the current legal transition. This mechanism differs from a model that directly scores the next transition using only a history-derived representation, without asserting that all existing route-choice models ignore downstream information.