An asymptotically minimax kernel machine

Recently, a class of machine learning-inspired procedures, termed kernel machine methods, has been extensively developed in the statistical literature. In this note, we construct a so-called ‘adaptively minimax’ kernel machine. Such a construction highlights the limits on the interpretability of such kernel machines.