- Rating
- 2
- Confidence
- 2
- Informativeness
- 3
- Presentation
- 2
- Soundness
- 2
Read review
Paper summary
The paper introduces VecMALT, a fixed-width global-plus-local representation for geospatial vector geometry, with local records pairing features and spatial frames. It combines constrained allocation, transport-based chart construction, refinement, and sampled boundary supervision. Experiments cover reconstruction across code widths, frozen-code attribute readers, feature–frame reassignment, public downstream tasks, and storage/runtime. The results support the broad value of local capacity for difficult polygon reconstruction and suggest that record-aware readers can improve access to frozen codes, but the specific benefits of VecMALT’s allocation and support mechanism are not isolated.
Critical strengths
- The global-plus-local representation and explicit feature–frame records address a meaningful problem: retaining both global geometry and localized spatial information under a bounded latent width.
- The evaluation distinguishes reconstruction, spatial support, and independent readout, and reports useful negative results and protocol qualifications rather than presenting a uniformly favorable picture.
Critical weaknesses
Critical Weaknesses:
- Major Issue 1 — The central method comparison is not causally isolated. In Section 4 and Appendix A.7, Uniform-local, Demand-adaptive, and VecMALT differ in allocation, transport cost, refinement, regularization, schedules, and boundary supervision. The experiments therefore establish at most that particular complete systems behave differently; they do not establish that coverage-constrained allocation causes the gains. The broad local-versus-global conclusion is more credible than VecMALT’s specific superiority.
- Major Issue 2 — The independent-reader comparison is substantially confounded. In Section 3.4 and Appendix H.2, Flat MLP, code-chunk attention, and chart-record attention differ in grouping, parameter sharing, normalization, architecture, and parameter count. Thus, the 31.8% window-MAE reduction and the reassignment result support the usefulness of one record-aware interface, but do not cleanly establish that learned spatial frames or VecMALT codes themselves provide the improvement. Area-priority checkpoint selection (Appendix A.4) is an additional confound because area is a headline readout target.
Minor Issues:
- Most experiments use a single training seed, while the reported bootstrap intervals condition on fitted models and do not capture seed variability. This makes small differences and intervention rankings difficult to interpret.
- The paper should distinguish fixed latent width from total serialized capacity, since pose and header information add substantial storage (Equation (1), Tables A1, and Appendix G.3).
- The external topology evidence is limited (Appendix B.3: 17 polygons with holes and 3 multipart polygons), and the public-task protocol is transductive because test geometries participate in representation learning. Claims about general topology preservation and unseen-geometry reuse should therefore be narrowed.
- Comparisons with Geo2Vec combine different acquisition, fitting, compute, and extraction protocols; the scope of this comparison should be made explicit.
Questions for authors
- Clarification that could change the assessment: Can the central B=512 comparisons be repeated across multiple representation and reader-training seeds, with uncertainty that includes seed variability?
- Can the allocation ablations hold localization, refinement, regularization, and boundary supervision fixed while changing only the allocation component?
- Can the reader comparison match normalization, parameter count, architecture, and training budget, including controls with randomized spatial frames or feature–frame pairings?
- Are pose and structural-header fields available to downstream readers, and do the results hold when total serialized storage—not only latent width—is matched?
- Can external results be reported separately by source, scale, and topology, and can the public results be clearly labeled as transductive?
5 comments
Response to s2XF — Part 2 of 3: Reader controls and checkpoint selection
Major Issue 2: Same architecture, normalization, and training for the frame intervention
The new frame-masked control uses the original 34,689-parameter chart-record reader. For , we reuse the intact condition's task-training normalization, then zero the two anchor and three metric channels of each standardized record. The eleven feature channels, global embedding, query input, input width, and architecture remain unchanged.
Masking applies to training, validation, and test inputs before reader retraining. Intact and masked runs use paired reader seeds, the same maximum of 50 epochs, and validation-MAE checkpoint selection. Reassignment preserves both feature and frame sets while changing their correspondence. The encoder and reconstruction decoder remain frozen; each condition starts from the same cached codes and applies its specified input transformation.
Two experimental groups are reported separately. Fixed-code runs keep representation seed 42 and vary reader seeds 42–46. New representation/reader pairs use matching seeds 43–46 at both stages. Evaluation comprises 20,000 external polygons and 64 windows per object. Tables S3–S4 focus on VecMALT and Uniform-local; ± denotes sample SD across the runs in each row.
Table S3. Window MAE under matched frame interventions.
| Setting | Configuration | Intact | Frame-masked | Reassigned |
|---|---|---|---|---|
| Fixed codes; five readers | Uniform-local | 0.032360 ± 0.001139 | 0.032908 ± 0.001868 | 0.032693 ± 0.001574 |
| Fixed codes; five readers | VecMALT | 0.032829 ± 0.001648 | 0.032953 ± 0.001452 | 0.033386 ± 0.001366 |
| Four new trained pairs | Uniform-local | 0.031691 ± 0.001935 | 0.032398 ± 0.001755 | 0.033175 ± 0.002021 |
| Four new trained pairs | VecMALT | 0.031191 ± 0.000791 | 0.032497 ± 0.002121 | 0.033916 ± 0.000915 |
For VecMALT, masking raises MAE in 4/5 fixed-code runs but gives a small mean increase (+0.38%). In the new pairs, the paired masking increase is +0.001306 ± 0.002663 (3/4 positive); reassignment gives +0.002725 ± 0.000677 (4/4 positive). Original correspondence has repeated support, while the explicit-coordinate effect varies across runs. Revised Table 4B and Tables M8–M9 report the intervention and interface comparisons.
The interface benefit is distinct from the frame-only effect
Flat-code MLP, code-chunk attention, and chart-record attention have 74,497, 28,353, and 34,689 registered parameters. Their comparisons test complete interfaces; only the intact/masked/reassigned controls hold the chart-record architecture fixed.
Table S4. VecMALT paired interface comparisons; negative differences favor intact reading.
| Setting | Intact − Flat MAE | Lower in | Intact − Chunk MAE | Lower in |
|---|---|---|---|---|
| Fixed codes; five reader seeds | −0.012164 ± 0.002323 | 5/5 | −0.002082 ± 0.002655 | 4/5 |
| Four new representation/reader pairs | −0.013395 ± 0.000630 | 4/4 | −0.003524 ± 0.001812 | 4/4 |
Intact reading improves over flat in 9/9 comparisons and chunk in 8/9, across these two designs. Reductions computed from mean MAEs are 27.0% and 30.0% versus flat. These comparisons measure record organization together with reader architecture, sharing, and normalization. The matched frame controls above examine the explicit channels; retained features may still encode spatial information.
Area-priority does not select on the downstream area regressor
Area-priority selects representation checkpoints using internal polygon-family, complexity-tier-weighted field errors and polygon field/geometry terms (Appendix A.4). The independent area MLP, window-reader errors, and downstream test labels are not selection inputs. Reader fitting follows checkpoint selection, and all conditions reading the same code share that checkpoint.
Response to s2XF — Part 3 of 3: Storage, external strata, and evaluation scope
Total storage and reader inputs
At in FP32, a local code stores 512 bytes of global features, 480 bytes of frames, and 1,056 bytes of local features: 2,048 bytes in total. All frame coordinates count toward the code budget. Independent readers receive the code and, for windows, the query rectangle; pose and structural headers are not reader inputs.
Table S5. Measured storage, including metadata.
| Configuration | Learned code (bytes/object) | Mean payload (bytes/object) | With amortized decoder (KiB/object) |
|---|---|---|---|
| Global-only | 2,048 | 2,896.3 | 3.122 |
| Uniform-local | 2,048 | 2,896.3 | 3.067 |
| Demand-adaptive | 2,048 | 2,896.3 | 3.067 |
| VecMALT | 2,048 | 2,896.3 | 3.067 |
Payload includes 16 identifier/index bytes and mean pose/header storage of 832.3 bytes. Decoder amortization uses 54,379 objects, as in submitted Table G7. Thus the measured mean object payload is matched across the four encoder configurations; shared networks and compute are separate resources.
Source-specific external results
The following use the original seed-42 reconstructions, not the new-seed averages.
Table S6. External reconstruction by source.
| Configuration | Delhi buildings: IoU (%) | São Paulo land use: IoU (%) | Cairo curves: CD (m) |
|---|---|---|---|
| Adapted Geo2Vec | 98.8938 | 96.8627 | 0.4081 |
| Global-only | 99.2137 | 96.8532 | 0.3606 |
| Uniform-local | 99.6259 | 98.2494 | 0.4071 |
| Demand-adaptive | 99.5667 | 98.2007 | 0.4980 |
| VecMALT | 99.6266 | 98.2400 | 0.4021 |
The columns contain 32,373 polygons, 7,100 polygons, and 14,903 curves. Three additional São Paulo curves remain in the all-object evaluation. Local configurations improve polygon IoU in both polygon sources; Global-only leads Cairo curve CD. Geography and feature type are coupled, so these are source-specific effects.
Scale and topology
Table S7. Polygon HD95 in meters, from Table J2. The common-scale subset uses reference pose scale ≤362.0883 m (the population's 99th percentile). P95 is computed across finite per-object HD95 values; the final column gives the subset's finite-distance count.
| Configuration | Full mean | Full P95 | Common-scale mean | Subset finite n |
|---|---|---|---|---|
| Adapted Geo2Vec | 0.4014 | 1.1401 | 0.2061 | 39,078 |
| Global-only | 0.7714 | 1.5839 | 0.2280 | 39,078 |
| Uniform-local | 0.6517 | 0.6556 | 0.1063 | 39,077 |
| Demand-adaptive | 0.3682 | 0.6769 | 0.1187 | 39,077 |
| VecMALT | 0.5980 | 0.6421 | 0.1044 | 39,078 |
VecMALT has the lowest full-population P95 and common-scale mean. One retained large polygon contributes 53.73% of its summed meter-valued HD95, explaining the sensitivity of the full mean to scale. The diagnostic subset was already reported in Table J2.
Table S8. Polygon IoU (%) on the available topology subsets.
| Configuration | With holes (n=17) | Multipart (n=3) |
|---|---|---|
| Adapted Geo2Vec | 81.9489 | 92.2330 |
| Global-only | 66.6714 | 74.5068 |
| Uniform-local | 81.7094 | 93.6014 |
| Demand-adaptive | 77.5412 | 93.4860 |
| VecMALT | 82.6698 | 93.8915 |
These estimates describe 17 hole-containing polygons and three multipart polygons; the sample counts limit conclusions about topology preservation.
Transductive public tasks and Geo2Vec's protocol
External reconstruction and area/window evaluation use held-out geometries. Public Shape/Edge learns representations from all cohort geometries without task labels, then holds out labels for reader evaluation. This transductive protocol tests label readout on known geometries (Section 4); Edge counts stored segments, including collinear vertices. The exploratory Shape-head revision is separately identified in Appendix K.4.
On external objects, adapted Geo2Vec fits new codes for 1,000 steps with its decoder frozen, whereas encoder methods use forward passes over prepared evidence. On public cohorts it exports jointly learned codes. These are comparisons under the declared adaptation and extraction pipelines, not equal acquisition compute. Acquisition and cached-code reading are reported separately.
Response to s2XF — Part 1 of 3: Allocation and representation-training variation
The new experiments address the two attribution questions separately: a one-factor marginal control tests allocation, and a same-architecture intervention tests explicit frame inputs. Additional representation seeds evaluate training variation.
Major Issue 1: A matched allocation-only test
The new control changes only λmax from 0.25 to zero, making the target token marginal uniform. Architecture, localization, transport cost and solver, refinement, regularization, boundary supervision, the remaining schedule settings, the 100,000-step budget, and checkpoint selection retain their Full settings. This differs from historical Uniform-local, which changes other settings, and from no learned importance, which retains the geometric prior in the marginal. The control protocol is given in revised Appendix M.4.
Full and control each use representation seed 42. Their codes are frozen before training readers with paired seeds 42–46. Evaluation uses the same 20,000 external polygons, with 64 windows per object. Values are mean ± sample SD across five reader runs.
Table S1. Window MAE in the allocation-only comparison.
With intact records, Full lowers mean MAE by 3.48%; the paired Full-minus-control difference is −0.001185 ± 0.000781. RMSE also decreases, from 0.060352 to 0.059593. Full has lower mean MAE in four conditions; code-chunk attention favors the control.
The control's intact MAE is higher than historical Uniform-local's (0.034014 versus 0.032360); it retains Full's other settings to isolate marginal adaptation rather than reproducing that configuration.
Additional representation seeds
We completed seeds 43–46 at B=512 for all five methods: 20 additional representation runs, with reconstruction and area/window evaluation. Table S2 reports polygon metrics across those four runs. Canonical distances are scaled by 103; the last column is in meters.
Table S2. Polygon reconstruction, mean ± sample SD.
All runs are included. VecMALT exceeds Uniform-local's polygon IoU in all four paired runs, has the lowest mean canonical polygon distances, and averages 0.5853 percentage points above Global-only in IoU. Uniform-local's seed-44 IoU is 98.835692%, versus approximately 99.35–99.36% in its other runs, accounting for its larger spread. Demand-adaptive retains the lowest mean meter-valued polygon HD95.
The corresponding reconstruction results are in revised Table 4A and Appendix M.2. Part 2 separates reader-seed variation on fixed codes from variation across new representation/reader pairs.