Metraipolis › archive › dc_bd15f22a8a4a
FLAT: Smoothing the Rugged Landscape for Learnable, Sample-Efficient Traffic Calibration — arXiv:2610.04337
- Source
- arXiv
- Original
- https://arxiv.org/abs/2610.04337
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-06T05:32:05.235Z
- SHA-256 of the archived text
89f6835e5f12e62197d5fb75b95847136198c7c9124ca623deb5175f5f453587- Stable URL of this page
https://metraipolis.com/documento/dc_bd15f22a8a4a
How to cite
FLAT: Smoothing the Rugged Landscape for Learnable, Sample-Efficient Traffic Calibration — arXiv:2610.04337 — arXiv, https://arxiv.org/abs/2610.04337 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_bd15f22a8a4a (Metraipolis archive dc_bd15f22a8a4a, sha256 89f6835e5f12e62197d5fb75b95847136198c7c9124ca623deb5175f5f453587)
BibTeX
@misc{dcbd15f22a8a4a,
title = {FLAT: Smoothing the Rugged Landscape for Learnable, Sample-Efficient Traffic Calibration — arXiv:2610.04337},
howpublished = {arXiv},
url = {https://arxiv.org/abs/2610.04337},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_bd15f22a8a4a; sha256 89f6835e5f12e62197d5fb75b95847136198c7c9124ca623deb5175f5f453587},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv, https://arxiv.org/abs/2610.04337. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Calibrating microscopic traffic models for digital twins is an expensive black-box optimization problem: tuning car-following and lane-changing parameters requires a full simulation run, affording only a tight budget per recalibration window. Matching raw trajectories yields a rugged objective that sparse surrogates cannot learn, reducing sequential acquisition to near-random probing. We present FLAT, which couples what to optimize with where to sample next. An eight-dimensional behavioral fingerprint smooths the parameter-error landscape, making the objective learnable from a few dozen samples; annealed lower-confidence-bound (LCB) acquisition then spends each remaining run where it most reduces error. The surrogate, interchangeable among a Gaussian process (GP), random forest (RF), or multi-layer-perceptron (MLP) ensemble, plugs into the same LCB loop. Across six heterogeneous real-world scenes, FLAT-GP achieves the lowest scene-averaged behavioral error, winning 6/6 scenes against SPSA, GA, and CMA-ES and 5/6 against TPE under the matched budget. Some baselines need up to 4.4 times more simulations to match. Ablations show objective choice shifts final behavioral error by 81% on average, removing sequential LCB raises the six-scene mean by 20%, and surrogate choice shifts it by at most 4.2%, confirming gains trace to objective geometry and sequential allocation rather than surrogate capacity. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Physics and Society (physics.soc-ph) ; Computational Engineering, Finance, and Science (cs.CE); Machine Learning (cs.LG). Pagina del lavoro: https://arxiv.org/abs/2610.04337 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-06T05:27:05.958Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).