betaFeedback

WorksMathematics

Reorganizing Graduate Statistical Inference for Modern Biostatistical Practice

Abstract

First-year graduate courses in statistical inference within PhD programs in biostatistics often follow a classical mathematical statistics progression through probability models, data reduction, point estimation, testing and interval estimation, and asymptotic evaluation. This organization has clear pedagogical strengths, but may provide less guidance when the probability model is not the natural starting point. We propose a complementary target-first organization for a graduate statistical inference course in biostatistics. The course begins with the scientific question and target parameter, then introduces statistical model classes, estimation, first-order sampling behavior, inference, and efficiency within a common framework. Classical methods such as maximum likelihood, method of moments, estimating equations, confidence intervals, hypothesis tests, bootstrap and jackknife methods, and the Cramér–Rao bound are organized within a common inferential workflow. A central advantage of this organization is that the same workflow provides a natural bridge from classical inference to modern statistical problems, including flexible estimation using machine learning and artificial intelligence, policy learning, anytime-valid inference, and modern Bayesian methods.

Introduction

Many first-year graduate courses in statistical inference in biostatistics programs build on probability and follow a classical mathematical statistics progression: probability and models, data reduction, point estimation, testing and interval estimation, followed by asymptotic evaluation. This sequence has clear pedagogical advantages. Parametric families provide concrete probability models with tractable calculations, sufficiency and completeness formalize data reduction, likelihood and related methods provide systematic approaches to point estimation, and tests and confidence intervals introduce formal uncertainty quantification. This progression naturally encourages a model-first view of inference: begin by specifying a parametric probability model for the observed data, then develop estimation and inference within that model. Texts such as Casella and Berger [6] follow this pedagogy closely. This sequence is intended to represent a common organizing pattern rather than to characterize every graduate inference course.

The model-first perspective is natural when a parametric model provides a useful starting point. Modern biostatistical problems, however, increasingly arise in settings where no such model is obvious. Electronic health records, genomics, imaging, and other complex data structures may require flexible, data-adaptive methods, including machine learning and artificial intelligence tools. The challenge is therefore not that classical inferential principles cease to apply, but that a model-first pedagogy provides less guidance about how to organize inference when the model is no longer the natural starting point. This may make it more difficult for students to connect classical theory with contemporary biostatistical practice.

A complementary way to organize statistical inference is to begin with the scientific question and define the statistical target, or quantity, that answers it. We refer to this as a target-first view of inference. Once the target has been specified, students can consider what statistical model class or structure to impose on the data-generating distribution, how to construct an estimator of the target, and how to study its sampling behavior, uncertainty, and efficiency. This places classical methods within a common inferential workflow that can remain useful as estimation becomes more flexible and statistical problems evolve.

A target-first organization can also help students connect frequentist and Bayesian approaches. Both can begin from the same scientific question and statistical target, while differing in how inference about that target is constructed and uncertainty is quantified. Framing the two approaches around a common target can therefore make their similarities and differences easier to understand.

To better prepare graduate students for contemporary biostatistical practice, we propose reorganizing the first graduate course in statistical inference around a target-first workflow. The contribution is pedagogical rather than methodological: classical inferential ideas remain central, but are reorganized around a common sequence linking scientific questions, statistical targets, models, estimation, sampling behavior, and inference. A central advantage of this organization is that the same sequence provides a natural bridge from classical inference to modern problems involving flexible machine-learning and artificial-intelligence methods, policy and reinforcement learning, sequential inference, and modern Bayesian methods.

A Target-First Framework for Statistical Inference

At a high level, the course is organized around a sequence that begins with the scientific question and target parameter, then proceeds through model class choice, estimation, sampling behavior, inference, and efficiency.

Within this organization, classical topics such as maximum likelihood estimation, estimating equations, hypothesis testing, confidence intervals, and the Cramér–Rao bound are introduced as components of a broader inferential workflow rather than as the organizing framework itself. The same structure also provides natural places for bootstrap and jackknife methods and can subsequently be reused to introduce multiple testing, regression and working models, and basic Bayesian inference.

The proposed organization is summarized in Table 1, while Figure 1 contrasts a classical model-first sequence with the target-first workflow. More advanced semiparametric machinery is deferred to a subsequent course, where the same framework can be extended to flexible machine-learning estimators and other modern inferential problems.

Comparison of a classical model-first sequence and a target-first organization

Figure 1. Two ways of organizing a first graduate course in statistical inference. A classical model-first sequence begins with probability models and develops estimation, testing, and large-sample theory within that structure. The target-first sequence begins with the scientific question and target parameter, then proceeds through model choice, observed data, estimation, sampling behavior, inference, and efficiency.

TopicPedagogical goal
I. Scientific questions and target parametersForeground the target of inference and distinguish the unknown distribution P0P_0, the target ψ0=Ψ(P0)\psi_0 = \Psi(P_0), and an estimator of that target
II. Statistical model classesPresent the statistical model as a choice about how much structure to impose on P0P_0 after the target has been defined
III. EstimationPresent plug-in, and M-/Z-estimation as alternative routes from a specified target and model to an estimator within a common inferential framework
IV. Population-level sensitivityIntroduce the score as a local direction of perturbation of P0P_0 and the pathwise derivative as the corresponding first-order change in the target
V. First-order sampling behaviorOrganize consistency, rates of convergence, and asymptotic distributions around the structure of the estimation error
VI. Regularity and influence functionsConnect local perturbations of P0P_0, first-order changes in the target, and the first-order sampling behavior of regular estimators
VII. Statistical inferenceShow how standard errors, confidence intervals, and hypothesis tests follow from the estimator’s first-order sampling behavior
VIII. Bootstrap and jackknifePresent resampling as a computational approach to studying sampling behavior, while using the jackknife to connect finite-sample perturbations with influence functions
IX. EfficiencyFrame efficiency as a comparison of regular estimators through first-order variance, with Fisher information and the Cramér–Rao bound as the parametric realization of these ideas
X. Multiple targets and multiple testingExtend the target-first framework from a single target to a collection of targets and motivate multiple-testing procedures through the need to control inferential errors across that collection
XI. Regression and working modelsApply the target-first framework to regression, distinguishing regression coefficients as population-level summaries from regression models used to estimate separately defined targets, without requiring correct specification of the working model
XII. A Bayesian route to inferenceUse the common target-first structure to introduce Bayesian inference as an alternative route to uncertainty quantification, while making explicit the role of the prior and the interpretation of uncertainty
XIII. Bridges to modern statistical inferenceShow how the same organizing ideas provide a foundation for flexible machine-learning estimators, policy learning, anytime-valid inference, and modern Bayesian methods

Table 1. A target-first organization for a first graduate course in statistical inference.

To make this progression concrete, Section A follows a simple example to show how familiar classical results emerge naturally from the target-first organization.

From Scientific Question to Target Parameter

The first objective is to translate a scientific question into a precise target of inference. When inference is organized around a model-first progression, the quantity being learned can remain implicit. In a target-first course, students first ask what quantity would answer the scientific question if the relevant population distribution were known.

Formally, let OO denote the observed data for one unit, let P\mathcal{P} denote a broad collection of distributions for OO, and let P0∈PP_0 \in\mathcal{P} denote the true data-generating distribution. A target parameter is a functional of this distribution:

Ψ:P→R\Psi: \mathcal{P} \to\mathbb{R}

The true target value is

ψ0=Ψ(P0)\psi_0 = \Psi(P_0)

This notation separates three objects that students often conflate: the unknown distribution P0P_0, the target value ψ0\psi_0, and the estimator ψ^\hat{\psi}. If P0P_0 were known, there would be no statistical problem; Ψ(P0)\Psi(P_0) could be computed directly. The need for inference arises because P0P_0 is unknown.

Defining the target parameter requires close collaboration with subject-matter experts and making explicit the outcome of interest, its scale and time point, the population of interest, and, when relevant, the treatment, exposure, or policy comparison, as well as whether the target is causal or associational.

For example, suppose a clinician is interested in how three-year survival varies with a baseline biomarker XX among patients with newly diagnosed cancer. The population of interest is patients with newly diagnosed cancer, the outcome is survival, the time point is three years, and the scale is the probability of survival. Let Y3=I(T>3)Y^3 = \mathbb{I}(T > 3) denote the indicator of survival beyond three years and let P0P_0 denote the unknown joint distribution of O=(X,Y3)O = (X, Y^3) in this population. A natural associational target is

m0(x)=EP0(Y3∣X=x)=PP0(T>3∣X=x).m_0(x) = \mathbb{E}_{P_0}(Y^3 \mid X = x) = \mathbb{P}_{P_0}(T > 3 \mid X = x).

Here, m0(x)m_0(x) is the target feature of P0P_0 that answers the scientific question.

Different scientific questions lead to different targets. For example, interest in overall three-year survival would lead to

ψ0=EP0(Y3)=PP0(T>3)\psi_0 = \mathbb{E}_{P_0}(Y^3) = \mathbb{P}_{P_0}(T > 3)

while changing the outcome, time point, population, scale, or scientific comparison would define a different target. If the scientific question were instead causal, for example the effect of a new treatment on three-year survival, a corresponding causal estimand might be the risk difference

ψ0causal=E(Y13)−E(Y03)\psi_0^{\mathrm{causal}} = \mathbb{E}(Y^3_1) - \mathbb{E}(Y^3_0)

where Ya3Y^3_a denotes the counterfactual three-year survival outcome under treatment level aa. Unlike the associational targets above, this counterfactual quantity is not generally identified from the observed-data distribution P0P_0 without additional causal assumptions. Such assumptions would be needed to express the causal estimand as a functional of P0P_0, but are not developed here (see [23]). At this stage, the target has only been defined. The next step is to consider what structure, if any, to impose on the underlying distribution P0P_0 for studying our target.

Pedagogical goal: The pedagogical goal is to understand and identify the target of inference, while making explicit the distinction between the unknown data-generating distribution P0P_0, the target ψ0=Ψ(P0)\psi_0 = \Psi(P_0), and an estimator of that target.

Statistical Model Classes

Once students have learned to define the target parameter, they can next consider what structure, if any, to impose on the unknown data-generating distribution P0P_0. Recall that the target ψ0=Ψ(P0)\psi_0 = \Psi(P_0) is the feature of P0P_0 of interest. A statistical model M\mathcal{M} can then be introduced as the collection of distributions considered possible for the observed data, with P0∈MP_0 \in\mathcal{M}.

For example, a parametric model restricts P0P_0 to a finite-dimensional family,

Mpar={Pθ:θ∈Θ⊆Rd}\mathcal{M}_{\mathrm{par}} = \{P_\theta: \theta\in\Theta\subseteq\mathbb{R}^d\}

so functionals of interest can be expressed as functions of a finite-dimensional parameter θ\theta. Structure may also be introduced through moment restrictions. For a vector-valued function g(O,θ)g(O,\theta), one may consider

Mmr={P∈P:EP{g(O,θ)}=0 for some θ∈Θ}\mathcal{M}_{\mathrm{mr}} = \{P \in\mathcal{P} : \mathbb{E}_P\{g(O,\theta)\} = 0 \text{ for some } \theta\in\Theta\}

Unlike a parametric model, moment restrictions constrain selected features of the distribution rather than the full distribution. This approach provides the basis for method-of-moments and generalized method-of-moments estimation ([14, 22]).

For the marginal survival target introduced above, specific examples are as follows. One may specify ψ0=EP0(Y3)\psi_0 = \mathbb{E}_{P_0}(Y^3), and impose a parametric model

Mpar(Y3)={Bernoulli⁡(p):p∈[0,1]},Ψ(Pp)=p(1)\mathcal{M}_{\mathrm{par}}^{(Y^3)} = \{\operatorname{Bernoulli}(p) : p \in[0,1]\}, \qquad\Psi(P_p) = p \tag*{(1)}

The same target can also be characterized using the moment-restriction formulation by taking g(O,ψ)=Y3−ψg(O,\psi) = Y^3 - \psi and θ=ψ\theta= \psi. Then

Mmr(Y3)={P∈P:EP(Y3−ψ)=0 for some ψ∈[0,1]},Ψ(P)=ψ=EP(Y3)\mathcal{M}_{\mathrm{mr}}^{(Y^3)} = \{P \in\mathcal{P} : \mathbb{E}_P(Y^3 - \psi) = 0 \text{ for some } \psi\in[0,1]\}, \qquad\Psi(P) = \psi= \mathbb{E}_P(Y^3)

The same perspective extends to semiparametric and nonparametric models, where less structure is imposed on P0P_0. These model classes are not developed here, but they illustrate why distinguishing the target from the model is useful: the same target can be studied under increasingly flexible assumptions.

Pedagogical goal: The pedagogical goal is to present the statistical model as a choice about how much structure to impose on P0P_0 after the target has been defined. Parametric models and moment restrictions provide two different ways of introducing such structure.

Estimation of the Target

Students can next learn how a population-level target is connected to observed data through estimation. The target parameter and statistical model remain population-level objects: P0P_0 is unknown, ψ0=Ψ(P0)\psi_0 = \Psi(P_0) specifies the feature of P0P_0 we wish to learn, and P0∈MP_0 \in\mathcal{M} represents the modeling assumptions imposed on P0P_0. Estimation begins with an observed sample,

O1,…,On∼iidP0O_1,\ldots,O_n \mathrel{\overset{\mathrm{iid}}{\sim}} P_0

and constructs an estimator ψ^=ψ^(O1,…,On)\hat{\psi} = \hat{\psi}(O_1,\ldots,O_n) to approximate ψ0\psi_0. Several broad estimation strategies fit naturally within this framework. A natural approach is the plug-in strategy, which ψ^=Ψ(P^)\hat{\psi} = \Psi(\hat{P}), which simply estimates relevant parts of the distribution PP, then plugs in those estimates to a formula for the target parameter as if we had used the truth. Mathematically, it is described as ψ^=Ψ(P^)\hat{\psi} = \Psi(\hat{P}). In the example of Eq. (1), this means estimating pp directly using proportions.

A Z-estimation approach can also be used. Define the empirical measure by Pnf=1n∑i=1nf(Oi)P_n f = \frac{1}{n}\sum_{i=1}^{n} f(O_i). Then, a Z-estimator θ^\hat{\theta} solves Png(O,θ^)=0P_n g(O,\hat{\theta}) = 0 where g(O,θ)g(O,\theta) is a moment or estimating function. An example of this is given by using logistic regression to model Eq. (1) in which the estimating function is a minimizer/maximizer of the gradient function. Method of moments and estimating equations fit naturally within Z-estimation, with the related M-estimation defining estimators through optimization of an empirical criterion ([27, 22, 12]), also falling under the class of Z-estimation.

Pedagogical goal: The pedagogical goal is to present plug-in and Z-estimation as different routes for estimation, yet working toward the same goal of estimating a target.

Sampling Behavior, Statistical Inference, and Efficiency

Once an estimator ψ^\hat{\psi} has been constructed, the next objective is to teach students how the target and estimator behave under small changes in the data-generating distribution, how these behaviors are linked, and how this connection leads to uncertainty quantification and efficiency. We begin with the population-level sensitivity of the target, study the first-order sampling behavior of the estimator, and finally connect the two through regularity and influence functions.

Population-Level Sensitivity: Local Perturbations and Scores

Students can first learn how the target changes under small, smooth perturbations of the data-generating distribution. To describe such perturbations, consider a smooth one-dimensional path given by

{Pϵ:ϵ∈(−δ,δ)}⊆M\left\{P_{\epsilon}:\epsilon\in(-\delta,\delta)\right\} \subseteq\mathcal{M}

subject to Pϵ=0=P0P_{\epsilon=0} = P_0. This represents a smooth local variation of the distribution, indexed by the scalar ϵ\epsilon, with Pϵ=0=P0P_{\epsilon=0} = P_0. Along this path, the target becomes a function of ϵ\epsilon, namely ψ(Pϵ)\psi(P_{\epsilon}), whose derivative at zero describes the sensitivity to this perturbation.

To rigorously quantify how distributions change along this submodel, the score is introduced by

S(O)=∂∂ϵlog⁡(pϵ(O))∣ϵ=0S(O) = \left.\frac{\partial}{\partial\epsilon}\log(p_{\epsilon}(O))\right|_{\epsilon=0}

An example of such a submodel is given by

pϵ(o)=p0(o)(1+ϵS(o))p_{\epsilon}(o) = p_0(o)(1+\epsilon S(o))

where for parametric models, the score is the usual derivative of the log-likelihood.

Finally, to describe how this translates the target parameter, the pathwise derivative of ψ\psi at P0P_0 is introduced along the submodels PϵP_{\epsilon}, [27, 3, 25]

Ψ˙P0(S)=∂∂ϵΨ(Pϵ)∣ϵ=0\dot{\Psi}_{P_0}(S) = \left.\frac{\partial}{\partial\epsilon}\Psi(P_{\epsilon})\right|_{\epsilon=0}

Pedagogical goal: The pedagogical goal is to introduce the score as describing a local direction of perturbation of P0P_0, and the pathwise derivative as describing the corresponding first-order change in the target, rather than presenting the score as an object tied specifically to maximum likelihood.

First-Order Representation of the Estimation Error

Students can next learn how to study the sampling behavior of an estimator through a common first-order representation of its estimation error. Letting Pnf=1n∑i=1nf(Oi)P_n f = \frac{1}{n}\sum_{i=1}^n f(O_i) be the empirical measure, consider the following expansion

ψ^−ψ0=(Pn−P0)ϕ+Rn\widehat{\psi} - \psi_0 = (P_n-P_0)\phi+ R_n

where ϕ\phi is mean 0, EP0{ϕ(O)}=0\mathbb{E}_{P_0}\{\phi(O)\}=0, and RnR_n collects the non-first order error. The function ϕ\phi plays a crucial role in determining the estimator’s first-order sampling behavior, referred to as the influence function of the estimator [13, 27, 3].

This representation provides a common framework for familiar large-sample properties of a general target parameter. If the leading term and remainder vanish in probability, the estimator is consistent. If Rn=op(n−1/2)R_n=o_p(n^{-1/2}), the estimator is asymptotically linear [27, 3], and

(Pn−P0)ϕ=1n∑i=1nϕ(Oi)(P_n-P_0)\phi= \frac{1}{n}\sum_{i=1}^n \phi(O_i)

which determines the first-order rate and limiting behavior by the central limit theorem.

Pedagogical goal: The pedagogical goal is to provide a common first-order representation of the estimation error, from which students can study various statistical properties.

Linking Population-Level Sensitivity and Estimator-Level Behavior: Regularity and Influence Functions

Students can next learn how the first-order sensitivity of the target and the first-order sampling behavior of an estimator are connected. The former is described through the pathwise derivative, while the latter is described through the estimator’s asymptotic linear expansion. Specifically, under regularity, these two first-order behaviors are linked by

Ψ˙P0(S)=EP0[ϕP0(O)S(O)]\dot{\Psi}_{P_0}(S) = E_{P_0}[\phi_{P_0}(O)S(O)]

where ϕP0\phi_{P_0} is the influence function in the expansion of a regular asymptotically linear estimator. Regularity requires this identity to hold for every score SS of a regular submodel through P0P_0 [3, 27, 25].

Loosely speaking, regularity means that the estimator’s limiting distribution, centered at the perturbed target, remains stable under local n−1/2n^{-1/2}-scale perturbations of P0P_0. This ensures that the first-order sampling behavior is compatible with the corresponding first-order change in the target.

This relationship gives students a common interpretation of the central objects:

SS : local direction of perturbation of P0P_0

Ψ˙P0(S)\dot{\Psi}_{P_0}(S) : pathwise derivative, or first-order change in the target

ϕ\phi : influence function describing the estimator’s first-order sampling behavior

Pedagogical goal: The pedagogical goal is to introduce the influence function as the object that links a local direction of perturbation of P0P_0, represented by the score SS, to first-order change in the target and the first-order sampling behavior of a regular estimator via regularity.

From Influence Functions to Statistical Inference

Students can next learn how the estimator’s first-order representation leads directly to statistical inference. Under the asymptotic linearity conditions above, the central limit theorem [27] gives

n(ψ^−ψ0)→dN(0,Var⁡P0{ϕ(O)})\sqrt{n}(\hat{\psi}-\psi_0) \xrightarrow{d} N(0,\operatorname{Var}_{P_0}\{\phi(O)\})

so first order, Var⁡(ψ^)≈1nVar⁡P0{ϕ(O)}\operatorname{Var}(\hat{\psi}) \approx\frac{1}{n}\operatorname{Var}_{P_0}\{\phi(O)\}. Thus, the influence function directly determines the asymptotic variance of the estimator. Writing

σ^2=1n−1∑i=1n{ϕ^(Oi)−(1n∑i=1nϕ^(Oi))}2\hat{\sigma}^2 = \frac{1}{n-1}\sum_{i=1}^{n}\left\{\hat{\phi}(O_i)-\left(\frac{1}{n}\sum_{i=1}^{n}\hat{\phi}(O_i)\right)\right\}^2

a large-sample confidence interval is then given by a Wald-type construction [20]. Let the Wald statistic be given by

Z=ψ^−ψ∗se⁡^(ψ^),se⁡^(ψ^)=σ^2nZ = \frac{\hat{\psi}-\psi^*}{\widehat{\operatorname{se}}(\hat{\psi})}, \qquad\widehat{\operatorname{se}}(\hat{\psi}) = \sqrt{\frac{\hat{\sigma}^2}{n}}

Then, students can form an asymptotically valid confidence interval by

ψ^±1.96se⁡^(ψ^)\hat{\psi} \pm1.96\widehat{\operatorname{se}}(\hat{\psi})

which also connects to a hypothesis test and p-value for

H0:ψ0=ψ∗H_0 : \psi_0 = \psi^*

Pedagogical goal: The pedagogical goal is to show how standard errors, confidence intervals, and hypothesis tests follow from the estimator’s first-order sampling behavior within a common inferential framework.

Resampling and the Jackknife

Students can next learn how resampling provides a computational way to study the sampling behavior of an estimator. Once a target and estimator have been specified, the bootstrap approximates the estimator’s sampling distribution by repeatedly applying the same estimation procedure to resampled data (Efron, [9]; Efron and Tibshirani, [10]). Typically, bootstrap is seen as a computational route to standard errors, confidence intervals, and other features of sampling behavior when analytic approximations are difficult, but the connection to estimation theory can be made explicit and clear using this approach.

The jackknife offers a related connection to the influence-function perspective (Boos and Stefanski, [4]). For sufficiently smooth estimators, the change induced by deleting one observation provides a finite-sample approximation to that observation’s first-order influence on the estimator. Jackknife pseudovalues are viewed as empirical analogues of influence-function contributions, linking classical resampling ideas to the first-order representation developed above.

Pedagogical goal: The pedagogical goal is to present the bootstrap and jackknife from the basis of the target first approach, providing an alternative to studying the sampling behavior of a specified estimator. In particular, the jackknife can be used to reinforce the connection between finite-sample perturbations and influence functions.

Efficiency

Once students understand that the influence function determines first-order variance, Var⁡P0{ϕ(O)}\operatorname{Var}_{P_0}\{\phi(O)\}, efficiency can be introduced as the question of how small this variance can be among regular estimators of the same target (Lehmann and Casella, [19]; van der Vaart, [27]; Bickel et al., [3]; Tsiatis, [25]).

Parametric models provide a concrete setting in which to develop this idea. For a model PθP_\theta, let the score vector be given by

Sθ(O)=∂∂θlog⁡pθ(O)S_\theta(O) = \frac{\partial}{\partial\theta}\log p_\theta(O)

and the Fisher information by

I(θ)=Eθ{Sθ(O)Sθ(O)T}I(\theta) = \mathbb{E}_\theta\left\{S_\theta(O)S_\theta(O)^\mathsf{T}\right\}

The one-dimensional score corresponding to a local direction through the parametric model is obtained from this score vector. For a smooth scalar target ψ(θ)\psi(\theta), the efficient influence function in the parametric model is

ϕeff(O)=∇ψ(θ0)⊤I(θ0)−1Sθ0(O)\phi_{\mathrm{eff}}(O) = \nabla\psi(\theta_0)^{\top} I(\theta_0)^{-1} S_{\theta_0}(O)

with variance

Var⁡P0{ϕeff(O)}=∇ψ(θ0)⊤I(θ0)−1∇ψ(θ0)\operatorname{Var}_{P_0}\{\phi_{\mathrm{eff}}(O)\} = \nabla\psi(\theta_0)^{\top} I(\theta_0)^{-1}\nabla\psi(\theta_0)

recovering the Cramér–Rao lower bound ([19, 6]). One can leverage much of the classical pedagogy to present efficiency in this view, and proceed to discuss equivalent ideas when moving past parametric models.

Pedagogical goal: The pedagogical goal is to frame efficiency as a comparison of regular estimators through their first-order variance, and to present the likelihood score, Fisher information, and Cramér–Rao lower bound as the parametric realization of these more general ideas.

Extensions of the Target-First Framework

We have presented an outline for a target first framework, going from the scientific question to target, the model class assumptions, the estimator choice, and an overview of understanding the sampling behavior, inference, and efficiency. Moving forward, we discuss two useful and natural extensions after developing this foundation: multiple testing, where the inferential target becomes multivariate, and regression, where the distinction between the target and the model becomes especially important.

Multiple Targets and Multiple Testing

Once students have learned to formulate inference around a single target parameter, the same framework can be extended to a collection of targets,

ψ0={Ψ1(P0),…,ΨK(P0)}\psi_0 = \{\Psi_1(P_0), \ldots, \Psi_K(P_0)\}

The inferential problem then includes not only estimating each target and quantifying its uncertainty, but also controlling errors across the collection. Multiple-testing procedures can therefore be introduced as an extension of the same target-first sequence, with family-wise error rate and false discovery rate providing different ways to formalize error control across several inferential targets ([16, 2]).

Pedagogical goal: The pedagogical goal is to extend the target-first framework from a single inferential target to a collection of targets and to motivate multiple-testing procedures through the need to control uncertainty across that collection.

Regression and Working Models

Once students have learned to distinguish the target parameter from the statistical model and estimator, the same framework can be used to revisit regression from a target-first perspective. Regression is often introduced by selecting a model based on the outcome type, such as linear regression for continuous outcomes or logistic regression for binary outcomes, and then interpreting the resulting model coefficients. However, these coefficients may not correspond to the original scientific question, and their usual interpretations may depend on correct model specification.

A target-first approach instead begins by asking which population quantity is of scientific interest and then considers how regression can be used to summarize or estimate that quantity. This provides two complementary ways of introducing regression within the same inferential framework.

First, regression can be used to define a lower-dimensional summary of a potentially complex population relationship. For example, consider the population conditional mean

m0(x)=EP0(Y∣X=x)m_0(x) = \mathbb{E}_{P_0}(Y \mid X = x)

without assuming a particular functional form. Rather than postulating that this relationship is linear, we may define the coefficients of its best linear approximation:

β∗=arg⁡min⁡β EP0[{m0(X)−β0−β1X}2]\beta^* = \underset{\beta}{\arg\min}\ \mathbb{E}_{P_0}\left[\{m_0(X) - \beta_0 - \beta_1X\}^2\right]

The corresponding working model is

mβ(x)=β0+β1xm_\beta(x) = \beta_0 + \beta_1x

Here, β∗\beta^* is a well-defined population quantity, provided the projection is unique, even when the true conditional mean is nonlinear. The coefficients describe a particular summary of the population relationship rather than parameters of an assumed true linear model [28, 5]. Their scientific relevance must still be justified by the research question.

Second, regression can be used as an estimation tool without its coefficients being the target of inference. For example, suppose the scientific question concerns the marginal mean

ψ0=EP0(Y)=EP0{EP0(Y∣X)}\psi_0 = \mathbb{E}_{P_0}(Y) = \mathbb{E}_{P_0}\{\mathbb{E}_{P_0}(Y \mid X)\}

A regression model for the conditional mean EP0(Y∣X)\mathbb{E}_{P_0}(Y \mid X) can be used to help estimate ψ0\psi_0, but the target remains the marginal mean rather than any individual regression coefficient.

These examples illustrate how familiar regression methods can be incorporated into the target-first framework without requiring the regression model to determine the scientific target. Regression can provide a useful population summary or serve as a tool for estimating a separately defined target, depending on the scientific question.

Pedagogical goal: The pedagogical goal is to extend the target-first framework to regression by teaching students to distinguish the scientific target from the role of the regression model. Regression coefficients may be defined as population-level summaries without assuming correct model specification, while regression models may also be used to estimate targets that are not themselves regression coefficients.

A Bayesian Route to Inference

Once students have learned to separate the scientific question, target parameter, statistical model, estimator, and uncertainty quantification, the same framework provides a natural way to introduce basic Bayesian inference. The scientific question, target parameter, statistical model, and observed data remain the same; Bayesian inference introduces a prior distribution on the unknown parameters of the model and updates this distribution using the observed data.

For example, under a parametric model PθP_\theta, a prior π(θ)\pi(\theta) and likelihood pθ(O1,…,On)p_\theta(O_1,\ldots,O_n) lead to the posterior [11]

π(θ∣O1,…,On)∝pθ(O1,…,On)π(θ)\pi(\theta\mid O_1,\ldots,O_n) \propto p_\theta(O_1,\ldots,O_n)\pi(\theta)

If the target is ψ=Ψ(Pθ)\psi= \Psi(P_\theta), the posterior for θ\theta induces a posterior distribution for the target, which can be summarized using posterior means, credible intervals, or posterior probabilities.

This presentation emphasizes the common structure of the inferential problem rather than framing Bayesian and frequentist methods as competing approaches. Both begin with the same scientific question and target, but they differ in how uncertainty about that target is constructed and interpreted.

Pedagogical goal: The pedagogical goal is to use the common target-first structure to introduce Bayesian inference as an alternative route to uncertainty quantification.

A Target-First Course Design

The framework above describes organizing principles rather than a syllabus. In this section, we illustrate how it could be implemented in a 14-week first graduate course in statistical inference. Table 1 summarizes the main components of the proposed organization and their pedagogical roles, while Table 2 gives one possible week-by-week implementation. The course develops the target-first sequence through estimation, first-order sampling behavior, inference, resampling, and efficiency, and then uses the same framework to revisit multiple testing, regression and working models, and basic Bayesian inference. The final component provides connections to a subsequent course in modern statistical inference. Concepts such as pathwise differentiability, regularity, and influence functions can be introduced at a conceptual and computational level, while more technical semiparametric theory and efficiency calculations are deferred to subsequent coursework.

WeekTopicRepresentative material
1Scientific questions, targets, and modelsObserved data, populations, target parameters, parametric models, moment restrictions
2General approaches to estimationPlug-in estimation, Z-estimation, M-estimation
3Classical estimators in the common frameworkMaximum likelihood, method of moments, generalized method of moments, estimating equations
4First-order estimation errorError decompositions, LLN, CLT, delta method, consistency, convergence rates
5Local perturbations and target sensitivityParametric submodels, scores, pathwise derivatives
6Regularity and influence functionsAsymptotic linearity, remainder terms, regular estimators, influence functions
7Statistical inferenceFirst-order variance, standard errors, confidence intervals, Wald tests
8BootstrapBootstrap distributions, standard errors, confidence intervals, relation to sampling distributions
9JackknifeLeave-one-out perturbations, pseudovalues, variance estimation, connection to influence functions
10EfficiencyEfficient influence functions, likelihood scores, Fisher information, Cramér–Rao bounds
11Multiple targets and multiple testingCollections of target parameters and hypotheses, family-wise error rate, false discovery rate
12Regression and working modelsConditional-mean targets, parametric regression models, regression coefficients, working models, low-dimensional summaries
13A Bayesian route to inferencePriors, likelihoods, posterior distributions, posterior summaries, credible intervals
14Bridges to modern statistical inferenceFlexible ML- and AI-based estimation, policy learning, anytime-valid inference, modern Bayesian methods

Table 2. One possible 14-week implementation of the target-first framework.

Bridging the Target-First Framework to a Second Course in Inference

The target-first framework provides a natural foundation for a subsequent course in modern statistical inference, where the same ideas of target specification, model choice, first-order approximation, and uncertainty quantification can be extended to more complex settings. We discuss the presentation and possible topics.

Flexible estimation with machine learning and AI. Flexible estimation provides a natural setting in which to revisit valid inference and introduce influence-function-based corrections, orthogonality, and cross-fitting [15, 18, 29, 7].

Policy learning and decision making. Replacing a fixed target with the value of a treatment rule or policy creates a bridge to individualized treatment rules, dynamic treatment regimes, contextual bandits, reinforcement learning, and regret-based decision making [8, 17, 1].

Anytime-valid inference. Sequential monitoring and adaptive stopping provide a natural extension of fixed-sample uncertainty quantification to confidence sequences and anytimevalid inference [24].

Modern Bayesian inference. The same target-first perspective can also connect to modern Bayesian methods, including amortized approaches such as Prior-Data Fitted Networks [21].

Higher-Order Influence Functions For nonlinear functionals, higher-order influence functions and classical U- and V-statistics provide natural extensions of the first-order framework. This can be casted in the framework of above, providing exposure to non-standard functional targets.

Discussion

The goal of the proposed framework is not to replace classical statistical inference, but to reorganize its central ideas around a common inferential workflow. Beginning with the scientific question and target parameter makes the distinction among the target, statistical model, estimator, and uncertainty explicit. Estimation, first-order sampling behavior, influence functions, resampling, and efficiency can then be introduced as successive components of the same inferential problem.

An important advantage of this organization is that the same framework provides a natural bridge to modern statistical inference. The questions developed here, including what the target is, what structure is imposed, how it is estimated, and how uncertainty is characterized, continue to apply in subsequent courses when estimation uses machine learning or artificial intelligence, when the target becomes a treatment policy or decision rule, when inference is sequential, or when uncertainty is represented through a Bayesian posterior.

This target-first perspective is closely related in spirit to the targeted-learning literature, which organizes estimation and inference around a prespecified target parameter and the statistical model in which it is defined ([26]). Our emphasis here is pedagogical: we use this organizing principle to connect classical and modern inferential methods rather than to advocate for a particular estimation procedure.

This reorganization necessarily changes the relative emphasis placed on some topics traditionally covered in mathematical statistics courses. Classical results on data reduction and finite-sample optimality, including sufficiency and minimal sufficiency, completeness, Rao–Blackwell and Lehmann–Scheffé results, and Neyman–Pearson or uniformly most powerful testing theory, may receive less attention. These remain valuable ideas, and programs wishing to retain exposure to them could reserve a lecture for selected classical finite-sample results while preserving the target-first organization of the course.

Finally, this is a curricular proposal rather than an empirical evaluation of learning outcomes, and the effects of this organization on student learning remain to be studied.

Acknowledgements

We acknowledge Ivan Diaz for the helpful discussions.

A Worked Example of the Target-First Framework

This appendix illustrates the proposed organization using a deliberately simple example. Suppose the scientific question concerns three-year survival among patients with newly diagnosed cancer. Let

Y3=I(T>3)Y^3 = \mathbb{I}(T > 3)

indicate survival beyond three years. To keep the calculations transparent, we initially take O=Y3O = Y^3; a baseline biomarker XX is reintroduced in the extensions below. The simplicity of the example allows the same problem to be followed from target specification through estimation, first-order behavior, inference, resampling, and efficiency.

Scientific Question and Target

The scientific question is: what proportion of patients in the population survive beyond three years? Following § 2.1, the corresponding target is

ψ0=Ψ(P0)=EP0(Y3)=PP0(T>3)\psi_0 = \Psi(P_0) = \mathbb{E}_{P_0}(Y^3) = P_{P_0}(T > 3)

where P0P_0 denotes the unknown population distribution of Y3Y^3.

At this stage, the target has been defined without specifying either a statistical model or an estimator.

Pedagogical goal illustrated (§ 2.1): separate the unknown distribution P0P_0, the target ψ0=Ψ(P0)\psi_0 = \Psi(P_0), and the estimator that will later be used to approximate it.

Statistical Model

Because Y3Y^3 is binary, its marginal distribution can be represented as

Y3∼Bernoulli⁡(p),p∈[0,1]Y^3 \sim\operatorname{Bernoulli}(p), \qquad p \in[0,1]

so that

M={Bernoulli⁡(p):p∈[0,1]},ψ(p)=p\mathcal{M} = \{\operatorname{Bernoulli}(p) : p \in[0,1]\}, \qquad\psi(p) = p

In this example the Bernoulli family exhausts the possible distributions on {0,1}\{0,1\}, so the parametric representation imposes no additional restriction beyond the binary support.

Pedagogical goal illustrated (§ 2.2): the target is specified first, while the statistical model describes the structure imposed on the unknown distribution.

Estimation

Suppose

Y13,…,Yn3∼iidP0Y^3_1,\ldots,Y^3_n \mathrel{\overset{\mathrm{iid}}{\sim}} P_0

The natural estimator is the sample proportion

ψ^=PnY3=1n∑i=1nYi3\widehat{\psi} = P_nY^3 = \frac{1}{n}\sum_{i=1}^{n}Y^3_i

This single estimator illustrates the three estimation strategies introduced in § 2.3.

First, it is a plug-in estimator:

ψ^=Ψ(Pn).\hat{\psi} = \Psi(P_n).

Second, it is a Z-estimator because it solves

Pn(Y3−ψ^)=0P_n(Y^3-\hat{\psi})=0

Third, under the Bernoulli model it is the maximum likelihood estimator,

ψ^=arg max⁡p∈[0,1]  Pn[Y3log⁡p+(1−Y3)log⁡(1−p)]\hat{\psi}=\underset{p\in[0,1]}{\operatorname{arg\,max}}\;P_n\left[Y^3\log p+(1-Y^3)\log(1-p)\right]

and hence an M-estimator with negative log-likelihood as its criterion.

Thus, plug-in estimation, Z-estimation, and M-estimation provide different representations of the same familiar estimator.

Pedagogical goal illustrated (§ 2.3): place familiar estimation methods within a common inferential workflow and show how plug-in, Z-estimation, and M-estimation can provide different representations of the same estimator.

Population-Level Sensitivity

Following § 2.4, consider a local path through the true Bernoulli distribution,

pϵ=p0+ϵhp_{\epsilon}=p_0+\epsilon h

for sufficiently small ϵ\epsilon. The corresponding score is

Sh(Y3)=hY3−p0p0(1−p0).S_h(Y^3)=h\frac{Y^3-p_0}{p_0(1-p_0)}.

Because the target is ψ(p)=p\psi(p)=p,

Ψ˙P0(Sh)=∂∂ϵψ(pϵ)∣ϵ=0=h\dot{\Psi}_{P_0}(S_h)=\left.\frac{\partial}{\partial\epsilon}\psi(p_\epsilon)\right|_{\epsilon=0}=h

The score therefore describes the local direction in which P0P_0 is perturbed, while the pathwise derivative describes the corresponding first-order change in the survival probability.

Pedagogical goal illustrated (§ 2.4): connect a local perturbation of the data-generating distribution to the resulting first-order change in the target.

First-Order Sampling Behavior

For the sample proportion,

ψ^−ψ0=PnY3−P0Y3=(Pn−P0)(Y3−ψ0)\hat{\psi}-\psi_0=P_nY^3-P_0Y^3=(P_n-P_0)(Y^3-\psi_0)

Thus the general first-order representation becomes

ψ^−ψ0=(Pn−P0)ϕ,ϕ(Y3)=Y3−ψ0\hat{\psi}-\psi_0=(P_n-P_0)\phi,\qquad\phi(Y^3)=Y^3-\psi_0

with

Rn=0R_n = 0

In this simple example, the first-order representation is exact, and ϕ(Y3)=Y3−ψ0\phi(Y^3) = Y^3 - \psi_0 is the function governing the estimator’s first-order sampling behavior. The next step is to verify that this same function is compatible with the local behavior of the target. Consistency follows from the law of large numbers, while the central limit theorem determines the root-nn limiting behavior.

Pedagogical goal illustrated (§ 2.4): organize consistency, rates, and limiting distributions around the structure of the estimation error.

Regularity and the Influence Function

The function identified from the first-order representation can now be connected to the population-level perturbation. For the path indexed by hh,

EP0[ϕ(Y3)Sh(Y3)]=EP0[(Y3−p0)hY3−p0p0(1−p0)]=h\mathbb{E}_{P_0}\left[\phi(Y^3)S_h(Y^3)\right] = \mathbb{E}_{P_0}\left[(Y^3-p_0)h\frac{Y^3-p_0}{p_0(1-p_0)}\right] = h

Hence

Ψ˙P0(Sh)=EP0{ϕ(Y3)Sh(Y3)}\dot{\Psi}_{P_0}(S_h) = \mathbb{E}_{P_0}\{\phi(Y^3)S_h(Y^3)\}

Thus the same ϕ(Y3)=Y3−ψ0\phi(Y^3) = Y^3 - \psi_0 that describes the estimator’s first-order sampling behavior also represents the pathwise derivative through the influence function relationship. The example therefore makes explicit the connection among the score, the first-order change in the target, and the first-order sampling behavior of the estimator described in § 2.4.

Pedagogical goal illustrated (§ 2.4): show concretely how the influence function links population-level sensitivity to the first-order sampling behavior of a regular estimator.

Statistical Inference

Since

Var⁡P0{ϕ(Y3)}=ψ0(1−ψ0)\operatorname{Var}_{P_0}\{\phi(Y^3)\} = \psi_0(1-\psi_0)

the central limit theorem gives

n(ψ^−ψ0)→dN{0,ψ0(1−ψ0)}\sqrt{n}(\hat{\psi}-\psi_0) \xrightarrow{d} N\{0,\psi_0(1-\psi_0)\}

The corresponding estimated standard error is

se⁡^(ψ^)=ψ^(1−ψ^)n\widehat{\operatorname{se}}(\hat{\psi}) = \sqrt{\frac{\hat{\psi}(1-\hat{\psi})}{n}}

A large-sample confidence interval is therefore

ψ^±1.96 se⁡^(ψ^)\hat{\psi} \pm1.96\,\widehat{\operatorname{se}}(\hat{\psi})

and for H0:ψ0=ψ∗H_0:\psi_0=\psi^*, the corresponding Wald statistic is

Z=ψ^−ψ∗se⁡(ψ^)Z=\frac{\hat{\psi}-\psi^*}{\operatorname{se}(\hat{\psi})}

Thus standard errors, confidence intervals, and hypothesis tests arise directly from the first-order representation.

Pedagogical goal illustrated (§ 2.4): derive familiar inferential procedures from the estimator’s first-order sampling behavior.

Bootstrap and Jackknife

The same estimator also illustrates the role of resampling. A nonparametric bootstrap sample

Y13∗,…,Yn3∗Y_1^{3*},\ldots,Y_n^{3*}

is drawn from the empirical distribution PnP_n, and the estimator is recomputed as

ψ^∗=1n∑i=1nYi3∗\hat{\psi}^*=\frac{1}{n}\sum_{i=1}^{n}Y_i^{3*}

The conditional distribution of ψ^∗−ψ^\hat{\psi}^*-\hat{\psi} provides a computational approximation to the sampling distribution of ψ^−ψ0\hat{\psi}-\psi_0.

For the jackknife, deleting observation ii gives

ψ^(−i)=nψ^−Yi3n−1\hat{\psi}_{(-i)}=\frac{n\hat{\psi}-Y_i^3}{n-1}

The corresponding jackknife pseudovalue is

Ji=nψ^−(n−1)ψ^(−i)=Yi3J_i=n\hat{\psi}-(n-1)\hat{\psi}_{(-i)}=Y_i^3

so that

Ji−ψ^=Yi3−ψ^J_i-\hat{\psi}=Y_i^3-\hat{\psi}

The centered pseudovalues therefore coincide with the empirical version of the influence-function contribution.

Pedagogical goal illustrated (§ 2.4): present bootstrap and jackknife methods as tools for studying the sampling behavior of the same estimator, while making the connection between jackknife perturbations and influence functions explicit.

Efficiency

For the Bernoulli model, the likelihood score is

Sp(Y3)=Y3−pp(1−p)S_p(Y^3)=\frac{Y^3-p}{p(1-p)}

and the Fisher information is

I(p)=1p(1−p)I(p) = \frac{1}{p(1-p)}

Because ψ(p)=p\psi(p)=p,

ϕeff(Y3)=I(p0)−1Sp0(Y3)=Y3−p0\phi_{\mathrm{eff}}(Y^3) = I(p_0)^{-1} S_{p_0}(Y^3) = Y^3-p_0

Thus

Var⁡P0{ϕeff(Y3)}=p0(1−p0)\operatorname{Var}_{P_0}\{\phi_{\mathrm{eff}}(Y^3)\}=p_0(1-p_0)

and the corresponding variance bound for an estimator based on nn observations is

p0(1−p0)n\frac{p_0(1-p_0)}{n}

The influence function of the sample proportion is therefore the efficient influence function, and the estimator attains the Cramér–Rao bound in this model.

Pedagogical goal illustrated (§ 2.4): connect first-order variance, likelihood scores, Fisher information, and the Cramér–Rao bound as different parts of the same efficiency calculation.

References

  1. [1]Athey, S. and Wager, S. (2021). Policy learning with observational data. Econometrica, 89(1):133–161.arxiv.org/abs/1702.02896
  2. [2]Benjamini, Y. and Hochberg, Y. (1995). Controlling the false discovery rate: A practical and powerful approach to multiple testing. Journal of the Royal Statistical Society: Series B, 57(1):289–300.DOI
  3. [3]Bickel, P. J., Klaassen, C. A. J., Ritov, Y., and Wellner, J. A. (1993). Efficient and Adaptive Estimation for Semiparametric Models. Johns Hopkins University Press.
  4. [4]Boos, D. D. and Stefanski, L. A. (2013). Essential statistical inference: theory and methods, volume 591. Springer.DOI
  5. [5]Buja, A., Berk, R., Brown, L., George, E., Pitkin, E., Traskin, M., Zhang, K., and Zhao, L. (2019). Models as approximations i: Consequences illustrated with linear regression. Statistical Science, 34(4):523–544.arxiv.org/abs/1404.1578
  6. [6]Casella, G. and Berger, R. L. (2002). Statistical Inference. Duxbury, 2 edition.
  7. [7]Chernozhukov, V., Chetverikov, D., Demirer, M., Duflo, E., Hansen, C., Newey, W., and Robins, J. (2018). Double/debiased machine learning for treatment and structural parameters. The Econometrics Journal, 21(1):C1–C68.
  8. [8]Dudík, M., Langford, J., and Li, L. (2011). Doubly robust policy evaluation and learning. In Proceedings of the 28th International Conference on Machine Learning, pages 1097–1104.arxiv.org/abs/1103.4601
  9. [9]Efron, B. (1982). The Jackknife, the Bootstrap and Other Resampling Plans. Society for Industrial and Applied Mathematics.
  10. [10]Efron, B. and Tibshirani, R. J. (1993). An Introduction to the Bootstrap. Chapman & Hall.
  11. [11]Gelman, A., Carlin, J. B., Stern, H. S., Dunson, D. B., Vehtari, A., and Rubin, D. B. (2013). Bayesian Data Analysis. Chapman & Hall/CRC, 3 edition.
  12. [12]Godambe, V. P., editor (1991). Estimating Functions. Clarendon Press, Oxford.
  13. [13]Hampel, F. R., Ronchetti, E. M., Rousseeuw, P. J., and Stahel, W. A. (1986). Robust Statistics: The Approach Based on Influence Functions. John Wiley & Sons.
  14. [14]Hansen, L. P. (1982). Large sample properties of generalized method of moments estimators. Econometrica, 50(4):1029–1054.DOI
  15. [15]Hines, O., Dukes, O., Diaz-Ordaz, K., and Vansteelandt, S. (2022). Demystifying statistical learning based on efficient influence functions. The American Statistician, 76(3):292–304.DOI
  16. [16]Holm, S. (1979). A simple sequentially rejective multiple test procedure. Scandinavian Journal of Statistics, 6(2):65–70.DOI
  17. [17]Kallus, N. (2018). Balanced policy evaluation and learning. In Advances in Neural Information Processing Systems, volume 31.arxiv.org/abs/1705.07384
  18. [18]Kennedy, E. H. (2024). Semiparametric doubly robust targeted double machine learning: a review. Handbook of statistical methods for precision medicine, pages 207–236.arxiv.org/abs/2203.06469
  19. [19]Lehmann, E. L. and Casella, G. (1998). Theory of Point Estimation. Springer, 2 edition.
  20. [20]Lehmann, E. L. and Romano, J. P. (2005). Testing Statistical Hypotheses. Springer, 3 edition.
  21. [21]Müller, S., Hollmann, N., Pineda Arango, S., Grabocka, J., and Hutter, F. (2022). Transformers can do bayesian inference. In International Conference on Learning Representations.arxiv.org/abs/2112.10510
  22. [22]Newey, W. K. and McFadden, D. (1994). Large sample estimation and hypothesis testing. In Engle, R. F. and McFadden, D. L., editors, Handbook of Econometrics, volume 4, pages 2111–2245. Elsevier.
  23. [23]Pearl, J. (2010). An introduction to causal inference. The international journal of biostatistics, 6(2):7.
  24. [24]Ramdas, A., Grünwald, P., Vovk, V., and Shafer, G. (2023). Game-theoretic statistics and safe anytime-valid inference. Statistical Science, 38(4):576–601.arxiv.org/abs/2210.01948
  25. [25]Tsiatis, A. A. (2006). Semiparametric Theory and Missing Data. Springer.DOI
  26. [26]van der Laan, M. J. and Rose, S. (2011). Targeted Learning: Causal Inference for Observational and Experimental Data. Springer.DOI
  27. [27]van der Vaart, A. W. (1998). Asymptotic Statistics. Cambridge University Press.DOI
  28. [28]White, H. (1982). Maximum likelihood estimation of misspecified models. Econometrica, 50(1):1–25.
  29. [29]Williams, N. T., Hines, O. J., and Rudolph, K. E. (2026). Riesz represents for the rest of us. Epidemiology, pages 10–1097.DOI

Paper details

vlnc:W_t9wvqz52
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
CC BY 4.0
Usage

views · 1

downloads · 2

A view counts once per browser per day, a download each time the PDF is requested.

  • Mathematics

Not recorded for this paper

View statement
Looking for related papers…
Contents