- Rating
- 3(+1)
- Confidence
- 3
- Informativeness
- 2
- Presentation
- 3
- Soundness
- 3
Read review
Paper summary
This paper proposes Segment-Delta, a method for improving trajectory simplification by replacing selected points while keeping the same number of points. For segment-local reconstruction objectives, it finds the same best replacement as exhaustive search with fewer candidate comparisons. It also uses the edit structure to rank proposals for a frozen Transformer, checking each accepted change against the full objective. Experiments on GeoLife and Porto show lower reconstruction errors for classical and learned simplifiers, with faster refinement than exhaustive search.
Critical strengths
S1. For segment-local objectives, the method finds the same best replacement as exhaustive search while reducing candidate comparisons to (O(n+k) per round.
S2. The proposed method achieves near-optimal results under linear interpolation.
Critical weaknesses
W1. The paper only tests one recent published method, MLSimp. It would be useful to test more recent methods, such as S3 and RL4QDS where applicable, to see whether the improvements also hold for other existing simplifiers.
W2. Being faster than exhaustive refinement does not show whether the post-processing is worth its extra cost. Trajectory simplification needs to balance runtime and quality, so the paper should compare each original method with its refined version using total runtime, including both initial simplification and refinement.
W3. Scalability with longer trajectories is not clear. An experiment with large and increasing k should be added.
Questions for authors
Please address the weaknesses
4 comments
Follow-up on our response
Dear Reviewer FHhY,
Thank you again for your helpful suggestions. We wanted to briefly follow up on the additional experiments in our response: comparisons with S3 and an RL4QDTS-derived selector, quality–runtime measurements for the full simplification-plus-refinement pipeline, and scalability tests with longer trajectories and increasing .
We would welcome your thoughts on these results and would be happy to discuss any remaining concerns or clarify any points that need further explanation.
The authors have addessed most of my concerns. I have raised the recommendation to weak acceptance.
Thank you
Thank you for reviewing our additional experiments and clarifications. We really appreciate your time and helpful suggestions.
Response to Reviewer FHhY
Thank you for these suggestions.
W1. Additional learned simplifiers. We added S3 NoGraph and an RL4QDTS-derived selector to test Segment-Delta (SD) on outputs from additional learned simplifiers. For every method, budget and seed, SD yields lower mean error than the unrefined output and near-only refinement. Both selectors use fixed sample-index Linear reconstruction during training and evaluation. S3 retains its straight-through selector and learned temperature, replacing neural reconstruction with Linear during training and evaluation. RL4-derived retains INB/OUB policies, with its environment and rewards adapted to Linear reconstruction.
Both use the same 2,000 length-1,000 GeoLife trajectories and total budgets of 24,000/44,000 points: 1%/2% interior budgets, or 1.2%/2.2% including endpoints. Allocation may differ between upstreams. The unrefined output (Original), near-only refinement (Near) and SD are paired within each frozen output, preserving its point count and endpoints. S3's selector uses token candidates; SD can refine over the original samples.
Entries are mean non-anchor Euclidean errors in meters, averaged over three training seeds. Validation selects one checkpoint per seed jointly across budgets; every selected checkpoint improves over initialization on validation at both budgets. Training curves, checkpoint selection and matched controls are in Appendix L: S3 improves over candidate/quota-matched random subsets on test; RL4-derived improves over matched random-action policies on validation.
W2. Quality versus total cost. The same-cohort experiment measures the entire simplification-plus-refinement pipeline. A strong, inexpensive Greedy initializer remains substantially improvable:
Times cover the full 2,000-trajectory batch. SD reduces Greedy error by 33.5%/34.0%, adding 4.44/6.55 s to the batch. Relative to Near, SD reduces remaining error by 10.5%/12.8% for 22.8%/24.9% more total time. For each retention budget, Greedy+SD lies on the quality-time frontier of the tested Original/Near/SD configurations across all four upstreams: no other configuration at equal or lower total time attains equal or lower mean error. Across MLSimp, RL4-derived and S3, SD reduces error by 58.7-84.7% versus Original, with 4.7-67.1% more total time (Table 3).
Total time includes upstream construction/inference, model loading where applicable, preparation, refinement and output assembly; raw-data loading and JIT setup precede measurement. The methods use the same hardware and a fixed eight-worker native refiner; S3 was measured in a separate batch. Sec. 4.2 and Appendix L provide all upstream costs, repetitions and the full frontier.
To test whether the quality gain persists at equal refinement time, we compare SD and Near on 128 MLSimp outputs using recorded completion times of accepted updates. This experiment uses just-in-time-compiled interval evaluation and the original nominal 1%/2% masks, timed independently of the full-pipeline study. At 50 ms, Near gives 172.33/63.99 m and SD gives 141.92/46.06 m: 17.6%/28.0% lower error at the same time. Near is better at 10 ms; SD is better at every tested time budget from 25 ms to 2 s. Appendix L gives curves at all eight time budgets.
W3. Longer trajectories and increasing k. Full refinement now covers natural GeoLife trajectories from 13 deduplicated source-user groups, n=1,000/2,000/4,000, k/n=2%/10%/25%, and fixed k=20: 11 configurations and 143 nested states; k includes endpoints. Identical Douglas-Peucker anchors, Linear costs at the original timestamps and a shared native implementation on one CPU core are used. Timing includes interval construction, search, updates and the terminal scan, with one warmup and five repetitions.
Compared with exhaustive refinement (EX), paired median EX/SD speedups at 10%/25% retention rise from 3.040/4.835x at n=1,000 to 13.157/20.599x at n=4,000. In the largest cell (n=4,000, k=1,000), marginal median EX/SD times are 1.4903/0.0725 s. All 143 terminal anchor sets/objectives match. Fixed-k speedups remain 1.161/1.116/1.061x: with fixed small k, EX's candidate count is already linear in n. Fig. 2 and Appendix N report all configurations, absolute costs and source-group bootstrap intervals.