mlsanityData to 14 Oct 2026

CAROL: Context-Aware Online Learning for Fuzzer Scheduling

arXiv 2609.06772 ↗First posted 6 Sep 2026cs.SE cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Ensemble fuzzing runs multiple fuzzers on a target while a scheduler allocates CPU time among them. Existing schedulers base these decisions on compact summaries of past performance and rules fixed before a campaign. Our measurements reveal two limitations. First, past-reward summaries do not reliably capture performance evolution: after accounting for estimation noise, agreement between consecutive-window rankings is statistically indistinguishable from within-window self-agreement. Second, predictive signals vary across targets: on eight of nine targets, a weighting learned from the other eight predicts reward worse than one learned on the current target. We introduce CAROL, an online scheduler that uses each fuzzer's current context. Already available to the dispatch loop, this context describes reward trends, waiting and plateau time, reached code, and estimation uncertainty. CAROL uses context in two ways: a domain-guided method detects whether a fuzzer is rising or rotting and applies a phase-specific learning rule, while a learned method predicts reward from 15 context signals and uses predictive uncertainty for online selection. Across nine Magma targets, CAROL triggers more unique bugs than each of three ensemble-scheduling baselines whenever their results differ, and fewer on none. Compared with the strongest baseline for each target, CAROL gains 11.8% and surpasses an oracle that retrospectively selects the best single fuzzer per target. Removing context eliminates the gain, and the additional bugs are concentrated among those the baselines trigger rarely or never. Run unchanged on five widely used C++ programs, CAROL finds 120 previously unknown crashing defects, deduplicated by site, fault, and entry point; all were reported to maintainers through the projects' stated disclosure channels.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 21 of its 58 references that are in the map. First posted on arXiv 6 Sep 2026.

Builds on

21 of 58 references.

References · 21

  1. 2014Taming the Monster: A Fast and Simple Algorithm for Contextual Banditscited by 201
  2. 2020Beyond UCB: Optimal and Efficient Contextual Bandits with Regression Oraclescited by 197
  3. 2013Finite-Time Analysis of Kernelised Contextual Banditscited by 177
  4. 2019Weighted Linear Bandits for Non-Stationary Environmentscited by 86
  5. 2018A Contextual Bandit Bake-offcited by 64
  6. 2017Rotting Banditscited by 57
  7. 2018Evaluating Fuzz Testingcited by 32
  8. 2019Recovering Banditscited by 29
  9. 2022Stochastic Rising Banditscited by 18
  10. 2023Doubly High-Dimensional Contextual Bandits: An Interpretable Model for Joint Assortment-Pricingcited by 8
  11. 2024SoK: Prudent Evaluation Practices for Fuzzingcited by 8
  12. 2026The Impact of Magma: A Ground-Truth Fuzzing Benchmarkcited by 4
9 more
  1. 2018Adaptive Grey-Box Fuzz-Testing with Thompson Samplingcited by 3
  2. 2023autofz: Automated Fuzzer Composition at Runtimecited by 3
  3. 2020MEUZZ: Smart Seed Scheduling for Hybrid Fuzzingcited by 2
  4. 2025BandFuzz: An ML-powered Collaborative Fuzzing Frameworkcited by 2
  5. 2026A single algorithm for both restless and rested rotting banditscited by 2
  6. 2018Improving Grey-Box Fuzzing by Modeling Program Behaviorcited by 1
  7. 2022DARWIN: Survival of the Fittest Fuzzing Mutatorscited by 1
  8. 2025Ensemble Fuzzing with Dynamic Resource Scheduling and Multidimensional Seed Evaluationcited by 1
  9. 2025ReFuzz: Reusing Tests for Processor Fuzzing with Contextual Banditscited by 1

Built on by

Not cited yet.