FLAT: Smoothing the Rugged Landscape for Learnable, Sample-Efficient Traffic Calibration
Haopeng Deng, Thomas He, Dayuan Wang
原文摘要
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.
physics.soc-ph · cs.CE · cs.LG