跳到正文
研踪PaperTrail
← 研踪 PaperTrail

arXiv:2610.04337 · v3

FLAT: Smoothing the Rugged Landscape for Learnable, Sample-Efficient Traffic Calibration

首次提交 2026-10-03 15:05
版本更新 2026-11-17 01:25
雷达观测 2026-11-17 16:10
arXiv ↗PDF ↗

摘要

Calibrating microscopic traffic models for urban digital twins is an expensive black-box optimization problem: evaluating each set of car-following and lane-changing parameters requires a full simulation, limiting the evaluations available per recalibration window. Matching raw trajectories yields a rugged objective that sparse surrogates struggle to 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 LCB loop supports a Gaussian process (GP), random forest (RF), or multi-layer-perceptron (MLP) ensemble. 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 100-run budget. Some baselines require up to 4.4 times as many simulations to match. Ablations show objective choice shifts final behavioral error by 80.6% on average, removing sequential LCB raises the six-scene mean by 21.7%, and surrogate choice shifts it by at most 4.2%, confirming gains trace to objective geometry and sequential allocation rather than surrogate capacity.

作者备注:9 pages, 28 figures. Code and cache: https://github.com/QianyHP/FLAT-calibration

AI 论文解读

基于摘要 · 非全文审阅

此版本尚未生成 AI 解读。解读由后台任务生成并按论文版本保存,登录后共享已有结果。

版本差异

本站首次收录为 v3,暂无更早版本可对照。

观测到的版本

相邻记录可能跳过中间版本;首次发现 v2 及以上也会标为版本更新。

v3 · 2026-11-17 01:25 · 最新观测版本

FLAT: Smoothing the Rugged Landscape for Learnable, Sample-Efficient Traffic Calibration

Calibrating microscopic traffic models for urban digital twins is an expensive black-box optimization problem: evaluating each set of car-following and lane-changing parameters requires a full simulation, limiting the evaluations available per recalibration window. Matching raw trajectories yields a rugged objective that sparse surrogates struggle to 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 LCB loop supports a Gaussian process (GP), random forest (RF), or multi-layer-perceptron (MLP) ensemble. 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 100-run budget. Some baselines require up to 4.4 times as many simulations to match. Ablations show objective choice shifts final behavioral error by 80.6% on average, removing sequential LCB raises the six-scene mean by 21.7%, and surrogate choice shifts it by at most 4.2%, confirming gains trace to objective geometry and sequential allocation rather than surrogate capacity.

查看此版本解读 →查看此版本原文 ↗