Recall that a subset $B \subset \mathbb{N}$ is called an additive basis of order $h$ if there exists a finite set $C \subset \mathbb{N}$ such that $\mathbb{N} \setminus C = hB$, where $hB = B + \cdots + B$ $h$ times. Waring's problem asks whether $\mathbb{N}^k = \{n^k : n \in \mathbb{N}\}$ is an additive basis of finite order, and if it is, find the order. This is usually denoted $G(k)$ and the precise value of $G(k)$ is not known except for $k=2,4$, and the upper bound $G(k) \leq k \log k + k \log \log k + ck$ for some constant $c > 0$ is known (due to Wooley).

My question is the following. Suppose that we fix an $h$. Certainly if $h \geq G(k)$ for some $k$, then $\mathbb{N}^k$ is an additive basis of order $h$. Hence choose $k$ so that $h < G(k)$. What is the minimum number $l$ of integers from the set $\{k, k+1, \cdots \}$, say $m_1, \cdots, m_l$ that can be chosen so that $\mathbb{N}^{m_1} \cup \cdots \cup \mathbb{N}^{m_l}$ is an additive basis of order $h$? Is $l$ guaranteed to be finite? For cases when $l$ is finite, is there a canonical choice for the $m_1, \cdots, m_l$ (with respect to $h$) that can be made?