Extracted main text — title through conclusion, appendix excluded. This is what our citation measures are computed over, published so the extraction can be checked by eye.
Rendered from LaTeX for readability, not typeset faithfully. Citation keys are highlighted; maths is left as source; figures, tables and equation environments are summarised rather than reproduced; unrecognised commands are greyed out so nothing is silently dropped. Email addresses are removed.
-2cm Large-Scale Estimation under Unknown Heteroskedasticity
abstractThis paper studies nonparametric empirical Bayes methods in a heterogeneous parameters framework that features unknown means and variances. We provide extended Tweedie’s formulae that express the (infeasible) optimal estimators of heterogeneous parameters, such as unit-specific means or quantiles, in terms of the density of certain sufficient statistics. These are used to propose feasible versions with nearly parametric regret bounds of the order of $(\log n)^\kappa / n$. The estimators are employed in a study of teachers' value-added, where we find that allowing for heterogeneous variances across teachers is crucial for delivering optimal estimates of teacher quality and detecting low-performing teachers.
KEY\ WORDS: Empirical Bayes, Shrinkage Estimation, Unknown Heteroskedasticity, Nonparametric Estimation.
Introduction
The central task of this paper is the large-scale, optimal estimation of unit-specific parameters under unknown heteroskedasticity.
Motivating examples\footnote{Examples of the following three applications are Chetty2018, Gilraine2020, and Liu2020 respectively.}
of this include estimation of intergenerational mobilities of individual neighborhoods that are used to inform families on the areas with highest potentials for upward mobility, or estimation of teacher value-added that is necessary as inputs in high-stakes labor decisions.
We work within the following model in which, or variations of it, the estimation problem of these applications are framed\footnote{We focus on (ref) for common $J_i=J$ and discuss variations such as heterogeneous $J_i$ subsequently in Section (ref). This is because the central feature of our analysis is the unknown heteroskedasticity.}:
equation[equation omitted — 171 chars of source]
for $j=1,\dots,J$ and the unobserved $(\mu_i,\sigma_i) \sim_{\text{iid}} G_0$ for $i=1,\dots,n$.
Subsequently we also discuss settings where the point estimation is nested into more complex problems, such as optimal forecasting for a large collection of short time series, and demonstrate our results' relevance there.
For now, let us consider the teacher value-added literature as a concrete example: the outcome $y_{ij}$ represents the test score of the $j^{th}$ student in teacher $i$'s class, often after partialling out student-specific controls such that the independence of $\epsilon_{ij}$ is reasonable.
A common objective is to estimate $\left\{\mu_i\right\}_{i\in[n]}$, interpretable as how the average student (i.e., $\epsilon_{ij}=0$) will perform under each teacher and commonly termed as the teachers' mean value-added.
Relative to the existing large-scale estimation methods that impose homoskedasticity, we develop optimal estimators that allow for unknown heteroskedasticity. This is important in at least two respects. First, $\sigma_i$ is a key component of the optimal estimator of $\mu_i$, and restricting $\sigma_i=\sigma$ may lead to estimators with large risk and in some cases systematic under- or over-estimation of certain subsets of $\{\mu_i\}_{i\in[n]}$. Furthermore, $\sigma_i$ is important for the estimation of unit-specific quantiles
equation[equation omitted — 167 chars of source]
that we shall argue are of policy-relevance, and a generalization of the commonly targeted mean value-added $\mu_i$.
For example, in the context of the teacher value-added literature, this means that we estimate and compare how the bottom (say) 10% student will perform under each teacher instead of focusing only on the average student. This will be a more relevant object than the means if policymakers are concerned about the lower tails of student performances under each teacher.
In many applications $J \ll n$, which carries two implications for the large-scale estimation. First, the small number of observations per unit implies usage of only unit $i$'s observations to estimate $\mu_i$ or $q_{\alpha,i}$ leads to imprecise estimates and therefore high risk. Second, the large $n$ allows us to borrow information across units to sharpen individual estimates which can reduce the average risk.
More precisely, it is known that the estimator of $\mu_i$ or $q_{\alpha,i}$ minimizing the average (across $i$) risk under quadratic loss is its posterior mean that takes $G_0$, the distribution of unit-specific parameters $(\mu_i,\sigma_i)$, as the prior.
This forms the oracle estimator\footnote{See the end of this Section for notational details.} $\mathbb{E}_{G_0}[\, \cdot \mid \mathcal{Y}_i ]$, where $\mathcal{Y}_i$ is the set of observations associated with unit $i$.
The oracle is infeasible because $G_0$ is unknown in practice, and feasible empirical Bayes versions that exploit the cross-sectional information to mimic the oracle $\mathbb{E}_{G_0}[\, \cdot \mid \mathcal{Y}_i ]$ have to be proposed.
However, nonparametric estimation of $G_0$ using the cross-section is known to have slow rates of convergence because we are essentially estimating a density of unobservables. This suggests that emulating the oracle will be a difficult task. In response to this, this paper proves
an extension of the well-known Tweedie's formula\footnote{We review this in Section (ref).} under homoskedasticity to the setting of unknown heteroskedasticity, where we show that the oracle depends on $G_0$ only through the density of some sufficient statistics under model (ref).
Thus the problem of emulating the oracle is dramatically simpler, since the performance of feasible versions now only hinge on their ability to estimate a density of observables.
We further exploit this insight to provide regret bounds for the proposed estimators that are of the order $(\log n)^\kappa /n$ for some $\kappa>0$.
The upsot is that there is little cost to practitioners adopting a nonparametric empirical Bayes approach, whereas the benefits in terms of risk reduction is often substantial relative to the commonly used parametric modeling of $G_0$.
The remaining paper is organized as follows. Section (ref) reviews the related literature. Section (ref) defines the model, risk and oracle estimators. Section (ref) proposes feasible versions of the oracles while
Section (ref) provides theoretical guarantees for the feasible versions.
Section (ref) discusses extensions to the model, including heterogeneous $J_i$ as well as constructing optimal forecasts in large-$n$ short-$T$ panels.
Section (ref) employs numerical experiments to evaluate the finite-sample performances of the proposed estimators vis-\`a-vis alternative estimators.
Section (ref) demonstrates the estimation methodology and objective through an application to estimation of teacher quality using a matched student-teacher dataset. Section (ref) concludes.
\noindentNotations.
The symbol $[n]$ refers to the set $\{1,\dots,n\}$. The symbol
$\mathcal{Y}_i$ refers to the set of observations associated with unit $i$ (i.e., $\{y_{ij}\}_{j\in[J]}$) and $\mathcal{Y}$ is taken to refer to the full set of observations (i.e., $\{y_{ij}\}_{i\in[n],j\in[J]}$), and finally $\mathcal{Y}^{(i)}$ refers to all observations except for $i$'s: $\{y_{lj}\}_{l\neq i,j\in[J]}$.
A subscript on an expectation operator denotes objects that are conditioned upon. For instance, both $\mathbb{E}_{G}[\mu \mid \mathcal{Y}_i]$ and $\mathbb{E}[\mu \mid G,\mathcal{Y}_i]$ mean the same thing: that the integration is performed conditional on $\mathcal{Y}_i$ and $G$. We may sometimes also use a superscript on an expectation operator to make explicit the objects that are integrated out. For instance, $\mathbb{E}_{G}^{\mu}[\mu \mid \mathcal{Y}_i]$ emphasizes that we are integrating out the unknown parameter $\mu$.
Related Work
Our paper is within the empirical Bayes methodology,
which goes back at least to Efron1973's interpretation of the James-Stein estimator as the posterior mean under a normal-normal hierarchical model with the normal prior estimated via method-of-moments.
The James-Stein estimator can therefore be thought of as a parametric empirical Bayes methodology, where a particular class of prior is proposed, and feasible versions are proposed that seek to emulate the optimal estimator within the class of Bayes estimates implied by the class of priors. Recent papers in the parametric empirical Bayes methodology include Xie2012, and Kwon2023b, and the methodology has seen applications in work such as Chetty2014, Finkelstein2016.
Parametric empirical Bayes is however restrictive in the sense that the choice of a prior induces sometimes undesirable behavior in the consequent estimator. For instance, subject to the same number of observations, the posterior mean under a normal-normal hierarchical model imposes equal shrinkage for all units.
Gilraine2020 studies the shortcomings of the parametric approach within an application of estimating teacher value-added under homoskedasticity and proposes nonparametric empirical Bayes estimators, a direction that we also take in this paper.
Nonparametric empirical Bayes is more ambitious in that it targets the posterior mean without imposing a parametric form on the prior, and affords the flexbility that the parametric approach lacks.
However, the nonparametric approach raises finite-sample concerns because $\mathbb{E}_{G_0}[\mu\mid \mathcal{Y}_i]$ depends on $G_0$, which suggests solving a deconvolution problem that is known to have slow rates of convergence (as slow as $(\log n)^{-1}$, see Fan1991).
In the restricted case of homoskedasticity $\sigma_i=\sigma$ for all $i$, theoretical progress was made possible by the Tweedie's representation of the posterior mean\footnote{Note that in the homoskedastic case, $G_0$ is supposed to represent the univariate distribution of $\mu_i$.}
(see Efron2011):
equation[equation omitted — 170 chars of source]
where $y_i$ is the sample mean and $f_{G_0}(y_i \mid \sigma)$ is the (mixture) density of $y_i$. The insight of Tweedie's formula is that $\mathbb{E}_{G_0}[\mu\mid \sigma,\mathcal{Y}_i]$ comprises of the MLE $y_i$ and a Bayes correction term, for which we only require $f_{G_0}(y_i \mid \sigma)$ as opposed to the prior $G_0$.
This insight was instrumental for
Jiang2009, which uses a certain nonparametric plug-in estimate $\hat{G}_0$, to establish the fast regret\footnote{Relative to the oracle that knows $G_0$.} convergence rates of $\mathbb{E}_{\hat{G}_0}[\mu\mid \sigma,\mathcal{Y}_i]$ in estimating $\{\mu_i\}_{i\in[n]}$. Their results were subsequently extended by Jiang2020 to the case of known heteroskasticity within a class of prior where the heteroskedasticity is assumed independent of $\mu_i$. More recent work by Chen2024 allowed for dependence between $\mu_i$ and the known heteroskedasticity, a feature that was demonstrated to be economically relevant, but where the dependence operates through the first two moments.\footnote{Remark (ref) elaborates in more precise terms the setting and contributions of our paper relative to these two papers. }
Our paper also adopts the nonparametric empirical Bayes approach, but is situated in a more general framework that allows for unknown heteroskedasticity.
This substantially complicates the estimation of $\mu_i$ since $\sigma_i$, which regulates the Bayes correction in (ref), is now unknown and has to be estimated. Furthermore, the aforementioned insight from (ref) is no longer applicable since we do not know the form of
$\mathbb{E}_{G_0}^\sigma [\sigma^2\frac{\partial}{\partial y}\log f_{G_0}(y_i \mid \sigma) \mid \mathcal{Y}_i]$
and in particular if it depends on $G_0$ solely through a density of observables.
In this regard, the papers that adopt a similar framework are Gu2017, Gu2017a and Banerjee2023.
Gu2017 and Gu2017a study the properties of $\mathbb{E}_{\hat{G}}[\mu\mid \mathcal{Y}_i]$ and $\mathbb{E}_{\hat{G}}[\sigma^2\mid\mathcal{Y}_i]$ for a nonparametric estimate $\hat{G}$ using simulations that show promising results, but do not provide theoretical guarantees.
In contrast, we provide a significant extension of the Tweedie's formula that accommodates unknown heteroskedasticity and use it as the basis to study the theoretical properties of $\mathbb{E}_{\hat{G}}[\mu | \mathcal{Y}_i]$ for a nonparametric $\hat{G}$. Crucially, we do not restrict the form of dependence within $(\mu_i,\sigma_i)$.
Banerjee2023 also studies the optimal estimation of $\left\{\mu_i\right\}_{i=1}^n$ under unknown heteroskedasticity, albeit under a precision-weighted loss function.
The precision-weighted loss function is easier to handle in that, roughly speaking, it transforms the heteroskedastic problem back into a homoskedastic one. However, the usage of the precision-weighted loss function is less appropriate for the types of applications we have in mind, where the estimation loss from each unit should be taken as equally important.
Finally, in addition to the estimation of $\{\mu_i\}_{i\in[n]}$, we also study the theoretical properties of similarly defined estimators for alternative estimation objectives such as unit-specific quantiles $\{q_{\alpha,i}\}_{i\in[n]}$ for some $\alpha\in(0,1)$ that we argue are a policy-relevant generalization of $\{\mu_i\}_{i\in[n]}$, and unit-specific variances $\{ \sigma_i^2\}_{i\in[n]}$ or standard deviations $\{\sigma_i\}_{i\in[n]}$ that may be relevant in other applications.
Model and Risk
Model
We maintain the following model throughout the paper:
equation[equation omitted — 177 chars of source]
for $j=1,\dots,J$ and $(\mu_i,\sigma_i) \sim_{\text{iid}} G_0$ for $i=1,\dots,n$, and discuss extensions to the model in Section (ref).
We now briefly discuss how matched datasets such as the matched student-teacher dataset of our empirical application fits into (ref). Suppose that there are $\bar{J}$ students in total, with each student $j$ represented by $\tilde{\epsilon}_j$ drawn from a common distribution, who are then matched to the $n$ teachers. Let $i(j): [\bar{J}] \mapsto [n]$ be a function that returns the teacher identity of student $j$ resulting from this matching process. The outcomes of the students are then realized after the matching process as
$\tilde{y}_j = \mu_{i(j)} + \sigma_{i(j)} \tilde{\epsilon}_j$.
This fits into our framework (ref) by defining $J := | \{j\in[\bar{J}]:i(j)=i\} | $, and
$\{\epsilon_{ij}\}_{j\in[J]} := \{\tilde{\epsilon}_{j}\}_{i(j)=i}$ and similarly for the $\{y_{ij}\}_{j\in[J]}$.
The conditional independence assumption in (ref) then implies that the matching process between students and teachers did not depend on $\{\tilde{\epsilon}_{j}\}_{j=1}^{\bar{J}}$.
More realistically, the variable $\tilde{y}_{j}$ may be taken to have a set of relevant covariates partialled out from the raw test scores $\tilde{y}_j^*$:
equation[equation omitted — 72 chars of source]
For example, the variables $x_{j}$ in the teacher-value added literature typically include student-specific covariates such as student demographics or lagged test scores such that the independence assumption in (ref) is reasonable.
We abstract from the estimation of the common vector $\beta_0$ and take it to be known as is common in the literature, see e.g., Gilraine2020 and Kwon2023b.
An essential difference between (ref) and models commonly studied in the empirical Bayes literature is the heterogeneous and unknown $\{\sigma_i^2\}_{i\in[n]}$. This is not only empirically more plausible, but also allows for meaningful comparisons of units beyond their mean parameters. We provide two areas where the unit-specific quantile parameters will be of relevance.
example[Teacher Value-added]
A policymaker may be concerned about the performance of lower ability students. As a result, she may want to compare teachers according to how the lower ends of their value-added instead of their mean value-added, which only measures how the average student would perform under each teacher. In this case, the relevant measure would be $q_{\alpha,i}$ of (ref) with a low $\alpha$, which represents the performance of the $\alpha$-quantile students (i.e., the quantile in terms of their $\tilde{\epsilon}_j$) in a counterfactual under teacher $i$.
\ensuremath{\blacksquare}
example[Neighborhood Effects]
There is growing interest in measuring the mean causal outcome of growing up in county $i$ on adulthood income.
A central motivation given by Chetty2018 is to “construct forecasts of the causal effect of growing up in each county that can be used to guide families seeking to move to better areas”.
However, even if a neighborhood produces good outcomes for its resident children on average, or in other words that $\mu_i$ is large, this may not be a precise
enough measure of the future outcome for a family's child -- for instance in neighborhoods with highly unequal outcomes.
Different $\{q_{\alpha,i}\}_{i\in[n]}$, which provides the likelihood of different future income levels, are thus useful complements to $\{\mu_i\}_{i\in[n]}$
in forming a complete evaluation of each neighborhood.
\ensuremath{\blacksquare}
Therefore, in the subsequent theoretical analysis we also study the estimation problems involving $\{q_{\alpha,i}\}_{i\in[n]}$, and even $\{\sigma_i\}_{i\in[n]}$ or $\{\sigma_i^2\}_{i\in[n]}$ that may be of interest in other areas.
Finally, in anticipation of the theoretical results, we provide several remarks relevant to the existing nonparametric empirical Bayes literature.
remark[Normality at the Microdata Level]
It is common in the literature to work directly at the aggregated level. For instance, letting $y_i$ be the average student outcome under teacher $i$, the model is typically
\begin{equation}
y_i \mid
\mu_i,\sigma_i
\sim \mathcal{N}\big[\mu_i,\tfrac{\sigma_i^2}{J}\big]
\end{equation}
where the normality assumption in (ref) is often justified by an appeal to the Central Limit Theorem (CLT).
While we directly place a normality assumption at the microdata level (ref), these two modeling approaches are conceptually identical in that (ref) and (ref) imply one another. Furthermore, while (ref) is substantiated by the CLT, the transmission of the approximation error to the subsequent optimality results is not typically studied. Therefore, in terms of the optimality results, we do not view the normality assumption at the microdata level as a substantive restriction relative to the convention in the literature.
\ensuremath{\blacksquare}
remark[Differing Channels of Heteroskedasticity]
Beginning with the aggregated model (ref), Jiang2020 and Chen2024 provide regret bounds for nonparametric empirical Bayes estimators where the heteroskedasticity operates through heterogeneous $J_i$, and $\sigma_i$ either assumed homogeneous or known, with varying degrees of dependence allowed between $J_i$ and $(\mu_i,\sigma_i)$.
In contrast, we let the heteroskedasticity operate through the unknown $\sigma_i$ and assume a homogeneous $J_i=J$.
Nonetheless, the main thrust of our theoretical result is that even with heterogeneous and unknown $\sigma_i$, taking the nonparametric empirical Bayes approach comes at little cost in finite samples, and often with substantial benefits. Thus, when we have limited heterogeneity in $J_i$ such as in the teacher value-added application, one can expect that binning teachers by class sizes and performing the nonparametric empirical Bayes estimation seperately within bins will still lead to reasonable finite sample performance while accommodating the heterogeneity $J_i$ and any dependence between $J_i$ and $(\mu_i,\sigma_i)$. For both unknown heteregeneous $\sigma_i$ and heterogeneous $J_i$ (and dependence among these objects), Section (ref) provides an avenue for future work to extend the theoretical results to accommodate this setting. Alternatively, if one is willing to accept independence between $J_i$ and $(\mu_i,\sigma_i)$, then our theoretical results will directly apply to this setting of unknown $\sigma_i$ and known $J_i$ that are both heterogeneous.
\ensuremath{\blacksquare}
Risk
The discussion in this section will be framed in terms of the mean value-added $\{\mu_i\}_{i\in[n]}$, because these are the de-facto object of interest within the empirical Bayes literature. Nonetheless, our theoretical results equally apply to other objects of interests including $\{q_{\alpha,i}\}_{i\in[n]}$ as we show in Section (ref).
An estimator $\hat{\mu}$, which maps the observations $\mathcal{Y}$ to $\mathbb{R}^n$, is evaluated under the quadratic loss function
equation[equation omitted — 106 chars of source]
Define the (integrated) risk
equation[equation omitted — 157 chars of source]
The independence across $i$ together with the Rao-Blackwell Theorem\footnote{See, e.g., Theorem 7.8 of Casella1998.} imply the integrated risk is minimized, over all borel mappings of the data $\mathcal{Y}$ to $\mathbb{R}^n$, by
equation[equation omitted — 189 chars of source]
and
equation[equation omitted — 160 chars of source]
are the sufficient statistics for $(\mu_i,\sigma_i^2)$.
Note that similar statements also hold for the decision problems involving $\{\sigma_i\}_{i\in[n]}$ or $\{\sigma_i^2\}_{i\in[n]}$, and we denote their corresponding optimal estimators as $\hat{\sigma}^{*}$ and $\hat{\sigma}^{2*}$.
Finally, even though our interest in $\hat{\mu}^*$ stems from the decision problem (ref), we note that there are other reasons why $\hat{\mu}^*$, and thus our proposed estimator, may be of interest. We provide one such setting where $\hat{\mu}^*$ is also essential. This is a decision problem where we wish to identify units with $\mu_i$ below a certain threshold $c$ under an absolute loss function.
lemma[Identifying units below a fixed threshold]
Let $c$ be a fixed constant and define
\begin{equation}
l_{d}(\hat{\mu},\mu,c)
:=
\frac{1}{n}\sum_{i=1}^n
\bigg(
\left\{\hat{\mu}_i \leq c\right\}
\left\{\mu_i > c\right\}
+
\left\{\hat{\mu}_i > c\right\}
\left\{\mu_i \leq c\right\}
\bigg)
\cdot
\lvert \mu_i-c \rvert,
\end{equation}
and $R_{G_0,\text{d}}(\hat{\mu},\mu,c) := \mathbb{E}_{G_0}^{(\mu,\sigma)}
\mathbb{E}_{(\mu,\sigma)}^{\mathcal{Y}} l_{\text{d}}(\hat{\mu},\mu,c) $.
Then $\hat{\mu}^*$
solves the following problem:
\begin{equation}
\operatorname*{argmin}_{\hat{\mu}}
R_{d}(\hat{\mu},\mu,c)
\end{equation}
where the minimization is over all borel mappings of the data $\mathcal{Y}$ to $\mathbb{R}^n$.
Similarly, $\hat{q}_{\alpha}^*$ minimizes $R_{G_0,\text{d}}(\hat{q}_{\alpha},q_\alpha,c)$ over all borel mappings $\hat{q}_{\alpha}:\mathcal{Y}\mapsto\mathbb{R}^n$.
Thus in the context of teacher value-added literature, $\hat{\mu}^*$ will be of interest when we wish to identify teachers with poor performance defined in terms of an absolute threshold, e.g., mean value-added below a certain fixed value, and where the cost of misidentification increases and is symmetric in terms of the absolute loss. This result is complementary to existing results, such as in Gu2023 that seek to identify units within a relative threshold (say bottom $10\%$ of the population), or Kline2024 that focus on assigning ranks to units in the population under alternative loss functions.
Estimation
Characterizing Optimal Estimators
As a first step to studying feasible estimators, we prove a Tweedie-type characterization of the oracles.
theorem[Tweedie's formula under unknown heteroskedasticity]
Suppose that $J>3$. Then,
\begin{alignat*}{2}
(i)&\qquad
\mathbb{E}_{G_0} [\mu \mid y,s]
&&=
y
+
\frac{\mathbb{E}_{G_0} [\sigma^2 \mid y,s]}{J} \cdot \frac{\partial}{\partial y} \log f_{G_0}(y \mid s)
+
\frac{1}{J}\frac{\partial}{\partial y} \mathbb{E}_{G_0} [\sigma^2 \mid y,s],
\\
(ii)&\qquad
\mathbb{E}_{G_0} [\sigma^2 \mid y,s]
&&=
k\cdot
\int_{s^2}^\infty
\left[\frac{s^2}{t}\right]^{k-1}\frac{f_{G_0}(t \mid y)}{f_{G_0}(s^2 \mid y)}dt,
\\
(iii)&\qquad
\mathbb{E}_{G_0} [\sigma \mid y,s]
&&=
\frac{k}{\Gamma(0.5)}\cdot
\int_{s^2}^\infty
\frac{1}{\sqrt{k(t-s^2)}}
\left[\frac{s^2}{t}\right]^{k-1}\frac{f_{G_0}(t \mid y)}{f_{G_0}(s^2 \mid y)}dt,
\end{alignat*}
where $\Gamma(\cdot)$ is the gamma function, $k:=\frac{1}{2}(J-1)$, $(y,s^2)$ are the sufficient statistics for $(\mu,\sigma^2)$, and $f_{G_0}(y,s^2)$ is the mixture density of $(y,s^2)$ under $G_0$.
Theorem (ref) states that the posterior mean of the model parameters such as $\mu$ depend on $G_0$ only through the mixture density $f_{G_0}(y,s^2)$, which is a density of observables.
The representation of $\mathbb{E}_{G_0} [\mu \mid y,s]$ looks similar to its counterpart under a model where $\sigma^2$ is known:
equation[equation omitted — 159 chars of source]
In particular Theorem (ref)(i) tells us that relative to the case of known heteroskedasticity, the posterior mean of $\mu$ under unknown heteroskedasticity involves replacing the unknown $\sigma$ with its posterior mean, and an additional Bayes correction term $\frac{1}{J}\frac{\partial}{\partial y} \mathbb{E}_{G_0}[\sigma^2 \mid y,s]$.
The characterization of $\mathbb{E}_{G_0} [\sigma \mid y,s]$ in Theorem (ref) will be relevant in the estimation of teacher-specific quantiles (ref), which in our model (ref) takes a particularly simple form:
equation[equation omitted — 65 chars of source]
where $\Phi(\cdot)$ is the standard normal CDF. In particular, the quantiles are linear functions of the mean $\mu$ and standard deviation $\sigma$.
Theorem (ref) then provides us with a Tweedie-type characterization of the optimal estimator of $q_{\alpha}$,
equation[equation omitted — 123 chars of source]
where the minimization is over all borel mappings of the observations $\mathcal{Y}$ to $\mathbb{R}^n$.
lemma[Optimal Quantile Estimators]
Suppose $J>3$ and take $\alpha\in(0,1)$. Then,
\begin{align*}
\hat{q}_{\alpha,i}^*
&=
\mathbb{E}_{G_0} [\mu \mid y_i,s_i]
+
\mathbb{E}_{G_0} [\sigma \mid y_i,s_i] \cdot \Phi^{-1}(\alpha)
\end{align*}
which depends on $G_0$ only through the density $f_{G_0}(y,s^2)$.
Theorem (ref) and Lemma (ref) will be used in the following sections to both propose and study the theoretical properties of feasible counterparts to the oracles.
remark[Proof Outline of Theorem (ref)]
Efron2011 provides a formula, originally due to Robbins1956 for deriving expressions similar to Theorem (ref) when the sampling model lies within the exponential family. The derivation essentially recognizes the posterior density as a member of the exponential family, and moments of the sufficient statistic(s) can then be obtained by repeatedly differentiating the cumulant generating function.
A direct application of this for us would not work because the sufficient statistics of the posterior distribution $G_0(\mu,\sigma^2\mid y,s^2)$ are $(\mu\sigma^{-2},\sigma^{-2})$ and thus we obtain only the posterior means of these objects instead of $(\mu,\sigma,\sigma^2)$.
Instead, we take a more direct route (see Appendix (ref)) by differentiating under the integral and applying the law of iterated expectations to obtain the first expression, and the latter two expressions are obtained because by Cressie1986, the moment generating function (MGF) contains information on the fractional moments -- and the posterior MGF of $\sigma^{-2}$ is known in this case by following the strategy of Efron2011 described above.
\ensuremath{\blacksquare}
remark[Alternative Tweedie Expressions]
An expression for $\mathbb{E}_{G_0}[\sigma^2 \mid s]$ -- note the integrating out of $y$ -- is given in Proposition 3 of Gu2017a credited to Robbins1982, and is not in general equivalent to $\mathbb{E}_{G_0}[\sigma^2 \mid y,s]$ of Theorem (ref).
Similar expressions of optimal estimators for $\sigma^2$ under alternative loss functions are given in Kwon2023, which were then exploited for constructing empirical Bayes estimates of $\sigma^2$.
\ensuremath{\blacksquare}
Proposed Estimators
We first define truncated forms of the optimal estimators\footnote{
We use a slightly different representation of $\hat{\mu}^*$ that is more convenient for theoretical analysis -- see second to last line of (ref) in Appendix (ref) for derivation.
}
given in Theorem (ref) and Lemma (ref):
align[align omitted — 795 chars of source]
Note that when $G=G_0$ and $\rho=0$, we recover $(\hat{\mu}^*,\hat{\sigma}^{2*},\hat{\sigma}^*,\hat{q}_\alpha^*)$ respectively.
remark[Truncation]
The truncation of the denominator with $\rho$ is to stabilize the estimates because $f_{G_0}(y,s^2)$ may, in principle, be arbitrarily small. In the theory, we will prove regret convergence rates for $\rho\downarrow 0$ at a fast rate of $n^{-1}$, and thus we primarily view the truncation as a technical device.
\ensuremath{\blacksquare}
In operationalizing the estimators, we replace the unknown $f_{G_0}$ with a leave-one-out (approximate) nonparametric maximum likelihood estimator (NPMLE). That is, our estimator for $\mu_i$ is
$
\hat{\mu}\big( y_i,s_i \mid \hat{G}^{(i)},\rho \big)
$
where $\hat{G}^{(i)}\in\mathcal{G}$, the set of all bivariate distributions on $\mathbb{R}\times\mathbb{R}_{++}$, and
equation[equation omitted — 138 chars of source]
where $\eta_n \asymp \tfrac{1}{n}$.
It is well-known by Lindsay1983 that the exact NPMLE exists and takes the form of a discrete distribution with at most $n-1$ support points.
We now explain our choice of a leave-one-out NPMLE $f_{\hat{G}^{(i)}}$ as opposed to a common NPMLE $f_{\hat{G}}$ that uses all observations $\mathcal{Y}$ for all $i\in[n]$:
equation[equation omitted — 147 chars of source]
For one, in terms of finite-sample performances, we show using numerical experiments in Section (ref) that the leave-one-out $f_{\hat{G}^{(i)}}$ can often lead to a finite-sample improvement over $f_{\hat{G}}$, intuitively by reducing overfitting in small samples.
In terms of the theoretical analysis, the leave-one-out estimator allows us to side-step the analysis of certain entropy bounds for the optimal estimators. This is convenient in analyzing the extended Tweedie's formula of Theorem (ref) that is substantially more complex than in the case of homoskedasticity
as in (ref). This is especially so because we study the theoretical properties of estimators for multiple estimation objectives.
Nonetheless, we have constructed the proofs in a modular fashion such that pieces of the proofs can be incorporated into a theoretical study of estimators using a common $f_{\hat{G}}$ if desired.
A potential shortcoming of the leave-one-out NPMLE is that the maximization problem has to be solved once for every $i\in[n]$, which may turn out to be computationally expensive for large $n$.
We view this as a minor obstacle because, firstly, the leave-one-out NPMLE is directly parallelizable and this alone alleviates the associated time cost. Furthermore, as we do in the simulations and empirical application, one may first compute the full NPMLE $f_{\hat{G}}$ and use $\hat{G}$ as the initial guess downstream for the subsequent leave-one-out estimates $f_{G^{(i)}}$. Assuming that the maximum only changes slightly from leaving out each observation, as is observed in the simulations, the additional cost of the (parallelized) second step will be marginal.
remark[Implementation]
The solution $f_{\hat{G}}$ is typically approximated in practice using a sieve MLE $f_{\hat{G}(k)}$ for some order $k$ where
\begin{equation}
\prod_{i=1}^n f_{\hat{G}(k)}(y_i,s_i^2)
\geq
\sup_{G \in \mathcal{G}(k)}\prod_{i=1}^n f_{G}(y_i,s_i^2).
\end{equation}
and $\mathcal{G}(k)\subset\mathcal{G}$ with each member of $\mathcal{G}(k)$ having at most $k$ support points.
The corresponding leave-one-out sieve MLE estimators $f_{\hat{G}^{(i)}(k)}$ are analogously defined.
\ensuremath{\blacksquare}
Theoretical Results
The set-up for our theoretical analysis is a triangular array, where the subscript $n$ indicates the row of the array:
equation[equation omitted — 199 chars of source]
for $j=1,\dots,J$ and $(\mu_{n,i},\sigma_{n,i}) \sim_{iid} G_{0,n}$ for $i=1,\dots,n$.
In preparation for the main convergence result, we clarify certain notations and state the assumptions underlying the result.
First, the notation $G(A \times B)$ for a bivariate distribution $G$ and sets $A,B\subset\mathbb{R}$ denotes the probability that $G$ places on the event $(\mu\in A,\sigma\in B)$.
Second, $(\hat{\mu},\hat{\sigma},\hat{\sigma}^2,\hat{q}_{\alpha})$ for the remainder of this section are taken to denote the estimator forms of (ref) with $G$ replaced by the leave-one-out estimator $\hat{G}^{(i)}$ and $\rho$ by $\rho_n$, both more clearly explicated in Assumptions (ref) and (ref).
Finally, the notation $X\lesssim Y$ means that there exists a constant $C$, possibly dependent on $(\gamma_1,\gamma_2,\underline{\sigma},L)$ defined below, such that $X \leq C Y $.
assumption[Class of Distributions]
$G_{0,n}$ belongs to the class of distributions
\begin{equation}
\mathcal{G}_n
:=
\left\{
G:
G\left(
\left[-L (\log n)^{\gamma_1}, L (\log n)^{\gamma_1}\right]
\times
\left[\sigma,L(\log n)^{\gamma_2}\right]
\right)
=1
\right\}
\end{equation}
where $(\gamma_1,\gamma_2,\underline{\sigma},L)$ are positive constants.
Assumption (ref) essentially requires that the support of $G_{0,n}$ grows at at most logarithmic rates, and can conceivably be relaxed to allow for sub-Gaussian tails, which would then accommodate distributions with potentially infinite support such as Gaussian mixtures for $\mu_{i,n}$ and Gamma mixtures (suitably truncated away from 0) for $\sigma_{i,n}^2$.
What is crucial for our proofs however, is the lower-bound $\underline{\sigma}$ on the support of $\sigma$, which is used to guarantee sufficient smoothness of the mixture density $f_{G_{0,n}}$.
assumption[Support of Approximate NPMLE]
For every $i$, $\hat{G}_n^{(i)}$ satisfies
\begin{equation}
\hat{G}_n^{(i)}\left(\left[\max_{i\leq n} |y_i|, \max_{i\leq n} |y_i|\right] \times \left[\sigma,\max_{i\leq n} s_i\right]\right)=1.
\end{equation}
Assumption (ref) requires that
there exist approximate NPMLEs with supports that lie within the boundaries of the data. Note that it also requires knowledge of a lower bound $\underline{\sigma}$ on $\{\sigma_{n,i}\}_{i\in[n]}$.
The final assumption is on the truncation parameter $\rho_n$.
assumption[Truncation Rate]
The truncation parameter $\rho_n\asymp \frac{1}{n}$.
We now state the main theoretical result of the paper.
theorem[Regret Bounds]
Suppose that Assumptions (ref)--(ref) hold, and $J>3$. Then
\begin{align*}
R_{G_{0,n}}(\hat{\mu},\mu) - R_{G_{0,n}}(\hat{\mu}^{*},\mu)
&\,\lesssim\,
\tfrac{1}{n} \cdot (\log n)^{4\tilde{\gamma}_2+2\tilde{\gamma}_1+1+\kappa_{n}}
\\
R_{G_{0,n}}(\hat{\sigma},\sigma) - R_{G_{0,n}}(\hat{\sigma}^{*},\sigma)
&\,\lesssim\,
\tfrac{1}{n} \cdot (\log n)^{4\tilde{\gamma}_2 + \kappa_{n}}
\\
R_{G_{0,n}}(\hat{\sigma}^2,\sigma^2) - R_{G_{0,n}}(\hat{\sigma}^{2*},\sigma^2)
&\,\lesssim\,
\tfrac{1}{n} \cdot (\log n)^{4\tilde{\gamma}_2 + \kappa_{n}}
\end{align*}
where
$
\kappa_{n}
:=
(\log n)^{4\left[\tilde{\gamma}_1 + \tilde{\gamma}_2\right]+2}
$, $\tilde{\gamma}_1 := \gamma_1 + \gamma_2 + \tfrac{1}{2}$ and $\tilde{\gamma}_2 := \gamma_2 + \tfrac{1}{2}$.
remark[Proof Outline]
The proof of the theorem relies on several key ingredients.
Take the estimation of $\{\mu_i\}_{i\in[n]}$ as an example.
The choice of the leave-one-out NPMLE estimator, together with the i.i.d. assumption across $i$ reduces the regret to
\begin{equation}
\mathbb{E}_{G_{0,n}}^{\mathcal{Y}^{(1)}}
\mathbb{E}_{G_{0,n},\mathcal{Y}^{(1)}}^{\mathcal{Y}_1}
\left[
\hat{\mu}(y_1,s_1^2 \mid \hat{G}_n^{(1)} , \rho_n )
-
\hat{\mu}(y_1,s_1^2 \mid G_{0,n} , 0 )
\right]^2
\end{equation}
Theorem (ref) implies that (ref) can be written as a function of $f_{\hat{G}_n^{(1)}} $ and $f_{G_{0,n}}$.
We then provide a significant extension of Proposition 3 in Jiang2009 to the case of unknown heteroskedasticity, where (ref) is further reduced to the expected Hellinger distance between $f_{\hat{G}_n^{(1)}}$ and the true $f_{G_{0,n}}$.
This portion incurs logarithmic powers\footnote{The estimation of $\{\mu_i\}_{i\in[n]}$ incurs additional logarithmic powers relative to $\{\sigma_i\}_{i\in[n]}$ and $\{\sigma_i^2\}_{i\in[n]}$ because of the additional differentiation term $\tfrac{\partial}{\partial y}f_{G_{0,n}}(y,s^2)$ present in $\hat{\mu}^*$.} of $4\tilde{\gamma}_2+2\tilde{\gamma}_1+1$,
The main difficulties in extending Jiang2009 to our setting are in relating the integrals present in $\hat{\sigma}^{2*}$ and $\hat{\sigma}^2$ to the Hellinger distance between the densities.
We then provide an adaptation of Ghosal2001's Theorem 3.2 on convergence rates of maximum likelihood estimation of Gaussian location-scale mixtures\footnote{The differences between our model and that of Ghosal2001 is that first, the support of $\sigma$ is allowed to diverge and, second, that we observe multiple observations for each $(\mu,\sigma)$. That is, $J > 1$ in our model whereas $J=1$ in Ghosal2001. } to our model (ref), which are then used to deliver the convergence rates in Theorem (ref). Because $f_{G_{0,n}}$ is a super-smooth density, we are able to achieve a fast convergence rate of $\tfrac{1}{n}$ up to logarithmic factors. This portion contributes the logarithmic power of $\kappa_{n}$.
Finally, $\tilde{\gamma}_1$ and $\tilde{\gamma}_2$ appear in the bounds instead of $\gamma_1$ and $\gamma_2$ because we do not assume knowledge of $\gamma_1$ nor $\gamma_2$ and instead rely on Assumption (ref) to restrict the support of the NPMLE.
\ensuremath{\blacksquare}
Theorem (ref) provides regret bounds for the estimation of $\{\mu_i\}_{i\in[n]}$, $\{\sigma_i\}_{i\in[n]}$ and $\{\sigma_i^2\}_{i\in[n]}$, which all converge at the parametric rate (up to logarithmic factors).
This suggests that the cost of taking a nonparametric approach will be small in finite-samples.
In contrast, the benefits in terms of risk reduction can be large relative to assuming a particular parametric form for $G_{0,n}$, as documented in Gilraine2020.
Similar results are well-known in the cases of homoskedasticity or known heteroskedasticity, and Theorem (ref) can thus be seen as an extension to the setting where the heteroskedasticity is unknown and has to be estimated.
Theorem (ref) also extends ratio-optimality type results, originally established by Jiang2009 for homoskedastic models\footnote{
These results were similarly established by Brown2009 and Liu2020 for $f$-modeling estimators.
},
to accommodate unknown heteroskedasticity and more general estimation objectives. For example, supposing
equation[equation omitted — 157 chars of source]
such that the oracle risk is not too small, then Theorem (ref) implies the following ratio-optimality result:
equation[equation omitted — 131 chars of source]
Note that the concept of ratio-optimality, which targets the relative risk, is a much harder concept than the usual empirical Bayes optimality which only require that
equation[equation omitted — 86 chars of source]
Finally recall that by Lemma (ref)$, \hat{q}_{\alpha,i}^*$ (i.e., the oracle estimator of $q_{\alpha,i}$) is a linear function of $\hat{\mu}_i^*$ and $\hat{\sigma}_i^*$. Theorem (ref) therefore also provides bounds on the regret of using $\{\hat{q}_{\alpha,i}\}_{i\in[n]}$ to estimate $\{q_{\alpha,i}\}_{i\in[n]}$.
lemma[Regret Bounds for $\hat{q}$]
Suppose that Assumptions (ref)--(ref) hold, and $J>3$. Then for any fixed $\alpha\in(0,1)$
\begin{equation*}
R_{G_{0,n}}(\hat{q}_\alpha,q_\alpha) - R_{G_{0,n}}(\hat{q}_\alpha^{*},q_\alpha)
\lesssim
\tfrac{1}{n} \cdot (\log n)^{4\tilde{\gamma}_2 + 1} (\log n)^{2\tilde{\gamma}_1+\kappa_{n}}.
\\
\end{equation*}
Extensions
This section considers three extensions of the basic model (ref), including to the literature on optimal forecasting in large-$n$ short-$T$ panels, and we focus on the estimation of $\left\{\mu_i\right\}_{i\in[n]}$ to keep the discussion succinct.
Heterogeneous Sample Sizes. The first extension consists of settings where the number of observations per unit, $J_i\in \mathbb{N}$, is heterogeneous and furthermore informative about the underlying parameters $(\mu_i,\sigma_i)$. For instance, teachers have differing class sizes and a teacher with higher value-added $\mu_i$ may be systemically assigned smaller classes. Failure to take this into account will result in under- or over-estimation of $\left\{\mu_i\right\}_{i=1}^n$; see Chen2024 for fuller arguments in the setting of estimating neighborhood effects under homoskedasticity or known heteroskedasticity.
In this case, we augment the model to be
equation[equation omitted — 122 chars of source]
for $j=1,\dots,J_i$ and $(\mu_i,\sigma_i,J_i) \sim_{\text{iid}} H_0$ for $i=1,\dots,n$, and modify the decision problem to
equation[equation omitted — 225 chars of source]
where $\mathcal{J}:=\{J_i\}_{i\in[n]}$ and the minimization is over all borel mappings of $(\mathcal{Y},\mathcal{J})$ to $\mathbb{R}^n$.
The oracle estimator $\check{\mu}^*$ takes a similar form as in Theorem (ref) but with conditioning on $J_i$ everywhere:
lemmaUnder the model (ref) where $(\mu_i,\sigma_i,J_i) \sim_{\text{iid}} H_0$ and $\mathbb{P}_{H_0}\{J_i > 3\} = 1$, we have
\begin{equation}
\check{\mu}_i^*
=
y_i
+
\frac{\mathbb{E}_{H_0}\left[\sigma^2\mid y_i,s_i,J_i\right]}{J_i}
\frac{\partial}{\partial y} \log f_{H_0}\left(y_i,s_i^2 \mid J_i\right)
+
\frac{1}{J_i}
\frac{\partial}{\partial y} \mathbb{E}_{H_0}\left[\sigma^2\mid y_i,s_i,J_i\right].
\end{equation}
Thus, when the heterogeneity in the discrete $J_i$ is limited such that there are sufficient observations for each value $J$, one may pool observations of teachers with identical (or similar) $J_i$ to estimate the density $f_{H_0}(y,s | J_i=J)$ for each $J$. The fast regret convergence rates provided in Theorem (ref) suggest that this can still work reasonably well in practice.
Informative Covariates. The discussion above applies equally to the empirically relevant setting where the researcher has access to covariate(s) $x_i\in\mathbb{R}^m$ that is potentially informative about the parameters $(\mu_i,\sigma_i)$ and that may help sharpen estimation. For instance in the teacher value-added literature, the years of experience of teacher $i$ is likely to be positively correlated with her value-added $\mu_i$. In such settings, by suitably modifying the model and decision problem as above, we may once again show that the oracles depend only on the distribution of $(\mu_i,\sigma_i,x_i)$ through the conditional density $f(y,s^2 \mid x)$.
Dynamic Panel Forecasting.
Consider the problem of constructing optimal forecasts for a large collection of short time series, taking the basic dynamic panel model studied in Liu2020 as an example:
equation[equation omitted — 176 chars of source]
for $i=1,\dots,n$ and $t=1,\dots,T$.
The motivating application is the stress testing of bank-holding companies as part of regulatory requirements, where the key step is being able to first reliably forecast bank balance-sheet variables under observed macroeconomic and finanacial conditions.
Furthermore, as detailed in Liu2020, frequent mergers in the banking industry and changes in regulatory environments post-2008 makes a large-$n$ small-$T$ framework suitable to this task.
In such a model, the optimal one-step-ahead forecast is
$\mathbb{E}_{G_0}[y_{it} \mid \mathcal{Y}_{i,t-1}] = \rho y_{it-1} + \mathbb{E}_{G_0}[\mu_i \mid \mathcal{Y}_{i,t-1}]$, where $\mathcal{Y}_{i,t-1}$ is the vector of observations up to time period $t-1$ associated with unit $i$.
The conditional mean $\mathbb{E}_{G_0}[\mu_i \mid \mathcal{Y}_{i,t-1}]$ takes the form (ref) with $f_{G_0}(y_i | \sigma)$ replaced by $f_{G_0}(y_i| \sigma,y_{i,0})$ where $y_i$ is the sufficient statistic for $\mu_i$, which reveals that the oracle forecasts' reliability hinges upon the homoskedasticity assumption, because $\sigma^2$ regulates the Bayes correction in estimating each and every $\mu_i$.
Within this context, our model adds an additional layer of heterogeneity through the unit-level varying $\sigma_i^2$:
equation[equation omitted — 196 chars of source]
for $i=1,\dots,n$ and $t=1,\dots,T$.
Indeed it is reasonable to expect in such an application, that the heterogeneity in $\{\sigma_i^2\}_{i\in[n]}$ to be comparable or larger than is present within $\{\mu_i\}_{i\in[n]}$.
As a result, the oracle forecasts that allow for unknown heteroskedasticity will likely have substantial improvements over those that impose homoskedasticity by allowing for unit-specific Bayes correction.
In such a model, emulating the oracles again reduces to emulating $\mathbb{E}_{G_0}[\mu_i \mid \mathcal{Y}_{i,t-1}]$, which now takes the form in Theorem (ref) with $f_{G_0}(y_i,s_i^2)$ replaced by $f_{G_0}(y_i,s_i^2| y_{i,0})$ and $s_i^2$ is the sufficient statistic for $\sigma_i^2$.
If one is willing to accept independence between $y_{i,0}$ and $(\mu_i,\sigma_i^2)$, then the theoretical results in Section (ref) directly delivers fast regret\footnote{Regret that is relative to the oracle forecasts, i.e., that knows the distribution $G_0$.} convergence rates of using feasible forecasts that plug in the leave-one-out NPMLE of the density of $(\mu_i,\sigma_i^2)$.
In the case of unrestricted dependence between $y_{i,0}$ and $(\mu_i,\sigma_i^2)$, the proof and results developed here, leveraging on the expressions derived in Theorem (ref), may be extended under e.g., suitable smoothness conditions on the density of $y_i,s_i^2 \mid y_{i,0}$.
Simulations
We now utilize numerical experiments to evaluate the finite-sample performance of the proposed estimators and alternative sets of estimators.
Estimators
In implementing the proposed estimators of Section (ref), we adopt a leave-one-out $n^{1/2}$-order sieve MLE $f_{\hat{G}^{(i)}(n^{1/2})}$-- see Remark (ref).
We call this set of estimators het.
As alternatives,
we include an additional set of estimators using the (full) sieve-MLE $f_{\hat{G}(n^{1/2})}$; again, see Remark (ref). We call this $\textsc{het}_{\text{full}}$.
This is included to show the finite-sample improvements from the leave-one-out strategy within the context of nonparametric empirical Bayes estimation.
We also include a homoskedastic version of het, i.e., imposing homoskedasticity $\sigma_i^2 = \sigma^2$ and where $\sigma^2$ is estimated using $\tfrac{1}{n}\textstyle\sum_{i=1}^ns_i^2$. We call this $\textsc{hom}$.
Finally the set of naive estimators, which uses $(y_i,s_i^2)$ to directly estimate $(\mu_i,\sigma_i^2)$ and $y_i + \Phi^{-1}(\alpha)\cdot s_i$ to estimate $q_{i,\alpha}$, is also included and referenced as naive.
Data Generating Process
The DGP for the simulations proceeds in two stages, where conditional on $\left\{(\mu_i,\sigma_i)\right\}_{i=1}^n$ the second stage generates observations $y_{ij}$ according to model (ref) with $J=15$.
In the first stage, we adopt a relatively simple DGP and generate $(\mu_i,\sigma_i)$ by coupling Gaussian and Gamma random variables\footnote{$\gamma(\kappa,\lambda)$ denotes the Gamma distribution with shape $k$ and scale $\lambda$, and $F_{\gamma(\kappa,\lambda)}^{-1}(\cdot)$ denotes the quantile function of $\gamma(\kappa,\lambda)$. $\Phi(\cdot)$ denotes the standard normal CDF.}:
align[align omitted — 373 chars of source]
Thus $\mu_i$ is a Gaussian variable with mean $\alpha$ and variance $\nu$, whereas $\sigma_i^2$ is a Gamma variable with shape $\kappa$ and scale $\lambda$.
The parameter $\rho$ controls the correlation between $(\mu_i,\sigma_i^2)$.
In the calibrated DGP, we set $(\alpha,\nu,\kappa,\lambda,\rho)$ such that the first five moments of $(\mu_i,\sigma_i^2)$ matches those estimated from the dataset of our teacher value-added application:
equation[equation omitted — 182 chars of source]
figure[figure omitted — 662 chars of source]
Figure (ref) displays the marginal and joint densities of $(\mu_i,\sigma_i^2)$ under this calibration.
We also perturb this calibrated DGP along a single dimension (e.g., changing $\mathbb{V}[\mu_i]$ while keeping the other four moments constant) and observe the performances of the estimators under each perturbation.
Results
Relative Regrets I
table[table omitted — 3,069 chars of source]
Table (ref) displays\footnote{Appendix (ref) explores further numerical experiments, when the estimation objective is $\{\sigma_i\}_{i\in[n]}$ and $\{\sigma_i^2\}_{i\in[n]}$ instead.} the relative regrets involving the MSE loss $l(\cdot,\cdot)$ as defined in (ref):
equation[equation omitted — 333 chars of source]
for varying estimators $\hat{\mu}$ or $\hat{q}_{0.1}$ and DGPs, and where the expectation $\hat{\mathbb{E}}$ is taken across the simulation rounds.
The 3\textsuperscript{rd} column displays results for the calibrated DGP, whereas the DGP for the 4\textsuperscript{th} column onward each perturb the calibrated DGP along one dimension.
For example, the 4\textsuperscript{th} column displays results for the DGP with the same moments as the calibrated DGP, except that now $\mathbb{V}[\sigma_i^2] = 0.018$ so that $\sigma_i^2$ is relatively hetergeneous.
The 5\textsuperscript{th} column displays results for the DGP with the same moments as calibrated DGP, except that now $\mathbb{V}[\mu_i] = 0.0023$ so that $\mu_i$ is relatively homogeneous.
The top and bottom half of Table (ref) displays the relative-regret when the estimation target is $\{\mu_i\}_{i\in[n]}$ and $\{q_{0.1,i}\}_{i\in[n]}$ respectively.
We first observe that the calibrated DGP is one where $\{\sigma_i^2\}_{i\in[n]}$ is relatively homogeneous as compared to $\{\mu_i\}_{i\in[n]}$. As a result, the hom estimator applies a nearly optimal Bayes correction (see $(i)$ of Theorem (ref) and (ref)) for the estimation of $\{\mu_i\}_{i\in[n]}$ and is competitive with het in terms of relative regret.
As we shall see later however, this similarity of hom and het in terms of average performance in MSE across units masks important differences between the two methodologies in terms of detecting units with low $\mu_i$, an exercise of wide policy-relevance.
Nonetheless, for large $n$ in 3\textsuperscript{rd} column, the relative regret of het disappears whereas hom still suffers a non-zero relative regret because of the (limited) heterogeneity in $\{\sigma_i^2\}_{i\in[n]}$.
Furthermore, when the estimation target shifts to $\{q_{0.1,i}\}_{i\in[n]}$, the performance of hom deteriorates relative to het. This is because $\sigma_i^2$ not only matters for the Bayes correction in estimating $\mu_i$, but also directly as part of the estimation target: $q_{0.1,i}=\mu_i+\Phi^{-1}(0.1)\cdot\sigma_i$ where $\Phi^{-1}(0.1)=-1.28$. The suboptimality induced by hom's homoskedasticity assumption turns out to be large in this case.
The relative-regret differential between het and hom is also especially large in the case of heterogeneous $\{\sigma_i^2\}_{i\in[n]}$ (see 4\textsuperscript{th} column) or strong dependence between $\mu_i $ and $\sigma_i^2$ (see 6\textsuperscript{th} column). Recall that hom, which assumes homogeneous $\sigma_i=\sigma$, implicitly assumes no dependence between $(\mu_i,\sigma_i)$. When there is meaningful heterogeneity in $\{\sigma_i^2\}_{i\in[n]}$ and dependence between $(\mu_i,\sigma_i)$, hom is unable to take advantage of the information in $s_i^2$ regarding $\sigma_i^2$ to sharpen the estimation of $\mu_i$ and so incurs a larger relative regret. On the other hand, het is fully capable of exploiting this information for estimating $\{\mu_i\}_{i\in[n]}$ and its relative regret remains similar from 3\textsuperscript{rd} column to 4\textsuperscript{th} or 6\textsuperscript{th} columns.
The next observation is that as $\{\mu_i\}_{i\in[n]}$ becomes homogeneous (from 3\textsuperscript{rd} to 5\textsuperscript{th} column), the relative regrets of all estimators increase. This is because the oracle knows the distribution of the parameters and incurs a much smaller MSE in the case of homogeneous $\{\mu_i\}_{i\in[n]}$. The cost of estimating the distribution for the feasible estimators thus implies a higher regret relative to the oracle.
Nonetheless, the fast convergence rates established in Section (ref) imply that het is able to achieve small relative regrets for realistic sample sizes.
Furthermore, it is within this setting (5\textsuperscript{th} column), where the relative regrets of the estimators are large, that the finite-sample gains from the leave-one-out strategy is most substantial. The het estimator improves on $\textsc{het}_{\text{full}}$ that does not apply the leave-one-out estimation by over 10 percentage points when the sample size is very small.
The improvement fades away as $n$ becomes large, because then the complexity of the model relative to the number of observations (represented by the order of the sieve, $n^{1/2}$), decreases and overfitting no longer becomes an issue for $\textsc{het}_{\text{full}}$. We note however that if the order of the sieve were to be increased (e.g., to $n^{3/4}$ or even considering the actual NPMLE of sieve order $n$), the finite-sample improvements of het relative to $\textsc{het}_{\text{full}}$ will be larger for the same sample sizes as in Table (ref).
In sum, we conclude that het dominates hom and naive for both targets $\{\mu_i\}_{i\in[n]}$ and $\{q_{0.1,i}\}_{i\in[n]}$ across all specifications and in particular even for very small sample sizes. Thus, there is little finite-sample cost to adopting het in practice, and much to be gained in terms of the relative regrets especially when $\{\sigma_i^2\}_{i\in[n]}$ is hetergeneous or when there exists strong dependence between $\mu_i$ and $\sigma_i^2$.
Relative Regrets II
figure[figure omitted — 831 chars of source]
Figure (ref) displays the relative regrets involving the loss function $l_{\text{d}}(\cdot,\cdot,c)$ as defined in (ref):
equation[equation omitted — 411 chars of source]
for the left and the right panels of the figure respectively.
Intuitively, the loss functions underlies a decision problem of identifying units with $\mu_i$ or $q_{0.1,i}$ below a fixed threshold $c$, where the loss from each unit increases symmetrically in the magnitude of misidentification.
The DGP utilized is the calibrated DGP with $n=4000$, and
the threshold value $c$ is varied on the $x$-axis of Figure (ref).
From the left panel, we observe that het dominates hom for almost all values of $c$. Furthermore, even though the heterogeneity in $\{\sigma_i^2\}_{i\in[n]}$ is limited under this DGP, the relative regret differential between het and hom widens considerably for small values of $c$.
This is likely due to the negative dependence between $\mu_i$ and $\sigma_i^2$: units with the smallest $\mu_i$ tend to have the largest $\sigma_i^2$, and hom, which assumes a common $\sigma^2$ for all units, will suffer the largest regret at detecting units with small $\mu_i$ because it is precisely at these regions that the homoskedasticity assumption is most misplaced.
Interestingly, the story seems to be reversed for detecting units with small $q_{i,0.1}$, in that the regret differential decreases for smaller values of $c$.
It turns out that there is a happy coincidence for hom in this case, specifically for small values of $\mu_i$: the (negative) bias in the estimation of $\mu_i$ arising from the homoskedasticity assumption cancels out the (negative) bias in the estimation of $\sigma_i^2$ through the form of the quantile: $q_{0.1,i}= \mu_i - 1.28\cdot \sigma_i$.\footnote{To elaborate in detail: in this DGP the units with small $\mu_i$ tend to have larger $\sigma_i$, and so the homoskedasticity assumption falsely imputes small $\sigma_i$s to these units; thus hom estimators of $\sigma_i$ for these units will be too small. As a result of this, the Bayes correction for the estimation of $\mu_i$ is smaller than optimal and the hom estimates of these $\mu_i$ will also be too small.}
Finally, the naive methodology, which simply plugs in $(y_i,s_i^2)$ for the unknown $(\mu_i,\sigma_i^2)$, performs poorly at all values of $c$. In fact, it has relative regret that is uniformly above $0.15$ in the right panel. This is because it identifies many units as having $\mu_i$ or $q_{0.1,i}$ below $c$, but the vast majority of these are likely due to noise in the sufficient statistics than a true reflection of the unit-specific parameters $(\mu_i,\sigma_i^2)$.
Empirical Application
We conclude with an application of estimating teacher quality using a matched student-teacher dataset from the North Carolina Education Research Data Center.
Data
The dataset is a panel dataset on elementary school students from grades 3--5 in North Carolina. Each observation is linked to a (student, year, grade, subject) cell with covariates including student demographics information such as ethnicity, gender, economic status, etc.
We follow Gilraine2020 in restricting observations to students that are matched to teachers and have a lagged test score in the subject associated to that observation.
Estimation
To keep the analysis simple, we further restrict attention to observations from year 2019 and where the class size associated with each observation is between 14 to 22 students. This is to exclude special education classes and to abstract from potential effects of class size heterogeneity. Doing so leaves us with a total of 50,063 observations, each associated with a unique student, and a total of $n=2,841$ teachers in the sample.
Table (ref) displays the summary statistics for some of the covariates present in the restricted dataset.
table[table omitted — 827 chars of source]
We take a standard model of teacher value-added:
equation[equation omitted — 163 chars of source]
where $y_{j}^*$ is student $j$'s 2019 reading test score, and $i(\cdot)$ is the matching function that returns student $j$'s teacher identity in 2019. The covariates $x_j$ include student $j$'s 2018 reading test score, ethnicity, gender, family economic status, whether the student is an english language learner, and age. The test scores are standardized to have mean 0 and standard deviation 1 within each (year,grade) cell. The identification assumption is that conditional on the covariates, the student effect $\epsilon_j$ is independent of her matched teacher's profile $\left(\mu_{i(j)},\sigma_{i(j)}\right)$. We follow the literature in first running a regression that purges the covariates' effects\footnote{That is, we estimate the common coefficients $\beta_0$ using within-teacher variation and move the consequent estimated covariates $x_j^\prime \hat{\beta}$ to the left-hand side, defining $y_j:=y_j^*-x_j^\prime\hat{\beta}$. The estimates $\hat{\beta}$ are consistent for $\beta_0$ because the relevant sample size is $n$, which is large.} which then leads to the model (ref) posited in Section (ref), written in terms of the matching function notation:
equation[equation omitted — 161 chars of source]
for $j=1,\dots,J_i$ and $i=1,\dots,n$, where $J_i:=\lvert\left\{j:i(j)=i\right\}\rvert$.
The difference with the standard model, such as in Gilraine2020, is that we allow for teacher-level heteroskedasticity.
In a model where teachers differ in both $\mu_i$ and $\sigma_i$, there are multiple ways to define and measure teacher quality. For example, conditional on teachers having the same $\mu_i$, whether a high $\sigma_i$ is preferred depends on the policymaker's preferences. The most common way to measure a teacher's performance is by her mean value-added $\mu_i$, which measures how the average student ($\epsilon_j=0$) would have performed under each teacher. In what follows we also consider defining teacher performances by $q_{0.1,i}$, which measures how the 10\textsuperscript{th} percentile student would have performed under each teacher. This implies we penalize teachers with high $\sigma_i$, because $q_{0.1,i}=\mu_i-1.28\cdot\sigma_i$.
Estimators
With the model (ref) in hand, we construct the teacher-specific sufficient statistics
equation[equation omitted — 148 chars of source]
and estimate $(\mu_i,q_{0.1,i})$ using firstly the proposed set of estimators (called het), secondly a modification of het that assumes homoskedasticity (called hom), and thirdly naive that uses the teacher-specific sufficient statistics $(y_i,s_i^2)$ directly; see Section (ref) for more details. Note that we abstract from class size heterogeneity in the estimation which we justify by our sample restriction to a relatively narrow band of class sizes between 14 to 22 students.
Results
figure[figure omitted — 855 chars of source]
The main finding here is that teachers with small $\mu_i$ will also tend to have large $\sigma_i$, as is shown in the left panel of Figure (ref) that plots the het estimates of $\sigma_i$ against those of $\mu_i$. This implies differences in teacher quality is exacerbated, in that teachers who differ in how the average student performs under them (that is, $\mu_i$) tend to differ even more in how the lower-percentile students will perform under them (e.g., $q_{0.1,i}$). To see this, the right panel of Figure (ref) displays the test score distribution of (ref) for two representative teacher profiles $(\mu,\sigma)$ constructed from the het estimates; see the notes of Figure (ref) for construction details.
The negative correlation between $\mu_i$ and $\sigma_i$ implies that while the two teachers' $\mu$ differ by 0.42 (i.e., 0.42 standard deviations of the raw test scores), their $q_{0.1}$ differ by $0.51$, a $22\%$ increase in difference.
figure[figure omitted — 766 chars of source]
We turn now to explore in detail the individual estimates for the two targets, $\{\mu_i\}_{i\in[n]}$ and $\{q_{0.1,i}\}_{i\in[n]}$, displayed in Figure (ref).
To give an orientation to the panels of this figure: the top-left panel displays the scatter plot of the naive estimate of $\mu_i$ against the het estimate of the same $\mu_i$, for every $i$.
Now with reference to the first row which compares het and naive estimates, we see that there is substantial shrinkage from using het for both targets. The shrinkage also appears to be non-linear, particularly for estimation of $\{\mu_i\}_{i\in[n]}$ which has less (more) shrinkage for smaller (larger) values of $y_i$.
Turning to the second row of Figure (ref), it appears from first sight that the estimates for $\{\mu_i\}_{i\in[n]}$ are very similar across the het and \textsc{hom} methodologies. There are however still systematic differences between the two, particularly so when we consider the estimation of $\{q_{0.1,i}\}_{i\in[n]}$. The estimates from \textsc{het} are more spread out compared to those from \textsc{hom}, because \textsc{het} allows for heterogeneity in $\sigma_i$ whereas \textsc{hom} does not. Furthermore, it appears from the best-fit line that \textsc{hom} generally overpredicts and underpredicts $q_{0.1,i}$ relative to \textsc{het} near the left and right end points respectively. This may be explained by the fact that a small $\mu_i$ is associated with a large $\sigma_i$, which \textsc{hom} does not take into account and thus spuriously compresses the estimates of $\{q_{0.1,i}\}_{i\in[n]}$.
Finally, recall by Lemma (ref) that the oracle $\hat{\mu}^*$ (or $\hat{q}_{0.1}^*$) is also optimal for the problem of detecting teachers with $\mu_i$ (or $q_{0.1,i}$) below a fixed threshold. We thus explore the various methodologies in the context of this problem, again according to the two cases where teacher quality is measured by $\{\mu_i\}_{i\in[n]}$ and by $\{q_{0.1,i}\}_{i\in[n]}$.
The left (and right) panel of Figure (ref) plots, by methodology, the number of teachers whose estimates of $\mu_i$ (and $q_{\alpha,i}$) are flagged as being less than the threshold value which is varied on the $x$-axis. Unsurprisingly, naive flags the greatest number of teachers for every threshold value. It is likely that most of these were flagged because of the large variability of the estimates $(y_i,s_i^2)$ rather than a true reflection of the value-added $\mu_i$.
Another notable feature from the left panel of Figure (ref) is that hom flags more teachers than het for almost all threshold values. For instance, it flags out 25 more teachers than het for the threshold value of $-0.24$, or an increase of 40% in relative terms. As we have seen from Figure (ref), teachers with smaller $\mu_i$ tend to have larger $\sigma_i$. The hom methodology, which assumes $\sigma_i=\sigma$ for all $i$, applies a less-than-optimal Bayes correction (relative to the oracle) for this set of teachers and the additional variability in the hom estimates results in more teachers being flagged. On the contrary, het allows for heterogeneous variances and dependence within $(\mu_i,\sigma_i)$ and therefore does not suffer from this problem. This difference may also be seen from the bottom-left panel of Figure (ref), where \textsc{hom} underpredicts relative to \textsc{het} in the left tail.
On the right panel where teacher quality is defined in terms of $\{q_{0.1,i}\}_{i\in[n]}$, hom now flags significantly fewer teachers than het for every threshold value. This is again due to the same combination of hom imposing a common $\sigma$ for all teachers and the negative correlation within $(\mu_i,\sigma_i)$, albeit through a different channel.
Recall that
$
q_{0.1,i} = \mu_i - 1.28\sigma_i
$.
As a result, hom understates how poorly the 10\textsuperscript{th}-percentile students will do under teachers with smaller $\mu_i$ whereas het, which incorporates the negative correlation in $(\mu_i,\sigma_i)$, does not. In absolute terms, the implications of both methodologies are very different. The hom methodology generally flags about 100 fewer teachers than does \textsc{het} as a result of its a-priori homoskedasticity restriction -- a restriction that Figure (ref) suggests to be misguided.
figure[figure omitted — 567 chars of source]
Conclusion
This paper contributes to the growing empirical Bayes (EB) literature by proposing nonparametric EB estimators with regret bounds of the order $\tfrac{1}{n}(\log n)^\kappa$. The upshot is that nonparametric EB methods come at little cost in typical sample sizes and in fact with much benefits in terms of risk reduction.
Importantly, these results are developed within a framework that features unknown heteroskedasticity.
Allowing for this feature is essential for two reasons: firstly, in the estimation of the commonly targeted mean parameters by applying the optimal level of unit-specific Bayes correction. This is important within many micreconometrics applications and extends to other areas such as the literature on optimal forecasting for a large collection of short time series.
Unknown heteroskedasticity is also essential for comparing units along richer dimensions of heterogeneity, such as the performances of lower-percentile students under each teacher.
These (i.e., unit-specific quantiles) we have argued are also relevant in other areas of literature such as in the estimation of neighborhood effects.
We demonstrated how the estimation objective and methodology fit together in an empirical application using a matched dataset on North Carolina elementary school students and teachers. Our results suggest that the detection of low-performing teachers -- a typical exercise with high-stakes consequences -- is sensitive to the estimator choice regardless of how teacher quality is defined.
In particular, using nonparametric EB estimators that allow for dependence among the teacher-specific parameters is crucial for delivering optimal estimates of teacher quality and detecting low-performing teachers.
\setcounter{page}{1}
appendix\setcounter{equation}{0}
\setcounter{table}{0}
\setcounter{figure}{0}
\begin{center}
{ {\bf Appendix: Large-scale estimation under Unknown Heteroskedasticity}}
{\bf Sheng Chao Ho}
\end{center}
Proofs for Sections (ref) and (ref)
Proof of Theorem (ref)
proof[Proof of Theorem (ref)]
We provide the proof of Theorem (ref)(i) in two parts. The first part, which takes $\sigma$ as known, is similar to the proof of the homoskedastic Tweedie's formula as in Liu2020. The second part then integrates out the unknown $\sigma$ using the law of iterated expectations. We will exploit the conditional independence $y \perp \!\!\! \perp s \mid \mu,\sigma$ throughout, which is a consequence of the Gaussianity assumption (ref).
Let us first take $\sigma$ as known. Further let $p(\cdot)$ denote a probability density of a random variable, with the identity of the random variable inferred from the argument. Let “$A\implies B$” mean statement $A$ implies statement $B$. Then since $\int p(\mu\mid y,s^2,\sigma^2)d\mu=1$,
\begin{equation}
\begin{aligned}[b]
&\frac{\partial}{\partial y} \int p(\mu\mid y,s^2,\sigma^2)d\mu
=
0
\\
\implies&
\int
\frac{\partial}{\partial y}
\left\{
p(y,s^2 \mid \mu , \sigma^2)
\frac{p(\mu,\sigma^2)}{p(y,s^2,\sigma^2)}
\right\}
d\mu
=
0
\\
\implies&_{(1)}
\int
\frac{\partial}{\partial y}
\left\{
p(y \mid \mu , \sigma^2)
p(s^2 \mid \mu , \sigma^2)
\frac{p(\mu,\sigma^2)}{p(y,s^2,\sigma^2)}
\right\}
d\mu
=
0
\\
\implies&
\int
\frac{\partial}{\partial y}
\left\{
p(y \mid \mu , \sigma^2)
p(s^2 \mid \mu , \sigma^2)
\frac{p(\mu,\sigma^2)}{p(y,s^2,\sigma^2)}
\right\}
d\mu
=
0
\\
\implies&
\int
-\frac{y-\mu}{\sigma J^{-1}}
p(\mu \mid y,s^2,\sigma^2)
-
p(y \mid \mu , \sigma^2)
p(s^2 \mid \mu , \sigma^2)
\frac{p(\mu,\sigma^2)\frac{\partial p(y,s^2,\sigma^2)}{\partial y}}{p^2(y,s^2,\sigma^2)}
d\mu
=
0
\\
\implies&_{(2)}
\int
-\frac{y-\mu}{\sigma J^{-1}}
p(\mu \mid y,s^2,\sigma^2)
-
p(\mu\mid y,s^2,\sigma^2)
\frac{\frac{\partial p(y,s^2,\sigma^2)}{\partial y}}{p(y,s^2,\sigma^2)}
d\mu
=
0
\\
\implies&
\mathbb{E}_{G}[\mu \mid y,s,\sigma]
=
y + \frac{\sigma^2}{J} \cdot \frac{1}{p(y,s^2 \mid \sigma^2)} \cdot \frac{\partial p(y,s^2 \mid \sigma^2)}{\partial y}
\end{aligned}
\end{equation}
where $\implies_{(1),(2)}$ follow by $y \perp \!\!\! \perp s^2 \mid \mu,\sigma$ such that $p(y,s^2\mid\mu,\sigma^2)=p(y\mid\mu,\sigma^2)p(s^2\mid\mu,\sigma^2)$.
We then apply the law of iterated expectations to integrate out $\sigma^2$:
\begin{equation}
\begin{aligned}[b]
\mathbb{E}_G [\mu \mid y,s]
=&
\mathbb{E}_G \left\{\mathbb{E}_G [\mu \mid y,s,\sigma] \mid y,s\right\}
\\
=&
y
+
\frac{1}{J}
\mathbb{E}_G
\left[
\sigma^2 \cdot \frac{1}{p(y,s^2 \mid \sigma^2)} \cdot \frac{\partial p(y,s^2 \mid \sigma^2)}{\partial y}
\mid y,s
\right] \\
=&
y
+
\frac{1}{J}
\int
\left[
\sigma^2 \cdot \frac{1}{p(y,s^2 \mid \sigma^2)} \cdot \frac{\partial (y,s^2 \mid \sigma^2)}{\partial y}
\right] p(\sigma^2 \mid y,s^2) d\sigma^2 \\
=&
y
+
\frac{1}{J}
\int
\left[
\sigma^2 \cdot \frac{1}{p(y,s^2 , \sigma^2)} \cdot \frac{\partial p(y,s^2 , \sigma^2)}{\partial y}
\right] \frac{p(y,s^2,\sigma^2)}{p(y,s^2)} d\sigma^2 \\
=&
y
+
\frac{1}{J}
\cdot
\frac{1}{p(y,s^2)}
\int
\sigma^2 \cdot \frac{\partial p(y,s^2 , \sigma^2)}{\partial y} d\sigma^2 \\
=&_{(1)}
y
+
\frac{1}{J}
\cdot
\frac{1}{p(y,s^2)}
\frac{\partial}{\partial y}
\left\{\int
\sigma^2 \cdot p(y,s^2 , \sigma^2) d\sigma^2\right\} \\
=&
y
+
\frac{1}{J}
\cdot
\frac{1}{p(y,s^2)}
\frac{\partial}{\partial y}
\left\{\int
\sigma^2 \cdot p(\sigma^2 \mid y,s^2) p(y,s^2) d\sigma^2\right\} \\
=&
y
+
\frac{1}{J}
\cdot
\frac{1}{p(y,s^2)}
\frac{\partial}{\partial y}
\left\{p(y,s^2) \mathbb{E}_G [\sigma^2 \mid y,s]\right\}
\\
=&_{(2)}
y
+
\frac{\mathbb{E}_G [\sigma^2\mid y,s]}{J} \cdot \frac{\partial}{\partial y} \log p(y \mid s)
+
\frac{1}{J}\frac{\partial}{\partial y} \mathbb{E}_G [\sigma^2\mid y,s]
\end{aligned}
\end{equation}
where $=_{(1)}$ interchanged the order of integration and differentiation, and $=_{(2)}$ is an application of the product rule.
We will next prove Theorem (ref)(ii) and (iii), which again proceeds in two parts. The first which we separately provide in Lemma (ref), involves deriving the posterior moment generating function (MGF) of $\tau:=\sigma^{-2}$ and the proof follows Banerjee2023. The second involves an application of Proposition 6 of Cressie1986 to the posterior MGF of $\tau$, which allows us to recover the negative moments of $\tau$ (that is, moments of $\sigma$ and $\sigma^2$) from its MGF. The application of Proposition 6 of Cressie1986 requires us to verify the following two integrability statements, which we do below:
\begin{equation}
\int_0^\infty M_{\tau \mid y,s} (-t) dt < \infty
\quadand\quad
\int_0^\infty \left[\frac{1}{t}\right]^{1/2} M_{\tau \mid y,s} (-t) dt < \infty.
\end{equation}
The first integrability condition is direct since
\begin{equation}
\begin{aligned}[b]
\int_0^\infty M_{\tau \mid y,s} (-t) dt
=&_{(1)}
\frac{[s^2]^{k-1}}{p(y,s^2)}\int_0^\infty \left[\frac{1}{s^2+tk^{-1}}\right]^{k-1} p(y,s^2+tk^{-1})dt
\\
\leq&
\frac{[s^2]^{k-1}}{p(y,s^2)}
\left[\frac{1}{s^2}\right]^{k-1}
\int_0^\infty p(y,s^2+tk^{-1})dt
\\
\leq&
\frac{1}{p(y,s^2)}
p(y)
\\
<& \infty
\end{aligned}
\end{equation}
where $=_{(1)}$ follows by Lemma (ref).
The second integrability condition is more tedious but follows as
\begin{equation}
\begin{aligned}[b]
&\int_0^\infty M_{\tau \mid y,s} (-t) dt
\\
=&_{(1)}
\frac{[s^2]^{k-1}}{p(y,s^2)}
\int_0^\infty
\frac{1}{t^{1/2}}
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1} p(y,s^2+tk^{-1})dt
\\
\lesssim&
\int_0^\infty
\frac{1}{t^{1/2}}
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1}
p(y,s^2+tk^{-1})dt
\\
=&
\int_0^\infty
\frac{1}{t^{1/2}}
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1}
\int \phi(y\mid \mu,\sigma) \gamma(s^2+tk^{-1}\mid \sigma)
dG(\mu,\sigma)
dt
\\
\leq&_{(2)}
\int_0^\infty
\frac{1}{t^{1/2}}
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1}
\int \frac{1}{\pi\sigma}
\frac{k^k}{\sigma^{2k}} [s^2+tk^{-1}]^{k-1} \exp\left(-\frac{ks^2+tk^{-1}}{\sigma^2}\right)
dG(\mu,\sigma)
dt
\\
\lesssim&
\int_0^\infty
\frac{1}{t^{1/2}}
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1}
\int \frac{1}{\sigma^{2k+1}}
\exp\left(-\frac{ks^2}{\sigma^2}\right)
dG(\mu,\sigma)
dt
\\
\lesssim&_{(3)}
\int_0^\infty
\int dG(\mu,\sigma)
\frac{1}{t^{1/2}}
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1}
dt
\\
=&
\int_0^\infty
\frac{1}{t^{1/2}}
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1}
dt
\\
\leq&
\left[\frac{1}{s^2}\right]^{k-1}
\int_0^1
\frac{1}{t^{1/2}}
dt
+
\int_1^\infty
\left[\frac{1}{s^2+tk^{-1}}\right]^{k-1}
dt
\\
<& \infty
\end{aligned}
\end{equation}
where $=_{(1)}$ follows by Lemma (ref), $\leq_{(2)}$ follows by substituting the expressions for the sampling densities, and $\lesssim_{(3)}$ follows because the function
\begin{equation}
z(\sigma) :=
\frac{1}{\sigma^{2k+1}}
\exp\left(-\frac{ks^2}{\sigma^2}\right)
\end{equation}
is continuous over $(0,\infty)$, tends to $0$ as $\sigma\downarrow0$ and as $\sigma\uparrow\infty$ and is therefore uniformly bounded by some constant.
lemma[Posterior MGF of $\sigma^{-2}$]
Suppose $J > 3$ and define $\tau:=\sigma^{-2}$. Then
\begin{equation}
M_{\tau \mid y,s}(t)
=
\left[\frac{s^2}{s^2 - tk^{-1}}\right]^{k-1}\frac{p(y,s^2 - tk^{-1})}{p(y,s^2)}
.
\end{equation}
proof[Proof of Lemma (ref)]
The proof follows closely Proposition 2 of Banerjee2023.
Again, let $p(\cdot)$ denote a probability density of a random variable, with the identity of the random variable obvious from the argument.
Note that Bayes' rule gives
\begin{equation}
\begin{aligned}[b]
p(\mu,\tau \mid y,s^2)
=&
\frac{p(y,s^2 \mid \mu,\tau)}{p(y,s^2)}p(\mu,\tau) \\
=&
\frac{p(y \mid \mu,\tau) p(s^2 \mid \mu,\tau)}{p(y,s^2)}\\
\propto&
exp\left\{-\frac{1}{2} \tau J(y-\mu)^2 \right\}
exp\left\{-k\tau s^2 + (k-1)\log s^2\right\}
\frac{1}{p(y,s^2)} \\
\propto&
exp\left\{Jy \cdot \tau\mu - \frac{1}{2}\left(Jy^2 + 2ks^2\right) \cdot \tau + (k-1)\log s^2 - \log p(y,s^2) \right\}
\\
=&
exp\left\{ \langle \boldsymbol{\eta} _i \; , \; [\tau\mu,\tau]^\prime \rangle - A( \boldsymbol{\eta} )\right\}
\end{aligned}
\end{equation}
where
\begin{equation}
\begin{aligned}[b]
\boldsymbol{\eta}
:=&
[ \boldsymbol{\eta} _{1} \ , \ \boldsymbol{\eta} _{2}]^\prime := \left[Ty \ , \ -\frac{1}{2}\left(Jy^2 + 2ks^2\right)\right]^\prime,
\\
A( \boldsymbol{\eta} )
:=&
-(k-1)\log\left[-\frac{ \boldsymbol{\eta} _{2}+(2J)^{-1} \boldsymbol{\eta} _{1}^2}{k} \right] + \log f\left(\frac{ \boldsymbol{\eta} _{1}}{J} \ , \ -\frac{ \boldsymbol{\eta} _{2}+(2J)^{-1} \boldsymbol{\eta} _{1}^2}{k} \right)
\\
=&
-(k-1)\log\left[s^2 \right] + \log p\left(y , s^2 \right).
\end{aligned}
\end{equation}
Therefore, $p(\mu,\tau \mid y,s^2)$ is a member of the exponential family with sufficient statistics $(\tau\mu,\tau)$. This then identifies the posterior moment generating function of the sufficient statistic as
\begin{equation}
M_{(\tau\mu,\tau) \mid y,s}( \boldsymbol{t} )
=
exp \left\{ A( \boldsymbol{\eta} + \boldsymbol{t} ) - A( \boldsymbol{\eta} ) \right\}
\end{equation}
for $ \boldsymbol{t} \in\mathbb{R}^2$, and the marginal posterior moment generating function of $\tau$ is then
\begin{equation}
M_{\tau \mid y,s}(t) =
exp \left\{ A( \boldsymbol{\eta} _i + [0,t]^\prime) - A( \boldsymbol{\eta} ) \right\}
\end{equation}
for $t\in\mathbb{R}$. Substituting out $( \boldsymbol{\eta} _{1}, \boldsymbol{\eta} _{2})$ for $(y,s^2)$ and a little more algebraic manipulation will yield us the expression in the lemma.
Proofs of Lemmas (ref), (ref), and (ref)
proof[Proof of Lemma (ref)]
Define $d_i:= \{\hat{\mu}_i \leq c\}$ for a generic estimator $\hat{\mu}:\mathcal{Y}\mapsto\mathbb{R}^n$.
Note that
\begin{equation}
\lvert \mu_i-c\rvert
\left(
\left\{\mu_i>c\right\} - \left\{\mu_i \leq c\right\}
\right) \cdot d_i
=
(\mu_i-c) \cdot d_i
\end{equation}
so that
\begin{equation}
\begin{aligned}[b]
&\operatorname*{argmin}_{\hat{\mu}}
\mathbb{E}_{G_0}^{(\mu,\sigma)}
\mathbb{E}_{(\mu,\sigma)}^{\mathcal{Y}}
\frac{1}{n}
\sum_{i=1}^n
\big[
\lvert \mu_i-c \rvert
\cdot
\big(
d_i
\left\{\mu_i>c\right\}
+
(1-d_i)
\left\{\mu_i<c\right\}
\big)
\big]
\\
=&
\operatorname*{argmin}_{\hat{\mu}}
\mathbb{E}_{G_0}^{(\mu,\sigma)}
\mathbb{E}_{(\mu,\sigma)}^{\mathcal{Y}}
\frac{1}{n}
\sum_{i=1}^n
\left[
(\mu_i-c) \cdot d_i
\right]
\\
=&
\operatorname*{argmin}_{\hat{\mu}}
\mathbb{E}_{G_0}^{\mathcal{Y}}
\frac{1}{n}
\sum_{i=1}^n
\left(\mathbb{E}_{G_0}[\mu_i\mid \mathcal{Y}_i]-c\right) \cdot d_i
\end{aligned}
\end{equation}
and the solution to the last equality is
\begin{equation}
d_i^*
=
\begin{cases}
1 &if \mathbb{E}_{G_0}[\mu_i\mid y_i,s_i]\leq c \\
0 &otherwise.
\end{cases}
\end{equation}
proof[Proof of Lemma (ref)]
Follows by Theorem (ref) and the linearity of expectations.
proof[Proof of Lemma (ref)]
Denote the conditional distribution of $(\mu_i,\sigma_i)$ given $J_i=J$ as $H_{(\mu_i,\sigma_i)|J}$.
Clearly $\check{\mu}^*=\mathbb{E}_{H_0}[\mu\mid y_i,s_i,J_i]$, and so we only have to characterize $\mathbb{E}_{H_0}[\mu\mid y_i,s_i,J_i]$ for the model
\begin{equation}
y_{ij} \mid \mu_i,\sigma_i,J \sim \mathcal{N}[\mu_i,\sigma_i],
\quad
(\mu_i,\sigma_i) \mid J \sim H_{(\mu_i,\sigma_i) | J}
\end{equation}
for $j=1,\dots,J$.
The desired result follows once we apply the proof of Theorem (ref) to the model (ref) and condition on $J$ throughout,
and noting that by assumption, $\mathbb{E}_{H_0}\{J_i > 3\} =1$.
Proofs for Section (ref)
Notations.
Let $\phi(\cdot)$ denote the standard normal density, and $\gamma(\cdot | k,\theta)$ denote the density of a gamma random variable with shape $k$ and scale $\theta$.
We sometimes use $\{ A \}$ as an indicator function that takes on a value of 1 when the event $A$ occurs and 0 otherwise; for instance, $\{ x \geq y \}$ takes on a value of 1 when $x \geq y$ and 0 otherwise.
Let $C>0$ denote a generic constant depending only on $\underline{\sigma}$ and $k$.
Let $\bar{\mu}_{G}$ and $\bar{\sigma}_{G}$ denote the maximum supports of $\mu$ and $\sigma$ for a distribution $G$ respectively.
Let $\bar{\mu}_{\mathcal{G}}$ and $\bar{\sigma}_{\mathcal{G}}$ denote the maximum supports for $\mu$ and $\sigma$ of the class of distributions $\mathcal{G}$ respectively. That is, $\bar{\mu}_{\mathcal{G}} := \sup_{G \in \mathcal{G}}\bar{\mu}_{G}$.
We will further define a class of distributions in addition to $\mathcal{G}_n$ defined in Assumption (ref):
equation[equation omitted — 227 chars of source]
where
$\tilde{\gamma}_1 := \gamma_1 + \gamma_2 + \tfrac{1}{2}$ and
$\tilde{\gamma}_2 := \gamma_2 + \tfrac{1}{2}$.
Finally, we will sometimes drop the subscript $n$ (which indicates the row of the triangular array) for notational compactness.
Proof of Theorem (ref)
In this section, we split the proof of Theorem (ref) into three parts, each corresponding to one of the three bounds.
We provide the proof for the regret bounds of estimating $\{\sigma_i^2\}_{i\in[n]}$ in detail, and then specify how it is modified to complete the proofs for $\{\sigma_i\}_{i\in[n]}$ and $\{\mu_i\}_{i\in[n]}$ respectively.
proof[Regret bounds for $\{\sigma_i^2\}_{i\in[n]}$]
Using Lemma (ref), we have
\begin{align}
R_{G_0}(\hat{\sigma}^2,\sigma^2) - R_{G_0}(\hat{\sigma}^{2*},\sigma^2)
\leq&
\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)},\mathcal{Y}_1}
\left[
\hat{\sigma}^2(y_1,s_1 \mid \hat{G}^{(1)},\rho_n)
-
\hat{\sigma}^2(y_1,s_1 \mid G_0,\rho_n)
\right]^2
\\
+&
\mathbb{E}_{G_0}^{\mathcal{Y}_1}
\left[
\left\{\tfrac{f_{G_0}(y_1,s_1^2)}{f_{G_0}(y_1,s_1^2)\vee\rho_n} - 1\right\}\hat{\sigma}^{2*}(y_1,s_1)
\right]^2.
\end{align}
The term (ref) is handled by $\rho\asymp n^{-1}\downarrow0$ fast enough:
\begin{align}
&\mathbb{E}_{G_0}^{\mathcal{Y}_1}
\left[\big(\tfrac{f_{G_0}(y_1,s_1^2)}{f_{G_0}(y_1,s_1^2)\vee\rho} - 1\big)
\hat{\sigma}^{2*}(y_1,s_1)\right]^2
\nonumber\\
\leq&
\bar{\sigma}_{G_0}^4 \cdot
\int \big(\tfrac{f_{G_0}(y,s^2)}{f_{G_0}(y,s^2)\vee\rho} - 1\big)^2
f_{G_0}(y,s^2) d(y,s^2)
\nonumber\\
=_{(1)}&
\bar{\sigma}_{G_0}^4 \cdot
O(n^{-1})
\end{align}
where $=_{(1)}$ follows because in the region where $\rho_n < f_{G_0}(y,s^2)$, the first term in the integral is exactly zero, whereas in the region where $\rho_n > f_{G_0}(y,s^2)$, the first term in the integral is bounded and the second is $O(n^{-1})$ by Dominated Convergence Theorem and Assumption (ref).
The term (ref) is handled by splitting the region of integration for $\mathcal{Y}_1$ into two disjoint regions: $\mathbb{R}\times\mathbb{R}_+ = \mathcal{R}\cup\mathcal{R}^c$ where $\mathcal{R}:=\{|y|\leq \bar{y}_n\}\cap\{s \leq \bar{s}_n\}$, defined by
\begin{equation}
\bar{y}_n
:= \bar{\mu}_{G_0} + \bar{\sigma}_{G_0} (\log n^2)^{1/2}
and
\bar{s}_n := \tfrac{1}{k^{1/2}}\bar{\sigma}_{G_0} (\log n^2)^{1/2}.
\end{equation}
The integration over $\mathcal{R}^c$ is bounded by Lemma (ref) to be of the order
\begin{align}
&\left( \mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}}[\bar{\sigma}_{\hat{G}^{(1)}}^4] + \bar{\sigma}_{G_0}^4
\right) \cdot
o(n^{-1})
\nonumber\\
\leq_{(1)}&
\left( \bar{\sigma}_{\tilde{\mathcal{G}}}^4 + \bar{\sigma}_{G_0}^4
\right) \cdot
o(n^{-1})
\end{align}
and $\leq_{(1)}$ further follows from Lemma (ref).
The integration over $\mathcal{R}$ is handled by Theorem (ref) to be bounded by
\begin{equation}
C \cdot
\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}}
\left[
\left( \bar{\sigma}_{\hat{G}^{(1)}}^4 + \bar{\sigma}_{G_0}^4 + \bar{s}_n^4 \right)
\cdot d^2\big(f_{\hat{G}^{(1)}},f_{G_0}\big)
\right] .
\end{equation}
In the regions where either $\bar{\sigma}_{\hat{G}^{(1)}}> \bar{\sigma}_{\tilde{\mathcal{G}}}$ or $\bar{\mu}_{\hat{G}^{(1)}}> \bar{\mu}_{\tilde{\mathcal{G}}}$, we will have (ref) to be $o(n^{-1})$ by Lemmas (ref) or (ref), since the maximum Hellinger distance between any two densities is 1. For example,
\begin{align}
&\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}}
\left[
\left( \bar{\sigma}_{\hat{G}^{(1)}}^4 + \bar{\sigma}_{G_0}^4 + \bar{s}_n^4 \right)
\cdot d^2\big(f_{\hat{G}^{(1)}},f_{G_0}\big)
\cdot \{ \bar{\sigma}_{\hat{G}^{(1)}} \leq \bar{\sigma}_{\tilde{\mathcal{G}}} \}
\{ \bar{\mu}_{\hat{G}^{(1)}} > \bar{\mu}_{\tilde{\mathcal{G}}} \}
\right]
\nonumber\\
\leq&
\left( \bar{\sigma}_{\tilde{\mathcal{G}}}^4 + \bar{\sigma}_{G_0}^4 + \bar{s}_n^4 \right)
\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}}\{ \bar{\mu}_{\hat{G}^{(1)}} > \bar{\mu}_{\tilde{\mathcal{G}}} \}
\nonumber\\
=_{(1)}& o(n^{-1}).
\end{align}
where $=_{(1)}$ follows from Lemma (ref).
We therefore assume for the remainder of the proof that $\bar{\sigma}_{\hat{G}^{(1)}}\leq \bar{\sigma}_{\tilde{\mathcal{G}}}$ and $\bar{\mu}_{\hat{G}^{(1)}}\leq \bar{\mu}_{\tilde{\mathcal{G}}}$.
Then (ref) is bound by
\begin{equation}
C \cdot
\left( \bar{\sigma}_{\tilde{\mathcal{G}}}^4 + \bar{\sigma}_{G_0}^4 + \bar{s}_n^4 \right)
\cdot \mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}} d^2\big(f_{\hat{G}^{(1)}},f_{G_0}\big)
\end{equation}
and by Theorem (ref), there exists positive constants $c_1$ and $c_2$ such that
\begin{align}
\mathbb{E}_{G_0}^{\mathcal{Y}}[d^2\big(f_{\hat{G}^{(1)}},f_{G_0}\big)]
\leq&
\mathbb{E}_{G_0}^{\mathcal{Y}}
d^2\big(f_{\hat{G}^{(1)}},f_{G_0}\big)
\left\{d\big(f_{\hat{G}^{(1)}},f_{G_0}\big) > c_1\epsilon_n\right\}
+
c_1\epsilon_n^2
\nonumber\\
\leq&
2\exp\big(-c_2 (\log n)^3\big)
+
c_1
\tfrac{1}{n}
(\log n)^{4\left[\tilde{\gamma}_1\vee \frac{1}{2}+\tilde{\gamma}_2\right]+1}
\nonumber\\
\leq&
C
\tfrac{1}{n}
(\log n)^{4\left[\tilde{\gamma}_1\vee \frac{1}{2}+\tilde{\gamma}_2\right]+1}.
\end{align}
Therefore, by combining (ref)--(ref), we have
\begin{align}
R_{G_0}(\hat{\sigma}^2,\sigma^2) - R_{G_0}(\hat{\sigma}^{2*},\sigma^2)
\leq&
C
[\bar{\sigma}_{\tilde{\mathcal{G}}}^4 + \bar{\sigma}_{G_0}^4 + \bar{s}_n^4 ]
\cdot
\tfrac{1}{n}
(\log n)^{4\left[\tilde{\gamma}_1\vee\frac{1}{2} + \tilde{\gamma}_2\right] +1 }
\nonumber\\
\leq&
C
\left[
(\log n)^{4\tilde{\gamma}_2} + (\log n)^{4\gamma_2 + 2}
\right]
\cdot
\tfrac{1}{n}
(\log n)^{4\left[\tilde{\gamma}_1\vee\frac{1}{2} + \tilde{\gamma}_2\right] + 1 }
\nonumber\\
\leq&
C
(\log n)^{4\tilde{\gamma}_2}
\cdot
\tfrac{1}{n}
(\log n)^{4\left[\tilde{\gamma}_1\vee\frac{1}{2} + \tilde{\gamma}_2\right] + 1 }
\nonumber\\
=&
C
(\log n)^{4\tilde{\gamma}_2}
\cdot
\tfrac{1}{n}
(\log n)^{4\left[\tilde{\gamma}_1 + \tilde{\gamma}_2\right] + 1 }.
\end{align}
and the final equality follows by definition of $\tilde{\gamma}_1$.
proof[Regret bounds for $\{\sigma_i\}_{i\in[n]}$]
Following the proof of regret bound for $\{\sigma_i\}_{i\in[n]}$, we have
\begin{align}
&R_{G_0}(\hat{\sigma},\sigma) - R_{G_0}(\hat{\sigma}^{*},\sigma)
\nonumber\\
\leq&
\bar{\sigma}_{G_0}^2 \cdot O(n^{-1})
+
\left[
\bar{\sigma}_{\tilde{\mathcal{G}}}^2 +\bar{\sigma}_{G_0}^2
\right] \cdot o(n^{-1})
+
\mathbb{E}_{G_0}^{\mathcal{Y}}
\left[
\hat{\sigma}(y_1,s_1|\hat{G}^{(1)},\rho_n) - \hat{\sigma}(y_1,s_1 |G_0,\rho_n)
\right]^2 \mathcal{R}
\end{align}
and by Theorem (ref) we have
\begin{align}
\mathbb{E}_{G_0}^{\mathcal{Y}}
\left[\hat{\sigma}(y_1,s_1 | \hat{G}^{(1)},\rho_n) - \hat{\sigma}(y_1,s_1 | G_0,\rho_n)\right]^2 \mathcal{R}
\leq&
C \cdot
\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}}
\left[(\bar{\sigma}_{\hat{G}^{(1)}}^2+\bar{s}_n^4) \cdot d^2\big(f_{\hat{G}^{(1)}},f_{G_0}\big)\right]
\end{align}
and thus by arguments identical as (ref)--(ref) we have
\begin{equation}
R_{G_0}(\hat{\sigma},\sigma) - R_{G_0}(\hat{\sigma}^{*},\sigma)
\lesssim
(\log n)^{4\tilde{\gamma}_2}
\cdot
\tfrac{1}{n}
(\log n)^{4\left[\tilde{\gamma}_1 + \tilde{\gamma}_2\right] + 1 }.
\end{equation}
proof[Regret bounds for $\{\mu_i\}_{i\in[n]}$]
Following the proof of regret bound for $\{\sigma_i\}_{i\in[n]}$
and replacing the application of Theorem (ref) with Theorem (ref),
we have
\begin{align}
R_{G_0}(\hat{\mu},\mu) - R_{G_0}(\hat{\mu}^{*},\mu)
\leq&
\bar{\mu}_{G_0}^2 \cdot O(n^{-1})
+
[\bar{\mu}_{\tilde{\mathcal{G}}}^2+\bar{\mu}_{G_0}^2] \cdot o(n^{-1})
\nonumber\\
+&
C\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}}
\left\{
\big[\bar{\mu}_{\hat{G}^{(1)}}^2+\bar{\mu}_{G_0}^2 + \bar{s}_n^4\big(\tilde{L}(\rho)x_n^2+a_n^2\big)\big]
d^2(f_{\hat{G}^{(1)}},f_{G_0})
\right\}
\end{align}
where
\begin{align}
x_n
:=& \bar{\mu}_{\hat{G}^{(1)}} + \bar{\mu}_{G_0} + 2\bar{y}_n,
\nonumber\\
a_n
:=& \max\{\tilde{L}(\rho_n)+1, |\log d^2(f_{\hat{G}^{(1)}},f_{G_0})|\},
\nonumber\\
\tilde{L}(\rho)
:=& \sqrt{-\log(2\pi \rho^2)} for 0<\rho\leq\tfrac{1}{\sqrt{2\pi}}.
\end{align}
Note that $\tilde{L}(\rho_n)\asymp \log n$ is of a larger order than $| \log \epsilon_n^2 |$ when
$\epsilon_n^2 := \tfrac{1}{n} (\log n)^{4\left[ \tilde{\gamma}_1\vee\frac{1}{2} + \tilde{\gamma}_2 \right]+1}$.
Now we follow (ref)--(ref) to obtain bounds on (ref) as
\begin{align}
&\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}}
\left\{\big[\bar{\mu}_{\hat{G}^{(1)}}^2+\bar{\mu}_{G_0}^2 + \bar{s}_n^4\{\tilde{L}(\rho_n)x_n^2+a_n^2\}\big]
d^2(f_{\hat{G}^{(1)}},f_{G_0})\right\}
\nonumber\\
\leq_{(1)}&
C \cdot \bar{s}_n^4 \log (n) \bar{\mu}_{\tilde{\mathcal{G}}}^2 \cdot
\mathbb{E}_{G_0}^{\mathcal{Y}^{(1)}} [d^2(f_{\hat{G}^{(1)}},f_{G_0}) ]
\nonumber\\
\leq_{(2)}&
C \cdot \bar{s}_n^4 \log (n) \bar{\mu}_{\tilde{\mathcal{G}}}^2 \cdot
\tfrac{1}{n} (\log n)^{4\left[\tilde{\gamma}_1\vee\frac{1}{2} + \tilde{\gamma}_2\right]+1}
\nonumber\\
\leq&
C \cdot
(\log n)^{4\tilde{\gamma}_2 + 2\tilde{\gamma}_1 + 1}
\cdot
\tfrac{1}{n} (\log n)^{4\left[\tilde{\gamma}_1 + \tilde{\gamma}_2\right] + 1 }.
\end{align}
where $\leq_{(1)}$ follows by comparing rates within the block parenthesis, and $\leq_{(2)}$ follows by Lemma (ref).
Leave-one-out regret
The following reduces the regret of using leave-one-out NPMLEs to a form more amenable for analysis.
lemma[Leave-one-out Regret]
Suppose that $\hat{G}^{(i)}$ satisfy Assumption (ref) for all $i$. Then
\begin{align}
&R_{G_0}(\hat{\mu},\mu) - R_{G_0}(\hat{\mu}^{*},\mu)
\nonumber\\
=&
\mathbb{E}_{G_0}^{\mathcal{Y}}
\left[
\hat{\mu}(y_1,s_1 \mid \hat{G}^{(1)},\rho_n)
-
\hat{\mu}(y_1,s_1 \mid G_0,\rho_n)
+
\left\{\tfrac{f_{G_0}(y_1,s_1^2)}{f_{G_0}(y_1,s_1^2)\vee\rho_n} - 1\right\}\hat{\mu}^{*}(y_1,s_1)
\right]^2,
\nonumber\\
&R_{G_0}(\hat{\sigma},\sigma) - R_{G_0}(\hat{\sigma}^{*},\sigma)
\nonumber\\
=&
\mathbb{E}_{G_0}^{\mathcal{Y}}
\left[
\hat{\sigma}(y_1,s_1 \mid \hat{G}^{(1)},\rho_n)
-
\hat{\sigma}(y_1,s_1 \mid G_0,\rho_n)
+
\left\{\tfrac{f_{G_0}(y_1,s_1^2)}{f_{G_0}(y_1,s_1^2)\vee\rho_n} - 1\right\}\hat{\sigma}^{*}(y_1,s_1)
\right]^2,
\nonumber\\
&R_{G_0}(\hat{\sigma}^2,\sigma^2) - R_{G_0}(\hat{\sigma}^{2*},\sigma^2)
\nonumber\\
=&
\mathbb{E}_{G_0}^{\mathcal{Y}}
\left[
\hat{\sigma}^2(y_1,s_1 \mid \hat{G}^{(1)},\rho_n)
-
\hat{\sigma}^2(y_1,s_1 \mid G_0,\rho_n)
+
\left\{\tfrac{f_{G_0}(y_1,s_1^2)}{f_{G_0}(y_1,s_1^2)\vee\rho_n} - 1\right\}\hat{\sigma}^{2*}(y_1,s_1)
\right]^2
\nonumber.
\end{align}
proofNote that
\begin{align}
&
R_{G_0}(\hat{\sigma}^2,\sigma^2) - R_{G_0}(\hat{\sigma}^{2*},\sigma^2)
\nonumber\\
=_{(1)}&
\mathbb{E}^{\mathcal{Y}} \left[ \hat{\sigma}_1^{2} - \sigma_1^2 \right]^2
-
\mathbb{E}^{\mathcal{Y}} \left[ \hat{\sigma}_1^{2*} - \sigma_1^2 \right]^2
\nonumber\\
=_{(2)}&
\mathbb{E}^{\mathcal{Y}^{(1)}}\mathbb{E}_{\mathcal{Y}^{(1)}}^{\mathcal{Y}_1}
\left[\hat{\sigma}^2(y_1,s_1 | \hat{G}^{(1)},\rho_n) - \hat{\sigma}^{2*}(y_1,s_1)\right]^2
\nonumber\\
=&
\mathbb{E}^{\mathcal{Y}^{(1)}}\mathbb{E}_{\mathcal{Y}^{(1)}}^{\mathcal{Y}_1}
\left[
\tfrac{k}{f_{\hat{G}^{(1)}}(y_1,s_1^2)\vee \rho_n} \cdot \int_{s_1^2}^\infty \left[\tfrac{s_1^2}{t}\right]^{k-1} f_{\hat{G}^{(1)}}(y_1,t) dt
-
\tfrac{k}{f_{G_0}(y_1,s_1^2) } \cdot \int_{s_1^2}^\infty \left[\tfrac{s_1^2}{t}\right]^{k-1} f_{G_0}(y_1,t) dt
\right]^2
\nonumber\\
=&
\mathbb{E}^{\mathcal{Y}^{(1)}}\mathbb{E}_{\mathcal{Y}^{(1)}}^{\mathcal{Y}_1}
\bigg[
\underbrace{\tfrac{k}{f_{\hat{G}^{(1)}}(y_1,s_1^2)\vee \rho_n} \cdot \int_{s_1^2}^\infty \left[\tfrac{s_1^2}{t}\right]^{k-1} f_{\hat{G}^{(1)}}(y_1,t) dt}_{=\hat{\sigma}^2(y_1,s_1|\hat{G}^{(1)},\rho_n)}
-
\underbrace{\tfrac{k}{f_{G_0}(y_1,s_1^2) \vee \rho_n} \cdot \int_{s_1^2}^\infty \left[\tfrac{s_1^2}{t}\right]^{k-1} f_{G_0}(y_1,t) dt}_{=\hat{\sigma}^2(y_1,s_1|G_0,\rho_n)}
\nonumber\\
&\, \qquad\qquad+
\left\{\tfrac{f_{G_0}(y_1,s_1^2)}{f_{G_0}(y_1,s_1^2)\vee\rho_n} - 1\right\} \underbrace{\tfrac{k}{f_{G_0}(y_1,s_1^2)} \int_{s_1^2}^\infty \left[\tfrac{s_1^2}{t}\right]^{k-1}f_{G_0}(y_1,t)dt}_{=\hat{\sigma}^{2*}(y_1,s_1)}
\bigg]^2
\end{align}
where $=_{(1)}$ follows by the i.i.d. set-up, and $=_{(2)}$ by expanding and using the law of iterated expectations coupled with the fact that $\hat{\sigma}_1^{2*}$ is the Bayes' estimator under $G_0$.
The regret statements for estimation of $\{\mu_i\}_{i\in[n]}$ and $\{\sigma_i\}_{i\in[n]}$ follow along identical lines and are thus omitted.
Support of NPMLE maximization
First recall the definition of $\tilde{\mathcal{G}}$ in (ref).
lemmaSuppose Assumptions (ref) and (ref) hold, and $J>3$. Then
\begin{align}
\mathbb{E}_{G_0}
\left[ \bar{\sigma}_{\hat{G}^{(1)}}^2 \{ \bar{\sigma}_{\hat{G}^{(1)}}^2 > \bar{\sigma}_{\tilde{\mathcal{G}}}^2 \} \right]
=& o(n^{-1}) ,
\nonumber\\
\mathbb{E}_{G_0}
\left[ \bar{\sigma}_{\hat{G}^{(1)}}^4 \{ \bar{\sigma}_{\hat{G}^{(1)}}^4 > \bar{\sigma}_{\tilde{\mathcal{G}}}^4 \} \right]
=& o(n^{-1}) ,
\nonumber\\
\mathbb{E}_{G_0}
\left[ \bar{\mu}_{\hat{G}^{(1)}}^2 \{ \bar{\mu}_{\hat{G}^{(1)}}^2 > \bar{\mu}_{\tilde{\mathcal{G}}}^2 \} \right]
=& o(n^{-1}).
\nonumber
\end{align}
proofNow for the first result: by the tail-sum expectation formula\footnote{That is, for any non-negative random variable $X$, we have $\mathbb{E}[X]=\int_{0}^{\infty}\mathbb{E}\{X > t\} dt$.}, we have
\begin{align}
\mathbb{E}_{G_0}
\left[ \bar{\sigma}_{\hat{G}^{(1)}}^2 \{ \bar{\sigma}_{\hat{G}^{(1)}}^2 > \bar{\sigma}_{\tilde{\mathcal{G}}}^2 \} \right]
=&
\int_{\bar{\sigma}_{\tilde{\mathcal{G}}}^2}^\infty
\mathbb{E}_{G_0}\{ \bar{\sigma}_{\hat{G}^{(1)}}^2 > t \} dt
\nonumber\\
\leq_{(1)}&
\int_{\bar{\sigma}_{\tilde{\mathcal{G}}}^2}^\infty
\sum_i^n \mathbb{E}_{G_0}\{ s_i^2 > t \} dt
\nonumber\\
\leq_{(2)}&
\int_{\bar{\sigma}_{\tilde{\mathcal{G}}}^2}^\infty
n\cdot\exp\left(-k \left[\tfrac{t}{\bar{\sigma}_{G_0}^2} - \sqrt{\tfrac{2t}{\bar{\sigma}_{G_0}^2}-1}\right]\right)
dt
\nonumber\\
=&
\int_0^\infty
\{ t > \bar{\sigma}_{\tilde{\mathcal{G}}}^2\}
\exp\left(-k \tfrac{t}{\bar{\sigma}_{G_0}^2} + \log n + k\sqrt{\tfrac{2t}{\bar{\sigma}_{G_0}^2}-1}\right)
dt
\nonumber\\
=_{(3)}&
o(n^{-1})
\end{align}
where $\leq_{(1)}$ is a union bound coupled with Assumption (ref), and $\leq_{(2)}$ follows from Lemma (ref).
The integrand in the second-to-last equality is $o(n^{-1})$ for each $t$, because $kt/\bar{\sigma}_{G_0}^2 = 2k \log n$ for $t>\bar{\sigma}_{\tilde{\mathcal{G}}}^2$, and furthermore $2k>2$. Thus $=_{(3)}$ follows from the Monotone Convergence Theorem.
The second and third results follow in a similar fashion.
lemmaSuppose Assumptions (ref) and (ref) hold, and $J>3$. Then,
\begin{align}
v_n \cdot \mathbb{E}_{G_0}
\{ \bar{\sigma}_{\hat{G}^{(1)}}^2 > \bar{\sigma}_{\tilde{\mathcal{G}}}^2 \}
=& o(n^{-1})
\nonumber\\
v_n \cdot \mathbb{E}_{G_0} \{ \bar{\mu}_{\hat{G}^{(1)}}^2 > \bar{\mu}_{\tilde{\mathcal{G}}}^2 \}
=& o(n^{-1})
\nonumber
\end{align}
where $v_n$ is any sub-polynomial sequence\footnote{A sub-polynomial sequence $v_n$ is one that satisfies $v_n = o(n^\epsilon)$ for every $\epsilon>0$.}.
proofFollows from Lemma (ref) and the union bound.
lemmaSuppose Assumption (ref) holds. Then,
\begin{align}
\mathbb{E}_{G_0} \{s_i^2 > t\}
\leq&
\exp\left(-k \left[\tfrac{t}{\bar{\sigma}_{G_0}^2} - \sqrt{\tfrac{2t}{\bar{\sigma}_{G_0}^2}-1}\right]\right)
\nonumber\\
\mathbb{E}_{G_0}\left\{ |y_i| > t \right\}
\leq&
2
\exp\left( -\tfrac{1}{2} \left[ \tfrac{t-\bar{\mu}_{G_0}}{\bar{\sigma}_{G_0}/\sqrt{J}} \right]^2 \right).
\nonumber
\end{align}
proofFor the first result: note that for all $i$,we have\footnote{ That is, $\tfrac{s_i^2}{\sigma_i^2}-1$ is sub-gamma on the right tail with variance factor $k^{-1}$ and scale factor $k^{-1}$. See e.g., Section 2.4 of Boucheron2013.}
\begin{equation}
\tfrac{s_i^2}{\sigma_i^2}-1 \in\Gamma_+(k^{-1},k^{-1}).
\end{equation}
Therefore
\begin{align}
\mathbb{E}_{G_0} \left\{ s_i^2 > t \right\}
\leq&
\mathbb{E}_{G_0}
\left\{ \tfrac{s_i^2}{\sigma_i^2} -1 > \tfrac{t}{\bar{\sigma}_{G_0}^2} -1 \right\}
\nonumber\\
\leq_{(1)}&
\exp\left(-k \left[\tfrac{t}{\bar{\sigma}_{G_0}^2} - \sqrt{\tfrac{2t}{\bar{\sigma}_{G_0}^2}-1}\right]\right).
\end{align}
where $\leq_{(1)}$ follows from\footnote{Again, see Section 2.4 of Boucheron2013.} (ref).
For the second result: note that $\frac{y_i-\mu_i}{\sigma_i/\sqrt{J}}$ is a standard normal variable.
\begin{align}
\mathbb{E}_{G_0}\left\{ |y_i| > t \right\}
\leq&
\mathbb{E}_{G_0}\left\{
\left| \tfrac{y_i-\mu_i}{\sigma_i/\sqrt{J}} \right| > \tfrac{t-\bar{\mu}_{G_0}}{\bar{\sigma}_{G_0}/\sqrt{J}}
\right\}
\nonumber\\
\leq&
2
\mathbb{E}_{G_0}\left\{
\tfrac{y_i-\mu_i}{\sigma_i/\sqrt{J}} > \tfrac{t-\bar{\mu}_{G_0}}{\bar{\sigma}_{G_0}/\sqrt{J}}
\right\}
\nonumber\\
\leq_{(1)}&
2
\exp\left( -\tfrac{1}{2} \left[ \tfrac{t-\bar{\mu}_{G_0}}{\bar{\sigma}_{G_0}/\sqrt{J}} \right]^2 \right)
\end{align}
and $\leq_{(1)}$ follows from the sub-Gaussianity\footnote{See Section 2.3 of Boucheron2013.} of $\frac{y_i-\mu_i}{\sigma_i/\sqrt{J}}$.
MSEs within region $\mathcal{R}$
This section provides adaptations of results from Jiang2009 that reduce the MSE from using a density estimate in place of the true density $f_{G_{0,n}}$ to the Hellinger distance between the density estimate and the true density.
In this regard, Theorems (ref), (ref) and (ref) are adaptations of Proposition 3 of Jiang2020 to the setting of unknown heteroskedasticity for the estimation objectives of $\{\sigma_i^2\}_{i\in[n]}$, $\{\sigma_i\}_{i\in[n]}$ and $\{\mu_i\}_{i\in[n]}$ respectively.
Lemmas (ref) is used in the proofs of all three theorems, whereas Lemmas (ref) and (ref) are specifically for handling the additional differentiation term required in the proof of Theorem (ref).
Recall that the indicator function $\mathcal{R}$ is defined as in (ref).
We maintain the following assumption for this subsection:
assumption[Lower bound on $\sigma$]
$G_0$ and $G_1$ are two bivariate distributions satisfying $G_l\left( \mathbb{R} \times [\underline{\sigma},\infty) \right)=1$ for $l=0,1$ for some fixed constant $\underline{\sigma}$.
theoremWe have
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)}
\left\{\big[
\hat{\sigma}^2(y,s|G_1,\rho_n)
-
\hat{\sigma}^2(y,s|G_0,\rho_n)
\big]^2\mathcal{R}\right\}
\nonumber\\
\leq&
\big(\bar{\sigma}_{G_1}^4 + \bar{\sigma}_{G_0}^4\big)
2d^2(f_{G_1},f_{G_0})
+
4k^2
\tfrac{\bar{s}_n^4}{k-2}
d^2\big(f_{G_1},f_{G_0}\big).
\end{align}
proofRecall that by definition of $\hat{\sigma}^2(y,s, | G,\rho_n)$,
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)}
\left\{\big[
\hat{\sigma}^2(y,s|G_1,\rho_n)
-
\hat{\sigma}^2(y,s|G_0,\rho_n)
\big]^2\mathcal{R}\right\}
\nonumber\\
=&
\mathbb{E}_{G_0}^{(y,s)}
\bigg[
\frac{k}{f_{G_1}(y,s^2)\vee \rho_n} \cdot \int_{s^2}^\infty \left[\frac{s^2}{t}\right]^{k-1} f_{G_1}(y,t) dt
-
\frac{k}{f_{G_0}(y,s^2)\vee \rho_n} \cdot \int_{s^2}^\infty \left[\frac{s^2}{t}\right]^{k-1} f_{G_0}(y,t) dt
\bigg]^2
\mathcal{R}.
\end{align}
Now define
\begin{equation}
w^* := [f_{G_1}(y,s^2)\vee\rho_n + f_{G_0}(y,s^2)\vee\rho_n]^{-1}
\end{equation}
and note that for $\tilde{G}=G_1$ or $G_0$,
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)} \bigg[
\left(\tfrac{k}{f_{\tilde{G}}(y,s^2)\vee\rho_n} - 2kw^*\right)
\int_{s^2}^\infty \left[\tfrac{s^2}{t}\right]^{k-1} f_{\tilde{G}}(y,t)dt
\bigg]^2 \mathcal{R}
\nonumber\\
=&
\mathbb{E}_{G_0}^{(y,s)} \bigg[
\tfrac{f_{G_0}(y,s^2)\vee\rho_n - f_{G_1}(y,s^2)\vee\rho_n}{f_{G_0}(y,s^2)\vee\rho_n + f_{G_1}(y,s^2)\vee\rho_n}
\cdot
\underbrace{\tfrac{k}{f_{\tilde{G}}(y,s^2)\vee\rho_n}
\int_{s^2}^\infty \left[\tfrac{s^2}{t}\right]^{k-1} f_{\tilde{G}}(y,t)dt}_{\hat{\sigma}^2(y,s |\tilde{G},\rho_n)}
\bigg]^2 \mathcal{R}
\nonumber\\
\leq&
\bar{\sigma}_{\tilde{G}}^4
\cdot
\mathbb{E}_{G_0}^{(y,s)} \bigg[
(f_{G_0}(y,s^2)\vee\rho_n - f_{G_1}(y,s^2)\vee\rho_n)w^*
\bigg]^2 \mathcal{R}
\nonumber\\
\leq_{(1)}&
\bar{\sigma}_{\tilde{G}}^4
\cdot
\mathbb{E}_{G_0}^{(y,s)} \big[
(f_{G_0}(y,s^2) - f_{G_1}(y,s^2) )w^*
\big]^2 \mathcal{R}
\end{align}
where $\leq_{(1)}$ follows because for instance if
$f_{G_0}(y,s^2) < \rho_n < f_{G_1}(y,s^2)$, then
\begin{align}
[f_{G_0}(y,s^2)\vee\rho_n - f_{G_1}(y,s^2)\vee\rho_n]^2
=& [\rho_n-f_{G_1}(y,s^2)]^2
\nonumber\\
\leq&
[f_{G_0}(y,s^2)-f_{G_1}(y,s^2)]^2
\end{align}
with the other cases such as
$\{\rho_n< f_{G_0}(y,s^2)\} \cap \{\rho_n<f_{G_1}(y,s^2)\}$
being obvious.
Inserting (ref) into (ref) and bounding using the triangle inequality will give us
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)}
[\hat{\sigma}(y,s|G_1,\rho_n) - \hat{\sigma}^2(y,s |G_0,\rho_n)]^2 \mathcal{R}
\nonumber\\
\leq&
\big(\bar{\sigma}_{G_1}^4 + \bar{\sigma}_{G_0}^4\big)
\mathbb{E}_{G_0}^{(y,s)} \big[
(f_{G_0} - f_{G_1} )w^*
\big]^2
\nonumber\\
+&
4k^2
\mathbb{E}_{G_0}^{(y,s)}
\left(
w^*
\int_{s^2}^\infty
\left[\tfrac{s^2}{t}\right]^{k-1}
\left[f_{G_1}(y,t) - f_{G_0}(y,t)\right] dt
\right)^2 \mathcal{R}.
\end{align}
We bound the two terms on the RHS of the inequality in (ref) in turn. For the first term, we have
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)} \big[
(f_{G_0}(y,s^2) - f_{G_1}(y,s^2) )w^*
\big]^2
\nonumber\\
=&
\mathbb{E}_{G_0}^{(y,s)} \bigg[
(f_{G_0}^{1/2}(y,s^2) - f_{G_1}^{1/2}(y,s^2) ) (f_{G_0}^{1/2}(y,s^2) + f_{G_1}^{1/2}(y,s^2) ) w^*
\bigg]^2
\nonumber\\
=&
\int
\left[f_{G_0}^{1/2}(y,s^2) - f_{G_1}^{1/2}(y,s^2) \right]^2
\cdot
\left[ f_{G_0}^{1/2}(y,s^2) + f_{G_1}^{1/2}(y,s^2) \right]^2 w^*
\cdot
w^* f_{G_0}(y,s^2)d(y,s^2)
\nonumber\\
\leq&
d^2(f_{G_1},f_{G_0}) \cdot 2
\end{align}
because $w^*f_{G_0}(y,s^2) \leq 1$ and $\big[f_{G_0}(y,s^2)^{1/2} + f_{G_1}^{1/2}(y,s^2)\big]^2w^* \leq 2$ for all $(y,s^2)$.
For the second term on the RHS of the inequality (ref):
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)}
\left(
w^*
\int_{s^2}^\infty
\left[\tfrac{s^2}{t}\right]^{k-1}
\left[f_{G_1}(y,t) - f_{G_0}(y,t)\right]dt
\right)^2 \mathcal{R}
\nonumber\\
=&
\int_{\mathcal{R}}
\left(
w^*
\int_{s^2}^\infty
\left[\tfrac{s^2}{t}\right]^{k-1}
\left[f_{G_1}(y,t) - f_{G_0}(y,t)\right]dt
\right)^2 f_{G_0}(y,s^2)d(y,s^2)
\nonumber\\
\leq_{(1)}&
\int_{\mathcal{R}}
\frac{
\big(\int_{s^2}^\infty
\big[\tfrac{s^2}{t}\big]^{k-1}
\big[f_{G_1}(y,t) - f_{G_0}(y,t)\big]dt\big)^2
}{
f_{G_1}(y,s^2)\vee\rho_n + f_{G_0}(y,s^2)\vee\rho_n
}
d(y,s^2)
\nonumber\\
=&
\int_{\mathcal{R}}
\left\{
\int_{s^2}^\infty
\big[\tfrac{s^2}{t}\big]^{k-1}
\left[
\tfrac{
f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n
}{
f_{G_1}(y,s^2)\vee\rho_n + f_{G_0}(y,s^2)\vee\rho_n
}
\right]^{1/2}
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]
dt
\right\}^2
d(y,s^2)
\nonumber\\
\leq_{(2)}&
\int_{\mathcal{R}}
\left\{
\int_{s^2}^\infty
\big[\tfrac{s^2}{t}\big]^{k-1}\cdot \big[\tfrac{s^2}{t}\big]^{k-1}
\left[
\tfrac{
f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n
}{
f_{G_1}(y,s^2)\vee\rho_n + f_{G_0}(y,s^2)\vee\rho_n
}
\right]
dt
\cdot
\int_{s^2}^\infty
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt
\right\}
d(y,s^2)
\end{align}
where $\leq_{(1)}$ follows by $\tfrac{f_{G_0}(y,s^2)}{f_{G_1}(y,s^2)\vee\rho_n+f_{G_0}(y,s^2)\vee\rho_n}\leq 1$ for all $(y,s^2)$ and $\leq_{(2)}$ by Cauchy-Schwarz.
We now focus on the first term within the first inner integral of (ref). First note that
\begin{align}
&\{t>s^2\}\big[\tfrac{s^2}{t}\big]^{k-1}
\tfrac{
f_{G_1}(y,t)
}{
f_{G_1}(y,s^2)
}
\nonumber\\
=&
\{t>s^2\}\big[\tfrac{s^2}{t}\big]^{k-1}
\tfrac{
\int \sigma^{-1}\phi(\tfrac{y-\mu}{\sigma}) \gamma(t|k,\theta) dG_1(\mu,\sigma)
}{
\int \sigma^{-1}\phi(\tfrac{y-\mu}{\sigma}) \gamma(s^2|k,\theta) dG_1(\mu,\sigma)
}
\nonumber\\
=&
\{t>s^2\}\big[\tfrac{s^2}{t}\big]^{k-1}
\tfrac{
\int \sigma^{-1}\phi(\tfrac{y-\mu}{\sigma}) (\Gamma(k)\theta^k)^{-1}t^{k-1}\exp(-\tfrac{t}{\theta}) dG_1(\mu,\sigma)
}{
\int \sigma^{-1}\phi(\tfrac{y-\mu}{\sigma}) (\Gamma(k)\theta^k)^{-1}(s^2)^{k-1}\exp(-\tfrac{s^2}{\theta}) dG_1(\mu,\sigma)
}
\nonumber\\
=&
\{t>s^2\}
\tfrac{
\int \sigma^{-1}\phi(\tfrac{y-\mu}{\sigma}) (\Gamma(k)\theta^k)^{-1} \exp(-\tfrac{t}{\theta}) dG_1(\mu,\sigma)
}{
\int \sigma^{-1}\phi(\tfrac{y-\mu}{\sigma}) (\Gamma(k)\theta^k)^{-1} \exp(-\tfrac{s^2}{\theta}) dG_1(\mu,\sigma)
}
\nonumber\\
\leq_{(1)}&
1
\end{align}
where $\leq_{(1)}$ follows because $\exp(-\tfrac{t}{\theta})<\exp(-\tfrac{s^2}{\theta})$ for all $t>s^2$. The same reasoning gives
\begin{equation}
\{t>s^2\}\big[\tfrac{s^2}{t}\big]^{k-1}
\tfrac{
f_{G_0}(y,t)
}{
f_{G_0}(y,s^2)
}
\leq 1.
\end{equation}
Now plugging (ref) and (ref) into (ref)
gives an upper bound on (ref) as
\begin{align}
&\int_{\mathcal{R}}
\left\{
\int_{s^2}^\infty
\big[ \tfrac{s^2}{t} \big]^{k-1} 2
dt
\cdot
\int_{s^2}^\infty
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt
\right\}
d(y,s^2)
\nonumber\\
\leq&
\int_{s\leq\bar{s}_n} \int_{|y|\leq\bar{y}_n}
\left\{
\tfrac{2}{k-2}s^2
\cdot
\int_{\mathbb{R}_+}
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt
\right\}
dyds^2
\nonumber\\
=&
\tfrac{2}{k-2}
\int_{s\leq\bar{s}_n}
s^2
ds^2
\cdot
\int_{|y|\leq\bar{y}_n}
\int_{\mathbb{R}_+}
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dtdy
\nonumber\\
=&
\tfrac{1}{k-2}
\bar{s}_n^4
\cdot
\int_{|y|\leq\bar{y}_n}
\int_{\mathbb{R}_+}
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dtdy
\nonumber\\
\leq &
\tfrac{1}{k-2}
\bar{s}_n^4
\cdot d^2\big(f_{G_1},f_{G_0}\big)
\end{align}
and the last inequality follows by Lemma (ref).
theoremWe have
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)}
[\hat{\sigma}(y,s|G_1,\rho_n) - \hat{\sigma}(y,s |G_0,\rho_n)]^2 \mathcal{R}
\nonumber\\
\leq&
\left\{
\bar{\sigma}_{G_1}^2 +
\bar{\sigma}_{G_0}^2
\right\}
\cdot 2d^2\big(f_{G_1},f_{G_0}\big)
+
C \left[\bar{s}_n^2 \log n + \bar{s}_n^4 \right] \left[\tfrac{1}{n} + d^2\big(f_{G_1},f_{G_0}\big)\right]
\end{align}
where $C$ is a universal constant.
proofFollowing through the arguments as in (ref) to (ref) gives us
\begin{align}
&\mathbb{E}_{G_0}^{(y,s)}
[\hat{\sigma}(y,s|G_1,\rho_n) - \hat{\sigma}^2(y,s |G_0,\rho_n)]^2 \mathcal{R}
\nonumber\\
\leq&
\left\{
\bar{\sigma}_{G_1}^2 +
\bar{\sigma}_{G_0}^2
\right\}
\cdot 2d^2\big(f_{G_1},f_{G_0}\big)
\nonumber\\
+&
4k^2
\mathbb{E}_{G_0}^{(y,s)}
\left(
w^*
\int_{s^2}^\infty
\tfrac{1}{\sqrt{k(t-s^2)}}
\left[\tfrac{s^2}{t}\right]^{k-1}
\left[f_{G_1}(y,t) - f_{G_0}(y,t)\right] dt
\right)^2 \mathcal{R}
\end{align}
And further following the arguments in (ref) to (ref) gives us
\begin{align}
&
\mathbb{E}_{G_0}^{(y,s)}
\left(
w^*
\int_{s^2}^\infty
\left[\tfrac{1}{(t-s^2)^{1/2}}\right]
\left[\tfrac{s^2}{t}\right]^{k-1}
\left[f_{G_1}(y,t) - f_{G_0}(y,t)\right] dt
\right)^2 \mathcal{R}
\nonumber\\
\leq&
\int_{\mathcal{R}}
\bigg\{
\int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\gamma_n}} \cdot
\big[\tfrac{s^2}{t}\big]^{k-1}\cdot \big[\tfrac{s^2}{t}\big]^{k-1}
\left[
\tfrac{
f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n
}{
f_{G_1}(y,s^2)\vee\rho_n + f_{G_0}(y,s^2)\vee\rho_n
}
\right]
dt
\nonumber\\
&\,\qquad \cdot
\int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt
\bigg\}
d(y,s^2)
\nonumber\\
\leq&
\int_{ \mathcal{R}}
\bigg\{
\int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\gamma_n}} \cdot
\big[\tfrac{s^2}{t}\big]^{k-1}
dt
\cdot
\int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt
\bigg\}
d(y,s^2)
\nonumber\\
=&
\int_{ s\leq\bar{s}_n}
\bigg\{
\int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\gamma_n}} \cdot
\big[\tfrac{s^2}{t}\big]^{k-1}
dt
\cdot
\int_{|y|\leq\bar{y}_n}
\int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt dy
\bigg\}
ds^2
\end{align}
for $\gamma_n:=\frac{1}{2}-\frac{1}{\log n}$.
We bound the first (inner) term on the RHS of the final equality (ref) as follows:
\begin{align}
\int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\gamma_n}} \cdot
\big[\tfrac{s^2}{t}\big]^{k-1}
dt
\leq&
\int_{s^2}^{s^2+l_n}
\tfrac{1}{(t-s^2)^{2\gamma_n}}
dt +
\tfrac{1}{l_n^{2\gamma_n}}
\int_{s^2+l_n}^\infty
\big[\tfrac{s^2}{t}\big]^{k-1}
dt
\nonumber\\
=&
\tfrac{ l_n^{1-2\gamma_n} }{ 1-2\gamma_n }
+
\tfrac{1}{l_n^{2\gamma_n}}
\tfrac{1}{k-2} (s^2+l_n) \left[\tfrac{s^2}{s^2+l_n}\right]^{k-1}
\nonumber\\
\leq&
\tfrac{1}{l_n^{2\gamma_n}}
\left[\tfrac{l_n}{1-2\gamma_n} + \tfrac{1}{k-2}(s^2+l_n)\right]
\nonumber\\
=&
\tfrac{1}{l_n^{2\gamma_n}}
\left[l_n \tfrac{1}{2}\log n + \tfrac{1}{k-2}(s^2+l_n)\right]
\nonumber\\
\leq_{(1)}&
l_n^{\tfrac{1}{\log n}} \left[ \tfrac{1}{2}\log n + \tfrac{1}{k-2}(s^2+1) \right]
\nonumber\\
\leq_{(2)}&
C\left[\log n + s^2 \right]
\end{align}
where $l_n \uparrow\infty$ is some sub-polynomial sequence\footnote{A sub-polynomial sequence $l_n$ is one that satisfies $l_n = o(n^{\epsilon})$ for every $\epsilon>0$.}, and $\leq_{(1)}$ follows from substituting in the definition of $\gamma_n$, and $\leq_{(2)}$ follows from $l_n^{\frac{2}{\log n}} \downarrow 0$.
We bound the second (inner) term on the RHS of the final equality (ref) as follows:
\begin{align}
&\int_{y\leq\bar{y}_n} \int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt dy
\nonumber\\
\leq_{(1)}&
2
\int_{\mathbb{R}} \int_{ [s^2,s^2+\delta_n] \cup [s^2+\delta_n,\infty] }
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\left[
f_{G_1}^{1/2}(y,t) - f_{G_0}^{1/2}(y,t)
\right]^2
dt dy
\end{align}
where $\delta_n := \tfrac{1}{n}\downarrow0$, and $\leq_{(1)}$ follows like in the proof of Lemma (ref).
Now for the integration over $[s^2,s^2+\delta_n]$, we have
\begin{align}
&\int_{ [s^2,s^2+\delta_n] }
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\int_{\mathbb{R}} \left[
f_{G_1}^{1/2}(y,t) - f_{G_0}^{1/2}(y,t)
\right]^2
dy dt
\nonumber\\
\leq&
2 \int_{ [s^2,s^2+\delta_n] }
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\int_{\mathbb{R}} \left[
f_{G_1}(y,t) + f_{G_0}(y,t)
\right]
dy dt
\nonumber\\
\leq&
2 \sup_{t>0}| f_{G_1}(t) + f_{G_0}(t) | \cdot
\int_{ [s^2,s^2+\delta_n] } \tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} dt
\nonumber\\
\leq_{(1)}&
C \cdot \tfrac{\delta_n^{2\gamma_n}}{2\gamma_n}
\end{align}
and $\leq_{(1)}$ follows by Lemma (ref),
whereas for the integration over $[s^2+\delta_n,\infty]$ we have
\begin{align}
&\int_{ [s^2+\delta_n,\infty] }
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\int_{\mathbb{R}} \left[
f_{G_1}^{1/2}(y,t) - f_{G_0}^{1/2}(y,t)
\right]^2
dy dt
\nonumber\\
\leq&
\tfrac{1}{\delta_n^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\int_{ [s^2+\delta_n,\infty] }
\int_{\mathbb{R}}
\left[
f_{G_1}^{1/2}(y,t) - f_{G_0}^{1/2}(y,t)
\right]^2
dy dt
\nonumber\\
\leq&
\tfrac{1}{\delta_n^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
d^2\big(f_{G_1},f_{G_0}\big).
\end{align}
By substituting (ref) and (ref) into
(ref), together with substituting in the definitions of $\gamma_n$ and $\delta_n$ we get
\begin{align}
&\int_{y\leq\bar{y}_n} \int_{s^2}^\infty
\tfrac{1}{(t-s^2)^{2\left(\frac{1}{2}-\gamma_n\right)}} \cdot
\left[
\tfrac{
f_{G_1}(y,t) - f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dt dy
\nonumber\\
\leq&
C \left[
n^{\frac{2}{\log n}} \cdot \tfrac{1}{n}
+ n^{-\frac{2}{\log n}}\cdot d^2\big(f_{G_1},f_{G_0}\big)
\right].
\end{align}
Note that $n^{\frac{2}{\log n}}$ is a constant.
Therefore, combining (ref), (ref), (ref), and (ref) we get
\begin{align}
&\mathbb{E}^{(y,s)}
[\hat{\sigma}(y,s|G_1,\rho_n) - \hat{\sigma}(y,s |G_0,\rho_n)]^2 \mathcal{R}
\nonumber\\
\leq&
\left\{
\bar{\sigma}_{G_1}^2 +
\bar{\sigma}_{G_0}^2
\right\}
\cdot 2d^2\big(f_{G_1},f_{G_0}\big)
\nonumber\\
+&
C \cdot
\left[\bar{s}_n^2 \log n + \bar{s}_n^4 \right]
\cdot
\left[\tfrac{1}{n}
+ d^2\big(f_{G_1},f_{G_0}\big)
\right].
\end{align}
theoremWe have
\begin{align}
&\mathbb{E}^{(y,s)}
[\hat{\mu}(y,s|G_1,\rho_n) - \hat{\mu}^2(y,s |G_0,\rho_n)]^2 \mathcal{R}
\nonumber\\
\leq&
C\big[\bar{\mu}_{G_1}^2+\bar{\mu}_{G_0}^2 + \bar{s}_n^4\big(\tilde{L}(\rho_n)x_n^2+a_n^2\big)\big] d^2\big(f_{G_1},f_{G_0}\big)
\nonumber
\end{align}
for some universal constant $C>0$, and where
\begin{align}
x_n
:=& \bar{\mu}_{G_1} + \bar{\mu}_{G_0} + 2\bar{y}_n,
\nonumber\\
a_n
:=& \max\{\tilde{L}(\rho_n)+1, |\log d^2(f_{G_1},f_{G_0})|\}
\nonumber\\
\tilde{L}(\rho)
:=& \sqrt{-\log(2\pi \rho^2)} for 0<\rho\leq\tfrac{1}{\sqrt{2\pi}}.
\end{align}
proofFollowing through the proof of Theorem (ref) (i.e., from (ref) up to before the final inequality of (ref)), we will have
\begin{align}
&\mathbb{E}^{(y,s)}
[\hat{\mu}(y,s|G_1,\rho_n) - \hat{\mu}^2(y,s |G_0,\rho_n)]^2 \mathcal{R}
\nonumber\\
\leq&
\big(\bar{\mu}_{G_1}^2 + \bar{\mu}_{G_0}^2\big)
2d^2\big(f_{G_1},f_{G_0}\big)
\nonumber\\
+&
4\left[\tfrac{k}{J}\right]^2
\tfrac{1}{k-2}
\bar{s}_n^4
\cdot
\int_{|y|\leq\bar{y}_n}
\int_{\mathbb{R}_+}
\left[
\tfrac{
\tfrac{\partial}{\partial y}f_{G_1}(y,t) - \tfrac{\partial}{\partial y}f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dtdy
\end{align}
where by Lemma (ref) we have
\begin{align}
\int_{|y|\leq\bar{y}_n}
\int_{\mathbb{R}_+}
\left[
\tfrac{
\tfrac{\partial}{\partial y}f_{G_1}(y,t) - \tfrac{\partial}{\partial y}f_{G_0}(y,t)
}{(f_{G_1}(y,t)\vee\rho_n + f_{G_0}(y,t)\vee\rho_n)^{1/2}}
\right]^2
dtdy
\leq
C \left[\tilde{L}(\rho_n)x_n^2 + a_n^2 \right] d^2(f_{G_1},f_{G_0}).
\end{align}
and therefore
\begin{align}
&\mathbb{E}^{(y,s)}
[\hat{\mu}(y,s|G_1,\rho_n) - \hat{\mu}^2(y,s |G_0,\rho_n)]^2 \mathcal{R}
\nonumber\\
\leq&
C\big[\bar{\mu}_{G_1}^2+\bar{\mu}_{G_0}^2 + \bar{s}_n^4\big(\tilde{L}(\rho_n)x_n^2+a_n^2\big)\big] d^2\big(f_{G_1},f_{G_0}\big).
\end{align}
lemma\begin{equation}
\int
\left[
f_{G_1}(y,s^2) - f_{G_0}(y,s^2)
\right]^2 w^*
d(y,s^2)
\leq 2d^2(f_{G_1},f_{G_0})
\nonumber
\end{equation}
where $w^*$ is defined as in (ref).
proof\begin{align}
&\int
\left[
f_{G_1}(y,s^2) - f_{G_0}(y,s^2)
\right]^2 w^*
d(y,s^2)
\nonumber\\
=_{(1)}&
\int
\left[
f_{G_1}^{1/2}(y,s^2) - f_{G_0}^{1/2}(y,s^2)
\right]^2
\cdot
\left[
f_{G_1}^{1/2}(y,s^2) + f_{G_0}^{1/2}(y,s^2)
\right]^2
w^*
d(y,s^2)
\nonumber\\
\leq_{(1)}&
2\int
\left[
f_{G_1}^{1/2}(y,s^2) - f_{G_0}^{1/2}(y,s^2)
\right]^2
d(y,s^2)
\nonumber\\
=&
2d^2(f_{G_1},f_{G_0})
\end{align}
where $=_{(1)}$ follows by the identity $x^2-y^2 = (x-y)(x+y)$, and $\leq_{(2)}$ follows because
$[f_{G_1}^{1/2}(y,s^2) + f_{G_0}^{1/2}(y,s^2)]^2 w^* \leq 2$.
The following lemma (and Lemma (ref)) is an extension of Lemma 1 of Jiang2009 from a univariate to a bivariate density of sufficient statistics, which is relevant for our framework of unknown heteroskedasticity.
lemma\begin{align}
&\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+}
\left[
\tfrac{\partial}{\partial y}f_{G_1}(y,s^2) - \tfrac{\partial}{\partial y}f_{G_0}(y,s^2)
\right]^2 w^*
d(y,s^2)
\nonumber\\
\leq&
C\cdot d^2(f_{G_1},f_{G_0})
\left[ \tilde{L}^2(\rho_n)x_n^2 + a^2 \right]
\nonumber
\end{align}
for $a^2:=\max\{\tilde{L}^2(\rho_n)+1,|\log d^2(f_{G_1},f_{G_0})| \}$ and $x_n:=\left[ \bar{\mu}_{G_1} + \bar{\mu}_{G_0} + 2|y| \right] $.
proofWe abbreviate the densities $f_{G_0}(y,s^2)$ and $f_{G_1}(y,s^2)$ as $f_{G_0}$ and $f_{G_1}$ respectively for notational compactness.
Let $D^l(\cdot)$ denote the derivative with respect to $y$; e.g., $D^lf_{G_0} := \tfrac{\partial^l}{\partial y^l} f_{G_0}(y,s^2)$.
First define
\begin{equation}
\triangle_l :=
\left(\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+} \left[D^l (f_{G_1}-f_{G_0})\right]^2 w^* d(y,s^2)\right)^{1/2}
\end{equation}
and note that integration by parts (with respect to the argument $y$) gives
\begin{align}
&\triangle_l^2
\nonumber\\
=&
\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+} D^l (f_{G_1}-f_{G_0})w^* \cdot D^l (f_{G_1}-f_{G_0}) dy ds^2
\nonumber\\
=&
0 -
\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+} D^{l-1} (f_{G_1}-f_{G_0})
\left\{
D^{l+1}(f_{G_1}-f_{G_0})w^* + [D^l(f_{G_1}-f_{G_0})][Dw^*]
\right\} dy ds^2
\nonumber\\
\leq&
\bigg|
\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+} D^{l-1} (f_{G_1}-f_{G_0}) w^{*1/2} \cdot
D^{l+1}(f_{G_1}-f_{G_0})w^{*1/2} dyds^2
\bigg|
\nonumber\\
+&
\bigg|
\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+} D^{l-1} (f_{G_1}-f_{G_0}) \cdot
D^{l}(f_{G_1}-f_{G_0})Dw^* dyds^2
\bigg|
\nonumber\\
\leq_{(1)}&
\triangle_{l-1}\triangle_{l+1}
\nonumber\\
+&
\left(
\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+} \left\{
D^{l-1} (f_{G_1}-f_{G_0})
\right\}^2 |Dw^*| dyds^2
\right)^{1/2}
\nonumber\\
&\cdot
\left(
\int_{\{|y|\leq\bar{y}_n\}\times\mathbb{R}_+} \left\{
D^{l} (f_{G_1}-f_{G_0})
\right\}^2 |Dw^*| dyds^2
\right)^{1/2}
\end{align}
where $\leq_{(1)}$ follows by Cauchy-Schwarz. Now (let $f_{G_0'}$ denote the derivative of $f_{G_0}$ with respect to $y$)
\begin{align}
| Dw^* |
=&
\big| \tfrac{\partial}{\partial y} \tfrac{1}{f_{G_1}\vee\rho_n + f_{G_0}\vee\rho_n} \big|
\nonumber\\
=&
\begin{cases}
0 &if \rho_n>f_{G_1} and \rho_n>f_{G_0}
\\
\big|w^* \tfrac{f'_{G_0}}{f_{G_1}\vee\rho_n + f_{G_0}\vee\rho_n} \big| &if f_{G_0}>\rho_n>f_{G_1}
\\
\big|w^* \tfrac{f'_{G_1}}{f_{G_1}\vee\rho_n + f_{G_0}\vee\rho_n} \big| &if f_{G_1}>\rho_n>f_{G_0}
\\
\big|w^* \tfrac{f'_{G_1}+f'_{G_0}}{f_{G_1}\vee\rho_n + f_{G_0}\vee\rho_n} \big| &if f_{G_1}>\rho_n and f_{G_0}>\rho_n
\end{cases}
\nonumber\\
\leq&
w^*\left[\tfrac{|f'_{G_1}|}{f_{G_1}\vee\rho_n} + \tfrac{|f'_{G_0}|}{f_{G_0}\vee\rho_n}\right]
\nonumber\\
\leq&
w^*\left[\tfrac{|f'_{G_1}|}{f_{G_1}} + \tfrac{|f'_{G_0}|}{f_{G_0}}\right]
\nonumber\\
=_{(1)}&
w^*\left[
\tfrac{J\left|\mathbb{E}_{G_1}[\mu | y,s,\sigma] - y\right| }{\sigma^2}
+
\tfrac{J\left|\mathbb{E}_{G_0}[\mu | y,s,\sigma] - y\right|}{\sigma^2}
\right]
\nonumber\\
\leq&
w^*
\tfrac{J}{\underline{\sigma}^2}\left[ \bar{\mu}_{G_1} + \bar{\mu}_{G_0} + 2|y| \right]
\end{align}
where $=_{(1)}$ follows from (ref).
Inserting (ref) into (ref) gives
\begin{equation}
\triangle_l^2
\leq
\triangle_{l-1}\triangle_{l+1}
+
\tfrac{J}{\underline{\sigma}^2}
\underbrace{\left[ \bar{\mu}_{G_1} + \bar{\mu}_{G_0} + 2|y| \right]}_{=: x_n}
\triangle_{l-1}\triangle_{l}.
\end{equation}
We now define $l_0\in\mathbb{N}$ to be the integer satisfying $l_0 < \tfrac{\tilde{L}(\rho_n)}{2} < l_0+1$, and
\begin{equation}
l^*:= \min\{l : \triangle_{l+1} \leq \tfrac{J}{\underline{\sigma}^2} x_nl_0\triangle_l \}.
\end{equation}
We split the analysis of $\triangle_1$ according to whether $l^* \leq l_0$.
When $l^*\leq l_0$, we have for every $l<l^*$ that $\triangle_{l+1}>\tfrac{J}{\underline{\sigma}^2}x_nl_0\triangle_l$, or equivalently, that $\triangle_l < \tfrac{1}{J\underline{\sigma}^{-2}x_nl_0} \triangle_{l+1}$. Inserting this final inequality into (ref) gives
\begin{equation}
\triangle_l^2 \leq \triangle_{l-1}\triangle_{l+1}[1+l_0^{-1}]
\end{equation}
and dividing throughout by $\triangle_{l}\triangle_{l-1}$ gives
\begin{equation}
\tfrac{\triangle_{l}}{\triangle_{l-1}} \leq [1+l_0^{-1}] \tfrac{\triangle_{l+1}}{\triangle_{l}}
\end{equation}
for every $l<l^*$. And thus iterating this through every $l<l^*$ gives
\begin{equation}
\tfrac{\triangle_1}{\triangle_0}
\leq
[1+l_0^{-1}] \tfrac{\triangle_2}{\triangle_1}
\leq
[1+l_0^{-1}]^{l^*-1} \tfrac{\triangle_{l^*}}{\triangle_{l^*-1}}.
\end{equation}
We now divide (ref) for $l=l^*$ by $\triangle_{l^*}\triangle_{l^*-1}$ to get
\begin{equation}
\tfrac{\triangle_{l^*}}{\triangle_{l^*-1}}
\leq
\tfrac{\triangle_{l^*+1}}{\triangle_{l^*}} + \tfrac{J}{\underline{\sigma}^2} x_n
\end{equation}
which we insert into (ref) to get
\begin{align}
\tfrac{\triangle_1}{\triangle_0}
\leq&
[1+l_0^{-1}]^{l^*-1} \left[
\tfrac{\triangle_{l^*+1}}{\triangle_{l^*}}+\tfrac{J}{\underline{\sigma}^2}x_n
\right]
\nonumber\\
\leq_{(1)}&
[1+l_0^{-1}]^{l^*-1}[l_0+1] \tfrac{J}{\underline{\sigma}^2}x_n
\nonumber\\
\leq_{(2)}&
\tfrac{1}{1+l_0^{-1}} e [1+l_0] \tfrac{J}{\underline{\sigma}^2}x_n
\nonumber\\
=&
e\cdot l_0 \cdot \tfrac{J}{\underline{\sigma}^2} x_n
\nonumber\\
\leq_{(3)}&
\tfrac{eJ}{\underline{\sigma}^2} \tfrac{\tilde{L}(\rho_n)}{2} x_n
\end{align}
where $\leq_{(1)}$ follows from definition of $l^*$ and $\leq_{(2)}$ follows\footnote{By assumption of this part of analysis -- see line before (ref).} from $l^* \leq l_0$ and $\leq_{(3)}$ follows from the definition of $l_0$. We thus have $\triangle_1^2 \leq \tfrac{(eJ)^2}{4\underline{\sigma}^4}\cdot d^2(f_{G_1},f_{G_0})\tilde{L}^2(\rho_n)x_n^2$ by Lemma (ref). This concludes the analysis under $l^*\leq l_0$.
Now when $l_0 < l^*$, we use arguments identical to the above to show that for every $l\leq l_0$,
\begin{equation}
\tfrac{\triangle_1}{\triangle_0}
\leq
[1+l_0^{-1}]^l \tfrac{\triangle_{l+1}}{\triangle_{l}}
\end{equation}
so that
\begin{equation}
\left(\tfrac{\triangle_1}{\triangle_0}\right)^{l_0+1}
\leq
\left[
\prod_{l=0}^{l_0} (1+l_0)^l \tfrac{\triangle_{l+1}}{\triangle_{l}}
\right]
\end{equation}
or
\begin{align}
\tfrac{\triangle_1}{\triangle_0}
\leq&
\left[
\prod_{l=0}^{l_0} (1+l_0)^l
\right]^{\tfrac{1}{l_0+1}}
\left[\tfrac{\triangle_{l_0+1}}{\triangle_0}\right]^{\tfrac{1}{l_0+1}}
\nonumber\\
=&
(1+l_0^{-1})^{l_0/2}
\cdot
\left[\tfrac{\triangle_{l_0+1}}{\triangle_0}\right]^{\tfrac{1}{l_0+1}}
\end{align}
where the final equality of (ref) may be directly verified.
Now since $w^*\leq (2\rho_n)^{-1}$, coupled with the fact that $a^2\geq 2(l_0+1)-1$ by definitions of $(a,l_0)$ for small enough $\rho_n$, this would allow application of Lemma (ref) to give
\begin{align}
&\triangle_{l_0+1}^2
\nonumber\\
\leq&
\tfrac{1}{2\rho_n} \cdot
\int_{|y|\leq\bar{y}_n}
\int_{\mathbb{R}_+}
\{
D^{l_0+1} (f_{G_1} - f_{G_0})
\}^2 d(y,s^2)
\nonumber\\
\leq&
\tfrac{1}{2\rho_n} \cdot C
\cdot
\left[
a^{2(l_0+1)} d^2(f_{G_1},f_{G_0}) + a^{2(l_0+1)-1}\exp(-a^2)
\right]
\nonumber\\
\leq_{(1)}&
C
\tfrac{1}{\rho_n}d^2(f_{G_1},f_{G_0})a^{2(l_0+1)}
\left[ 1 + \tfrac{1}{a} \right]
\nonumber\\
\leq_{(2)}&
C
\tfrac{1}{\rho_n\sqrt{2\pi}}d^2(f_{G_1},f_{G_0})a^{2(l_0+1)}
\end{align}
where $\leq_{(1)}$ follows by $\exp(-a^2)\leq d^2(f_{G_1},f_{G_0})$ by definition of $a$, and $\leq_{(2)}$ follows by $a\geq1$.
We then insert (ref) into (ref) to get
\begin{align}
\triangle_1
\leq&
(1+l_0^{-1})^{l_0/2} \cdot \triangle_0^{\tfrac{l_0}{l_0+1}}
\cdot
\left[
\tfrac{1}{\rho_n\sqrt{2\pi}}d^2(f_{G_1},f_{G_0})a^{2(l_0+1)} C
\right]^{\tfrac{1}{2(l_0+1)}}
\nonumber\\
\leq_{(1)}&
\sqrt{e} d(f_{G_1},f_{G_0}) a \cdot (2\pi\rho_n^2)^{-\tfrac{1}{4l_0+4}} \cdot C^{\frac{1}{2(l_0+1)}}
\nonumber\\
\leq_{(2)}&
\sqrt{e} d(f_{G_1},f_{G_0}) a \cdot \exp(\tfrac{1}{2}) \cdot C^{\frac{1}{2(l_0+1)}}
\end{align}
where $\leq_{(1)}$ follows by using Lemma (ref), and $\leq_{(2)}$ follows because
\begin{align}
-\tfrac{1}{4l_0+4}\log(2\pi\rho_n^2)
=&
\tfrac{1}{4l_0+4} \tilde{L}(\rho_n)
\nonumber\\
\leq_{(3)}&
\tfrac{1}{4l_0+4} (2l_0+2)
\nonumber\\
=&\tfrac{1}{2}
\end{align}
where $\leq_{(3)}$ follows by definition of $l_0$.
Note that $C^{\frac{1}{2(l_0+1)}}\rightarrow 1$, because $l_0\uparrow\infty$ by $\rho_n\downarrow0$.
lemmaFor all $l\in\mathbb{N}$ and $a\geq \sqrt{2l-1}$,
\begin{align}
&\int_{|y|\leq\bar{y}_n}
\int_{\mathbb{R}_+}
\{
D^l (f_{G_1} - f_{G_0})
\}^2 d(y,s^2)
\nonumber\\
\leq&
C \cdot
\left[ a^{2l} d^2(f_{G_1},f_{G_0})
+ a^{2l-1}\exp(-a^2)\right]
\end{align}
where $D^l$ represents the $l^{th}$ derivative with respect to $y$.
proofFirst define $h^*(u;s^2) := \int e^{iux} h(y,s^2) dy$ where $h(y,s^2)$ is an arbitrary integrable function. Now
\begin{align}
&| f_{G_1}^*(u;s^2) |
\nonumber\\
=&
\bigg| \int e^{iuy}
\int \tfrac{1}{\sigma/\sqrt{J}}
\phi\left(\tfrac{y-\mu}{\sigma/\sqrt{J}}\right)
\gamma(s^2 | k,\theta) dG(\mu,\sigma)
dy
\bigg|
\nonumber\\
=&
\bigg| \int
\tfrac{1}{\sigma/\sqrt{J}} \int
e^{iuy} \phi\left(\tfrac{y-\mu}{\sigma/\sqrt{J}}\right) dy \cdot
\gamma(s^2 | k,\theta) dG(\mu,\sigma)
\bigg|
\\
and &
\tfrac{1}{\sigma/\sqrt{J}} \int
e^{iuy} \phi\left(\tfrac{y-\mu}{\sigma/\sqrt{J}}\right) dy
\nonumber\\
=_{(1)}&
\int \exp\left(iu\left[\tfrac{y\sigma}{\sqrt{J}} + \mu\right]\right) \phi(y)dy
\nonumber\\
=&
\tfrac{1}{\sqrt{2\pi}} \exp(iu\mu) \int \exp\left(iu\tfrac{\sigma}{\sqrt{J}}y - \tfrac{y^2}{2}\right)dy
\nonumber\\
=_{(2)}&
\exp(iu\mu)\exp(-\tfrac{u^2}{2}).
\end{align}
where $=_{(1)}$ follows by a change of variables $\tilde{y} = \tfrac{y-\mu}{\sigma/\sqrt{J}}$, and $=_{(2)}$ follows by completing the square within the second exponential term and taking the fourier transform of the Gaussian density. Now inserting (ref) into (ref) gives us
\begin{align}
| f_{G_1}^*(u;s^2) |
=&
\bigg|
\exp(iu\mu) \exp(-\tfrac{u^2}{2}) \int \gamma(s^2 | k,\theta) dG(\mu,\sigma)
\bigg|
\nonumber\\
\leq&
|\exp(iu\mu)| \exp(-\tfrac{u^2}{2}) f_{G_1}(s^2)
\nonumber\\
\leq&
\exp(-\tfrac{u^2}{2}) f_{G_1}(s^2).
\end{align}
Therefore it follows from the Plancherel identity that
\begin{align}
&\int \{
D^l (f_{G_1} - f_{G_0})
\}^2 dy
\nonumber\\
=&
\tfrac{1}{2\pi} \int u^{2l} | f_{G_1}^*(u;s^2) - f_{G_0}^*(u;s^2) |^2 du
\nonumber\\
=&
\tfrac{1}{2\pi} \int_{ \{ |u| \leq a\} \cup \{ |u| > a \} } u^{2l} | f_{G_1}^*(u;s^2) - f_{G_0}^*(u;s^2) |^2 du
\nonumber\\
\leq_{(1)}&
\tfrac{1}{2\pi}a^{2l} \int_{\{ |u| \leq a\}}
| f_{G_1}^*(u;s^2) - f_{G_0}^*(u;s^2) |^2 du
+
\tfrac{1}{2\pi} \int_{ |u| > a } u^{2l} \exp(-u^2) [f_{G_1}(s^2) + f_{G_0}(s^2)]^2 du
\nonumber\\
\leq &
\tfrac{1}{2\pi}a^{2l} \int | f_{G_1}^*(u;s^2) - f_{G_0}^*(u;s^2) |^2 du
+
\tfrac{1}{2\pi} \int_{ |u| > a } u^{2l} \exp(-u^2) [f_{G_1}(s^2) + f_{G_0}(s^2)]^2 du
\nonumber\\
\leq_{(2)}&
a^{2l} \int | f_{G_1}(y,s^2) - f_{G_0}(y,s^2) |^2 dy
+ \tfrac{1}{2\pi} [f_{G_1}(s^2) + f_{G_0}(s^2)]^2 \cdot a^{2l-1} \exp(-a^2)
\nonumber\\
\implies
&\int \{
D^l (f_{G_1} - f_{G_0})
\}^2 d(y,s^2)
\nonumber\\
\leq&
a^{2l} \int | f_{G_1}(y,s^2) - f_{G_0}(y,s^2) |^2 d(y,s^2)
+
\tfrac{1}{2\pi} \int[f_{G_1}(s^2) + f_{G_0}(s^2)]^2ds^2 \cdot a^{2l-1} \exp(-a^2)
\nonumber\\
\leq_{(3)}&
a^{2l} \int \left[f_{G_1}^{1/2}(y,s^2) + f_{G_0}^{1/2}(y,s^2)\right]^2 d(y,s^2) \cdot d^2(f_{G_1},f_{G_0})
\nonumber\\
+& \tfrac{1}{2\pi} \int[f_{G_1}(s^2) + f_{G_0}(s^2)]^2ds^2 \cdot a^{2l-1} \exp(-a^2)
\nonumber\\
\leq_{(4)}&
C \cdot \left[ a^{2l} d^2(f_{G_1},f_{G_0}) + a^{2l-1}\exp(-a^2) \right]
\end{align}
where $\leq_{(1)}$ follows from (ref), and $\leq_{(2)}$ follows from the calculus inequality for $a\geq\sqrt{2l-1}$ (see JZ proof)
\begin{equation}
\int_{\{|u| > a\}} u^{2l} \exp(-u^2)du \leq a^{2a-1}\exp(-a^2).
\end{equation}
and $\leq_{(3)}$ follows from the identity $x^2-y^2=(x+y)(x-y)$ then applying Cauchy-Schwarz. Finally, $\leq_{(4)}$ follows from Lemma (ref), and that both $f_{G}(y,s^2)$ and $f_{G}(s^2)$ integrate to 1 for $G=G_0$ or $G_1$.
MSEs over region $\mathcal{R}^c$
Recall that the indicator function $\mathcal{R}$ is defined as in (ref), with $\mathcal{R}^c$ being its complement.
lemma[Bounding over $\mathcal{R}^c$]
\begin{align}
\mathbb{E}_{G_0}^{\mathcal{Y}_1}
\left\{\big[
\hat{\sigma}^2(y_1,s_1 | \hat{G}^{(1)},\rho)
-
\hat{\sigma}^2(y_1,s_1 | G_0,\rho)
\big]^2 \mathcal{R}^c\right\}
\leq&
\big[\bar{\sigma}_{\hat{G}^{(1)}}^4 + \bar{\sigma}_{G_0}^4 ] \cdot
o(n^{-1}) ,
\nonumber\\
and
\mathbb{E}_{G_0}^{\mathcal{Y}_1}
\left\{\big[
\hat{\sigma}(y_1,s_1 | \hat{G}^{(1)},\rho)
-
\hat{\sigma}(y_1,s_1 | G_0,\rho)
\big]^2 \mathcal{R}^c\right\}
\leq&
\big[\bar{\sigma}_{\hat{G}^{(1)}}^2 + \bar{\sigma}_{G_0}^2 ] \cdot
o(n^{-1}) ,
\nonumber\\
and
\mathbb{E}_{G_0}^{\mathcal{Y}_1}
\left\{\big[
\hat{\mu}(y_1,s_1 | \hat{G}^{(1)},\rho)
-
\hat{\mu}(y_1,s_1 | G_0,\rho)
\big]^2 \mathcal{R}^c\right\}
\leq&
\big[\bar{\mu}_{\hat{G}^{(1)}}^2 + \bar{\sigma}_{G_0}^2 ] \cdot
o(n^{-1}) .
\nonumber
\end{align}
proofObserve that
$
\mathcal{R}^c \leq \{ |y_1| > \bar{y}_n \} + \{s_1 > \bar{s}_n\},
$
and thus by Lemma (ref), we have
$
\mathbb{E}_{G_0}^{\mathcal{Y}_1}
\mathcal{R}^c
=
o(n^{-1}).
$
For example,
\begin{align}
\mathbb{E}_{G_0}^{\mathcal{Y}_1}\{ |y_1| > \bar{y}_n \} =&
\int \int_{\{|y| > \bar{y}_n\}} f_{G_0}(y \mid s^2) dy f_{G_0}(s^2) ds^2
\nonumber\\
=&
\int \int
\int_{\{|y| > \bar{y}_n\}} \tfrac{1}{\sigma}\phi\left(\tfrac{y-\mu}{\sigma}\right) dy dG_0(\mu,\sigma) f_{G_0}(s^2) ds^2
\nonumber\\
=_{(1)}&
o(n^{-1}) \int \int dG_0(\mu,\sigma) f_{G_0}(s^2) ds^2
\nonumber\\
=&
o(n^{-1})
\end{align}
where $=_{(1)}$ is a consequence of Lemma (ref).
Auxiliary Lemmas
lemma[Convergence rates for integrals]
Let $\theta:=\sigma^2/k$. For $\mu\leq\bar{\mu}_{G_0}$ and $\sigma\leq\bar{\sigma}_{G_0}$,
\begin{equation}
\begin{aligned}[b]
\int_{|y| > \bar{y}_n } \phi(y | \mu,\sigma) dy
=& o\big(n^{-1}\big)
\nonumber\\
\int_{s > \bar{s}_n } \gamma(s^2 | k,\theta) ds
&= o\big(n^{-1}\big)
\nonumber
\end{aligned}
\end{equation}
where $\bar{y}_n$ and $\bar{s}_n$ are defined as in (ref).
proofFor the first statement of (ref),
\begin{equation}
\begin{aligned}[b]
\phi(y\mid\mu,\sigma)
&=
\tfrac{1}{\sqrt{2\pi}\sigma} \exp \left(-0.5\left(\tfrac{y-\mu}{\sigma}\right)^2\right)
\nonumber\\
&\leq_{(1)}
\tfrac{1}{\sqrt{2\pi}\bar{\sigma}_{G_0}} \exp\left(-0.5 \log n^2\right)
\nonumber\\
&=
\tfrac{1}{\sqrt{2\pi}\bar{\sigma}_{G_0}} n^{-1}
\nonumber\\
&=o(n^{-1})
\end{aligned}
\end{equation}
where $\leq_{(1)}$ follows because for our selection of $\bar{y}_n$, the function $\tfrac{1}{\sigma}\phi\big(\tfrac{y-\mu}{\sigma}\big)$ is maximized by $\sigma$ being as large as possible.
An application of dominated convergence then yields the desired result of (ref).
For the second statement of (ref), we first note that there exists a large enough $\bar{x}$ such that the function $x^k\exp(-x)$ is strictly decreasing in $x$ for $x>\bar{x}$. Now recall that $\theta:=\sigma^2/k$, and so
\begin{equation}
\begin{aligned}[b]
\gamma(s^2\mid k,\theta)
= &
\tfrac{1}{\Gamma(k)\theta^k}[s^2]^{k-1}\exp\left(-\tfrac{s^2}{\theta}\right)
\nonumber\\
= &
\tfrac{1}{\Gamma(k)}
\tfrac{1}{s^2}
\cdot
\left[\tfrac{s^2}{\theta}\right]^k \exp\left(-\tfrac{s^2}{\theta}\right)
\nonumber\\
\leq &
\tfrac{1}{\Gamma(k)}
\tfrac{1}{\bar{s}_n^2}
\cdot
\log^{k}(n) \cdot \exp(-\log n^2)
\nonumber\\
=&
\tfrac{k}{\Gamma(k)} \tfrac{1}{\bar{\sigma}_{G_0}^2} \log^{k-1}(n) \cdot n^{-2}
\\
=&
o\left(n^{-1}\right).
\end{aligned}
\end{equation}
lemma[Bounded densities]
Let $\theta:=\sigma^2/k$, and suppose that $\sigma\geq\underline{\sigma}$. Then
\begin{align}
\phi(y | \mu,\sigma) \leq& \tfrac{1}{\sqrt{2\pi} \sigma^2 } \nonumber\\
\gamma(s^2\mid k,\theta) \leq& \tfrac{k(k-1)^{k-1}}{\Gamma(k)} \tfrac{1}{\sigma^2}.
\nonumber
\end{align}
proofFor the first statement, $\phi(y | \mu_,\sigma) \leq \tfrac{1}{\sqrt{2\pi} \underline{\sigma}^2 }$ is immediate.
For the second statement, note that the gamma density $\gamma(s^2 \mid k,\theta)$ attains a maximum (over $s^2$) of
\begin{equation}
\begin{aligned}[b]
\tfrac{1}{\Gamma(k)\theta^k} [(k-1)\theta]^{k-1} \exp\left(-(k-1)\right)
\leq&
\tfrac{k(k-1)^{k-1}}{\Gamma(k)} \tfrac{1}{\sigma^2}.
\end{aligned}
\end{equation}
NPMLE density estimation
This section provides adaptations of results in Ghosal2001 on maximum likelihood estimation of normal mixtures to accommodate our setting\footnote{That is, to accommodate bivariate distributions on $(\mu,\sigma)$ with possibly growing supports for both $\mu$ and $\sigma$ and also multiple observations per unit.}. In this regard, Lemmas (ref), (ref)+(ref) and (ref) are extensions of Lemma 3.4, Theorem 3.3 and Theorem 4.1 of Ghosal2001 respectively.
\noindentNotations.
The notation $G(A \times B)$ for a bivariate distribution $G$ and sets $A,B\subset\mathbb{R}$ denotes the probability that $G$ places on the event $(\mu\in A,\sigma\in B)$.
The notation $X\lesssim Y$ means that there exists a constant $C$, possibly dependent on $(\gamma_1,\gamma_2,\underline{\sigma},L)$ but independent of $\epsilon$, such that $X \leq C Y $. Furthermore, all (generic) constants $C$ defined are also possibly dependent on $(\gamma_1,\gamma_2,\underline{\sigma},L)$ but independent of $\epsilon$.
Let $\vee_i x_i$ denote the maximum of $\{x_i\}_{i\in[k]}$.
Let $|| \cdot ||_{\infty}$ denote the sup-norm and for two densities $f$ and $f'$, let $d(f,f')$ denotes their Hellinger distance.
Let $N_{[\,]}(\epsilon,\mathcal{F},m)$ and $N(\epsilon,\mathcal{F},m)$ denote the $\epsilon$-bracketing and $\epsilon$-covering numbers respectively for the set $\mathcal{F}$ under metric $m$ (see, e.g., Ghosal2001 for precise definitions).
First introduce the following definition
equation[equation omitted — 277 chars of source]
where $(\gamma_1,\gamma_2,\underline{\sigma},L)>0$ are taken to be constants throughout our analysis.
Let $x\in\mathbb{R}^k$ and define
equation[equation omitted — 118 chars of source]
for $G\in \mathcal{G}(\epsilon)$ and $k$ is also a constant throughout our analysis. Finally let
equation[equation omitted — 75 chars of source]
lemmaSuppose $p_{0,n}\in\mathcal{F}(n^{-1})$. Define
\begin{equation}
\varepsilon_n := n^{-1/2} (\log n)^{2\left[\gamma_1\vee\frac{1}{2} + \gamma_2\right] + \frac{1}{2}}.
\end{equation}
Let $\hat{p}_n \in\mathcal{F}(n^{-1})$ satisfy
\begin{equation}
n^{-1}\sum_{i=1}^n \hat{p}_n(X_i) \geq
\sup_{p\in\mathcal{F}(n^{-1})}
n^{-1}\sum_{i=1}^n p(X_i)
-
\tfrac{1}{24} \varepsilon_n^2.
\end{equation}
Then there exist positive constants\footnote{See e.g., final remark of Section 3 of Wong1995 for choice of constants.} $(c_1,c_2)$ such that
\begin{equation}
\mathbb{P}\left\{
d(\hat{p}_n,p_{0,n}) > c_1 \varepsilon_n
\right\}
\lesssim
\exp\big(-c_2 (\log n)^3\big).
\end{equation}
proofBy Lemma (ref), we have that
\begin{equation}
\log N_{[\,]}\big(\varepsilon_n,\mathcal{F}(n^{-1}),d\big)
\lesssim
\big(\log\tfrac{1}{\varepsilon_n}\big)^{4\big[\gamma_1\vee\frac{1}{2}+\gamma_2\big]+1}.
\end{equation}
Then
\begin{align}
&\int_0^{\varepsilon_n} \sqrt{\log N_{[\,]}\big(u,\mathcal{F}(n^{-1}),d\big) } du
\nonumber\\
\lesssim&
\big( \log \sqrt{n} - \big[2\big(\gamma_1\vee\tfrac{1}{2}+\gamma_2\big)+\tfrac{1}{2}\big]\log\log n \big)^{2\big[\gamma_1\vee\tfrac{1}{2}+\gamma_2\big]+\tfrac{1}{2}}
\cdot \varepsilon_n
\nonumber\\
=&
\frac{
\left(
\tfrac{1}{2}\log n - \big[2\big(\gamma_1\vee\frac{1}{2}+\gamma_2\big)+\frac{1}{2}\big]\log\log n
\right)^{2\big[\gamma_1\vee\frac{1}{2}+\gamma_2\big]+\frac{1}{2}}
}{
\big(\log n\big)^{2\big[\gamma_1\vee\frac{1}{2}+\gamma_2\big]+\frac{1}{2}}
}
\cdot \sqrt{n} \varepsilon_n^2
\nonumber\\
\lesssim&
\sqrt{n} \varepsilon_n^2.
\end{align}
Thus by Theorem 2 of Wong1995, there exists positive constants $(c_1,c_2)$ such that
\begin{align}
\mathbb{P}\left\{
d(\hat{p}_n,p_{0,n} > c_1 \varepsilon_n)
\right\}
\leq&
4\exp\big(-c_2 n\varepsilon_n^2\big)
\nonumber\\
=&
4\exp \left(-c_2 \big[\log n\big]^{4\big[\gamma_1\vee\frac{1}{2}+\gamma_2\big]+1} \right)
\nonumber\\
\lesssim&
\exp\big(-c_2 (\log n)^3\big).
\end{align}
lemmaLet $\gamma_1 \geq 1/2$, $\gamma_2 \geq 0 $. We have
\begin{equation}
\log N_{[\,]}(\epsilon , \mathcal{F}(\epsilon),d)
\lesssim
\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2]+1}.
\end{equation}
proofAgain let
$\bar{\mu}:= L(\log \frac{1}{\epsilon})^{\gamma_1}$ and $\bar{\sigma} := L (\log \frac{1}{\epsilon})^{\gamma_2}$,
and $\eta$ satisfying
$\eta\leq\epsilon$ be a positive constant to be chosen later.
Let $f_1,\dots,f_N$ be an $\eta$-net for $\mathcal{F}(\epsilon)$ with the $||\cdot||_\infty$ norm, where $N$ is again a positive constant to be chosen later.
Define
\begin{equation}
E(x_j) :=
\{x_j\leq 2\bar{\mu}\} \tfrac{1}{\sigma}\phi(0)
+
\{x_j > 2\bar{\mu}\} \tfrac{1}{\sigma} \phi\big(\tfrac{x_j}{2\bar{\sigma}}\big)
\end{equation}
and note that $\textstyle\prod_{j=1}^k E(x_j)$ is an envelope for $\mathcal{F}(\epsilon)$,
because we have that for every $| \mu | \leq \bar{\mu} $ and $\underline{\sigma}\leq\sigma\leq\bar{\sigma}$,
\begin{equation}
\{x_j\leq 2\bar{\mu}\}
\left[
\tfrac{1}{\sigma}\phi(0) - \tfrac{1}{\sigma} \phi\big(\tfrac{x_j-\mu}{\sigma}\big)
\right]
+
\{x_j > 2\bar{\mu}\}
\left[
\tfrac{1}{\sigma} \phi\big(\tfrac{x_j}{2\bar{\sigma}}\big) - \tfrac{1}{\sigma} \phi\big(\tfrac{x_j-\mu}{\sigma}\big)
\right]
\geq 0
\end{equation}
for every $j=1,\dots,k$.
Now define $l_i := \max(f_i-\eta,0)$ and $u_i:=\min\big(f_i+\eta,\textstyle\prod_j E(x_j)\big)$, and note that we have\footnote{Here $[l_i,u_i]$ represents the set of all functions $f:\mathbb{R}^k\mapsto\mathbb{R}$ such that $l_i(x)\leq f(x) \leq u_i(x)$ for all $x$.} $\mathcal{F}(\epsilon) \subset \cup_{i=1}^N [l_i,u_i]$, because if\footnote{Here $B(\eta,f_i,||\cdot||_\infty)$ represents the set of all $p\in\mathcal{F}(\epsilon)$ satisfying $||f_i - p||_\infty<\eta$.} $p \in B(\eta,f_i,||\cdot||_\infty)$, then
\begin{align}
&|| f_i - p ||_\infty < \eta
\nonumber\\
\implies &l_i(x) \leq p(x) \leq u_i(x)
\nonumber\\
\implies &p(x) \in [l_i,u_i].
\end{align}
Now $u_i - l_i \leq \min\big(2\eta,\textstyle\prod_j E(x_j)\big)$, and therefore for any $B>0$, we have
\begin{equation}
\int u_i(x)-l_i(x) dx
\leq
\int \prod_{j=1}^{k} \left[ \{x_j\leq B\} + \{x_j > B\} \right] \min(2\eta,\textstyle\prod_j E(x_j))
dx.
\end{equation}
We choose $B:=\max\big(2L,\sqrt{8}\bar{\sigma}\big[\log\tfrac{1}{\eta}\big]^{\gamma_1}\big)$ and
now study each term that results from the product expansion within the integral. The term
\begin{equation}
\int \prod_{j=1}^{k} \{x_j\leq B\} \min(2\eta,\textstyle\prod_j E(x_j))
dx
\leq
2\eta B^k
\end{equation}
is the term of the leading order since for any arbitrary set $S\subset\{1,\dots,k\}$,
\begin{align}
&\int \prod_{j\in S} \{x_j\leq B\} \prod_{j\in S^c} \{x_j > B\} \min\big(2\eta,\textstyle\prod_jE(x)\big)
dx
\nonumber\\
\leq&
B^{ |S| } \cdot \big[\tfrac{1}{\sigma}\phi(0)\big]^{ |S| }
\cdot \prod_{j\notin S} \int_{x_j>B} E(x_j) dx_j
\nonumber\\
\lesssim_{(1)}&
B^{ |S| } \prod_{j\in S^c} E(B)
\nonumber\\
\leq&
B^{ |S| } \eta^{ | S^c| }.
\end{align}
where $\lesssim_{(1)}$ follows by $B\geq2\bar{\mu}$ and the Mill's ratio. Thus by returning to the integral (ref) we have
\begin{equation}
\int u_i(x)-l_i(x) dx
\lesssim \eta B^k
\lesssim \eta [\log\tfrac{1}{\eta}]^{k[\gamma_1+\gamma_2]}
\end{equation}
and therefore
\begin{equation}
N_{[\,]} \big(C\eta [\log\tfrac{1}{\eta}]^{k[\gamma_1+\gamma_2]}, \mathcal{F}(\epsilon),||\cdot||_1\big)
\leq N
\end{equation}
for some constant $C$.
By Lemma (ref), we can choose $N\lesssim \big(\log\tfrac{1}{\eta}\big)^{4[\gamma_1+\gamma_2]+1}$, and we then choose $\eta$ to satisfy the equation
\begin{equation}
C \eta [\log\tfrac{1}{\eta}]^{k[\gamma_1+\gamma_2]} = \epsilon.
\end{equation}
Note that $\log \tfrac{1}{\eta} \sim \log \tfrac{1}{\epsilon}$, so that we have
\begin{equation}
N_{[\,]} \big(\epsilon, \mathcal{F}(\epsilon),||\cdot||_1\big)
\lesssim
\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2]+1}.
\end{equation}
By the inequality $d^2(f,g) \leq ||f-g||_1$, we have
\begin{equation}
N_{[\,]} \big(\epsilon, \mathcal{F}(\epsilon), d \big)
\leq
N_{[\,]} \big(\epsilon^2, \mathcal{F}(\epsilon),||\cdot||_1\big)
\lesssim
\big(\log\tfrac{1}{\epsilon^2}\big)^{4[\gamma_1+\gamma_2]+1}
\lesssim
\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2]+1}.
\end{equation}
lemmaLet $\gamma_1 \geq 1/2$, $\gamma_2 \geq 0 $. We have
\begin{equation}
\log N(\epsilon , \mathcal{F}(\epsilon) ,||\cdot||_\infty)
\lesssim
\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2]+1}
\end{equation}
proofLet $\mathcal{F}_{\text{d}}(\epsilon):= \{ p_G : G\in\mathcal{G}_{\text{d}}(\epsilon) \}$ where
\begin{equation}
\mathcal{G}_{d}(\epsilon)
:=
\big\{
G\in\mathcal{G}(\epsilon)
is discrete with at most
$N\leq C\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2]}$
support points
\big\}.
\end{equation}
By Lemma (ref), $C$ is a constant that can be chosen such that $\mathcal{F}_{\text{d}}(\epsilon)$ is an $\epsilon$-net\footnote{In the $|| \cdot ||_\infty$ norm.} over $\mathcal{F}(\epsilon)$. Thus an $\epsilon$-net over $\mathcal{F}_{\text{d}}(\epsilon)$ will be an $2\epsilon$-net\footnote{Also in the $|| \cdot ||_\infty$ norm.} over $\mathcal{F}(\epsilon)$.
Now we choose an $\epsilon$-net $\mathcal{S}$ over the $N$-dimensional simplex for the $L_1$ norm. By Lemma A.4 of Ghosal2001, this can be chosen such that $|\mathcal{S}|\leq \big(\tfrac{5}{\epsilon}\big)^N$.
We further define $\mathcal{F}_{\text{d}}'(\epsilon) := \{ p_{G} : G\in\mathcal{G}_{\text{d}}'(\epsilon)\}$ where
\begin{align}
\mathcal{G}_{d}'(\epsilon)
:=
\big\{
&G\in\mathcal{G}_{d}(\epsilon)
with $N$ support points of the form
(\pm\eta_1\epsilon,\underline{\sigma}+\eta_2\epsilon)
\nonumber\\
& \text{where $\eta_1,\eta_2=0,1,\dots,$ with its weights coming from $\mathcal{S}$}
\big\}.
\end{align}
Clearly we have $\mathcal{F}_{\text{d}}'(\epsilon)\subset \mathcal{F}_{\text{d}}(\epsilon)$.
Now for each
\begin{equation}
p_{G}(x) := \textstyle\sum_{j=1}^N w_j \prod_{i=1}^{k} \tfrac{1}{\sigma_j} \phi\big(\tfrac{x_i-\mu_j}{\sigma_j}\big) \in \mathcal{F}_{\text{d}}(\epsilon),
\end{equation}
we choose the
\begin{equation}
p_{G'}(x) := \textstyle\sum_{j=1}^N w_j' \prod_{i=1}^{k} \tfrac{1}{\sigma_j'} \phi\big(\tfrac{x_i-\mu_j'}{\sigma_j'}\big) \in \mathcal{F}_{\text{d}}'(\epsilon),
\end{equation}
that is closest in the sense that
$|\mu_j-\mu_j^\prime| < \epsilon$, and $|\sigma_j - \sigma_j'| < \epsilon$, and
$\textstyle\sum_{j=1}^N |w_j - w_j'| < \epsilon$ for all $j=1,\dots,N$.
Then
\begin{align}
&\sup_x
\big|
p_G(x) - p_{G'}(x)
\big|
\nonumber\\
\leq&
\sup_x
\bigg|
\sum_j^N w_j
\bigg\{\prod_{i=1}^{k} \tfrac{1}{\sigma_j} \phi\big(\tfrac{x_i-\mu_j}{\sigma_j}\big) - \prod_{i=1}^{k} \tfrac{1}{\sigma_j} \phi\big(\tfrac{x_i-\mu_j'}{\sigma_j}\big)\bigg\}
\bigg|
\nonumber\\
+&
\sup_x
\bigg|
\sum_j^N w_j
\bigg\{\prod_{i=1}^{k} \tfrac{1}{\sigma_j} \phi\big(\tfrac{x_i-\mu_j'}{\sigma_j}\big)
- \prod_{i=1}^{k} \tfrac{1}{\sigma_j'} \phi\big(\tfrac{x_i-\mu_j'}{\sigma_j'}\big)\bigg\}
\bigg|
\nonumber\\
+&
\sup_x
\bigg|
\sum_j^N [w_j - w_j'] \prod_{i=1}^{k} \tfrac{1}{\sigma_j'} \phi\big(\tfrac{x_i-\mu_j'}{\sigma_j'}\big)
\bigg|.
\end{align}
Using the identity
\begin{equation}
\prod_{i=1}^{k} z_i - \prod_{i=1}^{k} y_i =
\sum_{i=1}^k \big(\textstyle\prod_{s=1}^{i-1}y_s\big) (z_i-y_i) \big(\textstyle\prod_{s=i+1}^{k} z_s\big)
\end{equation}
and the fact that the derivatives of $\tfrac{1}{\sigma}\phi\big(\tfrac{x}{\sigma}\big)$ with respect to $\sigma$ and $x$ are uniformly bounded for $\sigma > \underline{\sigma}$, we show that the first and second terms on the RHS of (ref) are bounded by constant multiples of $\sup_{j\leq N}|\mu_j-\mu_j'| < \epsilon$ and $\sup_{j\leq N}|\sigma_j-\sigma_j'| < \epsilon$ respectively. And again using a similar argument we can show that the final term on the RHS of (ref) is bounded by a constant multiple of $\textstyle\sum_{j=1}^N |w_j-w_j'|<\epsilon$.
Thus we have $\sup_x
\big|
p_G(x) - p_{G'}(x)
\big| \lesssim \epsilon$, which implies that $\mathcal{F}_{\text{d}}'(\epsilon)$ is a $\epsilon$-net over $\mathcal{F}_{\text{d}}(\epsilon)$, and consequently a $2\epsilon$-net over $\mathcal{F}(\epsilon)$.
Furthermore, the cardinality of $\mathcal{F}_{\text{d}}'(\epsilon)$ is
\begin{equation}
| \mathcal{F}_{\text{d}}'(\epsilon)|
\lesssim
\big( \tfrac{2\bar{\mu}}{\epsilon}\big)^N \cdot
\big( \tfrac{\bar{\sigma}-\underline{\sigma}}{\epsilon}\big)^N \cdot
\big( \tfrac{5}{\epsilon}\big)^N
=\big(10\bar{\mu}[\bar{\sigma}-\underline{\sigma}]\big)^N \epsilon^{-3N}.
\end{equation}
This implies we have for some constants $(C_1,C_2)$
\begin{align}
&\log N(C_1\epsilon , \mathcal{F}(\epsilon),||\cdot||_\infty)
\nonumber\\
\leq&
N \log\big( 10 \bar{\mu} [\bar{\sigma}-\underline{\sigma}] \big)
+ 3N \log\big(\tfrac{1}{\epsilon}\big) + C_2
\nonumber\\
\lesssim&
\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2]}
\cdot \log\big(10L^2 \log\big[\tfrac{1}{\epsilon}\big]^{\gamma_1+\gamma_2}\big)
+
\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2]} \log\big(\tfrac{1}{\epsilon}\big)
\nonumber\\
\lesssim&
\big(\log\tfrac{1}{\epsilon}\big)^{4[\gamma_1+\gamma_2] + 1}.
\end{align}
lemmaSuppose $\gamma_1\geq \frac{1}{2}$, $\gamma_2\geq 0$. For any $G\in \mathcal{G}(\epsilon)$, there exists
a discrete $G'\in\mathcal{G}(\epsilon)$
with at most $N\lesssim (\log\tfrac{1}{\epsilon})^{4[\gamma_1+\gamma_2]}$ support points such that
\begin{equation}
|| p_G - p_{G'} ||_\infty < \epsilon.
\end{equation}
proofThroughout this proof, let
$\bar{\mu}:= L (\log \frac{1}{\epsilon})^{\gamma_1}$, $\bar{\sigma}:= L (\log \frac{1}{\epsilon})^{\gamma_2}$
and
\begin{equation}
M := \max\left(\bar{\mu} + \bar{\sigma}\bar{\mu} , \sqrt{8} \bar{\sigma} (\log\tfrac{1}{\epsilon})^{1/2}\right).
\end{equation}
Note that we have
\begin{align}
\sup_{\max_i|x_i| > M}
|p_G(x) - p_{G'}(x)|
\leq_{(1)}&
2\tfrac{1}{\sigma^{k-1}} \phi^{k-1}(0)
\tfrac{1}{\bar\sigma}\phi\left(\tfrac{M-\bar{\mu}}{\bar{\sigma}}\right)
\nonumber\\
\leq_{(2)}&
2\tfrac{1}{(\sqrt{2\pi}\sigma)^{k-1}}
\tfrac{1}{\bar\sigma}\phi\left(\tfrac{M}{2\bar{\sigma}}\right)
\nonumber\\
=&
2\tfrac{1}{(\sqrt{2\pi}\sigma)^{k-1}}
\tfrac{1}{\sqrt{2\pi}\bar{\sigma}}\exp(-\tfrac{1}{8\bar{\sigma}^2} M^2 )
\nonumber\\
\leq&
2\tfrac{1}{(\sqrt{2\pi}\sigma)^{k-1}}
\tfrac{1}{\sqrt{2\pi}\bar{\sigma}}\exp(-\log\tfrac{1}{\epsilon} ) )
\\
\lesssim&
\tfrac{1}{\sigma^{k-1}} \epsilon
\end{align}
where $\leq_{(1)}$ follows by the triangle inequality and the fact that the function $\tfrac{1}{\sigma} \phi(\tfrac{y}{\sigma})$ has a derivative (w.r.t. $\sigma$) of $\tfrac{1}{\sigma^2}[\tfrac{y^2}{\sigma}-1]\phi(\tfrac{y}{\sigma})$ that is positive for the region $y^2>\sigma$. Furthermore $\leq_{(2)}$ follows because we can assume WLOG\footnote{This is because this lemma is only utilized for small enough $\epsilon$.} $\bar{\sigma}\geq1$, such that $M \leq 2(M-\bar{\mu})$.
Next note that
\begin{equation}
\prod_{i=1}^k \tfrac{1}{\sigma} \phi(\tfrac{x_i-\mu}{\sigma})
=
\tfrac{1}{(\sqrt{2\pi}\sigma)^{k-1}} \cdot
\tfrac{1}{\sqrt{2\pi}\sigma } \exp \left( -\tfrac{[\sum_i(x_i-\mu)^2]}{2\sigma^2} \right)
\end{equation}
and use the approximation
\begin{equation}
\big|
e^y - \sum_{j=1}^{l-1} \tfrac{1}{j!} y^j
\big|
\leq
\tfrac{(e{y})^l}{l^l}
\end{equation}
for all $y<0$ and $l>1$, together with the substitution $y=-\tfrac{z}{2\sigma^2}$ for $z>0$,
to arrive at
\begin{equation}
\bigg|
\tfrac{1}{\sqrt{2\pi}\sigma} \exp(-\tfrac{z}{2\sigma^2})
-
\underbrace{\tfrac{1}{\sqrt{2\pi}\sigma} \sum_{j=1}^{l-1} \tfrac{1}{j!} \big(-\tfrac{z}{2\sigma^2}\big)^j }_{=\sum_{j=1}^{l-1} \tfrac{(-1)^j}{\sqrt{2\pi}\sigma\cdot j!} \big(\tfrac{z}{2\sigma^2}\big)^j}
\bigg|
\leq
\underbrace{\tfrac{1}{l^l} (e\tfrac{z}{2\sigma^2})^l \tfrac{1}{\sqrt{2\pi}\sigma} }_{=\tfrac{1}{\sqrt{2\pi}\sigma}\tfrac{(e2^{-1}z/\sigma^2)^l}{l^l}}
\end{equation}
then by substituting $z$ with $\sum_{i=1}^{k}[x_i-\mu]^2$ we have
\begin{align}
&
\underbrace{\tfrac{1}{(\sqrt{2\pi}\sigma)^{k-1}}\bigg|
\tfrac{1}{\sqrt{2\pi}\sigma} \exp\big(-\tfrac{\sum_i[x_i-\mu]^2}{2\sigma^2}\big)}_{=\prod_{i=1}^k \tfrac{1}{\sigma}\phi(\tfrac{x_i-\mu}{\sigma})}
-
\tfrac{1}{\sqrt{2\pi}\sigma} \sum_{j=1}^{l-1} (-1)^j \tfrac{1}{\sqrt{2\pi}j!} \big(-\tfrac{1}{2\sigma^2}\sum_i[x_i-\mu]^2\big)^j
\bigg|
\nonumber\\
\leq&
\tfrac{1}{(\sqrt{2\pi}\sigma)^{k-1}}
\tfrac{1}{\sqrt{2\pi}} \tfrac{1}{l^l} \big(e\tfrac{1}{2\sigma^2}\sum_i[x_i-\mu]^2\big)^l.
\end{align}
Thus we have
\begin{align}
&\sup_{\vee_i|x_i| \leq M} \big| p_G(x) - p_{G'}(x)\big|
\nonumber\\
\leq &
\sup_{\vee_i|x_i| \leq M}
\bigg|
\int \tfrac{1}{(\sqrt{2\pi}\sigma)^k} \sum_{j=1}^{l-1} (-1)^j \tfrac{1}{\sqrt{2\pi}j!}
\big(\tfrac{1}{2\sigma^2}\sum_{i=1}^{k}[x_i-\mu]^2\big)^j d(G-G')(\mu,\sigma)
\bigg|
\nonumber\\
&+
2 \sup_{\substack{ \vee_i|x_i| \leq M, \\ |\mu|\leq\bar{\mu} \ , \ \sigma\leq\sigma\leq\bar{\sigma} }}
\bigg|
\tfrac{1}{(\sqrt{2\pi}\sigma)^k} \tfrac{1}{l^l} \big(e\tfrac{1}{2\sigma^2} \sum_{i=1}^{k}[x_i-\mu]^2\big)^l
\bigg|
\nonumber\\
=&
\sup_{\vee_i|x_i| \leq M}
\bigg|
\int \tfrac{1}{(\sqrt{2\pi})^k} \sum_{j=1}^{l-1} (-1)^j \tfrac{1}{\sqrt{2\pi}j!}
\tfrac{1}{2^j} \sigma^{-(2j+k)} \big(\sum_{i=1}^{k}[x_i-\mu]^2\big)^j d(G-G')(\mu,\sigma)
\bigg|
\nonumber\\
&+
2 \sup_{\substack{ \vee_i|x_i| \leq M, \\ |\mu|\leq\bar{\mu} \ , \ \underline{\sigma}\leq\sigma\leq\bar{\sigma} }}
\tfrac{1}{(\sqrt{2\pi})^k} \tfrac{1}{l^l} e^l \tfrac{1}{2^l} \sigma^{-(2l+k)} \big(\sum_{i=1}^{k} [x_i-\mu]^2\big)^2.
\end{align}
The first term on the RHS of (ref) contains $(l-1)$ different powers of $\sigma^{-1}$ and $2(l-1)$ different powers of $\mu$. This term will therefore be zero if we are able to match the corresponding $2(l-1)^2$ moments of $G$ and $G'$.
Now consider the second term on the RHS of (ref). First note that
\begin{align}
&\sup_{ \vee_i|x_i| \leq M \ , \ |\mu|\leq\bar{\mu} }
|x_i-\mu|
\nonumber\\
\leq& M + \bar{\mu}
\nonumber\\
\leq& \max([2+\bar{\sigma}]\bar{\mu}, \sqrt{8}\bar{\sigma}(\log \tfrac{1}{\epsilon})^{1/2})
\nonumber\\
\leq& \max\big(C_1 (\log\tfrac{1}{\epsilon})^{\gamma_1+\gamma_2}, C_2 (\log\tfrac{1}{\epsilon})^{1/2+\gamma_2}\big)
\nonumber\\
\leq&
C_3 (\log\tfrac{1}{\epsilon})^{\gamma_1+\gamma_2}
\end{align}
where the final inequality follows by $\gamma_1\geq\tfrac{1}{2}$, and therefore we have that the second term on the RHS of (ref) is smaller than
\begin{align}
&\tfrac{1}{(\sqrt{2\pi})^k} \cdot \underline{\sigma}^{-(2l+k)} \big(\tfrac{e}{2}\sum_{i=1}^{k}[x_i-\mu]^2\big)^l \tfrac{1}{l^l}
\nonumber\\
\leq&
\tfrac{1}{(\sqrt{2\pi})^k} \cdot \underline{\sigma}^{-(2l+k)}
\big[C_4 k \cdot (\log\tfrac{1}{\epsilon})^{2(\gamma_1+\gamma_2)}\big]^l \tfrac{1}{l^l}
\nonumber\\
\leq&
\tfrac{1}{(\sqrt{2\pi})^k} \cdot \underline{\sigma}^{-(2l+k)}
\exp\left(
-l\big[\log l - 2\log(C_5[\log\tfrac{1}{\epsilon}]^{\gamma_1+\gamma_2})\big]
\right)
\end{align}
and by choosing $l=l^*$ where $l^*$ is the smallest integer exceeding $(1+C_5^2)(\log\tfrac{1}{\epsilon})^{2[\gamma_1+\gamma_2]}$ we will have that
\begin{equation}
\log\left[
\frac{l^*}{C_5^2 [\log\tfrac{1}{\epsilon}]^{2[\gamma_1+\gamma_2]} }
\right]
\geq
\log\big[1+\tfrac{1}{C_5^2}\big] =: C_6 > 0
\end{equation}
so that the exponential term of (ref) is smaller than
\begin{align}
\exp(-l^*\cdot C_6) \leq&
\exp(-C_7 (\log\tfrac{1}{\epsilon})^{2[\gamma_1+\gamma_2]})
\nonumber\\
\leq& \exp(-\log\tfrac{1}{\epsilon}) = \epsilon
\end{align}
where the final inequality follows because $2\gamma_1\geq1$,
and we conclude that
\begin{equation}
\tfrac{1}{(\sqrt{2\pi})^k} \cdot \underline{\sigma}^{-(2l+k)}
\exp\left(
-l\big[\log l - 2\log(C_5[\log\tfrac{1}{\epsilon}]^{\gamma_1+\gamma_2})\big]
\right)
\lesssim \epsilon.
\end{equation}
Therefore, by Lemma A.1. of Ghosal2001, we can find a discrete distribution $G'$ with
\begin{equation}
2(l^*-1)^2\asymp (\log\tfrac{1}{\epsilon})^{4[\gamma_1+\gamma_2]}
\end{equation}
number of support points such that $|| p_G - p_{G'} ||_\infty \lesssim \epsilon$.