• No results found

In the following it is assumed that the labels for the points of impact are ordered such that τr = arg mins=1,...,S|bτr− τs|. Moreover we assume that S has been consistently estimated

by bS and maxr=1,...,

b

S|τbr − τs| = OP(n

−1k). For estimating the parameters α, β1, . . .β S we

impose the following additional assumptions for model (2.2): Additional to E("i|Xi(t), t ∈

[a, b]) = 0 we assume that V("i|Xi(t), t ∈ [a, b]) = σ2(g(ηi)) < ∞, where the variance

functionσ2 is defined over the range of g and is strictly positive. For simplicity the function g is assumed to be a known strictly monotone and smooth function with bounded first and second order derivatives and hence invertible. Model (2.2) then implies E(Yi|Xi) = g(ηi) as

can be seen as a generalization of a generalized linear model framework (cf. McCullagh and Nelder, 1989, Ch. 9). The following result shows that our model is uniquely identified:

Theorem 2.2. Let g(·) be invertible and assume that Xi satisfies Assumption 2.1. Then for all S≥ S, all α∗,β1∗, . . . ,βS∗∗ ∈ R, and all τ1, . . . ,τS∈ (a, b) with τk /∈ {τ1, . . . ,τS}, k = S +

1, . . . , S, we obtain E ‚  g(α + S X r=1 βrXi(τr)) − g(α∗+ S∗ X r=1 βrXi(τr)) ‹2Œ > 0, (2.8) whenever |α − α| > 0, or supr=1,...,S|βr− βr| > 0, or supr=S+1,...,Sr| > 0.

Note that it already follows from Theorem 2.1 that all points of impact τr are uniquely identifiable under the assumptions of the theorem. Invertibility of g additionally ensures that the coefficientsα, β1, . . . ,βS are uniquely identified. Furthermore, it follows from the proof of Theorem 2.2, that under Assumption 2.1, E(Xi(τ) Xi(τ)T) is invertible, where Xi(τ) =

(1, Xi(τ1), . . . , Xi(τS))T.

Estimation of β0 = (α, β1, . . . ,βS)T is performed by quasi-maximum likelihood. Define

Xi(bτ) = (1, Xi(bτ1), . . . , Xi(bτS))T and denote the jth element of this vector asXbi j. Forβ ∈ RS+1 letηbi(β) = Xi(bτ)Tβ,

b

µn(β) = (g(ηb1(β)), . . . , g(ηbn(β)))

T,

b

Dn(β) be the n×(S+1) matrix with

entries g0(ηbi(β))Xbi j, and letVbn(β) be a n × n diagonal matrix with elements σ2(g(ηbi(β))). Furthermore, denote the corresponding objects evaluated at the true points of impactτr by

Xi(τ), Xi j,ηi(β), µn(β), Dn(β), and Vn(β); this convention applies also to the below defined objects.

Then our estimator bβ for β0= (α, β1, . . . ,βS)T is defined as the solution of the S+ 1 score

equationsUbn(bβ) = 0, where

b

Un(β) =Dbn(β)TbVn(β)−1(Ynµbn(β)). (2.9) Note that the score equations are evaluated at the estimatesτbr instead ofτr.

In the following, it will be convenient to define

Fn(β) = Dn(β)TVn(β)−1Dn(β) and bFn(β) =Dbn(β)TbVn(β)−1Dbn(β).

Observe that the S+ 1 × S + 1 matrix E(n−1Fn(β)) can be represented as E(n−1Fn(β)) =

[E(g02

i(β))/σ2(g(ηi(β))) XikXil)]k,l, where k= 1, . . . , S + 1 and l = 1, . . . , S + 1. Let η(β)

and Xj be generic copies of ηi(β) and the jth component of Xi, respectively. This allows us to write E(n−1Fn(β)) = E(F(β)) with E(F(β)) = [E(g02(η(β))/σ2(g(η(β))) XkXl)]k,l,

where we point out that E(F(β)) is for all β ∈ RS+1a symmetric and strictly positive definite matrix with inverse E(F(β))−1. Indeed, suppose E(F(β)) is not strictly positive definite, one would then derive the contradiction E((PS+1

j=1ajXjg0(η(β))/σ(g(η(β))))2) = 0 for nonzero

constants a1, . . . , aS+1. A similar argument can be used to show that E(bF(β)) is strictly positive

definite, where E(bF(β)) = [E(g02(η(β))/σb 2(g(η(β)))b XbkXbl)]k,l.

In the rest of this section we assume Xi to be i.i.d. Gaussian distributed which covariance σ(s, t) satisfying Assumption 2.1. The following additional set of assumptions are used to derive more precise theoretical statements:

Assumption 2.3.

a) There exists a constant 0 < M" < ∞, such that E("ip|Xi) ≤ M" for some even p with p≥ max{2/κ + ε, 4} for some ε > 0.

b) The link function g is monotone, invertible with two bounded derivatives |g0(·)| ≤ cg,

|g00(·)| ≤ cg, for some constant0≤ cg< ∞.

c) h(·) :=σ2g(g(·))0(·) is a bounded function with two bounded derivatives.

Assumption 2.3 a) states that some higher moments of "i exist. While the condition on p ≥ 4 and p being even simplifies the proofs, the condition p > 2/κ is a more crucial one and is used in the proof of Proposition C.1 in Appendix C. The Assumptions 2.3 a) and b) and c) hold, for example, in the important case of a functional logistic regression with points of impact. Assumption 2.3 c) is satisfied, for instance, in the special case of generalized linear models with natural link functions. For the latter case, we haveσ2(g(x)) = g0(x) such that h(x) = 1. The boundedness conditions in b) and c) constitute a set of sufficient conditions needed to obtain our theoretical results.

Theorem 2.3. Let bS = S, maxr=1,...,S|τbr− τr| = Op(n−1/κ) and let Xi be a Gaussian process satisfying Assumption 2.1. under Assumption 2.3 we then obtain

p

n(bβ − β0)→ N (0, (E(F(βd 0)))−1). (2.10) This result is remarkable; our estimator based on τbr enjoys the same asymptotic effi- ciency properties as the infeasible estimator based on the true points of impactτr. It achieves the same asymptotic efficiency properties under classical multivariate setups (cf. McCullagh, 1983). In practice one might then replace E(F(β0)) by its consistent estimator n−1bFn(bβ) in order to derive approximate results. This is a direct consequence of (C.24) and (C.50) in the supplementary Appendix C.

Parameter estimation under misspecified variance functions

So far, we have considered the case whereσ2(g(ηi(β))) is specified using a (correct) model assumption. In the following, we consider situations where only the mean function g(ηi(β)) can be specified, but where the functional form of σ2(·) is unknown. By Theorem 2.2, an estimator eβ for β0 minimizes the squared error

e β = arg min β∈RS+1 1 2n n X i=1 (yi− g(ηbi(β))) 2.

The estimator eβ can then be described as the solution of the score functionsUen(β) = 0, where

e

Un(β) =Dbn(β)T(Yn−bµn(β)). (2.11) Provided|g000(x)| ≤ Mg, we get the following corollary by following the same arguments as in the proof of Theorem 2.3:

Corrolary 2.1. Under the Assumptions of Theorem 2.3, but with Assumption 2.3 c) replaced by

the assumption that|g000(x)| ≤ Mgfor some0≤ Mg< ∞, we have p

n(eβ − β0)→ N (0, Ad −1BA−1), (2.12) where

A= E(g0(η(β0))2X XT) and B = cov(g0(η(β

0)) X ") = E(g0(η(β0))2σ2(g(η(β0))) X XT).

In practice one might replace the sandwich matrix in (2.12) by their estimators, i.e., re- placing E(g0(η(β0))2X XT) by n−1 Pn i=1g0(ηi(eβ))bXibX T i and cov(g0(η(β0)) X ") by n−1Pni=1g0(ηbi(eβ))2(yi− g(ηbi(eβ)))2bXiXb T i .

The above case corresponds to situations whereσ2(g(ηi(β))) is incorrectly specified by e

σ2(g(η

i(β))) withσe

2(g(η

i(β))) = 1. More general misspecifications lead to similar sandwich

estimators as in (2.12) provided eh(·) = g0(·)/σe2(·) is a bounded function with two bounded derivatives.

Related documents