- Rating
- 2
- Confidence
- 4
- Informativeness
- 2
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
This paper studies when learned compression harms exact-entity generation, using personalized mobility as a test case. It proposes NADI, which directly generates location categories and improves composite scores across four datasets.
Critical strengths
S1: The problem is well motivated. A trajectory that looks realistic but visits the wrong places is of limited use for personalized generation. S2: The experiments show that near-perfect reconstruction can coexist with poor location recovery during generation. This is useful evidence that reconstruction quality alone is insufficient for choosing a generative representation.
Critical weaknesses
W1: The paper does not establish which task or data properties predict compression failure. This limitation reduces its guidance beyond the tested settings. W2: The experiments do not fully separate representation problems from model-specific conditioning failures.
Questions for authors
Q1: Within the evaluated datasets, which observable properties best explain the differences in identity recovery across representations? Can the existing results provide practical guidance on when removing learned compression is likely to help? Q2: What evidence shows that poor identity recovery comes from the compressed representation rather than the model’s limited use of user history?
4 comments
Response to Reviewer LWTG (2/2): factorial and within-dataset results, and where each result is in the revision
Q2, factorial check (Table 2b). Own−swapped recall of beyond-prefix locations on NYC / TKY, three seeds. All pathways share hyperparameters and pass checks of condition use and convergence. In latent-cat, a categorical head on the denoiser's state replaces the autoencoder's decoder as the readout, while diffusion still runs in the compressed latent and each step's prediction is re-encoded by the frozen encoder.
| Main split | Point readout | Categorical readout |
|---|---|---|
| Learned latent | .042 / .002 | .562 / .467 |
| Native embedding | .014 / .001 | .489 / .301 |
| Native tokens, absorbing | – | .631 / .596 |
| Forecasting setting | Point readout | Categorical readout |
|---|---|---|
| Learned latent | .000 / −.001 | .030 / .023 |
| Native embedding | .003 / .001 | .030 / .021 |
| Native tokens, absorbing (NADI) | – | .020 / .023 |
Absorbing corruption adds beyond-prefix identity on the main split (.631 / .596 against .489 / .301 for native embeddings) but none in the forecasting setting (.020 / .023 against .030 / .021).
Q1, within-dataset test (Table 29). Gain of a categorical over a point readout in the recall of beyond-prefix targets under the user's own history, forecasting setting, three seeds:
| HK | NYC | TKY | YJ | |
|---|---|---|---|---|
| Users | 2,853 | 807 | 1,735 | 2,998 |
| Share, lowest → highest user quintile | .23 → .98 | .04 → .49 | .06 → .50 | .32 → .70 |
| Gain, lowest → highest user quintile | +.014 → +.030 | +.006 → +.069 | +.009 → +.047 | +.027 → +.044 |
| Spearman across users [95% CI] | +.14 [.09, .18] | +.52 [.46, .57] | +.42 [.38, .46] | +.24 [.20, .27] |
In an OLS regression that controls for activity and history size, the coefficient of the share is +.041 to +.096, with intervals excluding zero. The gain comes mostly from revisits, the beyond-prefix places the user visited during the training period. On TKY, recall of revisits is .106 with a categorical readout against .029 with a point readout, while first visits are recovered by neither (.010 and .005, Table 28).
Where the other results are in the revised PDF.
- Q2: the linear probe on latent-point's denoiser states, Appendix E.2. On NYC the states contain the beyond-prefix identity (top-1 .33–.36 across seeds) that the point readout loses (.04). On TKY the regression-trained denoiser barely forms it (.01–.05).
- Q2: the VQ code audit over three checkpoints (Appendix E.3, Table 18) and the per-location codebook (Appendix L).
- Q2: the readout contrast in the forecasting setting, Section 4.6 and Appendix I.1 (Tables 27 and 28).
- Q1: the dataset properties and the checklist, Appendix M (Table 34). The Limitations now state that the history share predicts the gain within each dataset but is only descriptive across datasets.
- Changes requested by the other reviewers, such as the split overlap and simple baselines, are in our response to Reviewer GmoT.
Thank you for the additional experiments. They address our concern about the CONT+AE model. With the same continuous latent representation, directly predicting location categories helps the model use a user’s history to recover more of the target locations that were absent from the seven-day prefix. This shows that compression alone cannot explain the original model’s low recall.
For discrete codes, the HK result is informative. Once the codebook assigns distinct codes to nearly all stations, VQ performs about as well as NADI. Prior work on generative retrieval has already shown that when an encoder assigns the same code to different entities, the model has difficulty distinguishing those entities from the code alone. We therefore see the main contribution of this experiment as quantifying the impact of code collisions on mobility generation.
For continuous representations, the new analysis helps explain which users within a dataset benefit most from directly predicting location categories. Our remaining concern is how to tell, on a new dataset, when removing compression is worthwhile and when changing the readout is enough. We therefore maintain our rating of 2 (Weak Reject).
Response to Reviewer LWTG: code collisions, and when to remove compression or change the readout
We thank the reviewer for the follow-up and agree with both readings. In this round, we updated the revised PDF in the following places. Appendix E.3 relates the VQ audit to code collisions in generative retrieval. A new Table 29b compares native embeddings with the learned latent, both read out categorically, user by user in leak-free forecasting, on all four datasets over three seeds. Appendix M now ends with a procedure for a new dataset, and the Conclusion states its core.
Code collisions. The effect of collisions is indeed known from generative retrieval, where items that share an identifier cannot be told apart from it alone. This is why TIGER (Rajput et al., 2023, cited in Section 1) appends an extra token to colliding semantic IDs. Appendix E.3 now presents the VQ experiment as quantifying collisions in mobility generation. Two observations go beyond the known effect. First, collisions persist on a large vocabulary even when the codebook has as many codes as locations. On TKY, training collapses to 3,076 codes in use, 93.6% of the locations seen in training share a code, and doubling the codebook does not help. The collisions are therefore not only a consequence of too few codes. Second, they fall on the entities that carry identity. On the three large vocabularies, 97.5–99.8% of visits to highly user-specific locations share a code whose majority label is another location (Table 18).
When to remove compression and when to change the readout. We summarize the procedure of Appendix M in four steps. Step 1 needs no model and Step 2 only the trained encoder, so in a two-stage pipeline both precede the generator. Step 3 sets the default generator, and Step 4 costs one additional training run.
Step 1: before any training, estimate how much the choice can matter. Two quantities computed from the data indicate how much beyond-prefix identity, that is, real future locations absent from the 7-day prefix, any pathway can draw from the history. One is the history share, the fraction of a user's beyond-prefix targets that the user visited during the training period. The other is the Recall@10 of a reference that samples popular locations by hour. When this reference is already high, as on HK (.951, Table 34), no pathway recovers beyond-prefix identity in forecasting (Table 27), so the choice can rest on other criteria.
Step 2: check whether the code is one-to-one on the entities that matter. If it is not, changing the readout cannot help, because a categorical head cannot separate locations that share a code. Compression should then be removed or replaced by a one-to-one code. In our data, a continuous per-visit latent serves on every vocabulary, whereas a per-location codebook serves only on a small one. The original VQ fails this check, and its own−swapped recall of beyond-prefix locations, the recall under the user's own history minus that under another user's, is at most .011 on every dataset (Table 2a). Once a per-location codebook makes the HK code nearly one-to-one (6.2% of stations share a code), VQ matches NADI.
Step 3: if the code is one-to-one, change the readout first. The continuous latent passes Step 2, and its autoencoder reconstructs 98.9–100% of visits to locations that are rare for the user (Table 17). A categorical readout in this latent matches native embeddings within .01 or exceeds them in five of the six comparisons where any beyond-prefix identity is recovered. These are the within-period setting, where test futures lie in the training period, on NYC (.562 against .571), TKY (.467 against .380) and YJ (.108 against .087, Table 2a), and forecasting on NYC (.030 against .030) and TKY (.023 against .021, Table 27).
Step 4: when the history share is high, confirm with one paired run. One trains the native pathway with the latent pathway's settings and removes compression only if it recovers more beyond-prefix identity, with seed ranges that do not overlap. Forecasting on YJ is the one case where this holds (.078–.089 against .026–.036, Table 27). The gain comes almost entirely from revisits to locations in the user's training history (+.160 against +.052), and Table 29b shows that it grows with the history share, from .033 to .088 across user quintiles (Table 29b, Spearman +.41, 95% CI +.37 to +.44), and the trend holds after controlling for activity and history size. On NYC and TKY the two pathways stay within .002 in every quintile, so the learned latent can be kept. Neither reconstruction, which is best on YJ (.998 for rare visits), nor the history share, which indicates how much the choice can matter, shows in advance whether the pathways differ, so the paired run remains the test.
Response to Reviewer LWTG (1/2): representation versus history use, observable properties, and practical guidance
We thank the reviewer for two precise questions. Our answers rest on new experiments and narrow the paper's claims. The second comment gives the supporting tables and their place in the revised PDF.
W2 and Q2. Does poor identity recovery come from the representation or from limited use of history? It depends on the pathway.
Original CONT+AE: limited use of history. The reviewer's alternative is correct for this model. Under a history swap even its time-of-day profile barely changes, and only 34–51% of its windows follow the source user's visitation profile, where 50% means ignoring the history. We remove it from the evidence for compression loss.
VQ: the representation. VQ uses the condition, since its time-of-day profile moves with the history (own − swapped +.13 to +.28). Its codes, however, merge exact locations. Mapping each code to its most frequent location recovers only .06–.19 of visits on the three large vocabularies, which we call code purity (Table 18). Even a per-location codebook with K ≥ |V| collapses on TKY, where 93.6% of the locations seen in training share a code (three seeds, Appendix L).
Continuous latent: the readout. A repaired latent model (latent-point) applies the native-embedding model's denoiser and conditioning path to a frozen, standardized per-visit autoencoder latent. It follows the source user in 97–100% of windows (Table 3), and its autoencoder reconstructs 99.4–100% of visits (Table 17). It still loses beyond-prefix locations, the real future locations absent from the 7-day prefix. Their own−swapped recall, the recall under the user's own history minus that under another user's, is .042 / .002 on NYC / TKY. A categorical readout on the same latent recovers them (.562 / .467), and a point readout on native embeddings loses them too (.014 / .001, Table 2b). In a leak-free forecasting setting on a strict time split, without the given length and weekdays, the contrast persists, with non-overlapping seed ranges on NYC, TKY and YJ (Table 27).
Poor identity recovery therefore comes from the compressed representation when the learned code is not one-to-one, that is, when one code stands for several locations, and in continuous pathways from the point readout, whether or not the space is compressed. Within period, a categorical readout recovers about as much from the learned latent as from native embeddings. In forecasting on YJ, native embeddings keep more of this identity (.085 against .031).
W1 and Q1. Which properties explain the differences, and when does removing learned compression help?
Code injectivity predicts where learned compression fails. It is a property of the trained encoder, which a two-stage pipeline can measure before training the generator. The paper's VQ has code purity .40 / .06 / .19 / .07 on HK / NYC / TKY / YJ (three seeds, Table 18), and its beyond-prefix own−swapped recall is about zero on all four datasets. Codebook design matters as well as vocabulary size. Purity is only .40 on HK's 91 stations, while a per-location codebook makes HK nearly injective (.987) and VQ then matches NADI.
The share of the target identity in the user's own history, a data property that needs no model. For each window we measure the share of beyond-prefix targets that the user visited during the training period. On the main split it is 1.00, because test futures were training data, and this is where the output effect is largest. In the forecasting setting it is .63 / .28 / .31 / .48 on HK / NYC / TKY / YJ. Within every dataset, users with a higher share gain more from a categorical readout, monotonically across quintiles and after controlling for activity and history size (Spearman +.14 to +.52 across users, Table 29). Across datasets the comparison is descriptive. On HK, popular locations alone reach Recall@10 = .95 in the forecasting setting, so the gain stays small despite the highest share.
Practical guidance (Appendix M). First, check code injectivity, since removing or replacing learned compression helps when the code is not injective on the entities that matter. Second, a continuous latent that reconstructs well need not be abandoned. On the main split, reading it out categorically recovers most of what NADI recovers in native space (TKY .467 against .535, Table 2a), and the history share above estimates how much this helps. Third, before attributing a failure to the representation, run a history-swap test and evaluate prefix and beyond-prefix targets separately. As the reviewer notes in S2, reconstruction accuracy cannot replace these checks.