Many problems across the sciences compare two stochastic processes through the sequences they generate. Reinforcement learning asks what a new policy would return from the trajectories of an old one; molecular simulation asks how much more a ligand binds from samples of the unbound state; climate attribution asks how a heat wave shifted under warming; and language-model post-training asks what a deployed agent will do from logged interactions. In every case, one quantity would answer all these questions at once: the ratio of the two probability laws over their generated sequences, the trajectory density ratio. This ratio exists only under strong conditions. When one process reaches states the other cannot, the ratio does not exist; when their overlap is thin, its variance grows without control with the sequence length; and when they concentrate on different lower-dimensional sets, the ratio is undefined altogether. Weak support of this kind is the norm for sequence data, not a sampling accident, and its price is paid in identifiability rather than in noise alone. This survey organizes the field around a three-level diagnosis of weak support and a map of the nine retreats that methods take when the full ratio is out of reach, from direct estimation and reweighting through staged decomposition, stationarization, and partial-identification bounds to smoothing, transport couplings, operator spectra, and direct estimation of a single functional. Each retreat keeps part of what the ratio offers and pays for the rest, and each application domain has standardized the retreat its data force. The survey closes with open problems: testable diagnostics at every level, partial identification at the trajectory level, a rate theory of time-amplified error, and benchmarks with ground truth.
Figures & tables
Figure 1: The trajectory-density-ratio problem. Top: we observe trajectories of a stochastic process Q but need expectations under a target process P ; the ratio wT=dP/dQ , a product of one-step ratios, converts one into the other. Bottom: weak support breaks this bridge in three ways—no overlap leaves wT undefined, thin overlap makes its variance grow with the horizon, and singular support leaves no density.
Level
Condition
supports overlap
low-dim. support
ratio exists
identifiable
consistent
worsens with horizon
Standard remedies
L1 support non-coverage
P≪Q
×
×
×
×
×
✓
restrict the space, report bounds
L2 thin overlap
P≪Q , esssupwT=∞
✓
×
✓
✓
✓
✓
truncation, stationarization
L3 trajectory singularity
P⊥Q or low-dimensional support
×
✓
×
×
×
×
smoothing, bridges, spectra
Table 1: The three levels of weak support.
Figure 2: The map of retreats, the organizing claim of this survey. The trajectory ratio wT (center) is the only estimand that one estimate reuses across all trajectory functionals (Eqs. ( 1 )–( 2 )). Each arrow is a retreat to a surrogate estimand, labeled by the weak-support level that forces it. Each box states what the surrogate keeps, what it pays, and where it is developed. Table 6 states the same map on one page with the standardizing domains.
Figure 3: Two research lineages converge on trajectory density-ratio estimation. Top lane: process measures and weak support, from coupling free energies and sequential analysis to overlap diagnostics, entropic transport, and dequantified bridges. Bottom lane: sequence-level learning, from sequential analysis and direct risk minimization to prefix objectives, marginal corrections, and simulation-calibrated testing. Labels name representative milestones. The map that organizes both lanes is stated in Table 6 .
Tension
direct risk
prefix objectives
signatures
conditional computation
reuse & DR
occupancy
coverage reweighting
diagnostics & testing
Representation vs. accumulated error
✓
✓
✓
✓
×
×
×
×
Whole trajectory vs. statistical cost
×
×
×
×
✓
✓
×
×
Estimation vs. valid inference
×
×
×
×
×
×
✓
✓
Table 2: The three tensions of the sequential literature.
Institute of Computational Biology, Helmholtz Munich · School of Computation Information and Technology, Technical University of Munich · Munich Center for Machine Learning (MCML) +2