Meta-theorems for linear kernels have been the subject of intensive research.
We follow the line toward even larger graph classes using stronger parametrization.
FII problems have linear kernels on graphs of bounded expansion, parameterized by the size of a treedepth-modulator.
For nowhere dense classes, this yields almost-linear kernels.
FII is required only on graphs of bounded treedepth.