“…The tuple (P, w, X, f ) is called the query space, and it defines the optimization problem at hand -where usually, the goal is to find x * ∈ arg min x∈X p∈P w(p)f (p, x). Given a query space (P, w, X, f ), a coreset is a small weighted subset of the input P that can provably approximate the cost of every query x ∈ X on P Jubran et al, 2021); see Definition 2.1. In particular, a coreset for a RBFNN can approximate the cost of an RBFNN on the original training data for every set of centers and weights that define the RBFNN (see Section 4).…”