mlsanityData to 7 Oct 2026

OASI: Objective-Aware Surrogate Initialization for Multi-Objective Bayesian Optimization in TinyML Keyword Spotting

arXiv 2512.19739 ↗First posted 17 Dec 2025cs.LG cs.SDcited by 2

Not on the map. Why?

Abstract (arXiv)

Voice-triggered interfaces rely on keyword spotting (KWS) models that must operate continuously under strict memory, latency, and energy constraints on microcontroller-class hardware. Designing such models therefore requires not only high recognition accuracy but also predictable deployability within limited Flash and SRAM budgets. Bayesian optimization is known to handle accuracy-efficiency trade-offs effectively in multi-objective optimization; however, it is highly sensitive to initialization, particularly in the low-budget regimes of TinyML model optimization. We propose Objective-Aware Surrogate Initialization (OASI), which seeds surrogate optimization with Pareto-biased solutions generated via multi-objective simulated annealing. Unlike space-filling or heuristic warm-start methods, OASI initializes the surrogate conditioning process with a bias toward feasible accuracy-memory trade-offs, thus avoiding SRAM-violating configurations. OASI improves hypervolume and convergence robustness over Latin hypercube, Sobol, and random initializations under the same budget constraints on a TinyML KWS problem. Hardware-in-the-loop experiments on STM32 microcontrollers verify the existence of deployable and memory-feasible models without incurring extra optimization costs.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 4 of its 14 references that are in the map. First posted on arXiv 17 Dec 2025.

Builds on

4 of 14 references.

References · 4

  1. 2018Speech Commands: A Dataset for Limited-Vocabulary Speech Recognitioncited by 741
  2. 2021Multi-Objective Bayesian Optimization over High-Dimensional Search Spacescited by 87
  3. 2021Deep Spoken Keyword Spotting: An Overviewcited by 43
  4. 2025Advances in Small-Footprint Keyword Spotting: A Comprehensive Review of Efficient Models and Algorithmscited by 3

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 2.

2 papers.