Research map / Learning theory and algorithms / Prediction and decision losses
Self-Bounded Prediction Suffix Tree via Approximate String Matching
Dongwoo Kim, Christian Walder
Read the paperCheck your idea against 137,217 papers
AI-extracted. The measured effects below were read by AI from the paper's full text (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Measured effects reported in the paper
| What was changed | Where | Measured | Effect |
|---|---|---|---|
| use approximate Hamming-distance suffix matching instead of exact matching | PST · JBM | accuracy: 0.231 -> 0.246 | Improved |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · PMD | accuracy: 0.386 -> 0.442 | Improved |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · NOT | accuracy: 0.510 -> 0.571 | Improved |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · MUS | accuracy: 0.253 -> 0.270 | Improved |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · System calls [100, 200] | accuracy: 0.292 -> 0.300 | Improved |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · System calls [200, 300] | accuracy: 0.408 -> 0.411 | Improved |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · System calls [300, 500] | accuracy: 0.803 -> 0.803 | No clear effect |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · Human activity Subject A | accuracy: 0.362 -> 0.385 | Improved |
| use approximate Hamming-distance suffix matching instead of exact matching | PST · Human activity Subject B | accuracy: 0.238 -> 0.238 | No clear effect |
| increase the maximum Hamming distance epsilon for approximate suffix matching (ablation) | aPST · Multiclass synthetic sequence prediction | accuracy | Improved |
Closest papers by meaning
- Efficiently Enumerating Substrings with Statistically Significant Frequencies of Locally Optimal Occurrences in Gigantic String (AAAI 2020 · similarity 0.82)
- Learning-Augmented Search Data Structures (ICLR 2025 · similarity 0.81)
- On the Power of Learning-Augmented Search Trees (ICML 2025 · similarity 0.80)
- Accelerating Diffusion Language Models via Structured Suffix Modeling (NeurIPS 2026 · similarity 0.80)
- Conformal Autoregressive Generation: Beam Search with Coverage Guarantees (AAAI 2024 · similarity 0.80)
- Universality of Linear Recurrences Followed by Non-linear Projections: Finite-Width Guarantees and Benefits of Complex Eigenvalues (ICML 2024 · similarity 0.80)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.
