betaFeedback

WorksMathematics

Identification and curvature bias for shared inputs in multichannel dynamical models

Abstract

Pooling many channels with a shared unknown input can leave persistent bias when each channel retains a fixed number of observations and its own incidental parameters. For heterogeneous smooth channel manifolds under isotropic noise, the second-order bias is an information-weighted regression of mean curvature on normal input velocity. A feasible correction gives centred Gaussian inference as the noise level σσ decreases with Rσ6→0Rσ^6\to0, compared with Rσ2→0Rσ^2\to0 without correction. We extend the stochastic expansion and studentization to deterministic channel arrays with densely correlated Gaussian errors of bounded covariance operator norm. General marginal covariance adds a forcing term that can bias even flat channels, while cross-channel covariance changes uncertainty. For Gaussian errors with a separable frame-by-channel covariance whose channel factor is autoregressive in a known ordering, an independent zero-mean calibration field yields a covariance estimator accurate enough for corrected inference. Boundary accumulation and fixed working population models introduce distinct bias terms; rational-multiplier and zero-count arguments connect identification to frame-integrated compartment models. Simulations test both oracle and estimated-covariance inference, including independent PET replications. Moderate-noise undercoverage, optimization ambiguity and the need to validate reconstruction covariance limit practical inference. The real-data example supports sensitivity analysis, not clinically calibrated intervals.

Introduction

A collection of time series may be generated by different dynamical systems driven by the same unobserved input. In dynamic positron emission tomography (PET), the tracer concentration in each region or voxel is the response of a compartment system with its own rate constants to the arterial blood input. Total-body scanners now record such curves in 10510^{5}–10610^{6} voxels [36], and the input is usually taken from an image of the aorta; recent likelihood-free and generative methods for voxelwise kinetic posteriors assume it is known [13, 43] (Gu et al. 2026). Voxelwise likelihoods that are nonlinear in a decay parameter also arise in positronium lifetime imaging with time-of-flight PET [25]. Estimating the input from the tissue curves themselves, by fitting all curves jointly, is the idea behind simultaneous estimation (SIME) and multichannel blind identification [16, 41, 38]. It is natural to expect that more channels give a better input. This paper asks what pooling channels can recover. The answer has three parts: identification, the input scale, and estimation.

Identification requires more than pooling. An alternative input can move poles and zeros between its transform and the rational channel transfer functions. A binding input pole budget and suitable separation of channel poles and zeros rule out these alternatives up to scale. For frame-integrated exponential-polynomial models, including the delayed Feng input, a zero-count argument transfers continuous-curve identification and local rank to frame means under explicit endpoint, onset-chart and channel-type conditions (§ 3). Structural identification does not guarantee good conditioning. An exact scale symmetry also remains: kinetic functionals that move with that symmetry retain external calibration error, however many channels are pooled.

The third part, and the principal statistical contribution, concerns estimation. Each channel brings its own kinetic parameters, so the number of parameters grows in proportion to the number RR of channels while the number nn of time frames stays fixed: the channel parameters are incidental in the sense of Neyman and Scott [33]. We show that the joint least-squares input estimator converges, as R→∞R \to\infty, to a pseudo-true input that differs from the truth by

−σ22Nˉ−1mˉ+O(σ4),Nˉ=E{BT(I−P)B},mˉ=E{s2BT(I−P)κ},-\frac{\sigma^2}{2}\bar{N}^{-1}\bar{m}+O(\sigma^4), \qquad\bar{N}=\mathbb{E}\{B^{T}(I-P)B\}, \qquad\bar{m}=\mathbb{E}\{s^2B^{T}(I-P)\kappa\},

where σ\sigma is the common noise level, BB is the sensitivity of a channel curve to the input, I−PI-P projects onto the normal space of that channel’s manifold of noise-free curves, and (I−P)κ(I-P)\kappa is the trace of the second fundamental form of the manifold, pp times its mean curvature vector. The deviation is an information-weighted regression of curvature on the normal input velocity. It is invariant under reparameterization of the channels, involves intrinsic but not parameter-effects curvature ([7]), and, under isotropic noise in the fitting metric, vanishes for flat channels such as unconstrained spectral basis models ([11]). Because the sampling standard deviation of the estimator is of order σ/R\sigma/\sqrt{R}, its bias dominates as soon as Rσ2R\sigma^2 is large: once Rσ2→∞R\sigma^2 \to\infty, Wald intervals for every linear functional whose leading bias is nonzero cover with probability tending to zero. An analytic correction of the curvature term removes the bias to first order and leaves the variance of the inverse fixed-effects information whenever Rσ6→0R\sigma^6 \to0. A PET simulation with compact channel types and σ\sigma decreasing along an explicit sequence in RR examines these predictions (§ 7). Physical constraints in the joint fit change the order: channels on a boundary such as k3=0k_3=0 are projected onto a cone, and the bias becomes of order σ\sigma whenever their aggregate boundary forcing is nonzero.

A different approach is a population model, in which the channel parameters are random and a hierarchical posterior is computed for the input. With an unrestricted population and support identification this gives consistency (Proposition S8.1). With a working parametric population gg we show that the integrated pseudo-likelihood has its own second-order bias

−σ2Nˉ−1E{div⁡V+VT∇log⁡g},-\sigma^2\bar{N}^{-1}\mathbb{E}\{\operatorname{div}V+V^{T}\nabla\log g\},

with −V=−GATB-V=-GA^{T}B the velocity of the channel foot points; under Bernstein–von Mises conditions the same holds for the hierarchical posterior mean. The bias vanishes for the correct population, but it involves the population score in the directions of the weakly identified channels. In our design the second-order coefficient is 1.7–7.1 times the fixed-effects coefficient for Gaussian-mixture populations, although at realistic noise levels the realized bias is damped well below this first-order value. The analytic correction, in contrast, needs no population model.

Scope and contributions

The contribution lies in the combination of three features that template-estimation and incidental-parameter results do not cover jointly: the channels are heterogeneous manifolds that move with the shared input, the number of frames per channel is fixed so that the bias is an expansion in the noise level rather than in a per-unit sample size, and physical constraints make channels accumulate on boundary faces. Sections 3–4.2 connect frame-level identification to an invariant curvature-bias expansion and a feasible correction at fixed frame count, and Section 4.4 distinguishes boundary atoms from continuous accumulation near a face. Section 5 contrasts the population-score bias of integrated likelihood under a fixed working density. A covariance-aware extension (§ 4.3) permits dense Gaussian dependence, separates marginal bias from cross-channel uncertainty and gives an explicit sufficient covariance-calibration experiment. External calibration (§ 6) gives an additional limit. The numerical work tests the small-noise predictions in two prespecified studies of a compact-population design, the second with the computed estimator (domain, input chart and regular-set correction) fixed in advance; it separates bias from variance and from optimization error, records where the correction falls short at moderate noise, and illustrates the failure of two ad hoc averaging approximations in this heterogeneous design. The real-data example illustrates sensitivity rather than calibrated inference.

Table 1 summarizes the closest results. Inconsistency of maximum likelihood with incidental parameters goes back to Neyman and Scott [33]; Kiefer and Wolfowitz [28] showed that treating them as draws from an unknown distribution restores consistency, and Lancaster [30] reviews the econometric literature. Analytic and jackknife corrections for nonlinear panels [19, 5] and modified profile likelihoods [39] remove biases of order 1/T1/T when each unit has T→∞T \to\infty observations; here nn is fixed and the expansion is in the noise level. Their large-TT guarantees do not directly cover this fixed-nn experiment. Splitting the frames can also remove the endpoint information required by our identification conditions; we do not establish that every possible jackknife construction must fail. Small-noise biases of orthogonal-distance estimators are known in several special settings: the essential bias σ2/(2ϱ)\sigma^2/(2\varrho) of geometric circle fits [2], hyperaccurate corrections in geometric computer vision [27], nonlinear orthogonal regression [14] and principal curves [20]. Closest to Theorem 4.2 is the template-estimation literature: Miolane, Holmes and Pennec [31] show that the Fréchet mean in a quotient by an isometric group action has asymptotic bias −(σ2/2)H-(\sigma^2/2)H, with HH the trace of the second fundamental form (unnormalized mean curvature vector) of the template orbit, and correct it by an iterative bootstrap; Devilliers et al. [12] and Bigot and Charlier [8] study inconsistency in related settings. There, all observations lie on one orbit of a group that acts by isometries, so every observation carries the same geometry. Our channels are different manifolds that move with the shared parameter, individual channels may be weakly informative, and the bias is the Nˉ\bar{N}-weighted regression of their curvatures on their normal velocities. The scalar example below shows that the order of pooling and inversion matters even when every single-channel information matrix has condition number one. The PET comparisons in § 7 are illustrative approximations, not implementations of the bootstrap methods in the template literature. General-covariance geometric bias is also established [26, 37]. Our extension derives a uniform correction and studentization theorem for heterogeneous fixed-frame arrays under Gaussian dependence; it does not claim the first covariance-dependent bias calculation. Boundary accumulation, population-score expansion and frame-level identification provide further results. These distinctions specify the extension beyond that literature rather than a claim that curvature-induced bias itself is new. Kumon and Amari [29] study the differential geometry of estimating functions with many nuisance parameters in exponential families. Curvature in nonlinear regression and its effect on a single fit are classical [9, 7, 10]; Huang and He [23] review the intrinsic and parameter-effects curvature measures and their effect on Wald inference. For regularized low-rank matrix models, Huang et al. [24] use a curvature bound for the fixed-rank manifold, proportional to the inverse smallest nonzero singular value, to control estimation error. Here the curvature enters the leading incidental-parameter bias. The algebraic arguments relate to multichannel blind identification [32, 1] (Xu et al. 1995). For multi-region PET, Holler, Morina and Schramm [21] prove that noiseless point measurements from several regions identify the irreversible two-tissue parameters and the input up to a common scale, with a consistency result for Tikhonov-regularized estimation as the noise vanishes with a fixed number of regions, and Holler, Morina and Schramm (2025) extend this to reversible kinetics. Section 3 overlaps with these results; it differs in using a rational-multiplier argument that covers a delayed input with a repeated pole and a direct vascular term, in working with frame integrals, and in treating local rank. The statistical results, which concern R→∞R \to\infty channels with fixed frames, are not addressed there. Boundary parameters are well studied for a fixed number of parameters ([40, 3]); their accumulation in an incidental-parameter problem appears not to have been described. The empirical study of Ogden et al. [34] found a systematic bias of SIME for $1FDG and suggested that more regions with distinct kinetics might help; Theorem 4.2 identifies a mechanism, present even under correct specification, that more channels at fixed noise cannot remove, and § 7 shows that misspecification can produce larger shifts. The powers R\sigma^2andandR\sigma^6$ follow by comparing bias orders with the standard error; they are not asserted to be minimax phase boundaries.

WorkSetting and resultThis paper
Incidental-parameter panels ([19, 5, 39])T→∞T \to\infty observations per unit; bias O(1/T)O(1/T), analytic and jackknife correctionsnn fixed; expansion in the noise level σ\sigma; regime Rσ2R\sigma^2
Geometric fitting ([2, 26, 27])points on one curve; essential bias σ2/(2ϱ)\sigma^2/(2\varrho) for circlesheterogeneous moving manifolds; covariance-aware correction with dense Gaussian dependence (Theorem 4.7)
Template estimation ([31])isometric group action, all observations on one orbit; bias −(σ2/2)H-(\sigma^2/2)H; bootstrap correctionnon-isometric channel manifolds, individual channels may be weakly informative; bias −σ22Nˉ−1mˉ-\frac{\sigma^2}{2}\bar{N}^{-1}\bar{m} is an information-weighted regression; analytic one-step correction with Rσ6→0R\sigma^6 \to0; order-σ\sigma bias with nonzero boundary forcing; population-score expansion
Multi-region PET identification ([21, 22])noiseless point samples identify two-tissue kinetics and the input up to scale; Tikhonov consistency as noise vanishes with fixed regionsrational-multiplier proof with delay, repeated input pole and vascular term; frame integrals and local rank; inconsistency of joint estimation as R→∞R \to\infty at fixed noise
SIME ([16, 41, 34])joint estimation of input and kinetics; systematic bias observed empiricallya correctly specified bias mechanism that more channels cannot remove; misspecification shifts compared
Random effects ([28])unrestricted mixing distribution gives consistencyframe-level support condition (Proposition S8.1); second-order bias of parametric populations (Theorem 5.1)

Table 1. Closest results and what this paper adds.

Multichannel experiments with a shared input

For channel r=1,…,Rr=1,\ldots,R, consider the causal linear compartment system

x˙r(t)=Ω(θr)xr(t)+b(θr)uϕ(t),xr(0)=0,fr(t)=c(θr)Txr(t)+vruϕ(t),(1)\dot{x}_r(t)=\Omega(\theta_r)x_r(t)+b(\theta_r)u_\phi(t),\qquad x_r(0)=0,\qquad f_r(t)=c(\theta_r)^{T}x_r(t)+v_r u_\phi(t), \tag*{(1)}

with a matrix Ω(θr)\Omega(\theta_r) whose eigenvalues have nonpositive real parts, transfer function Hr(z)=vr+c(θr)T{zI−Ω(θr)}−1b(θr)H_r(z)=v_r+c(\theta_r)^T\{zI-\Omega(\theta_r)\}^{-1}b(\theta_r) and input uϕu_\phi. For frame boundaries 0=t0<⋯<tn0=t_0<\cdots<t_n, the observed frame means are

yr=Fr(θr,ϕ0)+σsrεr∈Rn,Fr(θ,ϕ)i=writi−ti−1∫ti−1tifr(t;θ,ϕ) dt,(2)y_r=F_r(\theta_r,\phi_0)+\sigma s_r\varepsilon_r\in\mathbb{R}^{n},\qquad F_r(\theta,\phi)_i=\frac{w_{ri}}{t_i-t_{i-1}}\int_{t_{i-1}}^{t_i}f_r(t;\theta,\phi)\,\mathrm{d}t, \tag*{(2)}

where wri>0w_{ri}>0 are known whitening weights, sr>0s_r>0 is a channel noise scale and εr\varepsilon_r has identity covariance. Channel types ζr=(θr,sr,wr)\zeta_r=(\theta_r,s_r,w_r) are independent and identically distributed. The errors εr\varepsilon_r are independent and identically distributed across channels and independent of all channel types. § 4.3 replaces this assumption by a specified Gaussian covariance model, allowing dependence between channels. We consider R→∞R\to\infty with nn fixed and, in § 4.2, σ→0\sigma\to0 jointly with RR.

Two-tissue channels with a Feng input

Irreversible trapping permits a zero eigenvalue; asymptotic stability is therefore not required. Laplace transforms are taken in a right half-plane where they exist. For a reversible two-tissue system with fractional blood volume v∈(0,1)v\in(0,1),

H(z)=v+(1−v)K1z+k3+k4z2+(k2+k3+k4)z+k2k4;(3)H(z)=v+(1-v)K_1\frac{z+k_3+k_4}{z^2+(k_2+k_3+k_4)z+k_2k_4}; \tag*{(3)}

here the same input drives tissue exchange and the vascular term. The irreversible model used for [18{}^{18}F]fluorodeoxyglucose ([18{}^{18}F]FDG) has k4=0k_4=0, a pole at z=0z=0, and net influx rate Ki=K1k3/(k2+k3)K_i=K_1k_3/(k_2+k_3).

Plasma and whole blood

Tissue exchange is driven by the arterial plasma concentration CpC_p, whereas the vascular term contains whole blood CbC_b, and an aortic image-derived input measures CbC_b. If Cb=ϱCpC_b=\varrho C_p with constant ϱ>0\varrho>0, writing the model with plasma input gives vascular coefficient v′=vϱv'=v\varrho and tissue coefficient (1−v)K1(1-v)K_1. To keep the normalized form (3) one must also set K1′=(1−v)K1/(1−vϱ)K'_1=(1-v)K_1/(1-v\varrho), provided vϱ<1v\varrho<1; merely replacing vv is incorrect. Alternatively, using whole blood as the input retains vv and replaces K1K_1 by K1/ϱK_1/\varrho. The rates k2,k3,k4k_2,k_3,k_4 are unchanged, whereas KiK_i depends on this convention and on calibration. If vϱ≥1v\varrho\ge1, the plasma representation remains valid in free macro coefficients but not with a physical fractional blood volume. A time-varying ratio ϱ(t)\varrho(t) makes every channel a two-input system, outside the classes of § 3; we treat it, together with reversible kinetics, channel-specific delays and dispersion, as a stress test in § 7, where the analysis model is deliberately wrong. The Feng input [15] is

u(t)={(A1s−A2−A3)eλ1s+A2eλ2s+A3eλ3s}1{s>0}u(t)=\{(A_1s-A_2-A_3)e^{\lambda_1s}+A_2e^{\lambda_2s}+A_3e^{\lambda_3s}\}1\{s>0\}, s=t−τs=t-\tau, with λj<0\lambda_j<0 and transform

U(z)=e−τz{A1(z−λ1)2−A2+A3z−λ1+A2z−λ2+A3z−λ3}.U(z)=e^{-\tau z}\left\{\frac{A_1}{(z-\lambda_1)^2}-\frac{A_2+A_3}{z-\lambda_1}+\frac{A_2}{z-\lambda_2}+\frac{A_3}{z-\lambda_3}\right\}.

For every c>max⁡rvrc>\max_r v_r the transformation

u~=cu,v~r=vr/c,K~1r=K1r1−vrc−vr,k~jr=kjr(j=2,3,4)(4)\widetilde{u}=cu,\qquad\widetilde{v}_r=v_r/c,\qquad\widetilde{K}_{1r}=K_{1r}\frac{1-v_r}{c-v_r},\qquad\widetilde{k}_{jr}=k_{jr}\quad(j=2,3,4) \tag*{(4)}

leaves every output unchanged. Thus the input scale is not identified, the fraction k3/(k2+k3)k_3/(k_2+k_3) and all rate constants are scale free, and KiK_i moves by the factor (1−vr)/(c−vr)(1-v_r)/(c-v_r). We remove the scale by a gauge, a slice Φ\Phi of input parameters transversal to the orbits of (4); for the Feng input we fix A1A_1 and write ϕ=(τ,log⁡A2,log⁡A3,log⁡∣λ1∣,log⁡∣λ2∣,log⁡∣λ3∣)\phi=(\tau,\log A_2,\log A_3,\log|\lambda_1|,\log|\lambda_2|,\log|\lambda_3|). For statistical estimation we use positive amplitudes and an ordered chart, λ2<λ3<0\lambda_2<\lambda_3<0, with all poles distinct; otherwise swapping (A2,λ2)(A_2,\lambda_2) and (A3,λ3)(A_3,\lambda_3) leaves the input unchanged. A sufficient physically positive subfamily has λ1<λ2<λ3<0\lambda_1<\lambda_2<\lambda_3<0. Smooth local theory additionally restricts the delay to an interval strictly between two frame boundaries. Frame integration does not make the delayed onset six times differentiable across a boundary. These are restrictions of the statistical parameter space, not consequences of the algebraic theorem.

Identification

The admissible multiplier

Proposition 3.1 (Observational equivalence). Suppose HrU=H~rU~H_rU=\widetilde{H}_r\widetilde{U} for every channel, where all nonzero Hr,H~rH_r,\widetilde{H}_r are rational and U,U~U,\widetilde{U} are nonzero transforms. Then there is a nonzero rational function QQ with

U~=QU,H~r=Hr/Q(r=1,…,R).(5)\widetilde{U}=QU,\qquad\widetilde{H}_r=H_r/Q\quad(r=1,\ldots,R). \tag*{(5)}

Conversely, every QQ for which QUQU and Hr/QH_r/Q remain in the specified input and channel classes produces identical outputs. The transfer functions are identified up to scale exactly when every admissible multiplier is constant.

Supplement, Example S1.1, gives four positive-system counterexamples illustrating the role of the input pole budget and common channel poles and zeros.

Identification by pole separation

For a set Λ⊂C\Lambda\subset\mathbb{C}, write Up(Λ)\mathcal{U}_p(\Lambda) for the inputs whose transform is e−τzN(z)/D(z)e^{-\tau z}N(z)/D(z) with τ∈R\tau\in\mathbb{R}, DD monic of degree at most pp with all roots in Λ\Lambda, and N≠0N\ne0 of degree less than deg⁡D\deg D; and Hn,q\mathcal{H}_{n,q} for the rational channels N/DN/D with DD monic of degree at most nn and deg⁡N≤q≤n\deg N\le q\le n. Representations are in lowest terms.

Theorem 3.2 (Identification by pole separation). Let U=e−τzNU/DU∈Up(Λ)U=e^{-\tau z}N_U/D_U\in\mathcal{U}_p(\Lambda) and nonzero Hr=Nr/Dr∈Hnr,qrH_r=N_r/D_r\in\mathcal{H}_{n_r,q_r}, r=1,…,Rr=1,\ldots,R, satisfy

(i) deg⁡DU=p\deg D_U=p and deg⁡Dr=nr\deg D_r=n_r for every rr;

(ii) deg⁡Nr∗=qr∗\deg N_{r_*}=q_{r_*} for at least one channel r∗r_*;

(iii) the polynomials D1,…,DRD_1,\ldots,D_R have no common root in Λ\Lambda;

(iv) the polynomials N1,…,NRN_1,\ldots,N_R have no common root;

(v) gcd⁡(NU,Dr)=gcd⁡(Nr,DU)=1\gcd(N_U,D_r)=\gcd(N_r,D_U)=1 for every rr.

If U~∈Up(Λ)\widetilde{U}\in\mathcal{U}_p(\Lambda) and H~r∈Hnr,qr\widetilde{H}_r\in\mathcal{H}_{n_r,q_r} satisfy H~rU~=HrU\widetilde{H}_r\widetilde{U}=H_rU for every rr, then U~\widetilde{U} has delay τ\tau, and there is a constant c≠0c\ne0 with U~=cU\widetilde{U}=cU and H~r=Hr/c\widetilde{H}_r=H_r/c.

With Λ=C\Lambda=\mathbb{C} this is the usual pole-separation condition. Conditions (i)–(iv) cannot be dropped: Supplement Example S1.1(b) violates only the attainment of the input budget, (c) only (iii) and (d) only (iv); the supplement gives constructions for the channel half of (i) and for (ii). With R=1R=1, if the channel has a real pole ρ∈Λ\rho\in\Lambda and DUD_U a distinct real root ρU\rho_U, the multiplier Q=(z−ρU)/(z−ρ)Q=(z-\rho_U)/(z-\rho) is admissible, so a single channel does not identify the input shape in these unrestricted rational classes. This construction need not preserve the narrower positive Feng family. The proof (Supplement S1) compares the root multiplicities of output denominators and numerators.

Corollary 3.3 (Reversible two-tissue channels). Let R≥2R\ge2. Consider Feng inputs with A1A2A3≠0A_1A_2A_3\ne0 and distinct λ1,λ2,λ3<0\lambda_1,\lambda_2,\lambda_3<0 and channels (3) with (vr,K1r,k2r,k3r,k4r)∈(0,1)×(0,∞)4(v_r,K_{1r},k_{2r},k_{3r},k_{4r})\in(0,1)\times(0,\infty)^4. Outside a Lebesgue-null set of parameters, any Feng input and channels of the form (3) that reproduce all outputs have the same delay and are related by (4).

Corollary 3.4 (Irreversible two-tissue channels). The conclusion of Corollary 3.3 holds for channels (3) with k4r=0k_{4r}=0 and (vr,K1r,k2r,k3r)∈(0,1)×(0,∞)3(v_r,K_{1r},k_{2r},k_{3r})\in(0,1)\times(0,\infty)^3, among alternative channels of the form (3) with k4r≥0k_{4r}\ge0; in particular, no Feng input with reversible channels reproduces the outputs.

For irreversible channels all denominators z(z+k2r+k3r)z(z+k_{2r}+k_{3r}) share the root 00, so condition (iii) fails with Λ=C\Lambda=\mathbb{C}; it holds with Λ={ℜz<0}\Lambda=\{\Re z<0\}, which contains every Feng pole. The exceptional sets are zero sets of products of resultants, nonzero at certified rational points (Supplement, Table S1). The next example shows that restricting Λ\Lambda is essential.

Example 3.5 (Trapping versus a non-decaying input). Let uu be any input and the channels irreversible with vr=0v_r=0. For 0<γ<min⁡rk3r0<\gamma<\min_r k_{3r}, the input u~(t)=u(t)+γ∫0tu\widetilde{u}(t)=u(t)+\gamma\int_0^t u and the reversible channels with

K~1r=K1r,k~2r=k2r+γ,k~3r=k2r(k3r−γ)k2r+γ,k~4r=γ(k2r+k3r)k2r+γ\widetilde{K}_{1r}=K_{1r},\qquad\widetilde{k}_{2r}=k_{2r}+\gamma,\qquad\widetilde{k}_{3r}=\frac{k_{2r}(k_{3r}-\gamma)}{k_{2r}+\gamma},\qquad\widetilde{k}_{4r}=\frac{\gamma(k_{2r}+k_{3r})}{k_{2r}+\gamma}

produce the same outputs; with vr>0v_r>0 an analogous map exists for small γ\gamma (Supplement S1.5). Here U~(z)=U(z)(z+γ)/z\widetilde{U}(z)=U(z)(z+\gamma)/z has a pole at 00.

Within the Feng class the exact equivalence is excluded. A slowly decaying Feng component can nevertheless resemble a persistent component over a finite scan, suggesting weak numerical separation between slow input dynamics and channel reversibility; no uniform approximation of the full transformed input by the Feng family is claimed. For the study analysed in Supplement S30, 1/∣λ3∣=811/\lvert\lambda_3\rvert=81 min exceeds the scan length.

Finite frames

Theorem 3.2 and its corollaries compare complete curves, whereas the data are frame means. For two-tissue channels and the Feng input both inputs and outputs are exponential polynomials, and a classical zero count transfers identification from curves to frames. A real exponential polynomial is E(t)=∑jpj(t)eμjtE(t)=\sum_j p_j(t)e^{\mu_jt} with distinct real μj\mu_j and real polynomials pj≠0p_j\ne0. Its order ∑j(deg⁡pj+1)\sum_j(\deg p_j+1) is the order of the smallest constant-coefficient differential equation it solves. A nonzero exponential polynomial of order MM has at most M−1M-1 real zeros, counted with multiplicity [35 Part V, Problem 75]. Say that a model has exponential orders (pU,pH)(p_U,p_H) if every input vanishes before its onset τ≥0\tau\ge0 and is u(τ+s)=g(s)u(\tau+s)=g(s) for s≥0s\ge0, with gg of order at most pUp_U, real exponents and g(0)=0g(0)=0, and every channel has impulse response vδ0+κv\delta_0+\kappa with κ\kappa of order at most pHp_H and real exponents. Then the channel curve is fr(τ+s)=hr(s)=vrg(s)+(κr∗g)(s)f_r(\tau+s)=h_r(s)=v_rg(s)+(\kappa_r*g)(s), which we continue to all real ss as an exponential polynomial. The Feng input has pU=4p_U=4. Two-tissue channels, reversible or irreversible, have real poles and pH=2p_H=2, and so do the macro channels of § 7.

Theorem 3.6 (Finite frames). Consider a model with exponential orders (pU,pH)(p_U,p_H), delays in [τ−,τ+][\tau_-,\tau_+], and frame endpoints that include at least m∗=2(pU+pH)+1m^*=2(p_U+p_H)+1 points in [τ+,∞)[\tau_+,\infty).

(a) If two parameter values give equal frame means in channel rr, their curves agree on [τ+,∞)[\tau_+,\infty) and h~r(s)=hr(s+τ~−τ)\widetilde{h}_r(s)=h_r(s+\widetilde{\tau}-\tau) for all real ss.

(b) Suppose further that one true curve is positive on (0,τ+−τ−](0,\tau_+-\tau_-] and that the continuations h1,…,hRh_1,\ldots,h_R have no common zero in [−(τ+−τ−),0)[-(\tau_+-\tau_-),0). Then equal frame means in all channels imply τ~=τ\widetilde{\tau}=\tau and equal complete curves. In particular, the conclusions of Theorem 3.2 and Corollaries 3.3–3.4 hold for frame means, against alternatives in the same model of exponential orders.

(c) On an open real-analytic parameter chart with locally bounded real exponents and onset strictly inside a fixed frame, for any tangent direction ξ\xi, the derivative of the frame means along ξ\xi vanishes if and only if the derivative of every complete curve vanishes at all times other than its onset.

The proof (Supplement S4) applies the zero count to differences of cumulative curves, which frame means determine. Part (b) excludes an earlier alternative onset whose curves continue the true curves backwards. When alternative curves are nonnegative, it suffices, in place of the common-zero condition, that one true channel has vr>0v_r>0 and g′(0)>0g'(0)>0, because that curve then rises with positive slope at its onset. The bound m∗m^* is not claimed to be sharp. Part (c) reduces local rank for frames to an infinitesimal version of Theorem 3.2. In the next proposition δU\delta U and δHr\delta H_r denote first-order variations of the transforms, and the delay variation enters through δU=e−τz{−z δτ NU/DU+δ(NU/DU)}\delta U=e^{-\tau z}\{-z\,\delta\tau\,N_U/D_U+\delta(N_U/D_U)\}.

Proposition 3.7 (Infinitesimal identification). Assume conditions (i)–(v) of Theorem 3.2, and consider variations tangent to the classes: deg⁡δDU<deg⁡DU\deg\delta D_U<\deg D_U, deg⁡δNU≤deg⁡NU\deg\delta N_U\le\deg N_U, deg⁡δDr<nr\deg\delta D_r<n_r and deg⁡δNr≤qr\deg\delta N_r\le q_r. If HrδU+UδHr=0H_r\delta U+U\delta H_r=0 for every rr, then δτ=0\delta\tau=0, δDU=0\delta D_U=0, δDr=0\delta D_r=0, and δNU=cNU\delta N_U=cN_U, δNr=−cNr\delta N_r=-cN_r for a constant cc.*

Two degree conditions carry the delay step. The input numerator must keep its degree, and the channel r∗r^* of condition (ii) must attain its numerator degree. For the Feng input, deg⁡NU=2\deg N_U=2 exactly when g′(0)=A1+A2(λ2−λ1)+A3(λ3−λ1)≠0g'(0)=A_1+A_2(\lambda_2-\lambda_1)+A_3(\lambda_3-\lambda_1)\ne0, which holds for positive amplitudes when λ1<λ2,λ3\lambda_1<\lambda_2,\lambda_3. For two-tissue and macro channels, the numerator degree is attained exactly when vr≠0v_r\ne0. If either condition fails, a delay change can be absorbed by the amplitudes.

Corollary 3.8 (Frame-level conditions for two-tissue channels). Let the input be Feng with A1A_1 fixed, positive amplitudes, λ1<λ2<λ3<0\lambda_1<\lambda_2<\lambda_3<0, and delays in [τ−,τ+][\tau_-,\tau_+]. Let the channels be reversible or irreversible two-tissue channels with vr∈(0,1)v_r\in(0,1) and positive rates, or macro channels with vr,a1r,a2r≠0v_r,a_{1r},a_{2r}\ne0 and βr>0\beta_r>0. Suppose at least 13 frame endpoints lie in [τ+,∞)[\tau_+,\infty), and the condition of Theorem 3.6(b) holds. For every set of channels containing two channels outside the exceptional null sets of Corollaries 3.3–3.4, defined for macro channels by the same products of resultants in macro coordinates:

  1. frame means determine the delay, the input shape and every channel among Feng inputs in the chart and channels with at most two real poles (in the rational classes of Theorem 3.2), in particular the unconstrained macro extension;

  2. the stacked frame Jacobian in (ϕ,θ1,…,θR)(\phi,\theta_1,\ldots,\theta_R) has full column rank. Hence every channel Jacobian ∂θFr\partial_{\theta}F_r has full column rank, and the information matrix ∑rBrT(I−Pr)Br\sum_r B_r^{\mathsf T}(I-P_r)B_r of § 4 is positive definite.

Consequently, for a channel-type law on a compact set of such types that charges every neighbourhood of two generic types, and whose support contains a type with continued curve negative on [−(τ+−τ−),0)[-(\tau_+-\tau_-),0) and a type with curve positive on (0,τ+−τ−](0,\tau_+-\tau_-], parts (c) and (d) of Assumption 4.1 in § 4 hold: each channel is identified given the input, N‾>0\overline{N}>0, and Q0Q_0 vanishes only at ϕ0\phi_0.

The 35 frames of the study of Supplement S30 place 13 endpoints after every onset up to 10 min and 31 at or after the end of the frame containing the reference onset, so the delay chart is that frame, of width L=1/12L=1/12 min. For condition (b) an analytic certificate replaces pointwise evaluation. If the input continuation satisfies g′>0g'>0 on [−L,0][-L,0], then g<0g<0 and ∣g∣|g| is decreasing towards the onset there, and for an irreversible two-tissue channel with b=k2+k3b=k_2+k_3 the continuation obeys

h(s)≤−{v−(1−v)K1LebL}∣g(s)∣(−L≤s<0),(6)h(s)\le-\{v-(1-v)K_1L e^{bL}\}|g(s)| \qquad(-L\le s<0), \tag*{(6)}

where κ(x)=(1−v)K1(k3+k2e−bx)/b\kappa(x)=(1-v)K_1(k_3+k_2e^{-bx})/b is the continued tissue impulse response, 0<κ(x)≤(1−v)K1ebL0<\kappa(x)\le(1-v)K_1e^{bL} on [−L,0][-L,0], and the convolution is continued by the oriented integral, so that the tissue part (κ∗g)(s)=∫0sκ(s−t)g(t) dt=−∫s0κ(s−t)g(t) dt(\kappa\ast g)(s) = \int_{0}^{s} \kappa(s-t)g(t)\,\mathrm{d}t = -\int_{s}^{0} \kappa(s-t)g(t)\,\mathrm{d}t is nonnegative and at most (1−v)K1ebL∣g(s)∣(1-v)K_1e^{bL}|g(s)|. Hence h<0h<0 on [−L,0)[-L,0) whenever v>(1−v)K1LebLv>(1-v)K_1Le^{bL}, and one such channel type excludes a common zero. For positive Feng amplitudes with λ1<λ2<λ3<0\lambda_1<\lambda_2<\lambda_3<0, g′>0g^\prime>0 for s≤0s\leq0 and g>0g>0 for s>0s>0 follow directly from the exponential terms (Supplement S4.4). The certificate holds for four of the eight organ parameter sets of the XCAT phantom used in § 7, for instance the lungs, where (1−v)K1LebL=0.020<v=0.087(1-v)K_1Le^{bL}=0.020<v=0.087 (Supplement S4.4). It concerns the simulation population, not the voxels. Under these conditions the identification and rank parts of Assumption 4.1 follow for the actual frames; the smoothness part still requires the delay to stay inside one frame.

Corollary 3.8 is a statement of structural identification: no two parameter values give the same frame means. It does not bound the conditioning, which governs estimation. On the compact set of channel types of the corollary, λmin⁡(ArTAr)\lambda_{\min}(A_r^{T}A_r) is a continuous positive function of the type, and λmin⁡(N‾)\lambda_{\min}(\overline{N}) a continuous positive function of the delay over a closed subinterval of the chart, so both are bounded below uniformly; but the bounds can be small. For the eight XCAT organ means and delays across the interior of the chart, λmin⁡(N‾)\lambda_{\min}(\overline{N}) ranges over [0.0008,0.0025][0.0008,0.0025] and the condition number of N‾\overline{N} over [6.9,43.3]×103[6.9,43.3]\times10^3, while min⁡rλmin⁡(ArTAr)≥0.123\min_r\lambda_{\min}(A_r^{T}A_r)\geq0.123 (Supplement S4.4). Weak numerical identification, a nearly flat criterion in a direction that is identified in principle, is therefore expected along the slow input components, and it is distinct from structural nonidentification, for which the criterion would be exactly flat.

Information for the input shape and scale

Consider the exact whitened tangent experiment Yr=Arar+Brh+εrY_r=A_ra_r+B_rh+\varepsilon_r, Z=Ch+ξZ=Ch+\xi, with independent standard Gaussian noises, unrestricted channel nuisance ara_r, and common input perturbation h∈Rqh\in\mathbb{R}^q. Let PrP_r be the orthogonal projection onto col⁡(Ar)\operatorname{col}(A_r) and NR=∑r=1RBrT(I−Pr)BrN_R=\sum_{r=1}^{R}B_r^{T}(I-P_r)B_r.

Proposition 3.9 (Profile information). The efficient information for hh is Ih=CTC+NRI_h=C^{T}C+N_R. If Brh0∈col⁡(Ar)B_rh_0\in\operatorname{col}(A_r) for every rr and Ch0=0Ch_0=0, then h0h_0 is unidentifiable for every RR.

The scale symmetry (4) differentiates into a vector ee with Bre∈col⁡(Ar)B_re\in\operatorname{col}(A_r) for all rr.

Proposition 3.10 (Shape information grows, scale information does not). Suppose Bre∈col⁡(Ar)B_re\in\operatorname{col}(A_r) for every rr, for a unit vector ee, and IhI_h is invertible. For the efficient least-squares estimator of Proposition 3.9, NR=0N_R=0 and

var⁡(gTh^)=gTIh−1g≥(gTe)2∥Ce∥2(g∈Rq, R≥1).(7)\operatorname{var}(g^{T}\widehat{h})=g^{T}I_h^{-1}g\geq\frac{(g^{T}e)^2}{\lVert Ce\rVert^2}\qquad(g\in\mathbb{R}^q,\ R\geq1). \tag*{(7)}

If (Ar,Br)(A_r,B_r) are independent copies of (A,B)(A,B) with E∥B∥F2<∞\mathbb{E}\lVert B\rVert_F^2<\infty and N‾=E{BT(I−PA)B}\overline{N}=\mathbb{E}\{B^{T}(I-P_A)B\} is positive definite on e⊥e^\perp, then RgTIh−1g→gTN‾+gR g^{T}I_h^{-1}g\to g^{T}\overline{N}^{+}g for g⊥eg\perp e, with N‾+\overline{N}^{+} the Moore–Penrose inverse, and eTIh−1e→∥Ce∥−2e^{T}I_h^{-1}e\to\lVert Ce\rVert^{-2}.

Its restriction to the gauge slice Φ\Phi reappears below as the curvature of the profiled criterion.

Incidental channels and the curvature bias

The joint estimator and its pseudo-true value

The joint, or fixed-effects, least-squares estimator solves

(Φ^R,θ^1,…,θ^R)∈arg min⁡ϕ∈Φ, θr∈Θ ∑r=1R∥yr−Fr(θr,ϕ)∥2.(8)(\widehat{\Phi}_R,\widehat{\theta}_1,\ldots,\widehat{\theta}_R)\in\underset{\phi\in\Phi,\ \theta_r\in\Theta}{\operatorname{arg\,min}}\ \sum_{r=1}^{R}\lVert y_r-F_r(\theta_r,\phi)\rVert^2. \tag*{(8)}

It is the estimator of SIME and of joint blind identification. Profiling the channels, ϕ^R∈arg⁡min⁡ϕ∑rρr(yr,ϕ)\widehat{\phi}_{R} \in\underset{\phi}{\arg\min}\sum_r \rho_r(y_r,\phi) with

ρr(y,ϕ)=min⁡θ∈Θ∥y−Fr(θ,ϕ)∥2=dist⁡2{y,Mr(ϕ)},Mr(ϕ)=Fr(Θ,ϕ).(9)\rho_r(y,\phi)=\min_{\theta\in\Theta}\|y-F_r(\theta,\phi)\|^2=\operatorname{dist}^2\{y,\mathcal{M}_r(\phi)\},\qquad\mathcal{M}_r(\phi)=F_r(\Theta,\phi). \tag*{(9)}

The channel manifold Mr(ϕ)\mathcal{M}_r(\phi) is the set of noise-free curves that channel rr can produce with input ϕ\phi. Write ρ(y,ϕ)\rho(y,\phi), F(θ,ϕ)F(\theta,\phi) for a generic channel and Qσ(ϕ)=Eρ(y,ϕ)Q_\sigma(\phi)=\mathbb{E}\rho(y,\phi) for the expected criterion.

At the true curve xr=Fr(θr,ϕ0)x_r=F_r(\theta_r,\phi_0) define Ar=∂θFrA_r=\partial_\theta F_r (n×pn\times p), Br=∂ϕFrB_r=\partial_\phi F_r (n×qn\times q), Gr=(ArTAr)−1G_r=(A_r^{T}A_r)^{-1}, Pr=ArGrArTP_r=A_rG_rA_r^{T} and

κr=∑j,k=1p(Gr)jk∂θjθk2Fr,hr=(I−Pr)κr,Nr=BrT(I−Pr)Br,mr=BrThr.(10)\kappa_r=\sum_{j,k=1}^{p}(G_r)_{jk}\partial^2_{\theta_j\theta_k}F_r,\qquad h_r=(I-P_r)\kappa_r,\qquad N_r=B_r^{T}(I-P_r)B_r,\qquad m_r=B_r^{T}h_r. \tag*{(10)}

In the coordinates θ\theta, the second fundamental form of Mr(ϕ0)\mathcal{M}_r(\phi_0) at xrx_r is II⁡(a,b)=(I−Pr)∂θ2Fr[a,b]\operatorname{II}(a,b)=(I-P_r)\partial^2_\theta F_r[a,b], and hr=∑jk(Gr)jkII⁡(ej,ek)h_r=\sum_{jk}(G_r)_{jk}\operatorname{II}(e_j,e_k) is its trace with respect to the induced metric ArTArA_r^{T}A_r: pp times the mean curvature vector. It depends on the manifold only. The tangential part PrκrP_r\kappa_r measures parameter-effects curvature [7]. The columns of (I−Pr)Br(I-P_r)B_r are the normal velocities of the channel manifold when the input moves. Put N‾=ENr\overline{N}=\mathbb{E}N_r and m‾=E(srmr)\overline{m}=\mathbb{E}(s_rm_r).

ASSUMPTION 4.1. (a) 1≤p<n1\le p<n, q≥1q\ge1, and Θ⊂Rp\Theta\subset\mathbb{R}^{p} and Φ⊂Rq\Phi\subset\mathbb{R}^{q} are compact; the channel types have compact support, the true channel parameters lie in a compact subset Θ0\Theta_0 of the interior of Θ\Theta, and ϕ0\phi_0 is interior to Φ\Phi.

(b) Fr(θ,ϕ)=F(θ,ϕ;wr)F_r(\theta,\phi)=F(\theta,\phi;w_r), where FF is six times continuously differentiable in (θ,ϕ)(\theta,\phi) on a neighbourhood of Θ×Φ\Theta\times\Phi, with derivatives bounded uniformly in ww and continuous in ww.

(c) (Channels given the input.) λmin⁡(ArTAr)≥c0>0\lambda_{\min}(A_r^{T}A_r)\ge c_0>0, and for every η>0\eta>0, inf⁡{∥Fr(θ,ϕ0)−xr∥:θ∈Θ, ∥θ−θr∥≥η}>0\inf\{\|F_r(\theta,\phi_0)-x_r\|:\theta\in\Theta,\ \|\theta-\theta_r\|\ge\eta\}>0, uniformly over channel types.

(d) (Input.) Q0(ϕ)=Edist⁡2{x,M(ϕ)}Q_0(\phi)=\mathbb{E}\operatorname{dist}^{2}\{x,\mathcal{M}(\phi)\} vanishes on Φ\Phi only at ϕ0\phi_0, and N‾\overline{N} is positive definite.

(e) (Noise.) εr\varepsilon_r is symmetric about zero, EεrεrT=In\mathbb{E}\varepsilon_r\varepsilon_r^{T}=I_n and Eexp⁡(t0∥εr∥2)<∞\mathbb{E}\exp(t_0\|\varepsilon_r\|^2)<\infty for some t0>0t_0>0.

Condition (d) is global identification in the finite-frame noise-free experiment: Q0(ϕ)=0Q_0(\phi)=0 means that almost every true channel curve can be reproduced with input ϕ\phi. Condition (c) asks that each channel be identified once the input is known. The continuous-curve theorem alone does not give either condition for frames. For Feng inputs in the ordered chart and two-tissue or macro channels, Corollary 3.8 derives both from the algebra under its stated conditions on the frames, the delay chart and the type law; the endpoint count alone does not suffice. For other models, (c) and (d) remain assumptions. The macro parameterization extends the physical channel manifold across v=0v=0 and k3=0k_3=0, so true channels with v,k3>0v,k_3>0 are interior. § 4.4 shows that imposing the physical boundaries in the joint fit changes the order of the bias. The data-generating law of the validation design in § 7 admits these conditions on suitable compact parameter sets; the computed fits are assessed separately from the exact constrained minimizers; the reference design, with unbounded log-normal channel draws, does not satisfy them literally, and the experiments report how often fits reach the solver box.

Theorem 4.2 (Curvature bias). Under Assumption 4.1, for every σ>0\sigma>0 the function QσQ_\sigma is continuous on Φ\Phi and, almost surely, every limit point of ϕ^R\widehat{\phi}_R lies in arg⁡min⁡Qσ\arg\min Q_\sigma. There are σ1>0\sigma_1>0 and C<∞C<\infty such that for 0<σ≤σ10<\sigma\le\sigma_1:

(i) every ϕˉ∈arg⁡min⁡Qσ\bar{\phi} \in\arg\min Q_{\sigma} satisfies

∥ϕˉ−ϕ0+σ22Nˉ−1mˉ∥≤Cσ4;(11)\left\|\bar{\phi}-\phi_0+\frac{\sigma^2}{2}\bar{N}^{-1}\bar{m}\right\|\leq C\sigma^4; \tag*{(11)}

(ii) uniformly over a neighbourhood of ϕ0\phi_0,

Qσ(ϕ)=Q0(ϕ)+σ2E[s2{n−p−⟨x−πϕ(x),hϕ(πϕx)⟩}]+O(σ4+σ2∥ϕ−ϕ0∥2),(12)Q_{\sigma}(\phi)=Q_0(\phi)+\sigma^2\mathbb{E}\left[s^2\{n-p-\langle x-\pi_{\phi}(x),h_{\phi}(\pi_{\phi}x)\rangle\}\right]+O\left(\sigma^4+\sigma^2\|\phi-\phi_0\|^2\right), \tag*{(12)}

where πϕ(x)\pi_{\phi}(x) is the point of M(ϕ)\mathcal{M}(\phi) nearest to the noise-free curve xx and hϕh_{\phi} is the curvature vector (10) of M(ϕ)\mathcal{M}(\phi).

The criterion (12) explains the mechanism. Without noise, every input ϕ\phi is penalized by the squared distance Q0(ϕ)Q_0(\phi) of the true curves from its channel manifolds, which is quadratic with Hessian 2Nˉ2\bar{N} at ϕ0\phi_0. Noise adds σ2(n−p)Es2\sigma^2(n-p)\mathbb{E}s^2, the part of the noise normal to the manifold, minus a correction that is linear in the displacement x−πϕ(x)x-\pi_{\phi}(x) and in the curvature: a manifold that bends towards the data captures more of the noise. The minimizer therefore moves in the direction in which the true curves come to lie on the concave side of their manifolds, by an amount set by the regression of the curvature on the normal input velocities. Symmetry of the noise removes the odd orders; with skewed noise the remainder in (11) is O(σ3)O(\sigma^3), with a leading term given by the third moments (Supplement, Remark S3.4).

Proposition 4.3 (Geometry of the bias). Under Assumption 4.1:

(a) (Invariance.) If θ=g(ϑ)\theta=g(\vartheta) for a C6C^6 diffeomorphism gg, the profiled criterion ∑rρr\sum_r\rho_r, hence ϕ^R\hat{\phi}_R and arg⁡min⁡Qσ\arg\min Q_{\sigma}, are unchanged, and so are hrh_r, NrN_r and mrm_r.

(b) (Flat channels.) Let Φ\Phi be compact, Fr(θ,ϕ)=ar(ϕ)+Xr(ϕ)θF_r(\theta,\phi)=a_r(\phi)+X_r(\phi)\theta with Θ=Rp\Theta=\mathbb{R}^p and Xr(ϕ)X_r(\phi) of full column rank uniformly on Φ\Phi, with ar,Xra_r,X_r continuous and bounded, and let εr\varepsilon_r have mean zero and identity covariance; assume also E∥xr∥2<∞\mathbb{E}\|x_r\|^2<\infty and Esr2<∞\mathbb{E}s_r^2<\infty; parts (a), (c) and (e) of Assumption 4.1 are not needed. Then Qσ(ϕ)=Q0(ϕ)+σ2(n−p)Es2Q_{\sigma}(\phi)=Q_0(\phi)+\sigma^2(n-p)\mathbb{E}s^2 for every σ\sigma; if Q0Q_0 vanishes only at ϕ0\phi_0, ϕ^R→ϕ0\hat{\phi}_R\to\phi_0 almost surely.

(c) (Minimal channels.) If hr=0h_r=0 almost surely, the σ2\sigma^2 term of (11) vanishes.

(d) (Channel bias.) For 0<σ≤σ10<\sigma\leq\sigma_1 and ϕˉ∈arg⁡min⁡Qσ\bar{\phi}\in\arg\min Q_{\sigma}, the channel estimate with the limiting input, θ∗(yr,ϕˉ)\theta^*(y_r,\bar{\phi}), the minimizer near θr\theta_r of ∥yr−Fr(θ,ϕˉ)∥\|y_r-F_r(\theta,\bar{\phi})\|, satisfies

E{θ∗(yr,ϕˉ)∣ζr}−θr=−σ22GrArT{sr2Prκr−BrNˉ−1mˉ}+O(σ4),(13)\mathbb{E}\{\theta^*(y_r,\bar{\phi})\mid\zeta_r\}-\theta_r=-\frac{\sigma^2}{2}G_rA_r^T\{s_r^2P_r\kappa_r-B_r\bar{N}^{-1}\bar{m}\}+O(\sigma^4), \tag*{(13)}

where the expectation is over the event, of probability 1−O(e−c/σ2)1-O(e^{-c/\sigma^2}), on which the minimizer is defined.

The first term of (13) is Box’s coordinate-dependent bias of a single nonlinear regression (Box, [9]; Cook, Tsai and Wei, [10]). Suitable local coordinates can eliminate it at a chosen point; a single global reparameterization need not remove it everywhere, and nonlinear target functionals can still be biased. The second is the input bias propagated through the channel, which depends on the intrinsic curvature of all channels and cannot. For the two-tissue model in its macro form F=vC+a1(C∗1)+a2(C∗e−βt)F=vC+a_1(C*1)+a_2(C*e^{-\beta t}), the channel is linear in (v,a1,a2)(v,a_1,a_2) and only the direction of β=k2+k3\beta=k_2+k_3 curves, so the curvature that matters is that of the curves as the washout rate changes; spectral models with fixed rates and unconstrained coefficients are flat and immune, whereas the nonnegativity constraints of Cunningham and Jones [11] and Gunn et al. [18] create boundaries, which change the order of the bias (Theorem 4.10).

Example 4.4 (Known special cases). (a) Circle fitting. Points yr=(a+ϱcos⁡θr,b+ϱsin⁡θr)+σϵry_r=(a+\varrho\cos\theta_r,b+\varrho\sin\theta_r)+\sigma\epsilon_r with angles uniform on the circle have n=2n=2, p=1p=1, ϕ=(a,b,ϱ)\phi=(a,b,\varrho), Nr=vrvrTN_r=v_rv_r^T and mr=−vr/ϱm_r=-v_r/\varrho with vr=(cos⁡θr,sin⁡θr,1)Tv_r=(\cos\theta_r,\sin\theta_r,1)^T, so Nˉ−1mˉ=−(0,0,1)T/ϱ\bar{N}^{-1}\bar{m}=-(0,0,1)^T/\varrho and the radius of the geometric fit converges to ϱ+σ2/(2ϱ)+O(σ4)\varrho+\sigma^2/(2\varrho)+O(\sigma^4), the essential bias of Al-Sharadqah and Chernov [2]. (b) Template orbits. If yr=grϕ+σϵry_r=g_r\phi+\sigma\epsilon_r with grg_r in a compact Lie group acting orthogonally on Rn\mathbb{R}^n, ϕ0\phi_0 has trivial stabilizer, and the template is parameterized in a neighbourhood of ϕ0\phi_0 in the normal slice ϕ0+Eψ\phi_0+E\psi of its orbit, then Nr=IqN_r=I_q and mr=ETh0m_r=E^Th_0, with h0h_0 the curvature vector of the orbit at ϕ0\phi_0, and (11) becomes −(σ2/2)ETh0-(\sigma^2/2)E^Th_0, Theorem 2 of Miolane, Holmes and Pennec [31]. Both are verified in Supplement, Section S3.4.

The two cases use symmetry differently. For template orbits every channel sees the same geometry, Nr=IqN_r=I_q and mr=ETh0m_r=E^Th_0, so the bias is that of a single orbit. In circle fitting the channel quantities are not identical: Nr=vrvrTN_r=v_rv_r^T has rank one and mr=−vr/ϱm_r=-v_r/\varrho depends on the angle, so no single point identifies the circle. All points lie on one manifold, however, and the rotations about the centre map the channel quantities into one another, so with uniform angles Nˉ\bar{N} and mˉ\bar{m} are averages over a single orbit of the group. With heterogeneous channels the leading bias −σ22(∑rNr)−1∑rsr2mr-\frac{\sigma^2}{2}\left(\sum_r N_r\right)^{-1}\sum_r s_r^2m_r is generally not the unweighted average of single-type biases. Individual NrN_r may be singular or poorly conditioned. Global ambiguity in the unrestricted rational class does not imply singular local information in the narrower Feng family: a single channel can have full local rank while retaining a discrete global ambiguity. In the design of § 7, at the eight XCAT organ means, the single-organ matrices NrN_r have condition numbers between 4×1034\times10^3 and 10810^8, so single-type biases are unstable or undefined, whereas the eight types together have condition number 1.2×1041.2\times10^4. The proof of Theorem 4.2 therefore cannot use the group structure or the quotient on which these arguments rest. It works instead with one profiled criterion that is uniform over channel types.

A well-conditioned reversal under pooling

Let n=2n=2, p=q=1p=q=1, sr=1s_r=1 and

F(θ,ϕ)=(θ,g(θ)+(1+θ)ϕ)T,g(θ)=θ4/4−5θ3/3+2θ2.F(\theta,\phi)=\left(\theta,g(\theta)+(1+\theta)\phi\right)^T,\qquad g(\theta)=\theta^4/4-5\theta^3/3+2\theta^2.

Take ϕ0=0\phi_0=0 and θr=0\theta_r=0 or 11 with equal probabilities, inside the compact channel set [−1/4,5/4][-1/4,5/4] and a compact input interval containing zero in its interior. At the two true types, A=(1,0)TA=(1,0)^T, (N,m)=(1,4)(N,m)=(1,4) and (4,−6)(4,-6), respectively. Thus the pooled coefficient is −12Nˉ−1mˉ=1/5-\frac{1}{2}\bar{N}^{-1}\bar{m}=1/5, whereas the average of individual coefficients is −12E(N−1m)=−5/8-\frac{1}{2}\mathbb{E}(N^{-1}m)=-5/8. Every scalar NN has condition number one. The first output identifies θ\theta and 1+θ>01+\theta>0 identifies ϕ\phi, so the example satisfies the identification conditions. The reversal is caused by information weighting, without singular inverses. It illustrates a distinction between two algebraic operations, not the performance of an existing competing estimator.

Inference and the curvature correction

The sampling fluctuation of ϕ^R\hat{\phi}_R is of order σ/R\sigma/\sqrt{R} and its bias of order σ2\sigma^2, so the ratio is Rσ\sqrt{R}\sigma. Let Nˉs=E(sr2Nr)\bar{N}_s=\mathbb{E}(s_r^2N_r) and Σ=Nˉ−1NˉsNˉ−1\Sigma=\bar{N}^{-1}\bar{N}_s\bar{N}^{-1}; for sr=1s_r=1, Σ=Nˉ−1\Sigma=\bar{N}^{-1}.

Theorem 4.5 (Local asymptotics). Let Assumption 4.1 hold, R→∞R\to\infty and σ=σR→0\sigma=\sigma_R\to0 with σR2log⁡R→0\sigma_R^2\log R\to0. Then, for every ϕ^R∈arg⁡min⁡QσR\hat{\phi}_R\in\arg\min Q_{\sigma_R},

RσR(ϕ^R−ϕˉR)⇝Nq(0,Σ).(14)\frac{\sqrt{R}}{\sigma_R}(\hat{\phi}_R-\bar{\phi}_R)\rightsquigarrow N_q(0,\Sigma). \tag*{(14)}

Consequently, if RσR→λ∈[0,∞)\sqrt{R}\sigma_R\to\lambda\in[0,\infty), then (R/σR)(ϕ^R−ϕ0)⇝Nq(−λ2Nˉ−1mˉ,Σ)(\sqrt{R}/\sigma_R)(\hat{\phi}_R-\phi_0)\rightsquigarrow N_q(-\frac{\lambda}{2}\bar{N}^{-1}\bar{m},\Sigma); if RσR→∞\sqrt{R}\sigma_R\to\infty, then σR−2(ϕ^R−ϕ0)→−12Nˉ−1mˉ\sigma_R^{-2}(\hat{\phi}_R-\phi_0)\to-\frac{1}{2}\bar{N}^{-1}\bar{m} in probability. For c∈Rqc\in\mathbb{R}^q with cTNˉ−1mˉ≠0c^T\bar{N}^{-1}\bar{m}\ne0, the interval cTϕ^R±z1−α/2v^cσ^R/Rc^{T}\widehat{\phi}_{R} \pm z_{1-\alpha/2}\widehat{v}_{c}\widehat{\sigma}_{R}/\sqrt{R} with v^c2→cTΣc\widehat{v}_{c}^{2} \to c^{T}\Sigma c in probability has asymptotic coverage P{∣Z+λcTN‾−1m‾/(2cTΣc)∣≤z1−α/2}\mathbb{P}\{|Z+\lambda c^{T}\overline{N}^{-1}\overline{m}/(2\sqrt{c^{T}\Sigma c})|\le z_{1-\alpha/2}\}, Z∼N(0,1)Z\sim N(0,1), which is 1−α1-\alpha only for λ=0\lambda=0 and tends to zero as λ→∞\lambda\to\infty.

For fixed σ≤σ1\sigma\le\sigma_{1} with cTN‾−1m‾≠0c^{T}\overline{N}^{-1}\overline{m}\ne0 (σ1\sigma_{1} reduced if needed), every limit point of cTϕ^Rc^{T}\widehat{\phi}_{R} differs from cTϕ0c^{T}\phi_{0} by at least σ24∣cTN‾−1m‾∣\frac{\sigma^{2}}{4}|c^{T}\overline{N}^{-1}\overline{m}| (Theorem 4.2), so every interval centred at cTϕ^Rc^{T}\widehat{\phi}_{R} with width oP(1)o_{P}(1) has coverage tending to zero. Over all linear functionals, the largest standardized bias is Rσγ\sqrt{R}\sigma\gamma with γ=12(m‾TN‾s−1m‾)1/2\gamma=\frac{1}{2}(\overline{m}^{T}\overline{N}_{s}^{-1}\overline{m})^{1/2}, which is 12(m‾TN‾−1m‾)1/2\frac{1}{2}(\overline{m}^{T}\overline{N}^{-1}\overline{m})^{1/2} when sr≡1s_{r}\equiv1 (Supplement S3.5). In the design of § 7, γ=0.65\gamma=0.65, so the worst functional is biased by two standard errors once R≥3,809R\ge3{,}809 at σ=0.05\sigma=0.05 and R≥239R\ge239 at σ=0.2\sigma=0.2.

The bias in (11) is computable from the fit. Let θ^r=θ∗(yr,ϕ^R)\widehat{\theta}_{r}=\theta^{*}(y_{r},\widehat{\phi}_{R}), σ^r2=ρr(yr,ϕ^R)/(n−p)\widehat{\sigma}_{r}^{2}=\rho_{r}(y_{r},\widehat{\phi}_{R})/(n-p), and let N^\widehat{N} and m^\widehat{m} be the averages of NrN_{r} and σ^r2mr\widehat{\sigma}_{r}^{2}m_{r} evaluated at (θ^r,ϕ^R)(\widehat{\theta}_{r},\widehat{\phi}_{R}); when sr≡1s_{r}\equiv1, σ^r2\widehat{\sigma}_{r}^{2} may be replaced by the pooled estimate. The curvature-corrected estimator is

ϕ~R=ϕ^R+12N^−1m^.(15)\widetilde{\phi}_{R}=\widehat{\phi}_{R}+\frac{1}{2}\widehat{N}^{-1}\widehat{m}. \tag*{(15)}

It needs the first and second channel derivatives and the first input derivatives of FF at the fit, using dense linear algebra at cost O{R(np2+npq+nq2+p3)+q3}O\{R(np^{2}+npq+nq^{2}+p^{3})+q^{3}\} once derivatives are available; forward evaluation and differentiation costs are additional.

Theorem 4.6 (Curvature correction). Under the conditions of Theorem 4.5, if in addition RσR6→0R\sigma_{R}^{6}\to0, then

RσR(ϕ~R−ϕ0)⇝Nq(0,Σ).\frac{\sqrt{R}}{\sigma_{R}}(\widetilde{\phi}_{R}-\phi_{0})\rightsquigarrow N_{q}(0,\Sigma).

For Gaussian noise with sr=1s_{r}=1, σ2(∑rNr)−1\sigma^{2}(\sum_{r}N_{r})^{-1} is the inverse of the efficient information for ϕ\phi when θ1,…,θR\theta_{1},\ldots,\theta_{R} are treated as unknown constants (Proposition 3.9), and the asymptotic variance of ϕ~R\widetilde{\phi}_{R} equals it to first order; no optimality is claimed among procedures that exploit the distribution of the channel types.

The correction extends valid inference from R=o(σ−2)R=o(\sigma^{-2}) channels to R=o(σ−6)R=o(\sigma^{-6}); the proof is in Supplement S3.6. At moderate noise higher-order terms matter: Supplement S12 gives a finite-design expansion of the next terms, and Supplement S7 a conditional antithetic bootstrap correction for them, whose conditions are not verified for the PET model.

The computed estimator. Theorems 4.5 and 4.6 concern the exact minimizer over the compact sets Θ\Theta and Φ\Phi of Assumption 4.1(a), and a computation must fix them. In § 7, Θ\Theta is a solver box and Φ\Phi an ordered input chart, both chosen before the second validation study. Near degenerate faces of a channel family (β→0\beta\to0 and β→∞\beta\to\infty for the macro channel) ArTArA_{r}^{T}A_{r} is nearly singular and mrm_{r}, which contains GrG_{r}, is unbounded, so a few fitted channels can dominate m^\widehat{m} while carrying little information about ϕ\phi. We therefore use the regular-set correction

ϕ~Rreg=ϕ^R+12N^−1m^reg,m^reg=1R∑r∈G^Rσ^r2mr(θ^r,ϕ^R),(16)\widetilde{\phi}_{R}^{\mathrm{reg}}=\widehat{\phi}_{R}+\frac{1}{2}\widehat{N}^{-1}\widehat{m}_{\mathrm{reg}},\qquad \widehat{m}_{\mathrm{reg}}=\frac{1}{R}\sum_{r\in\widehat{\mathcal{G}}_{R}}\widehat{\sigma}_{r}^{2}m_{r}(\widehat{\theta}_{r},\widehat{\phi}_{R}), \tag*{(16)}

where G^R\widehat{\mathcal{G}}_{R} contains the channels with θ^r\widehat{\theta}_{r} interior to Θ\Theta and λmin⁡(A^rTA^r)≥κ\lambda_{\min}(\widehat{A}_{r}^{T}\widehat{A}_{r})\ge\kappa for a fixed κ>0\kappa>0. If κ<c0\kappa<c_{0}, every channel is regular on events of probability tending to one, so P(ϕ~Rreg=ϕ~R)→1\mathbb{P}(\widetilde{\phi}_{R}^{\mathrm{reg}}=\widetilde{\phi}_{R})\to1 and Theorem 4.6 holds for ϕ~Rreg\widetilde{\phi}_{R}^{\mathrm{reg}} (Supplement, Corollary S3.5). Unlike ϕ~R\widetilde{\phi}_{R}, the regular set depends on the channel coordinates. This is an asymptotic equivalence, not a finite-sample improvement: the two estimators differ only through fitted channels outside the simultaneous regular-projection event, and a large difference warns against relying on the local approximation. The assumptions concern the true channels and do not rule out such fitted channels at finite noise. The domain is part of the estimator, so enlarging Θ\Theta defines a different estimator, which § 7 examines as such.

On a smooth branch, interval estimates use the sandwich variance of the profiled estimating equation, H^−1(∑rψ^rψ^rT)H^−1\widehat{H}^{-1}\left(\sum_r \widehat{\psi}_r\widehat{\psi}_r^{T}\right)\widehat{H}^{-1} with H^\widehat{H} the profile Hessian of the criterion, with independent channels as sampling units (Supplement S3.5). For half the criterion the channel score is −BrTer-B_r^T e_r, with ere_r the whitened residual. Replacing it by −BrT(I−Pr)er-B_r^T(I-P_r)e_r requires the nuisance normal equations; at an active box face the full-tangent projection generally changes the score (Supplement S23). Grouping frames within a voxel does not account for spatial dependence between voxels. Replacing H^\widehat{H} by its Gauss–Newton form 2∑rNr(θ^r,ϕ^R)2\sum_r N_r(\widehat{\theta}_r,\widehat{\phi}_R) is asymptotically equivalent in the correctly specified small-noise regime, but the two differ at moderate noise (§ 7); neither is a fixed-noise misspecification-robust sandwich.

Covariance changes both bias and uncertainty

The curvature-only formula requires isotropic errors in the fitting metric. General covariance also couples tangential noise to the motion of the normal space. This matters when diagonal frame weights do not fully whiten a reconstruction. With isotropic marginal noise, dependence within independent clusters of fixed size changes only the score covariance, not the curvature bias (Supplement, Theorem S10.1); but independence of arbitrarily chosen image blocks is not guaranteed. We therefore give a deterministic-design extension allowing dense Gaussian dependence; it is not a model-free justification for reconstructed PET intervals.

Write Qr=I−PrQ_r=I-P_r, Hr,jk=∂θj∂θkFrH_{r,jk}=\partial_{\theta_j}\partial_{\theta_k}F_r and Vr=GrArTBrV_r=G_rA_r^TB_r. For a positive definite marginal covariance CrC_r define

MrC=GrArTCrArGr,κrC=∑jk(MrC)jkHr,jk,M_r^C=G_rA_r^TC_rA_rG_r,\qquad\kappa_r^C=\sum_{jk}(M_r^C)_{jk}H_{r,jk},
Dr,j=∂θjBr−∑kHr,jk(Vr)k,:,D_{r,j}=\partial_{\theta_j}B_r-\sum_k H_{r,jk}(V_r)_{k,:},
tr(Cr)=12BrTQrκrC−∑jDr,jT(QrCrArGr):,j.(17)t_r(C_r)=\frac{1}{2}B_r^TQ_r\kappa_r^C-\sum_jD_{r,j}^T(Q_rC_rA_rG_r)_{:,j}. \tag*{(17)}

Here Dr,jD_{r,j} is an n×qn\times q matrix. When Cr=sr2IC_r=s_r^2I, the second term vanishes and tr=sr2mr/2t_r=s_r^2m_r/2. Although its two terms use coordinates, their sum is invariant under smooth channel reparameterization (Supplement S13).

Theorem 4.7 (Gaussian dependence and covariance-aware correction). Let the channel types form deterministic triangular arrays satisfying the uniform compactness, smoothness and channel separation in Assumption 4.1(a)–(c). Replace (d) by uniform separation of R−1∑rρ(xr,ϕ)R^{-1}\sum_r\rho(x_r,\phi) away from ϕ0\phi_0, and assume NR=R−1∑rNr→N≻0N_R=R^{-1}\sum_rN_r\to N\succ0. Let yr=xr+σξry_r=x_r+\sigma\xi_r, where ξ=(ξ1T,…,ξRT)T∼N(0,KR)\xi=(\xi_1^T,\ldots,\xi_R^T)^T\sim N(0,K_R), Cr=(KR)rr⪯CIC_r=(K_R)_{rr}\preceq CI and ∥KR∥op≤Cˉ\lVert K_R\rVert_{\mathrm{op}}\le\bar C, for constants cr,cˉ>0c_r,\bar c>0. Put LR=(B1TQ1,…,BRTQR)L_R=(B_1^TQ_1,\ldots,B_R^TQ_R), tR=R−1∑rtr(Cr)t_R=R^{-1}\sum_rt_r(C_r) and assume ΩR=R−1LRKRLRT→Ω≻0\Omega_R=R^{-1}L_RK_RL_R^T\to\Omega\succ0. If σ→0\sigma\to0 and σ2log⁡R→0\sigma^2\log R\to0, the exact joint least-squares estimator satisfies

ϕ^R−ϕ0=σRNR−1LRξ−σ2NR−1tR+OP(σ4+σ2R).(18)\widehat{\phi}_R-\phi_0=\frac{\sigma}{R}N_R^{-1}L_R\xi-\sigma^2N_R^{-1}t_R+O_P\left(\sigma^4+\frac{\sigma^2}{\sqrt{R}}\right). \tag*{(18)}

Evaluate hatted geometry at the joint fit and set

σ^2=∑rρ(yr,ϕ^R)∑rtr⁡(Q^rCr),t^R=R−1∑rtr(Cr;θ^r,ϕ^R),ϕ~C=ϕ^R+σ^2N^R−1t^R.\widehat{\sigma}^2=\frac{\sum_r\rho(y_r,\widehat{\phi}_R)}{\sum_r\operatorname{tr}(\widehat{Q}_rC_r)},\qquad \widehat{t}_R=R^{-1}\sum_rt_r(C_r;\widehat{\theta}_r,\widehat{\phi}_R),\qquad \widetilde{\phi}_C=\widehat{\phi}_R+\widehat{\sigma}^2\widehat{N}_R^{-1}\widehat{t}_R.

If also Rσ6→0R\sigma^{6} \to0, then R(ϕ~C−ϕ0)/σ⇒Nq(0,N−1ΩN−1)\sqrt{R}(\widetilde{\phi}_{C}-\phi_{0})/\sigma\Rightarrow N_{q}(0,N^{-1}\Omega N^{-1}). The consistent covariance estimate is σ^2N^R−1Ω^RN^R−1/R\widehat{\sigma}^{2}\widehat{N}_{R}^{-1}\widehat{\Omega}_{R}\widehat{N}_{R}^{-1}/R, where Ω^R=R−1LRKRLRT\widehat{\Omega}_{R}=R^{-1}L_{R}K_{R}L_{R}^{T}. The same conclusions hold for a regular-set correction with any fixed 0<κ<c00<\kappa<c_{0}.

With KR=diag⁡(sr2In)K_{R}=\operatorname{diag}(s_{r}^{2}I_{n}) and known scales bounded away from 00 and ∞\infty, the forcing reduces to sr2mr/2s_{r}^{2}m_{r}/2 and the expansion and limits agree with those of Theorems 4.5 and 4.6 for deterministic channel arrays with Gaussian noise; the corrected estimators coincide when sr≡1s_{r}\equiv1 and the pooled noise scale is used. The proof combines a uniform profile expansion with a Gaussian Poincaré bound; the leading score is exactly Gaussian, so no artificial partition into independent spatial clusters is needed. For KR=SR⊗CK_{R}=S_{R}\otimes C with (SR)rs=ϱ∣r−s∣(S_{R})_{rs}=\varrho^{|r-s|} and fixed ∣ϱ∣<1|\varrho|<1, its operator norm is bounded. Conversely, unrestricted long-range dependence need not satisfy the theorem. Consistent estimation of KRK_{R} is an additional problem: operator-norm consistency suffices for the variance, but replacing the CrC_{r} in the bias correction also requires Rσmax⁡r∥C^r−Cr∥op→P0\sqrt{R}\sigma\max_{r}\|\widehat{C}_{r}-C_{r}\|_{\mathrm{op}}\to_{P}0 (Supplement, Corollary S13.2).

Example 4.8 (Bias without curvature). Let F(θ,ϕ)=(θ,θϕ)TF(\theta,\phi)=(\theta,\theta\phi)^{T}, ϕ0=0\phi_{0}=0, C=(1aa1)C=\begin{pmatrix}1 & a \\ a & 1\end{pmatrix} with 0<∣a∣<10<|a|<1, and R−1∑rθr2→m2>0R^{-1}\sum_{r}\theta_{r}^{2}\to m_{2}>0. The channels are straight lines, but tr⁡(C)=−a\operatorname{tr}(C)=-a and the leading bias is aσ2/m2a\sigma^{2}/m_{2}. For unrestricted line projections the population minimizer is exactly 2aσ2/{m2+(m22+4a2σ4)1/2}2a\sigma^{2}/\{m_{2}+(m_{2}^{2}+4a^{2}\sigma^{4})^{1/2}\}. Spatial correlation changes the variance through KRK_{R} while leaving this marginal expected criterion unchanged. Thus a variance adjustment alone does not correct the bias. Correct marginal generalized least squares also removes this population bias; this example does not establish superiority over a correctly specified fitting metric.

Proposition 4.9 (A sufficient covariance-calibration experiment). Under Theorem 4.7, suppose KR=SR(ϱ)⊗CK_{R}=S_{R}(\varrho)\otimes C, where (SR(ϱ))rs=ϱ∣r−s∣(S_{R}(\varrho))_{rs}=\varrho^{|r-s|}, ∣ϱ∣<ϱ∗<1|\varrho|<\varrho_{*}<1, C≻0C\succ0 is fixed and tr⁡C=n\operatorname{tr}C=n. Observe MR≥1M_{R}\ge1 independent calibration fields Z(m)∼N(0,τR2KR)Z^{(m)}\sim N(0,\tau_{R}^{2}K_{R}), independent of the fitted data, with arbitrary unknown τR>0\tau_{R}>0. Define

WR=∑m,rZr(m)Zr(m)TMRR,C^=nWRtr⁡WR,ϱ^=clip⁡[−ϱ∗,ϱ∗]∑m∑r<RZr(m)TZr+1(m)∑m∑r<R∥Zr(m)∥2.W_{R}=\frac{\sum_{m,r}Z_{r}^{(m)}Z_{r}^{(m)T}}{M_{R}R},\qquad\widehat{C}=\frac{nW_{R}}{\operatorname{tr}W_{R}},\qquad\widehat{\varrho}=\operatorname{clip}_{[-\varrho_{*},\varrho_{*}]}\frac{\sum_{m}\sum_{r<R}Z_{r}^{(m)T}Z_{r+1}^{(m)}}{\sum_{m}\sum_{r<R}\lVert Z_{r}^{(m)}\rVert^{2}}.

Then K^R=SR(ϱ^)⊗C^\widehat{K}_{R}=S_{R}(\widehat{\varrho})\otimes\widehat{C} satisfies ∥K^R−KR∥op=OP{(MRR)−1/2}\lVert\widehat{K}_{R}-K_{R}\rVert_{\mathrm{op}}=O_{P}\{(M_{R}R)^{-1/2}\}. Replacing the covariance in Theorem 4.7 retains its corrected limit and studentization, even for MR=1M_{R}=1.

The proof in Supplement S13.5 uses Gaussian quadratic-form variances and an operator-norm Lipschitz bound uniform in RR. Covariance estimation changes the standardized correction by OP(σ/MR)O_{P}(\sigma/\sqrt{M_{R}}). One calibration field contains RR correlated channel vectors; it is additional information, not the residuals of a single fitted image. The covariance structure and known zero mean are substantive assumptions.

Physical constraints and boundary channels

Kinetic parameters obey sign constraints such as k3≥0k_{3}\ge0 and v≥0v\ge0, and basis-function methods impose nonnegativity ([11, 18]). If these constraints are imposed in the joint fit, a channel whose true parameter lies on or near a boundary is projected onto a cone rather than a manifold. Consider one linear constraint θ1≥0\theta_{1}\ge0 per channel, with the other coordinates interior. Let ar=∂θ1Fra_{r}=\partial_{\theta_{1}}F_{r}, let aˉr=(I−Pr,−)ar\bar{a}_{r}=(I-P_{r,-})a_{r} be its part orthogonal to the other columns of ArA_{r}, and put

er=aˉr/∥aˉr∥,cr=BrTer∈Rq,dr=∥aˉr∥ϵr1≥0.e_{r}=\bar{a}_{r}/\lVert\bar{a}_{r}\rVert,\qquad c_{r}=B_{r}^{T}e_{r}\in\mathbb{R}^{q},\qquad d_{r}=\lVert\bar{a}_{r}\rVert\epsilon_{r1}\ge0.

Thus crc_r is the input velocity along the constrained direction, and drd_r is the linearized distance of the true curve from the face of its channel manifold, in the metric of the whitened data; ∥aˉr∥2=1/{(ArTAr)−1}11\lVert\bar{a}_r\rVert^2 = 1/\{(A_r^T A_r)^{-1}\}_{11} is bounded below under Assumption 4.1(c). Write x−=min⁡(x,0)x_-=\min(x,0), x+=max⁡(x,0)x_+=\max(x,0), φN\varphi_N and ΦN\Phi_N for the standard normal density and distribution function, and ψ(v)=φN(v)−v{1−ΦN(v)}=E(Z−v)+\psi(v)=\varphi_N(v)-v\{1-\Phi_N(v)\}=\mathbb{E}(Z-v)_+ for Z∼N(0,1)Z\sim N(0,1).

Theorem 4.10 (Boundary channels). Let Assumption 4.1 hold for the extended model with Gaussian noise, and let the true channels lie in {θ1≥0}\{\theta_1\geq0\}, possibly on the face {θ1=0}\{\theta_1=0\}. Let ϕ^R+\hat{\phi}_R^+ be the joint estimator with θr1≥0\theta_{r1}\geq0 in every channel, and let Qσ+Q_\sigma^+ be its expected criterion. Then every limit point of ϕ^R+\hat{\phi}_R^+ lies in arg⁡min⁡Qσ+\arg\min Q_\sigma^+. For 0<σ≤σ10<\sigma\leq\sigma_1, every ϕˉ+∈arg⁡min⁡Qσ+\bar{\phi}^+\in\arg\min Q_\sigma^+ satisfies

∥ϕˉ+−ϕ0−σδσ∥≤Cσ2\lVert\bar{\phi}^+-\phi_0-\sigma\delta_\sigma\rVert\leq C\sigma^2

where δσ\delta_\sigma is the unique root of Γσ(δ)=Nˉδ+E[srcrψ{(dr/σ−crTδ)/sr}]\Gamma_\sigma(\delta)=\bar{N}\delta+\mathbb{E}[s_rc_r\psi\{(d_r/\sigma-c_r^T\delta)/s_r\}]. Moreover ∥δσ∥≥∥Γσ(0)∥/λmax⁡(Nˉ+EcrcrT)\lVert\delta_\sigma\rVert\geq\lVert\Gamma_\sigma(0)\rVert/\lambda_{\max}(\bar{N}+\mathbb{E}c_rc_r^T), and Γσ(0)→(2π)−1/2E{srcr1(dr=0)}\Gamma_\sigma(0)\to(2\pi)^{-1/2}\mathbb{E}\{s_rc_r\mathbf{1}(d_r=0)\} as σ→0\sigma\to0.

If the aggregate boundary forcing E{srcr1(dr=0)}\mathbb{E}\{s_rc_r\mathbf{1}(d_r=0)\} is nonzero, the constrained joint estimator is therefore biased by an amount of exact order σ\sigma, against σ2\sigma^2 without the constraint. A positive fraction of channels on the face is necessary for this but not sufficient, because boundary velocities of different channel types can cancel.

Example 4.11 (Cancelling boundary forcing). Let n=2n=2, p=q=1p=q=1, Fc(θ,ϕ)=(θ+cϕ,ϕ)TF_c(\theta,\phi)=(\theta+c\phi,\phi)^T with θ≥0\theta\geq0, and let the channel types c∈{−1,1}c\in\{-1,1\} be equally likely, all with θr=0\theta_r=0, sr=1s_r=1 and ϕ0=0\phi_0=0. Every channel lies on the face, aˉr=er=(1,0)T\bar{a}_r=e_r=(1,0)^T, cr=cc_r=c, dr=0d_r=0 and Nˉ=1\bar{N}=1. Then Γσ(δ)=δ+12{ψ(−δ)−ψ(δ)}=32δ\Gamma_\sigma(\delta)=\delta+\frac{1}{2}\{\psi(-\delta)-\psi(\delta)\}=\frac{3}{2}\delta, because ψ(−v)−ψ(v)=v\psi(-v)-\psi(v)=v, so δσ=0\delta_\sigma=0. Indeed the reflection (ϕ,c,y2)↦(−ϕ,−c,−y2)(\phi,c,y_2)\mapsto(-\phi,-c,-y_2) leaves the model and the noise law invariant, so the constrained estimator has no bias of order σ\sigma although every channel is at the boundary. With crc_r uniform on {1,2}\{1,2\} instead, Ecr≠0\mathbb{E}c_r\neq0 and δσ=−0.301\delta_\sigma=-0.301. Because the model is linear, ϕˉ+=σδσ\bar{\phi}^+=\sigma\delta_\sigma exactly here. In 20 simulated data sets with R=2×105R=2\times10^5 channels at each of σ=0.02\sigma=0.02, 0.050.05 and 0.1( check_boundary_example.py)0.1 (\,\texttt{check\_boundary\_example.py}), the constrained estimate divided by σ\sigma averaged −0.301-0.301 in the second case and was within 5×10−45\times10^{-4} of zero in the first.

When the forcing is nonzero, the order-σ\sigma bias is large relative to the nominal fixed-effects standard error, which is of order σ/R\sigma/\sqrt{R}: the standardized bias grows like R\sqrt{R} at every noise level, and the curvature correction does not remove it. Channels farther than σ{sr(2log⁡(1/σ))1/2+∣crTδσ∣}\sigma\{s_r(2\log(1/\sigma))^{1/2}+|c_r^T\delta_\sigma|\} from the face contribute only to the σ2\sigma^2 term. Newton's method from δ=0\delta=0 gives δσ≈−N~σ−1Γσ(0)\delta_\sigma\approx-\tilde{N}_\sigma^{-1}\Gamma_\sigma(0) with N~σ=Nˉ+E{φN(−dr/(σsr))crcrT}\tilde{N}_\sigma=\bar{N}+\mathbb{E}\{\varphi_N(-d_r/(\sigma s_r))c_rc_r^T\}; this one-step value is accurate only when ∥Γσ(0)∥\lVert\Gamma_\sigma(0)\rVert is small relative to λmin⁡(Nˉ)\lambda_{\min}(\bar{N}), and we solve for the root in the experiments (proof in Supplement S5). Several active constraints per channel lead to a projection onto a polyhedral cone and a multivariate truncated-normal forcing term; we do not treat that case.

The forcing term has a direct reading. For the unconstrained fit the linearized slack estimate is Xr=dr+σsrζrX_r=d_r+\sigma s_r\zeta_r, and E(Xr)−=−σsrψ{dr/(σsr)}\mathbb{E}(X_r)_-=-\sigma s_r\psi\{d_r/(\sigma s_r)\}. Thus −σΓσ(0)-\sigma\Gamma_\sigma(0) is the average of the expected constraint violations of the unconstrained fits, weighted by the boundary velocities. More generally E{(crTδ−Xr)/sr}+=ψ{(dr/σ−crTδ)/sr}\mathbb{E}\{(c_r^T\delta-X_r)/s_r\}_+=\psi\{(d_r/\sigma-c_r^T\delta)/s_r\}, so the unconstrained fits estimate Γσ\Gamma_\sigma without bias to first order under correct specification. Violations by unconstrained voxel fits, as in Supplement S30, therefore indicate the forcing term that a constrained input fit would create; on misspecified data the indication is only qualitative. These results suggest a two-stage rule. First estimate the shared input with the smooth extension, to which Theorems 4.2–4.6 apply. Then impose the physical constraints only when each channel is fitted with the estimated input. In the second stage the boundary is a fixed-dimensional problem for each channel (Self and Liang, [40]; Andrews [3]), and its error does not accumulate over channels. A parametric bootstrap of the constrained input fit is not expected to be a remedy, because the local parameters dr/σd_r/\sigma cannot be estimated consistently (Andrews, [4]); we have not studied it.

Continuous accumulation near a boundary differs from an atom on the face. If its slack density behaves as dα−1d^{\alpha-1}, 0<α<10<\alpha<1, a nonzero leading boundary coefficient gives bias of order σ1+α\sigma^{1+\alpha}. Supplement, Proposition S11.1, states the precise regularity and noncancellation conditions and derives the coefficient. This dominates smooth curvature bias. A bounded slack density instead gives an O(σ2)O(\sigma^2) displacement, whose coefficient can still differ from the unconstrained one.

Population models for the channels

An unrestricted mixing distribution can restore consistency under compactness and support identification (Supplement, Proposition S8.1), following Kiefer and Wolfowitz [28]. This does not assert consistency for a fixed parametric population. Here the channels are independent, sr≡1s_r \equiv1 and the noise is Gaussian. For a fixed working density gg on Θ\Theta, let

ℓr(ϕ;g)=log⁡∫Θφσ{yr−Fr(θ,ϕ)}g(θ) dθ,\ell_r(\phi;g)=\log\int_{\Theta}\varphi_{\sigma}\{y_r-F_r(\theta,\phi)\}g(\theta)\,d\theta,

and let ϕ^g\hat{\phi}_g maximize ∑rℓr(ϕ;g)\sum_r\ell_r(\phi;g). Write Vr=GrArTBrV_r=G_rA_r^TB_r and let div⁡θVr\operatorname{div}_{\theta}V_r denote columnwise divergence.

Theorem 5.1 (Population-score bias). Let Assumption 4.1 hold with Gaussian noise and sr≡1s_r\equiv1, let Θ\Theta be the closure of an open set with Lipschitz boundary (a box, for instance), and strengthen part (b) to F∈C8F\in C^8 on a neighbourhood, with uniformly bounded derivatives. Let gg be positive and C6C^6 on a neighbourhood of Θ\Theta, with bounded derivatives and inf⁡Θg>0\inf_{\Theta}g>0. Every limit point of ϕ^g\hat{\phi}_g maximizes Lσ(ϕ)=Eℓr(ϕ;g)L_{\sigma}(\phi)=\mathbb{E}\ell_r(\phi;g), and there are σ1>0\sigma_1>0 and C<∞C<\infty such that for 0<σ≤σ10<\sigma\leq\sigma_1 every maximizer ϕˉg\bar{\phi}_g satisfies

∥ϕˉg−ϕ0+σ2Nˉ−1tg∥≤Cσ4,tg=E{div⁡θVr+VrT∇log⁡g(θr)}.(19)\left\lVert\bar{\phi}_g-\phi_0+\sigma^2\bar{N}^{-1}t_g\right\rVert\leq C\sigma^4,\qquad t_g=\mathbb{E}\left\{\operatorname{div}_{\theta}V_r+V_r^T\nabla\log g(\theta_r)\right\}. \tag*{(19)}

The proof uses a uniform Laplace expansion and a volume identity that combines the profile curvature with the Laplace determinant (Supplement S9). For a smooth true population g0g_0 supported in the interior, integration by parts gives E{div⁡V+VT∇log⁡g0}=0\mathbb{E}\{\operatorname{div}V+V^T\nabla\log g_0\}=0: the coefficient measures population-score misfit in the foot-point directions VV. The exact correctly specified likelihood also has the truth as an expected maximizer at every noise level, by the Kullback–Leibler inequality. This last fact does not follow by substituting g0g_0 into the theorem, whose positive-density assumptions differ.

Supplement S8 gives precise results for correct, flat and estimated populations. A jointly fitted working family needs additional uniformity and an identified limiting population; a hierarchical posterior conclusion further requires Bernstein–von Mises and moment conditions, unverified here. In the XCAT design, fixed Gaussian-mixture working populations leave second-order coefficients 1.7–7.1 times the fixed-effects coefficient in the information norm. These coefficients concern a small-noise expansion, not realized finite-noise bias. The analytic correction needs no population model. The attempted hierarchical sampler did not converge and remains a supplementary diagnostic, not evidence for posterior calibration.

Calibration limits

An exact scale symmetry leaves absolute kinetic targets dependent on external calibration, however many channels are pooled (Proposition 3.10). Supplement, Proposition S15.1, gives a van Trees bound along that symmetry orbit. With Gaussian log-scale calibration error of variance τ2\tau^2, its lower bound for aggregate squared log-influx error is Rτ2/(1+π2τ2/δ2)R\tau^2/(1+\pi^2\tau^2/\delta^2) on a regular orbit interval of half-width δ\delta. This scale limitation is separate from the shape bias and from covariance-shape calibration in Proposition 4.9.

Numerical experiments

Common setting

All PET simulations use the 35 frames of the total-body study of Supplement S30 (12×5 s, 4×15 s, 6×1 min, 5×2 min, 4×3 min, 4×5 min) and, as true input, the Feng fit to its aortic image-derived input (τ=0.40\tau= 0.40 min, λ=(−26.8,−0.227,−0.0123)\lambda= (-26.8,-0.227,-0.0123) min−1^{-1}; relative error of the fit 0.048). Channel parameters (K1,k2,k3,v)(K_1,k_2,k_3,v) are built from the eight $1\mathrm{FDG} organ parameter sets of the XCAT phantom distributed with qurit/dynamicPET ((Ashrafinia et al., n.d.)), for myocardium, liver, lungs, kidneys, spleen, bone, white and grey matter, with k_4=0. An organ is chosen uniformly, its blood-volume value is floored at 0.005, and each log parameter is perturbed independently. The noise of frame iinchannelin channelrhasstandarddeviationhas standard deviation\sigma\bar{f}_r u_i,where, where\bar{f}_risthemeanofthechannelcurveandis the mean of the channel curve andu_i^2 \propto \bar{c}_i/\Delta_ifollowsthepopulation−meancurvefollows the population-mean curve\bar{c}andtheframeduration,normalizedsothatand the frame duration, normalized so that\sigma is a coefficient of variation; the data are whitened by these known shapes, so s_r \equiv 1.Channelsarefittedinthemacroparameterization. Channels are fitted in the macro parameterization(v,a_1,a_2,\log\beta); near the true curves it has the same channel manifold, so the same h_r,,N_randandm_r (Proposition 4.3(a)), and it extends the manifold across the boundaries v=0andandk_3=0. For every candidate input each channel is fitted by linear least squares in (v,a_1,a_2)onagridofon a grid of\beta$ followed by Levenberg–Marquardt refinement; the input is updated by Gauss–Newton steps on the profiled criterion, and the channel search is repeated at the final input until no channel improves. The procedure does not certify a global optimum, so every fit reports its standardized profile score (about zero at a stationary point, one at a point one standard error away); Supplement S16.2 states conditions under which the limit theory transfers to computed estimates, and Supplement S31 records seeds, run times and failures.

Computational provenance

An earlier implementation of the frame-integrated convolution was inaccurate when a channel washout rate nearly coincided with an input decay rate. The repaired kernel agrees with 50-digit quadrature to 7.9×10−107.9 \times10^{-10} in 2,016 checks, and every result in this section was computed with it; earlier-kernel computations are historical analyses (Supplement S26), not used for any conclusion.

Designs

The validation design has a compact data-generating law compatible with Theorems 4.5 and 4.6. Each log parameter is perturbed by 0.2z0.2z with zz standard normal truncated to [−2,2][-2,2], so the channel types have compact support, interior to the solver box log⁡β∈[−6,3]\log\beta\in[-6,3] (β∈[0.0025,20]\beta\in[0.0025,20] min−1^{-1}); the certificate ((6)) holds for every lung-type channel, so Corollary 3.8 gives Assumption 4.1(c)–(d). No estimator is started at the truth. Each data set has its own simulated image-derived input, the true input dispersed by an exponential kernel of mean 5 s with 5% multiplicative frame noise; its Feng fit starts the joint estimator, a median of 18 and at most 117 sandwich standard errors from the truth in the worst coordinate. The channel grid has 361 points, and each fit ends with a search along the two weakest directions of the information for a lower local minimum (Supplement S19). The reference design (unbounded log-normal perturbations, a 157-point grid, true start) is used below only for physical constraints; the stress design generates data from deliberately different models.

The predicted bias

In the coordinates (τ,log⁡A2,log⁡A3,log⁡∣λ1∣,log⁡∣λ2∣,log⁡∣λ3∣)(\tau, \log A_2, \log A_3, \log|\lambda_1|, \log|\lambda_2|, \log|\lambda_3|) the predicted deviation per unit σ2\sigma^2 in the validation design is −12Nˉ−1mˉ=(0.01,−1.63,−3.08,1.29,1.81,−3.00)-\frac{1}{2}\bar{N}^{-1}\bar{m} = (0.01, -1.63, -3.08, 1.29, 1.81, -3.00), with γ=0.65\gamma= 0.65; Nˉ\bar{N} has condition number 1.1×1051.1 \times10^5, and λmin⁡(ArTAr)≥0.043\lambda_{\min}(A_r^{T}A_r) \ge0.043 in 5000 draws. The two weakest directions of Nˉ\bar{N} are made of the amplitudes and decay rates of the two slow input components, which the trapping term can partly mimic (Example 3.5). We summarize an estimate by its standardized projection c=bTNˉ(ϕ^−ϕ0)/(bTNˉb)c = b^T\bar{N}(\hat{\phi}-\phi_0)/(b^T\bar{N}b) on the predicted direction b=−12Nˉ−1mˉb = -\frac{1}{2}\bar{N}^{-1}\bar{m}, fixed in advance; the population minimizer has c=σ2+O(σ4)c = \sigma^2 + O(\sigma^4). This functional attains the largest standardized bias Rσγ\sqrt{R}\sigma\gamma, so Theorem 4.5 predicts that nominal 95% intervals for it from the joint estimator cover with probability about Φ(1.96−Rσγ)−Φ(−1.96−Rσγ)\Phi(1.96-\sqrt{R}\sigma\gamma)-\Phi(-1.96-\sqrt{R}\sigma\gamma), whereas Theorem 4.6 predicts 95% for the corrected estimator. Theorem 4.6 concerns distributional centring, not a finite-sample expectation, so empirical means assess higher-order terms, finite RR and computation together.

First validation study

The noise level decreases along σR=0.2(R/256)−1/4\sigma_R = 0.2(R/256)^{-1/4} for R=256R = 256, 1024 and 4096, so that RσR2=10R\sigma_R^2 = 10, 20 and 41 grows while RσR6≤0.016R\sigma_R^6 \le0.016. The study comprises all 120, 80 and 30 planned data sets, fixed before the runs and generated from disjoint, prespecified random-number streams; no computation failed (Table 2). The joint fit had c/σR2=1.14c/\sigma_R^2 = 1.14, 1.16 and 1.13 (Monte Carlo standard errors 0.06, 0.04, 0.04) and its intervals covered in 36%, 8% and 0% of the data sets, against 46%, 17% and 1% predicted; the bias exceeded its first-order value by 13–16%. The smooth correction (4.8) had c/σR2=0.26c/\sigma_R^2 = 0.26, 0.22 and 0.16, a residual bias of 0.5–0.7 standard errors, and its intervals covered in 88%, 88% and 97% (exact intervals 81–93%, 78–94%, 83–100%). The correction thus removed most of the bias but did not deliver nominal coverage for the projection at R=256R = 256 and 1024. Coordinatewise the shortfall was larger: at R=256R = 256 the corrected intervals for the six coordinates covered in 68–92% of the data sets, and the empirical spread exceeded the Gauss–Newton sandwich standard error by factors 1.20–1.97; at R=1024R = 1024 and 4096 the coverage was 86–96% and 97% (Supplement, Table S11 and Figure S6).

RRσR\sigma_RRσR2R\sigma_R^2estimatorc/σ2c/\sigma^2bias/secovered95% CI (%)predicted (%)sd/se
2560.20010.2joint1.14 (0.06)2.3143/120[27, 45]461.26 [1.11, 1.39]
2560.20010.2corrected0.26 (0.05)0.54106/120[81, 93]951.21 [1.07, 1.35]
10240.14120.5joint1.16 (0.04)3.416/80[3, 16]171.03 [0.89, 1.15]
10240.14120.5corrected0.22 (0.04)0.6470/80[78, 94]951.02 [0.88, 1.13]
40960.10041.0joint1.13 (0.04)4.680/30[0, 12]10.88 [0.68, 1.04]
40960.10041.0corrected0.16 (0.04)0.6529/30[83, 100]950.88 [0.68, 1.04]

Table 2. Validation design, regenerated with the repaired convolution kernel (all planned data sets, independent seeds fixed in advance): compact channel law, σR=0.2(R/256)−1/4\sigma_R = 0.2(R/256)^{-1/4} and a simulated image-derived start. Mean standardized projection c/σ2c/\sigma^2 on the predicted bias direction (Monte Carlo standard error), mean error divided by the mean sandwich standard error, coverage of nominal 95% intervals with exact 95% intervals, the first-order coverage predicted by Theorem 4.5 (joint) or Theorem 4.6 (corrected), and the ratio of the empirical standard deviation to the mean sandwich standard error with a paired bootstrap interval.

Bias and variance at smaller noise

A prespecified experiment with R=1024R = 1024 and 30 channel samples, each analysed at σ=0.2\sigma= 0.2, 0.1 and 0.05 with antithetic noise ±ε\pm\varepsilon and the same channels, noise array and start, separated residual bias from variance (Table 3). Half-sums of antithetic pairs contain the bias but no first-order noise: the joint estimator had c/σ2=1.19c/\sigma^2 = 1.19, 1.09, 1.05 and the corrected one 0.32, 0.11, 0.05 (Monte Carlo standard errors 0.02, 0.02, 0.02), a corrected bias of 1.30, 0.23, 0.05 standard errors. At fixed RR the second-order bias of the fitted estimator is not the population coefficient, and a finite antithetic average retains random quadratic terms; Supplement S12 derives these finite-design coefficients. Their realized values average 1.039 (Monte Carlo s.e. 0.021) for the joint fit and 0.035 (0.020) for the correction; the remainders after subtracting them fall by factors of 3–5 per halving of σ\sigma, which explains most of the apparent discrepancy from 1 and 0 at small noise. Half-differences retain the first-order noise; their spread was 0.95, 1.01, 0.99 times the sandwich standard error along the projection and 0.70–1.27, 0.77–1.10, 0.76–1.09 times coordinatewise. At R=1024R = 1024, then, the residual is higher-order bias that shrinks with σ\sigma, and the sandwich is accurate for the first-order noise term.

σ\sigmapairsjoint c/σ2c/\sigma^2corrected c/σ2c/\sigma^2corr. bias/seprojectioncoordinatesjointcorrectedcorr. coord.
0.2301.19 (0.02)0.32 (0.02)1.300.950.70–1.2707368–98
0.1301.09 (0.02)0.11 (0.02)0.231.010.77–1.10489788–100
0.05301.05 (0.02)0.05 (0.02)0.050.990.76–1.09809887–100

Table 3. Bias and variance at decreasing noise (R=1024R = 1024, compact channel law, antithetic noise pairs with common channel samples, noise and simulated image-derived starts across σ\sigma). Half-sums cancel odd noise terms and estimate the mean bias: mean standardized projection c/σ2c/\sigma^2 (Monte Carlo standard error over pairs) of the joint and corrected estimators and the corrected bias in units of the mean sandwich standard error. Half-differences retain odd terms, led by the first-order noise: their root mean square over the mean sandwich standard error, along the projection and over the six coordinates. Coverage (%) of nominal 95% sandwich intervals over both members of every pair, along the projection (joint, corrected) and the range over the six coordinates (corrected).

The solver domain

The solver domain. In 68 data sets a channel ended at the log β\beta box [−6,3][-6, 3], near the faces β→0\beta\to0 and β→∞\beta\to\infty of the macro family, where the channel information degenerates. Refitted with the box [−9,5][-9, 5], 16 joint estimates moved by more than half a standard error to other local minima, and the plug-in correction changed by up to 44 standard errors; the corrected coverage at R=256R = 256 fell from 106 to 88 of 120 (103 with a face-specific correction). The box restricts the numerical domain without by itself verifying Assumption 4.1, and the correction is sensitive to how close it lets channels come to these faces. Refits of the 31 data sets with the largest scores or two local minima, with tighter tolerance, an extended valley search and a second start, reduced the largest score from 0.51 to 7.5×10−37.5 \times10^{-3}, moved the estimates by at most 2.26 standard errors and changed the corrected projection coverage at R=256R = 256 from 106 to 105 of 120, so optimization error of this size does not explain the residual bias or the coordinatewise undercoverage. The regular-set correction (16) with κ=0.01\kappa= 0.01, applied post hoc to the stored fits, differs from the smooth correction by at most 0.29 standard errors at the original box, with projection coverage 106/120, 70/80 and 29/30. The second study recomputed the wider-box refits with saved fits; its selection rule, the lower criterion of the refit and the original fit, was fixed after the follow-up, so this is a recomputation of results already seen. With that rule the regular-set correction term ϕ~Rreg−ϕ^R\widetilde{\phi}^{\mathrm{reg}}_R-\widehat{\phi}_R changed by at most 0.57 standard errors (90th percentile 0.07), against up to 44 for the smooth term, and projection coverage at R=256R = 256 was 106 of 120 on both domains. The joint estimate still moved by more than half a standard error in 12 of the 68 data sets (at most 2.63), to other local minima along the slow-input valley (Supplement S20). The instability of the correction came from channels near degenerate faces, which the regular set excludes; the multiplicity of local minima remains.

Second validation study

Second validation study. After the first study we fixed the computed estimator: the box log⁡β∈[−6,3]\log\beta\in[-6,3], the diagnostic input chart ΦC\Phi_C (delay within the onset frame less 1/41/4 s at each end, ∣λ1∣≥1.5∣λ2∣≥1.52∣λ3∣|\lambda_1| \ge1.5|\lambda_2| \ge1.5^2|\lambda_3|, other coordinates within ±3\pm3 of the reference input), the regular-set correction with κ=0.01\kappa= 0.01, and the original Gauss–Newton (primary) and profile-Hessian variance calculations. The threshold is below the empirical minimum 0.043 from 5000 draws; this is not a certified bound on the support or a verification that κ<c0\kappa< c_0. It was applied to new prespecified data sets at R=256R = 256, where the first study fell shortest, with σ=0.2\sigma= 0.2, 0.10.1 and 0.050.05 and 400, 200 and 200 independent data sets, so that a 95% coverage has Monte Carlo standard error 1.1–1.5 points; the design file and code fingerprints were written before the first run (Supplement S20). All 800 data sets were computed and none failed. No fit left the chart. The solver checks this chart at the returned fit but does not enforce it along the search or certify minimization over it. Irregular channels occurred only at σ=0.2\sigma= 0.2 (in 290 of 400 data sets, 165 of them with a channel at the box), where the regular-set and smooth corrections differed by at most 0.49 standard errors.

At σ=0.05\sigma= 0.05 the observed corrected coverage was compatible with 95%, 94% for the projection (exact interval 89–96%) and 93–96% for the six coordinates, with spread ratios 0.99–1.08; the joint intervals covered the projection in 92%. At σ=0.1\sigma= 0.1 corrected coverage was 93% (88–96%) for the projection and 91–97% coordinatewise, with spread ratios 0.94–1.15. At σ=0.2\sigma= 0.2 the shortfall of the first study reappeared: projection 85% (81–88%), coordinates 72–95%, spread ratios 1.09–1.93, and a residual bias of 0.69 standard errors. A post hoc audit replaced the full-tangent projected scores by the envelope scores −BTεr-B^T\varepsilon_r in the fixed-face profile-Hessian calculation (Supplement S23). This gave coverage 90% for the projection and 89–96% coordinatewise, with spread ratios 1.01–1.27; at the two smaller noise levels it changed little (Table 4). These results support a smaller variance discrepancy as σ\sigma decreases at fixed RR. They attribute part of the discrepancy to the variance approximation, without establishing finite-noise validity at active faces; the residual bias at σ=0.2\sigma= 0.2 is not removed by either sandwich. A second start changed the joint estimate by more than 0.1 standard errors in four of 120 data sets, by at most 0.50, and the standardized scores exceeded 0.1 in 56 data sets (maximum 0.61), all at σ=0.2\sigma= 0.2.

σ\sigmasetscov.c/σ2c/\sigma^2bias/secov. [CI]coord.sd/secov. [CI]coord.sd/se
0.2400350.35 (0.03)0.6985 [81, 88]72–951.2690 [87, 93]89–961.11
0.1200790.20 (0.07)0.2193 [88, 96]91–971.0693 [89, 96]94–981.03
0.05200920.06 (0.14)0.0394 [89, 96]93–961.0294 [89, 96]94–971.01

Table 4. Table 4. Second validation study, R=256R = 256: the computational procedure fixed after the first study (box log β∈[−6,3]\beta\in[-6, 3], input chart checked at returned fits, regular-set correction (16) with κ=0.01\kappa= 0.01) on new data sets prespecified before the runs. Sets: number of data sets. All coverages are percentages of nominal 95% intervals. Projection on the predicted direction: coverage of joint-estimator intervals; mean c/σ2c/\sigma^2 of the corrected estimator (Monte Carlo standard error) and its bias over the mean standard error. Corrected intervals with the original Gauss–Newton calculation and the post hoc envelope-score profile-Hessian calculation: projection coverage [exact 95% interval], range of coordinatewise coverage, and the ratio of empirical standard deviation to mean standard error for the projection. The post hoc variant changes only the covariance, not the point estimates; the original secondary results are retained in the Supplement.

Heterogeneous channels

Heterogeneous channels. Two post hoc algebraic approximations illustrate why pooling and inversion cannot be interchanged: the average −12R−1∑rNr+mr-\frac{1}{2}R^{-1}\sum_r N_r^+m_r and the coefficient at the mean channel parameters. At the true input and 2×22 \times2 10410^4 compact-law channels their projections on the pooled direction are −1.92-1.92 and −0.27-0.27 (pooled value 1), at angles 131∘131^\circ and 105∘105^\circ in the N~\widetilde{N} metric. The first approximation is numerically fragile because individual information matrices have median condition number 8.6×1068.6 \times10^6. Supplement S21 reports their plug-in interval summaries. Neither approximation implements a published template estimator; these comparisons do not establish superiority over the methods of Miolane, Holmes and Pennec [31]. The well-conditioned example in § 4 provides an independent algebraic demonstration of the weighting issue.

Numerical error

In the first study, refits from the true input agreed with the fits from the image-derived start within 0.1 standard errors in 26 cases and otherwise ended in other local minima at most 0.70 standard errors apart; a twice finer grid changed no estimate by more than 10−310^{-3} standard errors (Supplement S19).

Physical constraints in the joint fit

A random quarter of the reference-design channels was given no trapping (k3=0k_{3}=0, hence a1=0a_{1}=0). On matched data, a fit imposing a1≥0a_{1}\ge0 was compared with the smooth macro fit, with R=2048R=2048 and 8 data sets per noise level (Table 5). The constrained-minus-unconstrained difference divided by σ\sigma tracks the root of Theorem 4.10 at smaller noise. For log⁡∣λ3∣\log\lvert\lambda_{3}\rvert at σ=0.025\sigma=0.025, the measured value is 1.71 (0.05) against 1.63 predicted, whereas the curvature contribution has size ∣σb∣=0.074\lvert\sigma b\rvert=0.074.

coordinateσ=0.025\sigma= 0.025 measuredσ=0.025\sigma= 0.025 predictedσ=0.05\sigma= 0.05 measuredσ=0.05\sigma= 0.05 predictedσ=0.1\sigma= 0.1 measuredσ=0.1\sigma= 0.1 predictedcurvature bb
log⁡A2\log A_{2}0.124 (0.003)0.1220.121 (0.004)0.1220.128 (0.008)0.122−1.56-1.56
log⁡A3\log A_{3}−0.072-0.072 (0.003)−0.065-0.065−0.067-0.067 (0.005)−0.065-0.065−0.065-0.065 (0.005)−0.065-0.065−3.07-3.07
log⁡∣λ2∣\log\lvert\lambda_{2}\rvert0.039 (0.003)0.0340.039 (0.004)0.0340.056 (0.004)0.0341.42
log⁡∣λ3∣\log\lvert\lambda_{3}\rvert1.712 (0.053)1.6261.604 (0.043)1.6261.793 (0.101)1.626−2.96-2.96

Table 5. Physical constraints in the joint fit (Theorem 4.10): a quarter of the XCAT channels have k3=0k_{3}=0, R=2048R=2048. Paired difference between the joint estimates with and without the constraint a1≥0a_{1}\ge0, divided by σ\sigma (mean over data sets, Monte Carlo standard error), and the prediction δσ\delta_{\sigma} of Theorem 4.10. The last column is the unconstrained curvature bias per unit σ2\sigma^{2} in this design, for comparison. The delay and log⁡∣λ1∣\log\lvert\lambda_{1}\rvert rows are below 0.02 in all cells.

Population models and stress tests

Local quadrature diagnostics for working Gaussian mixtures agree with the population-score coefficient within 10.5% at σ=0.01\sigma=0.01 (Supplement S22). Under misspecification (reversible kinetics, channel-specific delays or dispersion, a varying plasma-to-blood ratio) the noise-free limit of the joint estimator moved by more than the curvature bias at σ=0.2\sigma=0.2 in every case but the last (Supplement, Table S28).

Correlated noise and covariance calibration

For the flat channels of Example 4.8, known covariance separates the roles of bias correction and spatial variance adjustment (Supplement S24). With R=1024R=1024 and marginal and spatial correlations both 0.6, corrected 95% coverage at σ=0.2\sigma=0.2, 0.1 and 0.05 was 94.27, 94.88 and 95.06%, against 71.23, 72.29 and 72.53% when spatial correlation was ignored; correct marginal GLS gave similar coverage. Estimating the covariance from one independent calibration field, as in Proposition 4.9, gave 94.4, 95.1 and 95.4% (10,000 replicates per cell). The correction repairs the specified Euclidean estimator; no superiority over correct whitening is claimed.

A compartment-model experiment uses 50 independent datasets at each of σ=0.1\sigma=0.1 and 0.05, with R=256R=256, temporal correlation 0.5, spatial correlation 0.4 and one independent calibration field per dataset; all datasets are retained. The estimated temporal matrix had a mean relative operator-norm error of about 41 and 40%, yet within each dataset the estimated covariance and oracle analyses agreed closely on the standard-error scale: ratios of their standard errors had median 0.99 and 0.99 and 5–95% range 0.94–1.08, and the corrected contrasts differed by at most 0.28 oracle standard errors. Coverage of the prespecified contrast was 86 and 98% without correction, 92 and 98% with oracle correction and 98 and 98% with estimated correction. The oracle and estimated intervals disagreed for 3 and 0 of 50 datasets at σ=0.1\sigma=0.1 and 0.05, respectively, all borderline, so the study does not rank the two analyses; with 50 replicates per level its coverage estimates are imprecise (Supplement S24.4). These simulations assume known fitting weights and a correctly specified calibration field, neither of which is validated for a patient reconstruction.

Discussion

The theoretical distinction is between identification and estimation with incidental channels. A shared input can be identifiable from frame means yet estimated with a persistent curvature bias, whose leading term is an information-weighted regression of mean curvature on normal input velocity. The analytic correction removes this term under uniform smoothness and small-noise conditions; it is not a fixed-noise consistency result. Boundary constraints and population misspecification introduce different bias terms. With general marginal covariance, even flat moving channels can be biased. The Gaussian-dependence theorem distinguishes this marginal effect from the full score covariance needed for uncertainty.

In compact-population PET simulations with prespecified independent replicates, the joint intervals deteriorated as Rσ2R\sigma^2 grew and the correction removed most of the bias. The two validation studies locate where the first-order theory is accurate. Along σR∝R−1/4\sigma_R \propto R^{-1/4}, the corrected intervals retained a residual bias of 0.5–0.7 standard errors and undercovered at R=256R=256 and 1024. At R=256R=256 with the estimator fixed in advance, they were close to nominal at σ=0.05\sigma=0.05 and 0.1 but not at σ=0.2\sigma=0.2, where a residual bias remained and the Gauss–Newton sandwich understated the variance; the audited fixed-face profile-Hessian calculation reduced that understatement. Its score correction was post hoc, and it supplies no boundary-limit theorem. The finite-design expansion of the Supplement accounts for much of the gap between the fitted estimator and the population coefficient at fixed RR. We therefore claim calibrated inference only in the small-noise regime of Theorem 4.6; at σ=0.2\sigma=0.2 in this design the corrected intervals are better than the uncorrected ones but not calibrated.

The computed estimator includes its domain. A box that lets fitted channels approach degenerate faces of the channel family makes the smooth plug-in correction unstable; the regular-set correction, equivalent to it under the assumptions, substantially reduced that instability of the correction term in the tested fits. Choosing the lower criterion among candidate fits keeps the reported optimum from worsening when the domain grows, although the joint fit can then move to another local minimum. Weak identification of the slow input components still makes the profiled criterion nearly flat along a valley, so starting values and optimization diagnostics matter at moderate noise. Tighter refits of the data sets with the largest profile scores moved the estimates by at most 2.26 standard errors and the projection coverage changed from 43 to 44 of 120 (joint, R=256R=256) and from 106 to 105 of 120 (corrected, R=256R=256). Finally, heterogeneity makes the order of pooling and inversion important: the two-type example proves this without ill-conditioning, and the PET diagnostics illustrate its numerical consequences.

Unrestricted non-Gaussian spatial dependence, estimation of reconstruction covariance with external information, multiple active constraints, a uniform bootstrap theory and reliable estimation of flexible populations remain outside the results; the hierarchical sampler we implemented did not converge. The historical single-subject PET example (Supplement S30), computed with the earlier kernel, has unresolved optimization, correlated reconstructed noise and uncertain calibration; it illustrates sensitivity and supports no calibrated-inference claim.

Acknowledgments

The author thanks the developers of PET-TRACER, vPET-ABC, dynamicpet and qurit/dynamicPET for making their code and data openly available.

Funding

H.-H. Huang acknowledges support from the National Science Foundation under grants DMS-1924792 and DMS-2318925 and from the National Institutes of Health (NIH), National Institute of Allergy and Infectious Diseases (NIAID) R01 award (1R01AI206603-01).

Supplementary Material

Supplement to “Identification and curvature bias for shared inputs in multichannel dynamical models”

Available from the author on request: proofs, additional theoretical results, simulation details and numerical diagnostics, the historical PET sensitivity analysis, and reproducibility code and data-access information.

References

  1. [1]Abed-Meraim, K., Qiu, W. and Hua, Y. (1997). Blind system identification. Proceedings of the IEEE 85 1310–1322.
  2. [2]Al-Sharadqah, A. and Chernov, N. (2009). Error analysis for circle fitting algorithms. Electronic Journal of Statistics 3 886–911. https://doi.org/10.1214/09-EJS419
  3. [3]Andrews, D. W. K. (1999). On a parameter is on a boundary. Econometrica 67 1341–1383.
  4. [4]Andrews, D. W. K. (2000). Inconsistency of the bootstrap when a parameter is on the boundary of the parameter space. Econometrica 68 399–405.
  5. [5]Arellano, M. and Hahn, J. (2007). Understanding Bias in Nonlinear Panel Models: Some Recent Developments. In Advances in Economics and Econometrics: Theory and Applications, Ninth World Congress (R. Blundell, W. Newey and T. Persson, eds.) 381–409. Cambridge University Press. https://doi.org/10.1017/CBO9780511607547.013
  6. [7]Bates, D. M. and Watts, D. G. (1980). Relative Curvature Measures of Nonlinearity. Journal of the Royal Statistical Society: Series B (Methodological) 42 1–25. https://doi.org/10.1111/j.2517-6161.1980.tb01094.x
  7. [8]Bigot, J. and Charlier, B. (2011). On the consequences of Fréchet means in deformable models and image analysis. Electronic Journal of Statistics 5 1054–1089. https://doi.org/10.1214/11-EJS633
  8. [9]Box, M. J. (1971). Bias in Nonlinear Estimation. Journal of the Royal Statistical Society: Series B (Methodological) 33 171–190. https://doi.org/10.1111/j.2517-6161.1971.tb00871.x
  9. [10]Cook, R. D., Tsai, C. L. and Wei, B. C. (1986). Bias in nonlinear regression. Biometrika 73 615–623. https://doi.org/10.1093/biomet/73.3.615
  10. [11]Cunningham, V. J. and Jones, T. (1993). Spectral analysis of dynamic PET studies. Journal of Cerebral Blood Flow and Metabolism 13 15–23.
  11. [12]Devilliers, L., Allassonnière, S., Trouvé, A. and Pennec, X. (2017). Template Estimation in Computational Anatomy: Fréchet Means Top and Quotient Spaces Are Not Consistent. SIAM Journal on Imaging Sciences 10 1139–1169. https://doi.org/10.1137/16M1083931
  12. [13]Fan, Y., Emvalomenos, G., Grazian, C. and Meikle, S. R. (2021). PET-ABC: fully Bayesian likelihood-free inference for kinetic models. Physics in Medicine and Biology 66 115002. https://doi.org/10.1088/1361-6560/afba37
  13. [14]Fazekas, I., Kukush, A. G. and Zwanzig, S. (2004). Correction of nonlinear orthogonal regression estimator. Ukrains’kyi Matematychnyi Zhurnal 56 1101–1118.DOI
  14. [15]Feng, D., Huang, S. C. and Wang, X. (1993). Models for computer simulation studies of input functions for tracer kinetic modeling with positron emission tomography. International Journal of Bio-Medical Computing 32 95–110.
  15. [16]Feng, D., Wong, K. P., Wu, C. M. and Siu, W. C. (1997). A technique for extracting physiological parameters and the required input function simultaneously from PET image measurements: theory and simulation study. IEEE Transactions on Information Technology in Biomedicine 1 243–254.
  16. [18]Gunn, R. N., Gunn, S. R., Turkheimer, F. E., Aston, J. A. D. and Cunningham, V. J. (2002). Positron emission tomography compartmental models: a basis pursuit strategy for kinetic modeling. Journal of Cerebral Blood Flow and Metabolism 22 1425–1439.
  17. [19]Hahn, J. and Newey, W. (2004). Jackknife and Analytical Bias Reduction for Nonlinear Panel Models. Econometrica 72 1295–1319. https://doi.org/10.1111/j.1468-0262.2004.00533.x
  18. [20]Hastie, T. and Stutzle, W. (1989). Principal Curves. Journal of the American Statistical Association 84 502–516.DOI
  19. [21]Holler, M., Morina, E. and Schramm, G. (2024). Exact parameter identification in PET pharmacokinetic modeling using the irreversible two tissue compartment model. Physics in Medicine and Biology 69 165008. https://doi.org/10.1088/1361-6560/ad539e
  20. [22]Holler, M., Morina, E. and Schramm, G. (2025). Exact parameter identification in PET pharmacokinetic modeling: extension to the reversible two tissue compartment model. Inverse Problems 41 095009. https://doi.org/10.1088/1361-6420/adfacc
  21. [23]Huang, H. H. and He, Q. (2023). Nonlinear Regression Analysis. In International Encyclopedia of Education fourth ed. (R. J. Tierney, F. Rizi and K. Erickan, eds.) 558–567. Oxford: Elsevier. https://doi.org/10.1016/B978-0-12-818630-5.10068-5
  22. [24]Huang, H. H., Yu, F., Fan, X. and Zhang, T. (2024). A framework of regularized low-rank matrix models for regression and classification. Statistics and Computing 34 10. https://doi.org/10.1007/s11222-023-10318-z
  23. [25]Huang, H. H., Zhu, Z., Boopasiri, S., Chen, Z., Pang, S. and Kao, C. M. (2025). A statistical reconstruction algorithm for positronium lifetime imaging using time-of-flight positron emission tomography. IEEE Transactions on Radiation and Plasma Medical Sciences 9 478–486. https://doi.org/10.1109/TRPMS.2025.3531225
  24. [26]Kanatani, K. (1994). Statistical Analysis of Geometric Computation. CVGIP: Image Understanding 59 286–306. https://doi.org/10.1006/ciun.1994.1020
  25. [27]Kanatani, K. and Sugaya, Y. (2013). Hyperaccurate Correction of Maximum Likelihood for Geometric Estimation. IPSJ Transactions on Computer Vision and Applications 5 19–29.
  26. [28]Kiefer, J. and Wolfowitz, J. (1956). Consistency of the Maximum Likelihood Estimator in the Presence of Infinitely Many Incidental Parameters. Annals of Mathematical Statistics 27 887–906. https://doi.org/10.1214/aoms/1177728066
  27. [29]Kumon, M. and Amari, S. I. (1984). Estimation of a structural parameter in the presence of a large number of nuisance parameters. Biometrika 71 445–459. https://doi.org/10.1093/biomet/71.3.445
  28. [30]Lancaster, T. (2000). The incidental parameter problem since 1948. Journal of Econometrics 95 391–413. https://doi.org/10.1016/S0304-4076(99)00044-5
  29. [31]Miolane, N., Holmes, S. and Pennec, X. (2017). Template Shape Estimation: Correcting an Asymptotic Bias. SIAM Journal on Imaging Sciences 10 808–844. https://doi.org/10.1137/16M1084493
  30. [32]Moulines, E., Duhamel, P., Cardoso, J. F. and Gassiat, Y. S. (1995). Subspace methods for the blind identification of multichannel FIR filters. IEEE Transactions on Signal Processing 43 516–525.
  31. [33]Neyman, J. and Scott, E. L. (1948). Consistent Estimates Based on Partially Consistent Observations. Econometrica 16 1–32. https://doi.org/10.2307/1914288
  32. [34]Ogden, R. T., Zanderigo, F., Foy, Y. S., Mann, J. J. and Parsey, R. V. (2010). Simultaneous Estimation of Input Functions: An Empirical Study. Journal of Cerebral Blood Flow and Metabolism 30 816–826. https://doi.org/10.1038/jcbfm.2009.245
  33. [35]Pólya, G. and Szegő, G. (1976). Problems and Theorems in Analysis II. Berlin: Springer. Translation of Aufgaben und Lehrsätze aus der Analysis, 1925.
  34. [36]Prenosil, G. A., Sari, H., Fürstner, M., Afshar-Oromieh, A., Shi, K., Rominger, A. and Hentschel, M. (2022). Performance Characteristics of the Biograph Vision Quadra PET/CT System with a Long Axial Field of View Using the NEMA NU 2-2018 Standard. Journal of Nuclear Medicine 63 476–484. https://doi.org/10.2967/jnumed.121.261972
  35. [37]Refregier, A. and Brown, S. T. (1998). Effect of Correlated Noise on Source Shape Parameters and Weak Lensing Measurements. arXiv preprint astro-ph/9803279.
  36. [38]Riabkov, D. Y. and Di Bella, E. V. R. (2002). Estimation of kinetic parameters without input functions: analysis of three methods for multichannel blind identification. IEEE Transactions on Biomedical Engineering 49 1318–1327.
  37. [39]Sartori, N. (2003). Modified profile likelihoods in models with stratum nuisance parameters. Biometrika 90 533–549. https://doi.org/10.1093/biomet/90.3.533
  38. [40]Self, S. G. and Liang, K. Y. (1987). Asymptotic properties of maximum likelihood estimators and likelihood ratio tests under nonstandard conditions. Journal of the American Statistical Association 82 605–610.
  39. [41]Wong, K. P., Feng, D., Meikle, S. R. and Fulham, M. J. (2001). Simultaneous estimation of physiological parameters and the input function—in vivo PET data. IEEE Transactions on Information Technology in Biomedicine 5 67–76.
  40. [43]Zhao, Y., Gu, Q., Angelis, G. I., Reader, A. J., Fan, Y. and Meikle, S. R. (2026). Generative Consistency Models for Estimation of Kinetic Parametric Image Posteriors in Total-Body PET. IEEE Transactions on Medical Imaging 45 4137–4149. arXiv:2509.13614. Code and data: https://github.com/yundunbledore/PET-TRACER. https://doi.org/10.1109/TMI.2026.3692917

Paper details

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

views · 0

downloads · 0

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