2023 年的期刊文章 · 第 19 页

共 1511 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2023-04-05 到 2023-04-02。

按期刊、按主题看 →

第 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 页

JRSSB Latent Variables & Mixtures 讨论 / 评论 · 发表于 2023-04-05

Rungang Han and Anru R. Zhangs contribution to the Discussion of ‘Vintage factor analysis with varimax performs statistical inference’ by Rohe & Zeng

Rungang Han, Anru R Zhang

摘要

Anru Zhang; Rungang Han and Anru R Zhang’s contribution to the Discussion of “Vintage Factor Analysis with Varimax Performs Statistical Inference” by Rohe & *(abstract via OpenAlex)*

SiM Clinical Trials Causal Inference · 发表于 2023-04-05

Point estimation for adaptive trial designs II: Practical considerations and guidance

David S. Robertson, Babak Choodari‐Oskooei, Munya Dimairo, Laura Flight, Philip Pallmann, Thomas Jaki

摘要

In adaptive clinical trials, the conventional end‐of‐trial point estimate of a treatment effect is prone to bias, that is, a systematic tendency to deviate from its true value. As stated in recent FDA guidance on adaptive designs, it is desirable to report estimates of treatment effects that reduce or remove this bias. However, it may be unclear which of the available estimators are preferable, and their use remains rare in practice. This article is the second in a two‐part series that studies the issue of bias in point estimation for adaptive trials. Part I provided a methodological review of approaches to remove or reduce the potential bias in point estimation for adaptive designs. In part II, we discuss how bias can affect standard estimators and assess the negative impact this can have. We review current practice for reporting point estimates and illustrate the computation of different estimators using a real adaptive trial example (including code), which we use as a basis for a simulation study. We show that while on average the values of these estimators can be similar, for a particular trial realization they can give noticeably different values for the estimated treatment effect. Finally, we propose guidelines for researchers around the choice of estimators and the reporting of estimates following an adaptive design. The issue of bias should be considered throughout the whole lifecycle of an adaptive design, with the estimation strategy prespecified in the statistical analysis plan. When available, unbiased or bias‐reduced estimates are to be preferred.

SiM Survival Analysis · 发表于 2023-04-05

On the parameter estimation of Box‐Cox transformation cure model

Suvra Pal, Souvik Roy

摘要

We propose an improved estimation method for the Box‐Cox transformation (BCT) cure rate model parameters. Specifically, we propose a generic maximum likelihood estimation algorithm through a non‐linear conjugate gradient (NCG) method with an efficient line search technique. We then apply the proposed NCG algorithm to BCT cure model. Through a detailed simulation study, we compare the model fitting results of the NCG algorithm with those obtained by the existing expectation maximization (EM) algorithm. First, we show that our proposed NCG algorithm allows simultaneous maximization of all model parameters unlike the EM algorithm when the likelihood surface is flat with respect to the BCT index parameter. Then, we show that the NCG algorithm results in smaller bias and noticeably smaller root mean square error of the estimates of the model parameters that are associated with the cure rate. This results in more accurate and precise inference on the cure rate. In addition, we show that when the sample size is large the NCG algorithm, which only needs the computation of the gradient and not the Hessian, takes less CPU time to produce the estimates. These advantages of the NCG algorithm allows us to conclude that the NCG method should be the preferred estimation method over the already existing EM algorithm in the context of BCT cure model. Finally, we apply the NCG algorithm to analyze a well‐known melanoma data and show that it results in a better fit when compared to the EM algorithm.

JRSSB Latent Variables & Mixtures 讨论 / 评论 · 发表于 2023-04-05

Mark Pilling's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Mark Pilling

摘要

Thanks to the authors for their very interesting, thoughtful, and thorough reconsideration of the topic of factor analysis. We know to be a weakness of factor analysis that an issue is that analysts must chose the type of rotation (e.g., SPSS lists Varimax, Direct Oblimin, Quartimax, Equamax, & Promax) to use, and this choice tends to be subjectively based on how useful or interpretable the rotation was in the context of the study. So multiple rotations might be considered. Given the author’s assertion that rotations can be interpreted as performing statistical inference, could the authors additionally comment on whether this has consequences for multiple testing? i.e., Is there any danger that p-hacking could occur if multiple rotations are being considered? In some sense, searching for results that fit the preconceived ideas of the analyst. *(abstract via OpenAlex)*

JRSSB Latent Variables & Mixtures 讨论 / 评论 · 发表于 2023-04-05

Kaizheng Wang's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Kaizheng Wang

摘要

I congratulate Drs. Rohe and Zeng for their elegant paper that advances our understanding of the classical Varimax algorithm. Varimax was originally proposed by Kaiser (1958) as an analytic criterion for determining interpretable factors. Despite its extensive applications and tremendous success, theoretical understanding is still lacking. Statisticians are further perplexed by negative results showing the nonidentifiability of Gaussian factor models. Toward resolving the dilemma, Rohe and Zeng proved that Varimax performed on the spectral embedding of data indeed recovers meaningful structures under a wide class of semi-parametric factor models. Below I briefly summarize their key insights and discuss new avenues of research. The authors assumed that the observed data A∈Rn×d satisfies E(A|Z,Y)=ZBY⊤⁠, where Z∈Rn×K⁠, Y∈Rd×K are random latent factor matrices and B∈RK×K a deterministic matrix. The ith row zi of Z consists of latent factors of the ith sample, e.g., community membership of an individual, topics of a document, etc. The authors showed that if elements of zi are independent and leptokurtic, then Varimax consistently estimates them. Interestingly, leptokurticity can be guaranteed by sparsity (Theorem 4.1), which is ubiquitous in high-dimensional models. The paper opens up exciting possibilities for further study. Recall that Varimax searches for a K×K orthonormal matrix that maximizes the sum of kurtoses of the K transformed factors. However, kurtosis maximization fails to recover factors if the leptokurticity assumption is violated. As a toy example, consider K=d=2⁠, A=Z and let {zi}i=1n be i.i.d. from the degenerate Gaussian mixture 12N(e1,e2e2⊤)+12N(−e1,e2e2⊤)⁠. The two canonical coordinates correspond to independent factors and the first one is platykurtic. Elementary calculation shows that as n→∞⁠, Varimax rotates the data by 45 degrees and returns noninterpretable coordinates. So, how should one choose the objective function in general? Hyvarinen (1997) showed advantages of several objectives over the kurtosis. More research is needed for modern statistical models. Another question is whether one should compute an orthonormal matrix in one shot or K orthogonal directions one by one. The latter may have computational advantage while the former is more stable numerically. Moreover, they generally yield different solutions even as n→∞⁠. Their statistical properties are worth investigating. Last but not least, the nonconvex objective functions call for studies of efficient algorithms with convergence guarantees. *(abstract via OpenAlex)*

JRSSB Latent Variables & Mixtures High-Dimensional Networks & Graphs 讨论 / 评论 · 发表于 2023-04-05

Junhui Cai, Dan Yang, Linda Zhao and Wu Zhu's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Junhui Cai, Dan Yang, Linda Zhao, Wu Zhu

摘要

We congratulate the authors on their excellent article (Rohe & Zeng, 2022). Factors and communities in networks are often hierarchically structured, as demonstrated in the academic bibliometrics example in the paper. In order to (1) identify factors/communities with hierarchical structure and (2) identify the important individuals/nodes within these factors/communities, we propose hierarchical vintage sparse PCA (Hvsp) to account for the hierarchical structure while taking advantages of vsp’s capability of performing statistical inference. Hvsp combines the idea of hierarchical clustering and vsp. Specifically, Hvsp follows a top-down hierarchical partitioning by recursively applying vsp with dimension k = 2 to split the nodes into two communities and eventually produce a binary tree. Compared with the existing hierarchical clustering methodologies in network analysis, Hvsp can explore the hierarchical structure but also inherits vsp’s advantages in computation and interpretability. In addition, the rotated principal component provides a score of importance for each individual/node in its corresponding factor/community, analogous to the popular eigenvector centrality measure in network analysis. The detailed algorithm is described in Algorithm 1. To gauge the performance of Hvsp in community detection, we adopt the binary tree stochastic block models (BTSBM) that capture a binary tree community structure (Li et al., 2020).1 We first use a toy example of a four-cluster balanced BTSBM (Figure 1) to provide insights and compare singular value decomposition (SVD) vs. vsp with dimension k = 4 and hierarchical community detection (HCD) (Li et al., 2020) vs. Hvsp in Figures 2 and 3. As expected, we observe the radial streaks from the pairs of principal components in Figure 2a, and the Varimax rotation aligns the streaks with the coordinate axes in Figure 2b. However, neither accounts for the hierarchical structure. On the other hand, HCD and Hvsp split the community layer by layer. In addition, Hvsp aligns the principal components to the coordinate axes, which provide a measure of the importance/centrality of each node in each community at different levels. We further compare the clustering performance using normalized mutual information (NMI) (Yao, 2003) of HCD, Hvsp, and vsp varying the number of communities and the average degree of nodes in Figure 4. HCD and Hvsp perform similarly while vsp falls behind. A four-cluster binary tree stochastic block models (BTSBM) (Li et al., 2020). The binary tree has three layers where Layer 1 includes all nodes, Layer 2 splits into two mega-communities {0, 1}, and Layer 3 further splits into four communities {00, 01, 10, 11}. Each colour corresponds to each community in Layer 3. In Layer 2, the mega-community {0} includes {00, 01} (red and purple) and the mega-community {1} includes {10, 11} (green and teal). Edges between nodes within the same community/mega-community are assumed to be independently Bernoulli with probability p0, p1, and p2 depending on the layer. It is most natural to assume the communities are assortative p0 > p1 > p2 so that the communities are more closely connected as the hierarchical tree goes deeper; or vice versa dis-assortative where p0 < p1 < p2. In the toy example, we generate a balanced four-clustered BTSBM with 2,048 nodes where each mega-community at Layer 2 has 1,024 nodes and each community at Layer 3 has 512 nodes. We let p0 = 1, p1 = 0.3, and p2 = 0.09 and scale accordingly so that the average degree of nodes is expected to be 50. Scatter plot of pairs of principal components by SVD in figure (a) and pairs of varimax rotated components in figure (b). The colour corresponds to each community at Layer 3 in Figure 1. The radial streaks appear in figure (a) while the Varimax rotation aligns the streaks with the coordinate axes in figure (b), providing a sparse representation. However, neither provides a hierarchical structure. Scatter plot of pairs of principal components by SVD and pairs of Varimax rotated components. The rows correspond to hierarchical community detection (HCD-sign) (Li et al., 2020), which first performs SVD with dimension k = 2 and then assigns labels based on the sign of the second component, and the proposed Hvsp; while the columns correspond to the first split among all nodes (Layer 1) and the split of the mega-community {0} of {00, 01} and mega-community {1} of {10, 11} (Layer 2). The colour corresponds to each community at Layer 3 in Figure 1. HCD and Hvsp split the community layer by layer and reveal the hierarchical structure. In addition, Hvsp aligns the principal components to the coordinate axes so as to provide a sparse representation. The rotated components further provide a measure of the importance (importance score) of each node in each community as suggested by Rohe & Zeng (2022). Furthermore, the importance score can be provided by layers. The normalized mutual information (NMI) (Yao, 2003) between the true and estimated labels obtained by HCD-sign, Hvsp, and vsp varying the number of communities and the average degree of nodes. The simulation setup follows Section 4.1 in Li et al. (2020). A larger NMI suggests better clustering performance. HCD-sign and Hvsp perform similarly while vsp falls behind. We compare the performance with more metrics at https://github.com/cccfran/Hvsp-paper. Finally, we apply Hvsp to the three-core of the largest connected component of a statistics citation network (2003–2012) (Ji & Jin, 2016; Li et al., 2020). Figure 5 shows the hierarchical communities whose labels are based on the research interests of the ten statisticians with the highest scores within each community in Table 1. Hvsp clusters related communities together and the communities become more refined as the hierarchical tree goes deeper. The dendrogram of 11 communities of the three-core of the statistics citation network from 2003 to 2012 was obtained by Hvsp using edge cross-validation (ECV) as a stopping rule (Li et al., 2020). Research areas are manually labelled based on the research interests of the 10 statisticians with highest importance scores in Table 1, which are followed by the community size labelled in parentheses. The labelling can be made algorithmic such as using the ‘best feature function’ bff (Wang & Rohe, 2016). We provide the clustering result of using the nonbacktracking method (Le & Levina, 2015) as the stopping rule in https://github.com/cccfran/Hvsp-paper. The 15 statisticians with the highest importance scores in each community of the 2003–2012 citation network The hierarchical vintage sparse PCA (Hvsp) algorithm. We included a Github repo in our manuscript that provides all the codes and data. *(abstract via OpenAlex)*

JRSSB Latent Variables & Mixtures High-Dimensional Networks & Graphs 讨论 / 评论 · 发表于 2023-04-05

Joshua Cape's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Joshua Cape

摘要

I congratulate Professor Rohe and Dr Zeng on their illuminating paper. Their broad contributions will no doubt redouble contemporary research activity in multivariate analysis for years to come. Even the paper’s appendices are full of valuable gems, not to be overlooked by readers. Rohe and Zeng contextualize their findings vis-à-vis classical developments in psychometrics and statistics. This choice is apt, for the authors champion a newfound understanding of varimax factor rotations as inferential, not merely exploratory. In a secondary capacity, the paper further complements a burgeoning body of contemporary work dedicated to the entrywise study of eigenvector estimation, perturbations, and asymptotics, in network analysis (e.g., Abbe et al., 2020; Tang & Priebe, 2018) and in high-dimensional statistics (e.g., Cape et al., 2019b; Fan et al., 2018). Under certain data-generating conditions, these works characterize the behaviour of individual vectors and their coordinates in low-dimensional point cloud representations of data, in a much more precise manner than was considered in past decades, let alone during the time of Thurstone or Kaiser. Rohe and Zeng emphasize two forms of sparsity in their treatment of stochastic blockmodel random graphs (SBMs) in the appendix: network sparsity, and latent variable sparsity. The contemporary literature has heretofore largely overlooked the latter and its implications, notably in papers dedicated to adjacency spectral embedding in the time since (Sussman et al., 2012). For SBMs, Rohe and Zeng establish a high-probability uniform error bound which I summarize as max1≤i≤n‖Z^−ZPn‖i,ℓ2=oP(1) in the moderately sparse regime nρn⪰(logn)c⁠. Here ‖⋅‖i,ℓ2 denotes the ℓ2 vector norm of the i-th row of a given matrix, while nρn reflects nodal expected degree. Consequently, perfect clustering (discrimination) is achieved using Z^⁠; more interestingly, the sparse latent variable matrix $Z$ can be element-wise directly estimated uniformly well. More can be said. The eigenvector analysis in Cape et al. (2019a) and Rubin-Delanchy et al. (2022) hints that asymptotic normality might hold for the varimax-based estimator at the scaling nρn⁠. Indeed, it has recently been established in Cape (2022) that for certain SBM graphs, loosely speaking, the i-th row vector of nρn(Z^−ZPn) is conditionally asymptotically multivariate Gaussian, with block-specific asymptotic covariance matrix. Unanswered questions abound. Among them, it would be interesting to quantify the estimation performance of varimax rotations in dimension k^≠ktrue and when the coefficient matrix $B$ is rank degenerate. *(abstract via OpenAlex)*

JASA Missing Data & Measurement Error · 发表于 2023-04-05

Handbook of Measurement Error Models

Kwun Chuen Gary Chan

摘要

This is a new addition to the Chapman and Hall/CRC Handbooks of Modern Statistical Methods Series, which has 27 volumes as of December 2022. This volume focuses on the topic of measurement error, w... *(abstract via OpenAlex)*

JASA Latent Variables & Mixtures Spatial & Time Series High-Dimensional · 发表于 2023-04-05

Factor Modeling for Clustering High-Dimensional Time Series

Bo Zhang, Guangming Pan, Qiwei Yao, Wang Zhou

摘要

We propose a new unsupervised learning method for clustering a large number of time series based on a latent factor structure.Each cluster is characterized by its own cluster-specific factors in addition to some common factors which impact on all the time series concerned.Our setting also offers the flexibility that some time series may not belong to any clusters.The consistency with explicit convergence rates is established for the estimation of the common factors, the cluster-specific factors, and the latent clusters.Numerical illustration with both simulated data as well as a real data example is also reported.As a spin-off, the proposed new approach also advances significantly the statistical inference for the factor model of Lam and Yao.Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SiM Latent Variables & Mixtures Longitudinal Data · 发表于 2023-04-05

Exploration of model misspecification in latent class methods for longitudinal data: Correlation structure matters

Megan L. Neely, Carl F. Pieper, Bida Gu, Natalia O. Dmitrieva, Jane F. Pendergast

摘要

Modeling longitudinal trajectories and identifying latent classes of trajectories is of great interest in biomedical research, and software to identify latent classes of such is readily available for latent class trajectory analysis (LCTA), growth mixture modeling (GMM) and covariance pattern mixture models (CPMM). In biomedical applications, the level of within‐person correlation is often non‐negligible, which can impact the model choice and interpretation. LCTA does not incorporate this correlation. GMM does so through random effects, while CPMM specifies a model for within‐class marginal covariance matrix. Previous work has investigated the impact of constraining covariance structures, both within and across classes, in GMMs—an approach often used to solve convergence problems. Using simulation, we focused specifically on how misspecification of the temporal correlation structure and strength, but correct variances, impacts class enumeration and parameter estimation under LCTA and CPMM. We found (1) even in the presence of weak correlation, LCTA often does not reproduce original classes, (2) CPMM performs well in class enumeration when the correct correlation structure is selected, and (3) regardless of misspecification of the correlation structure, both LCTA and CPMM give unbiased estimates of the class trajectory parameters when the within‐individual correlation is weak and the number of classes is correctly specified. However, the bias increases markedly when the correlation is moderate for LCTA and when the incorrect correlation structure is used for CPMM. This work highlights the importance of correlation alone in obtaining appropriate model interpretations and provides insight into model choice.

JASA Survey & Sampling · 发表于 2023-04-05

Differential Privacy for Government Agencies—Are We There Yet?

Jörg Drechsler

摘要

Government agencies typically need to take potential risks of disclosure into account whenever they publish statistics based on their data or give external researchers access to collected data. In this context, the promise of formal privacy guarantees offered by concepts such as differential privacy seems to be the panacea enabling the agencies to quantify and control the privacy loss incurred by any data release exactly. Nevertheless, despite the excitement in academia and industry, most agencies—with the prominent exception of the U.S. Census Bureau—have been reluctant to even consider the concept for their data release strategy. This paper discusses potential reasons for this. We argue that the requirements for implementing differential privacy approaches at government agencies are often fundamentally different from the requirements in industry. This raises many challenges and questions that still need to be addressed before the concept can be used as an overarching principle when sharing data with the public. The paper does not offer any solutions to these challenges. Instead, we hope to stimulate some collaborative research efforts, as we believe that many of the problems can only be addressed by interdisciplinary collaborations. *(abstract via OpenAlex)*

Biometrics Causal Inference Econometrics & Economics · 发表于 2023-04-05

Conditional Cross-Design Synthesis Estimators for Generalizability in Medicaid

Irina Degtiar, Tim Layton, Jacob Wallace, Sherri Rose

摘要

While much of the causal inference literature has focused on addressing internal validity biases, both internal and external validity are necessary for unbiased estimates in a target population of interest. However, few generalizability approaches exist for estimating causal quantities in a target population that is not well-represented by a randomized study but is reflected when additionally incorporating observational data. To generalize to a target population represented by a union of these data, we propose a novel class of conditional cross-design synthesis estimators that combine randomized and observational data, while addressing their estimates' respective biases—lack of overlap and unmeasured confounding. These methods enable estimating the causal effect of managed care plans on health care spending among Medicaid beneficiaries in New York City, which requires obtaining estimates for the 7% of beneficiaries randomized to a plan and 93% who choose a plan, who do not resemble randomized beneficiaries. Our new estimators include outcome regression, propensity weighting, and double robust approaches. All use the covariate overlap between the randomized and observational data to remove potential unmeasured confounding bias. Applying these methods, we find substantial heterogeneity in spending effects across managed care plans. This has major implications for our understanding of Medicaid, where this heterogeneity has previously been hidden. Additionally, we demonstrate that unmeasured confounding rather than lack of overlap poses a larger concern in this setting.

Biometrics Latent Variables & Mixtures Survival Analysis Longitudinal Data · 发表于 2023-04-05

Combining Mixed Effects Hidden Markov Models with Latent Alternating Recurrent Event Processes to Model Diurnal Active–Rest Cycles

Benny Ren, Ian Barnett

摘要

Data collected from wearable devices can shed light on an individual's pattern of behavioral and circadian routine. Phone use can be modeled as alternating processes, between the state of active use and the state of being idle. Markov chains and alternating recurrent event models are commonly used to model state transitions in cases such as these, and the incorporation of random effects can be used to introduce diurnal effects. While state labels can be derived prior to modeling dynamics, this approach omits informative regression covariates that can influence state memberships. We instead propose an alternating recurrent event proportional hazards (PH) regression to model the transitions between latent states. We propose an expectation–maximization algorithm for imputing latent state labels and estimating parameters. We show that our E-step simplifies to the hidden Markov model (HMM) forward–backward algorithm, allowing us to recover an HMM with logistic regression transition probabilities. In addition, we show that PH modeling of discrete-time transitions implicitly penalizes the logistic regression likelihood and results in shrinkage estimators for the relative risk. This new estimator favors an extended stay in a state and is useful for modeling diurnal rhythms. We derive asymptotic distributions for our parameter estimates and compare our approach against competing methods through simulation as well as in a digital phenotyping study that followed smartphone use in a cohort of adolescents with mood disorders.

JRSSB Latent Variables & Mixtures High-Dimensional 讨论 / 评论 · 发表于 2023-04-04

Yunxiao Chen and Gongjun Xu's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Yunxiao Chen, Gongjun Xu

摘要

We congratulate Rohe and Zeng for this insightful paper that elegantly connects psychometric methods and statistical and machine learning applications. We would like to mention several lines of related research. First, the problem is closely related to the latent variable selection problems (e.g., Y. Chen et al., 2015; Xu & Shang, 2018), where regularised estimation procedures are proposed to learn sparse loading structures. In fact, the vsp procedure can be viewed as the limiting case of a regularised estimation procedure, in the sense that U^ from Algorithm vsp is the limit of when λ goes to zero if the solution path is smooth, where U and V satisfy the same constraints as in singular value decomposition, while D is allowed to be non-diagonal (F. Chen & Rohe, 2020). Note that the regularisation is used to learn the sparse loading structure rather than to avoid over-fitting, and thus, it does not require the tuning parameter to depend on the noise level. We agree that rotation is more convenient under many models, but the regularised estimation approach might be more general for some more complex latent variable models. Second, various rotation methods have been proposed in the psychometric literature to find simple and scientifically meaningful factor loading structures. For example, consider the L1 criterion that minimises the objective function This criterion is closely related to L1 regularisation and ensures statistical consistency under suitable conditions (Jennrich, 2004, 2006; Liu et al., 2022). We run a small simulation study to compare the Varimax and L1 rotations, where data are generated from the current factor model. Two settings are used to generate Z—one sparse setting where P([Z]ij=0)=0.5 and one dense setting where [Z]ij follows a heavy-tail distribution. The L1 rotation method only replaces v(R,U^) in step 3 of the vsp algorithm with c(R,U^)⁠. The mean squared errors for the estimation of Z are given in Figure 1, where the L1 rotation performs better under the sparse setting while the vsp outperforms under the dense setting. Box plots of mean squared errors ‖Z^−ZPn‖F2/(nk) from 100 simulations. The four box plots correspond to the combinations of two settings (⁠k=5,n=d=100,200⁠) and two rotation methods (Varimax and L1⁠). In the simulations, we generate A=ZYT+W⁠, where [A]ij and [W]ij are independent standard normal variables. Under Setting 1, [Z]ij=2[C]ij[S]ij⁠, where [C]ij are independent standard normal random variables and [S]ij are independent Bernoulli random variables with success probability 0.5. Under Setting 2, [Z]ij=[T]ij/5/3⁠, where [T]ij follows a t distribution with five degrees of freedom. R code for the simulation can be found on https://stats.lse.ac.uk/cheny185/L1˙rotation.R. Finally, another interesting extension of the current work is to non-linear factor models that assume E([A]ij|Z,B,Y)=f([ZBYT]ij)⁠, for some known smooth and strictly monotone non-linear function f (e.g., logistic function for binary data). Due to the non-linear transformation, the current vsp procedure does not directly apply. One solution is to first apply the universal singular value thresholding procedure (Chatterjee, 2015) to A to estimate (f([ZBYT]ij))n×d⁠, which yields an estimate of ZBYT through element-wise f−1 transformations; see Zhang et al. (2020) for more details and the related consistency theory. Then, one can learn Z by steps 2 and 3 of Algorithm vsp. G.X. is supported by National Science Foundation grants SES-1846747 and SES2150601. The data supporting the findings of this study are available within the article. *(abstract via OpenAlex)*

JRSSB Latent Variables & Mixtures 讨论 / 评论 · 发表于 2023-04-04

Yinqiu He, Yuqi Gu and Zhilian Ying's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Yinqiu He, Yuqi Gu, Zhiliang Ying

摘要

We congratulate the authors on an impressive paper that demystifies the popular Varimax rotation. They showed that the Varimax rotation can identify true axes of latent factors under the leptokurtic condition in a low-rank semiparametric factor model Different from (1), the exploratory Item Factor Analysis (IFA), widely used in social and behavioural sciences, adopts a nonlinear transformation of the low-rank structure: where the binary data matrix R contains N individuals’ responses to J items, Θ represents N individuals’ K latent factors, Λ is the loading matrix, and F is a prespecified monotone increasing function. The relationship between the two models can be seen by letting F(x)=x⁠, B=IK⁠, Z=Θ⁠, and Y=Λ⁠. However, in IFA, F(⋅) is usually taken from a distribution function, e.g., FNormal(x)=∫−∞xe−t2/2/(2π)dt and FLogistic(x)=ex/(1+ex)⁠; see Reckase (2009). For such a model, it is of interest to develop a similar Vintage Factor Analysis with Varimax. For (2), Zhang et al. (2020) proposed a two-step approach: (1) use SVD to obtain a low-rank approximation to the data matrix, denoted as R^⁠; (2) use F−1(R^) as an estimate of ΘΛ⊤ and apply SVD to obtain Θ^ and Λ^⁠. We add a third step that incorporates the Varimax rotation: (3) apply Varimax rotation to the initial estimate Θ^⁠. Our preliminary studies show some promising signs. Specifically, we conduct simulations under four settings of Θ⁠, given in Figures 1–4, respectively. In each setting, we consider three F(⋅) in (2): FNormal(x)⁠, FLogistic(x)⁠, and FCauchy(x)=π−1arctan(x)+1/2⁠. For d∈{Normal,Logistic,Cauchy}⁠, we generate a binary data matrix Rd with a population mean matrix Fd(ΘΛ⊤)⁠. Setting (I): N=J=500,K=2⁠. True factors Θ=(θik) are binary and give orthogonal columns: (θi1,θi2) are i.i.d. Multinomial(0.5,0.5)⁠. Data are not centred, as factors are orthogonal. The loading matrix Λ has i.i.d. entries following U(−2,2)⁠. Point i in red circle if θi1=0⁠, and blue triangle otherwise. The first figure in the first row gives the scatterplot of true factors Θ⁠, and the other figures plot estimated factors that are obtained following the subtitles above themselves. Setting (II): N=J=500,K=2⁠. True factors Θ=(θik) are binary and independent: for k∈{1,2}⁠, θik=norm(ζik)⁠, where ζik are i.i.d. Bernoulli(1/7)⁠, and norm(ζik) represents normalizing ζik by its population mean and standard deviation. Kurtosis(θik)>3 for k∈{1,2}⁠. Data are centred, as true factors are mean zero. The loading matrix Λ has i.i.d. entries following U(−2,2)⁠. Let ζi=(ζi1,ζi2)⁠. For i=1,…,N⁠, point i is in red circle if ζi=(0,0)⁠, in blue triangle if ζi=(0,1)⁠, in yellow square if ζi=(1,0)⁠, and in green diamond if ζi=(1,1)⁠. Setting (III): N=J=500,K=2⁠. True factor Θ=(θik) is nonbinary and give orthogonal columns: for k∈{1,2}⁠, θik=ϱik×mik⁠, where ϱik are i.i.d. Poisson(1)⁠, (mi1,mi2)∼Multinomial(0.5,0.5)⁠, and Kurtosis(θik)>3⁠. Data are not centred, as factors are orthogonal. The loading matrix Λ has i.i.d. entries following U(−2,2)⁠. Point i is in red circle if θi1=0⁠, and blue triangle otherwise. Setting (IV): N=J=500,K=2⁠. True factors Θ=(θik) are independent and include nonbinary: θi1∼norm(ζi1)⁠, where ζi1 are i.i.d. Bernoulli(1/7)⁠, and θi2∼ρi2−1⁠, where ρi2 are i.i.d. Poisson(1). Data are centred, as true factors have zero mean. The loading matrix Λ has i.i.d. entries following U(−2,2)⁠. Point i is in red circle if ζi1=0⁠, and blue triangle otherwise. (i) Population (Columns 2–4 in Figures 1–4). We apply the two-step algorithm in Zhang et al. (2020) to Fd(ΘΛ⊤) and obtain initial estimated factors Θ^P,Initial(d)⁠. We then apply Varimax to Θ^P,Initial(d) and obtain rotated factors Θ^P,Rotate(d)⁠. For d∈{Logistic,Cauchy}⁠, rotated factors Θ^P,Rotate(d) are close to true Θ⁠, whereas Θ^P,Initial(d) with d∈{Normal} can substantially deviate from Θ⁠. The results show that latent axes might be statistically identified given a nonlinear F in (2). However, the performance varies with the choice of F: FLogistic and FCauchy (heavy tail) outperform FNormal (light tail). (ii) Sample (Columns 5–7 in Figures 1–4). Similarly, we first apply the two-step algorithm to binary matrix Rd to obtain Θ^S,Initial(d)⁠, and then Θ^S,Rotate(d) via Varimax rotation. In Figures 1–2, binary Θ renders finite number of clusters, and the estimated factors can recover the clusters. This could be because in this case, (2) can be alternatively viewed as a Latent Class Model (Goodman, 1974), and Fd(ΘΛ⊤) always exhibits an exact low-rank structure even with a nonlinear Fd⁠. This observation aligns with the authors’ findings. However, in Figures 2–4, the sample estimate Θ^S,Rotate(d) can deviate from true Θ more significantly than its population counterpart Θ^P,Rotate(d) does. This may be due to the special signal-to-noise structure of a binary variable, i.e., its variance can always be computed from its mean, so the sampling noise can have a significant impact on the recovery accuracy. Nevertheless, comparing Θ^S,Initial(d) and Θ^S,Rotate(d)⁠, Varimax can indeed find one rotation aligned with the axes of the true latent factors. This suggests that similar Vintage Factor Analysis with varimax may also apply in the IFA model (2) with a nonlinear F and Θ that satisfy leptokurtic conditions. The following contributions were received in writing after the meeting. *(abstract via OpenAlex)*

JRSSB Latent Variables & Mixtures Optimization & Learning Theory 讨论 / 评论 · 发表于 2023-04-04

Proposer of the vote of thanks to Rohe & Zeng and contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’

Peter Hoff

摘要

I congratulate the authors on their article, which brings together theory and methods from the established areas of factor analysis and independent components analysis, combines these with new results, and applies the combination to the developing research area of matrix-variate data analysis. To many statisticians, factor analysis is simply a model that specifies that the covariance matrix Σ of a d-variate population is equal to a rank-k matrix M=HH⊤ (with k<d⁠) plus a diagonal matrix D. An appealing feature of such a model is that it can have many fewer parameters than has an unrestricted covariance model. But to many researchers, the appeal of the factor analysis model is that it might actually be true! As is well known, if the d-vector of variables y is equal to some unknown linear combination H of k uncorrelated common factors plus uncorrelated noise, that is, y=Hf+D1/2e where Var[f]=Ik and Var[e]=Id⁠, then indeed the variance of y is M+D where M=HH⊤⁠. In the literature that I am familiar with, the conundrum of classical factor analysis has been that interest is really in the factor loading matrix H and not M, but M is typically estimated from only the first two moments of the data, from which H is not recoverable. The VARIMAX rotation selects an H which may be preferred on aesthetic grounds, or because of some assumptions about the process being studied, or because of the invariance properties of VARIMAX—the latter being the original motivation in Kaiser (1958). While the focus of factor analysis is primarily on the factor loading matrix, or ‘column effects’, in independent components analysis (ICA) the goal is to recover the uncorrelated latent factors, or the ‘row effects.’ This is done by whitening the data by multiplying each data vector by a matrix H−1 for any H such that Var[y]=HH⊤⁠. But which whitening matrix to use? If the distribution of the latent factors is invariant to orthogonal rotation (i.e., the distribution is Gaussian), then the correct H cannot be determined. The assumption of ICA is that the factors (or all but one of them) are non-Gaussian, and if this is correct, the latent factors may well estimated by choosing a whitening matrix that makes the estimated factors maximally non-Gaussian by some measure. Standard multivariate statistical procedures, like factor analysis or ICA, typically focus on describing heterogeneity along only one of the two index sets of the data matrix. However, there has been rapid growth in the number of applications where the data are ‘matrix-variate’ and inferences about the row objects and the column objects are desired. For example, the rows and columns could represent biological samples and genes, or consumers and products, or exporters and importers. Analyses of such data are often based on matrix factorisation models like the one presented by Rohe and Zeng: where A is the data matrix, the values of z1,…,zn represent heterogeneity along the rows, and y1,…,yd represent heterogeneity along the columns. As with the identification of the loading matrix in factor analysis, the conundrum of matrix-variate data analysis is that there are infinitely many matrix factorizations that give the same low-rank least-squares approximation to A. How to select from among them? One approach is to abandon least-squares and instead infer the correct factorisation based on specific distributional assumptions about the latent row and column factors, often using a parametric statistical model. Such approaches can incorporate subject-matter knowledge about the factors into the estimation procedure, but are typically very computationally intensive. Alternatively, standard matrix factorisation methods, such as the singular value decomposition, are relatively inexpensive computationally, but they select a factorisation using arbitrary identifiability constraints that are not derived from the data. What has been needed is a data analysis method that is computationally inexpensive, but also identifies the factors using information from the data. I propose a vote of thanks to Rohe and Zeng for providing just such a method. As they show in their article, the classic VARIMAX criterion, applied to rows or columns of a data matrix, can identify rotations that recover non-Gaussian latent factors. Their results unify several multivariate statistical methods, and highlight that much of what might be thought of as multivariate data analysis should really be considered as matrix-variate data analysis. *(abstract via OpenAlex)*

Biometrika Networks & Graphs · 发表于 2023-04-04

Populations of unlabelled networks: graph space geometry and generalized geodesic principal components

Anna Calissano, Aasa Feragen, Simone Vantini

摘要

Statistical analysis for populations of networks is widely applicable, but challenging, as networks have strongly non-Euclidean behaviour. Graph space is an exhaustive framework for studying populations of unlabelled networks that are weighted or unweighted, uni- or multilayered, directed or undirected. Viewing graph space as the quotient of a Euclidean space with respect to a finite group action, we show that it is not a manifold, and that its curvature is unbounded from above. Within this geometrical framework we define generalized geodesic principal components, and we introduce the align-all-and-compute algorithms, all of which allow for the computation of statistics on graph space. The statistics and algorithms are compared with existing methods and empirically validated on three real datasets, showcasing the potential utility of the framework. The whole framework is implemented within the geomstats Python package.

SMMR Survival Analysis · 发表于 2023-04-04

Omnibus test for restricted mean survival time based on influence function

Jiaqi Gu, Yiwei Fan, Guosheng Yin

摘要

The restricted mean survival time (RMST), which evaluates the expected survival time up to a pre-specified time point τ , has been widely used to summarize the survival distribution due to its robustness and straightforward interpretation. In comparative studies with time-to-event data, the RMST-based test has been utilized as an alternative to the classic log-rank test because the power of the log-rank test deteriorates when the proportional hazards assumption is violated. To overcome the challenge of selecting an appropriate time point τ , we develop an RMST-based omnibus Wald test to detect the survival difference between two groups throughout the study follow-up period. Treating a vector of RMSTs at multiple quantile-based time points as a statistical functional, we construct a Wald χ 2 test statistic and derive its asymptotic distribution using the influence function. We further propose a new procedure based on the influence function to estimate the asymptotic covariance matrix in contrast to the usual bootstrap method. Simulations under different scenarios validate the size of our RMST-based omnibus test and demonstrate its advantage over the existing tests in power, especially when the true survival functions cross within the study follow-up period. For illustration, the proposed test is applied to two real datasets, which demonstrate its power and applicability in various situations.

SiM Survival Analysis · 发表于 2023-04-04

Modeling and maximum likelihood based inference of interval‐censored data with unknown upper limits and time‐dependent covariates

Jing Wu, Lijiang Geng, Angela Starkweather, Ming‐Hui Chen

摘要

Due to the nature of study design or other reasons, the upper limits of the interval‐censored data with multiple visits are unknown. A naïve approach is to treat the last observed time as the exact event time, which may induce biased estimators of the model parameters. In this paper, we first develop a Cox model with time‐dependent covariates for the event time and a proportional hazards model with frailty for the gap time. We then construct the upper limits using the latent gap times to resolve the issue of interval‐censored event time data with unknown upper limits. A data‐augmentation technique and a Monte Carlo EM (MCEM) algorithm are developed to facilitate computation. Theoretical properties of the computational algorithm are also investigated. Additionally, new model comparison criteria are developed to assess the fit of the gap time data as well as the fit of the event time data conditional on the gap time data. Our proposed method compares favorably with competing methods in both simulation study and real data analysis.

JRSSB Spatial & Time Series Bayesian Methods · 发表于 2023-04-04

Exact Monte Carlo likelihood-based inference for jump-diffusion processes

Flávio B Gonçalves, Krzysztof Łatuszyński, Gareth O Roberts

摘要

Statistical inference for discretely observed jump-diffusion processes is a complex problem which motivates new methodological challenges. Thus, existing approaches invariably resort to time-discretisations which inevitably lead to approximations in inference. In this paper, we give the first general collection of methodologies for exact (in this context meaning discretisation-free) likelihood-based inference for discretely observed finite activity jump-diffusions. The only sources of error involved are Monte Carlo error and convergence of expectation maximisation (EM) or Markov chain Monte Carlo (MCMC) algorithms. We shall introduce both frequentist and Bayesian approaches, illustrating the methodology through simulated and real examples.

Biometrics Causal Inference Clinical Trials · 发表于 2023-04-04

Estimating Optimal Individualized Treatment Rules with Multistate Processes

Giorgos Bakoyannis

摘要

Multistate process data are common in studies of chronic diseases such as cancer. These data are ideal for precision medicine purposes as they can be leveraged to improve more refined health outcomes, compared to standard survival outcomes, as well as incorporate patient preferences regarding quantity versus quality of life. However, there are currently no methods for the estimation of optimal individualized treatment rules with such data. In this paper, we propose a nonparametric outcome weighted learning approach for this problem in randomized clinical trial settings. The theoretical properties of the proposed methods, including Fisher consistency and asymptotic normality of the estimated expected outcome under the estimated optimal individualized treatment rule, are rigorously established. A consistent closed-form variance estimator is provided and methodology for the calculation of simultaneous confidence intervals is proposed. Simulation studies show that the proposed methodology and inference procedures work well even with small-sample sizes and high rates of right censoring. The methodology is illustrated using data from a randomized clinical trial on the treatment of metastatic squamous-cell carcinoma of the head and neck.

JRSSB Latent Variables & Mixtures High-Dimensional 讨论 / 评论 · 发表于 2023-04-04

Christine P Chai's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Christine P Chai

摘要

Disclaimer: The opinions and views expressed here are those of the author and do not necessarily state or reflect those of Microsoft. Rohe and Zeng (2020) made an advancement to show that Vintage Factor Analysis with Varimax can perform statistical inference, with a wide range of applications. I appreciate that the authors made the whole vsp (Vintage Sparse PCA) package1 available in R for the general public. I have several questions regarding the paper: Why was Multiple Factor Analysis first developed by psychologists (Thurstone, 1935), instead of statisticians or computer scientists? Was there any historical context at that time? Could the authors briefly describe the data cleaning process of the academic bibliometrics corpus? In the topic modelling results, the word ‘biology’ appears in both factors 2 and 7, which is a bit confusing. Some factors also include nontechnical words like ‘on’ and ‘conference’. Finally, words of the same stem appear as separate words, such as ‘chemistry’ vs. ‘chemical’ and ‘economics’ vs. ‘economic’. The authors specified the compute resources for the code running time, indicating that Vintage Factor Analysis with Varimax can be implemented on a personal laptop within a reasonable time. Since the computation involves sparse matrices, are data structures like scipy.sparse.csr_matrix2 used in the code to save memory space? Are there particular types of applications that can benefit more from Vintage Sparse PCA, rather than just traditional PCA for dimensionality reduction? For instance, I investigated the relationship between the microbiome and environmental characteristics as a team (Beckman et al., 2015), and PCA projected the high-dimensional data to the first two principle components. Given the small n large p data, would Vintage Sparse PCA be more helpful than PCA? *(abstract via OpenAlex)*

JRSSB Functional Data High-Dimensional · 发表于 2023-04-03

Testing homogeneity: the trouble with sparse functional data

Changbo Zhu, Jane-Ling Wang

摘要

Testing the homogeneity between two samples of functional data is an important task. While this is feasible for intensely measured functional data, we explain why it is challenging for sparsely measured functional data and show what can be done for such data. In particular, we show that testing the marginal homogeneity based on point-wise distributions is feasible under some mild constraints and propose a new two-sample statistic that works well with both intensively and sparsely measured functional data. The proposed test statistic is formulated upon energy distance, and the convergence rate of the test statistic to its population version is derived along with the consistency of the associated permutation test. The aptness of our method is demonstrated on both synthetic and real data sets.

JRSSB Spatial & Time Series High-Dimensional Testing & Uncertainty · 发表于 2023-04-03

Statistical inference for high-dimensional panel functional time series

Zhou Zhou, Holger Dette

摘要

In this paper, we develop statistical inference tools for high-dimensional functional time series. We introduce a new concept of physical dependent processes in the space of square integrable functions, which adopts the idea of basis decomposition of functional data in these spaces, and derive Gaussian and multiplier bootstrap approximations for sums of high-dimensional functional time series. These results have numerous important statistical consequences. Exemplarily, we consider the development of joint simultaneous confidence bands for the mean functions and the construction of tests for the hypotheses that the mean functions in the panel dimension are parallel. The results are illustrated by means of a small simulation study and in the analysis of Canadian temperature data.

SMMR Diagnostics & Prediction Machine Learning Networks & Graphs · 发表于 2023-04-03

Role of calibration in uncertainty-based referral for deep learning

Ruotao Zhang, Constantine Gatsonis, Jon Arni Steingrimsson

摘要

The uncertainty in predictions from deep neural network analysis of medical imaging is challenging to assess but potentially important to include in subsequent decision-making. Using data from diabetic retinopathy detection, we present an empirical evaluation of the role of model calibration in uncertainty-based referral, an approach that prioritizes referral of observations based on the magnitude of a measure of uncertainty. We consider several configurations of network architecture, methods for uncertainty estimation, and training data size. We identify a strong relationship between the effectiveness of uncertainty-based referral and having a well-calibrated model. This is especially relevant as complex deep neural networks tend to have high calibration errors. Finally, we show that post-calibration of the neural network helps uncertainty-based referral with identifying hard-to-classify observations.

JASA Survey & Sampling Causal Inference · 发表于 2023-04-03

Rejective Sampling, Rerandomization, and Regression Adjustment in Survey Experiments

Zihao Yang, Tianyi Qu, Xinran Li

摘要

Classical randomized experiments, equipped with randomization-based inference, provide assumption-free inference for treatment effects. They have been the gold standard for drawing causal inference and provide excellent internal validity. However, they have also been criticized for questionable external validity, in the sense that the conclusion may not generalize well to a larger population. The randomized survey experiment is a design tool that can help mitigate this concern, by randomly selecting the experimental units from the target population of interest. However, as pointed out by Morgan and Rubin, chance imbalances often exist in covariate distributions between different treatment groups even under completely randomized experiments. Not surprisingly, such covariate imbalances also occur in randomized survey experiments. Furthermore, the covariate imbalances happen not only between different treatment groups, but also between the sampled experimental units and the overall population of interest. In this article, we propose a two-stage rerandomization design that can actively avoid undesirable covariate imbalances at both the sampling and treatment assignment stages. We further develop asymptotic theory for rerandomized survey experiments, demonstrating that rerandomization provides better covariate balance, more precise treatment effect estimators, and shorter large-sample confidence intervals. We also propose covariate adjustment to deal with remaining covariate imbalances after rerandomization, showing that it can further improve both the sampling and estimated precision. Our work allows general relationship among covariates at the sampling, treatment assignment and analysis stages, and generalizes both rerandomization in classical randomized experiments and rejective sampling in survey sampling. *(abstract via OpenAlex)*

SiM Causal Inference Nonparametric & Semiparametric · 发表于 2023-04-03

Propensity score analysis with local balance

Yan Li, Liang Li

摘要

Most propensity score (PS) analysis methods rely on a correctly specified parametric PS model, which may result in biased estimation of the average treatment effect (ATE) when the model is misspecified. More flexible nonparametric models for treatment assignment alleviate this issue, but they do not always guarantee covariate balance. Methods that force balance in the means of covariates and their transformations between the treatment groups, termed global balance in this article, do not always lead to unbiased estimation of ATE. Their estimated propensity scores only ensure global balance but not the balancing property, which is defined as the conditional independence between treatment assignment and covariates given the propensity score. The balancing property implies not only global balance but also local balance—the mean balance of covariates in propensity score stratified sub‐populations. Local balance implies global balance, but the reverse is false. We propose the propensity score with local balance (PSLB) methodology, which incorporates nonparametric propensity score models and optimizes local balance. Extensive numerical studies showed that the proposed method can substantially outperform existing methods that estimate the propensity score by optimizing global balance, when the model is misspecified. The proposed method is implemented in the R package PSLB.

JRSSB Other · 发表于 2023-04-03

Permutation-based true discovery guarantee by sum tests

Anna Vesely, Livio Finos, Jelle J Goeman

摘要

Sum-based global tests are highly popular in multiple hypothesis testing. In this paper, we propose a general closed testing procedure for sum tests, which provides lower confidence bounds for the proportion of true discoveries (TDPs), simultaneously over all subsets of hypotheses. These simultaneous inferences come for free, i.e., without any adjustment of the α-level, whenever a global test is used. Our method allows for an exploratory approach, as simultaneity ensures control of the TDP even when the subset of interest is selected post hoc. It adapts to the unknown joint distribution of the data through permutation testing. Any sum test may be employed, depending on the desired power properties. We present an iterative shortcut for the closed testing procedure, based on the branch and bound algorithm, which converges to the full closed testing results, often after few iterations; even if it is stopped early, it controls the TDP. We compare the properties of different choices for the sum test through simulations, then we illustrate the feasibility of the method for high-dimensional data on brain imaging and genomics data.

JASA Causal Inference Nonparametric & Semiparametric Longitudinal Data · 发表于 2023-04-03

Nonparametric Causal Effects Based on Longitudinal Modified Treatment Policies

Iván Díaz, Nicholas Williams, Katherine L. Hoffman, Edward J. Schenck

摘要

Most causal inference methods consider counterfactual variables under interventions that set the exposure to a fixed value. With continuous or multi-valued treatments or exposures, such counterfactuals may be of little practical interest because no feasible intervention can be implemented that would bring them about. Longitudinal modified treatment policies (LMTPs) are a recently developed nonparametric alternative that yield effects of immediate practical relevance with an interpretation in terms of meaningful interventions such as reducing or increasing the exposure by a given amount. LMTPs also have the advantage that they can be designed to satisfy the positivity assumption required for causal inference. We present a novel sequential regression formula that identifies the LMTP causal effect, study properties of the LMTP statistical estimand such as the efficient influence function and the efficiency bound, and propose four different estimators. Two of our estimators are efficient, and one is sequentially doubly robust in the sense that it is consistent if, for each time point, either an outcome regression or a treatment mechanism is consistently estimated. We perform numerical studies of the estimators, and present the results of our motivating study on hypoxemia and mortality in intubated Intensive Care Unit (ICU) patients. Software implementing our methods is provided in the form of the open source R package lmtp freely available on GitHub (https://github.com/nt-williams/lmtp) and CRAN. *(abstract via OpenAlex)*

JASA Spatial & Time Series · 发表于 2023-04-03

Multivariate Temporal Point Process Regression

Xiwei Tang, Lexin Li

摘要

Point process modeling is gaining increasing attention, as point process type data are emerging in a large variety of scientific applications. In this article, motivated by a neuronal spike trains study, we propose a novel point process regression model, where both the response and the predictor can be a high-dimensional point process. We model the predictor effects through the conditional intensities using a set of basis transferring functions in a convolutional fashion. We organize the corresponding transferring coefficients in the form of a three-way tensor, then impose the low-rank, sparsity, and subgroup structures on this coefficient tensor. These structures help reduce the dimensionality, integrate information across different individual processes, and facilitate the interpretation. We develop a highly scalable optimization algorithm for parameter estimation. We derive the large sample error bound for the recovered coefficient tensor, and establish the subgroup identification consistency, while allowing the dimension of the multivariate point process to diverge. We demonstrate the efficacy of our method through both simulations and a cross-area neuronal spike trains analysis in a sensory cortex study. *(abstract via PubMed)*

JRSSB Latent Variables & Mixtures 讨论 / 评论 · 发表于 2023-04-03

Kuldeep Kumar's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Kuldeep Kumar

摘要

Data Analysts are quite often confused between principal component analysis (PCA) and factor analysis. Both are the same data reduction techniques that are immensely helpful in big data analysis in many other areas. I personally think factor analysis is just an offshoot of PCA and as the authors have mentioned PCA with Varimax is a vintage data analysis technique. So, should the title of the paper be Vintage PCA with Varimax performing statistical inference? I am quite impressed with the systematic study of 144,136 papers done by the authors on ‘How and where factor analysis is used’. No wonder it is one of the most widely used statistical techniques in many areas of social sciences, business, medicine, etc. I will just like to add that the ‘vintage’ book written by Professor Ian Jolliffe on PCA in 1986 and published by Springer has received more than 48,000 citations which is one of the highest citations of any statistical books. Professor Jolliffe has also written a series of well-cited seminal papers on PCA Jolliffe (2022), and his recent paper on his ‘vintage’ 50 years personal journey through time with PCA is worth reading in this context. *(abstract via OpenAlex)*

JASA Causal Inference · 发表于 2023-04-03

Instrumental Variable Estimation of Marginal Structural Mean Models for Time-Varying Treatment

Haben Michael, Yifan Cui, Scott A. Lorch, Eric J. Tchetgen Tchetgen

摘要

Robins introduced Marginal Structural Models (MSMs), a general class of counterfactual models for the joint effects of time-varying treatment regimes in complex longitudinal studies subject to time-varying confounding. In his work, identification of MSM parameters is established under a Sequential Randomization Assumption (SRA), which rules out unmeasured confounding of treatment assignment over time. We consider sufficient conditions for identification of the parameters of a subclass, Marginal Structural Mean Models (MSMMs), when sequential randomization fails to hold due to unmeasured confounding, using instead a time-varying instrumental variable. Our identification conditions require that no unobserved confounder predicts compliance type for the time-varying treatment. We describe a simple weighted estimator and examine its finite-sample properties in a simulation study. We apply the proposed estimator to examine the effect of delivery hospital type on neonatal survival probability. Supplementary materials for this article are available online. *(abstract via PubMed)*

JASA Survey & Sampling Testing & Uncertainty · 发表于 2023-04-03

Hypotheses Testing from Complex Survey Data Using Bootstrap Weights: A Unified Approach

Jae Kwang Kim, J. N. K. Rao, Zhonglei Wang

摘要

Standard statistical methods without taking proper account of the complexity of a survey design can lead to erroneous inferences when applied to survey data due to unequal selection probabilities, clustering, and other design features. In particular, the Type I error rates of hypotheses tests using standard methods can be much larger than the nominal significance level. Methods incorporating design features in testing hypotheses have been proposed, including Wald tests and quasi-score tests that involve estimated covariance matrices of parameter estimates. In this article, we present a unified approach to hypothesis testing without requiring estimated covariance matrices or design effects, by constructing bootstrap approximations to quasi-likelihood ratio statistics and quasi-score statistics and establishing its asymptotic validity. The proposed method can be easily implemented without a specific software designed for complex survey sampling. We also consider hypothesis testing for categorical data and present a bootstrap procedure for testing simple goodness of fit and independence in a two-way table. In simulation studies, the Type I error rates of the proposed approach are much closer to their nominal significance level compared with the naive likelihood ratio test and quasi-score test. An application to an educational survey under a logistic regression model is also presented. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Econometrics & Economics Bayesian Methods · 发表于 2023-04-03

Collaborative Multilabel Classification

Yunzhang Zhu, Xiaotong Shen, Hui Jiang, Wing Hung Wong

摘要

In multilabel classification, strong label dependence is present for exploiting, particularly for word-to-word dependence defined by semantic labels. In such a situation, we develop a collaborative-learning framework to predict class labels based on label-predictor pairs and label-only data. For example, in image categorization and recognition, language expressions describe the content of an image together with a large number of words and phrases without associated images. This article proposes a new loss quantifying partial correctness for false positive and negative misclassifications due to label similarities. Given this loss, we develop the Bayes rule to capture label dependence by nonlinear classification. On this ground, we introduce a weighted random forest classifier for complete data and a stacking scheme for leveraging additional labels to enhance the performance of supervised learning based on label-predictor pairs. Importantly, we decompose multilabel classification into a sequence of independent learning tasks, based on which the computational complexity of our classifier becomes linear in the size of labels. Compared to existing classifiers without label-only data, the proposed classifier enjoys the computational benefit while enabling the detection of novel labels absent from training by exploring label dependence and leveraging label-only data for higher accuracy. Theoretically, we show that the proposed method reconstructs the Bayes performance consistently, achieving the desired learning accuracy. Numerically, we demonstrate that the proposed method compares favorably in terms of the proposed and Hamming losses against binary relevance and a regularized Ising classifier modeling conditional label dependence. Indeed, leveraging additional labels tends to improve the supervised performance, especially when the training sample is not very large, as in semisupervised learning. Finally, we demonstrate the utility of the proposed approach on the Microsoft COCO object detection challenge, PASCAL visual object classes challenge 2007, and Mediamill benchmark. *(abstract via OpenAlex)*

SiM Diagnostics & Prediction · 发表于 2023-04-03

CRM and partial order CRM with adaptive rescaling for dose‐finding in immunotherapy trials with a continuous outcome

Pooja T. Saha, Jason P. Fine, Anastasia Ivanova

摘要

In many phase 1 oncology trials of immunotherapies, no dose‐limiting toxicities are observed and the maximum tolerated dose cannot be identified. In these settings, dose‐finding can be guided by a biomarker of response rather than the occurrences of dose‐limiting toxicity. The recommended phase 2 dose can be defined as the dose with mean response equal to a prespecified value of a continuous response biomarker. To target the mean of a continuous biomarker, we build on the idea of the continual reassessment method and the quasi‐Bernoulli likelihood. We extend the design to a problem of finding the recommended phase 2 dose combination in a trial with multiple immunotherapies.

JASA Testing & Uncertainty High-Dimensional · 发表于 2023-04-03

A Scale-Free Approach for False Discovery Rate Control in Generalized Linear Models

Chenguang Dai, Buyu Lin, Xin Xing, Jun S. Liu

摘要

The Generalized Linear Model (GLM) has been widely used in practice to model counts or other types of non-Gaussian data. This article introduces a framework for feature selection in the GLM that can achieve robust False Discovery Rate (FDR) control. The main idea is to construct a mirror statistic based on data perturbation to measure the importance of each feature. FDR control is achieved by taking advantage of the mirror statistic’s property that its sampling distribution is (asymptotically) symmetric about zero for any null feature. In the moderate-dimensional setting, that is, p/n→κ∈(0,1), we construct the mirror statistic based on the maximum likelihood estimation. In the high-dimensional setting, that is, p≫n, we use the debiased Lasso to build the mirror statistic. The proposed methodology is scale-free as it only hinges on the symmetry of the mirror statistic, thus, can be more robust in finite-sample cases compared to existing methods. Both simulation results and a real data application show that the proposed methods are capable of controlling the FDR and are often more powerful than existing methods including the Benjamini-Hochberg procedure and the knockoff filter. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Diagnostics & Prediction Nonparametric & Semiparametric · 发表于 2023-04-03

A Reproducing Kernel Hilbert Space Approach to Functional Calibration of Computer Models

Rui Tuo, Shiyuan He, Arash Pourhabib, Yu Ding, Jianhua Z. Huang

摘要

This article develops a frequentist solution to the functional calibration problem, where the value of a calibration parameter in a computer model is allowed to vary with the value of control variables in the physical system. The need of functional calibration is motivated by engineering applications where using a constant calibration parameter results in a significant mismatch between outputs from the computer model and the physical experiment. Reproducing kernel Hilbert spaces (RKHS) are used to model the optimal calibration function, defined as the functional relationship between the calibration parameter and control variables that gives the best prediction. This optimal calibration function is estimated through penalized least squares with an RKHS-norm penalty and using physical data. An uncertainty quantification procedure is also developed for such estimates. Theoretical guarantees of the proposed method are provided in terms of prediction consistency and consitency of estimating the optimal calibration function. The proposed method is tested using both real and synthetic data and exhibits more robust performance in prediction and uncertainty quantification than the existing parametric functional calibration method and a state-of-art Bayesian method. *(abstract via OpenAlex)*

Biometrika Testing & Uncertainty · 发表于 2023-04-02

Tailored inference for finite populations: conditional validity and transfer across distributions

Ying Jin, Dominik Rothenhäusler

摘要

Summary: Parameters of subpopulations can be more relevant than those of superpopulations. For example, a healthcare provider may be interested in the effect of a treatment plan for a specific subset of their patients; policymakers may be concerned with the impact of a policy in a particular state within a given population. In these cases, the focus is on a specific finite population, as opposed to an infinite superpopulation. Such a population can be characterized by fixing some attributes that are intrinsic to them, leaving unexplained variations like measurement error as random. Inference for a population with fixed attributes can then be modelled as inferring parameters of a conditional distribution. Accordingly, it is desirable that confidence intervals are conditionally valid for the realized population, instead of marginalizing over many possible draws of populations. We provide a statistical inference framework for parameters of finite populations with known attributes. Leveraging the attribute information, our estimators and confidence intervals closely target a specific finite population. When the data are from the population of interest, our confidence intervals attain asymptotic conditional validity, given the attributes, and are shorter than those for superpopulation inference. In addition, we develop procedures to infer parameters of new populations with differing covariate distributions; the confidence intervals are also conditionally valid for the new populations under mild conditions. Our methods extend to situations where the fixed information has a weaker structure or is only partially observed. We demonstrate the validity and applicability of our methods using simulated data and a real-word dataset for predicting car prices.

SiM Bayesian Methods · 发表于 2023-04-02

Summarizing empirical information on between‐study heterogeneity for Bayesian random‐effects meta‐analysis

Christian Röver, Sibylle Sturtz, Jona Lilienthal, Ralf Bender, Tim Friede

摘要

In Bayesian meta‐analysis, the specification of prior probabilities for the between‐study heterogeneity is commonly required, and is of particular benefit in situations where only few studies are included. Among the considerations in the set‐up of such prior distributions, the consultation of available empirical data on a set of relevant past analyses sometimes plays a role. How exactly to summarize historical data sensibly is not immediately obvious; in particular, the investigation of an empirical collection of heterogeneity estimates will not target the actual problem and will usually only be of limited use. The commonly used normal‐normal hierarchical model for random‐effects meta‐analysis is extended to infer a heterogeneity prior. Using an example data set, we demonstrate how to fit a distribution to empirically observed heterogeneity data from a set of meta‐analyses. Considerations also include the choice of a parametric distribution family. Here, we focus on simple and readily applicable approaches to then translate these into (prior) probability distributions.

SiM Networks & Graphs · 发表于 2023-04-02

SpiderLearner: An ensemble approach to Gaussian graphical model estimation

Katherine H. Shutta, Laura B. Balzer, Denise M. Scholtens, Raji Balasubramanian

摘要

Gaussian graphical models (GGMs) are a popular form of network model in which nodes represent features in multivariate normal data and edges reflect conditional dependencies between these features. GGM estimation is an active area of research. Currently available tools for GGM estimation require investigators to make several choices regarding algorithms, scoring criteria, and tuning parameters. An estimated GGM may be highly sensitive to these choices, and the accuracy of each method can vary based on structural characteristics of the network such as topology, degree distribution, and density. Because these characteristics are a priori unknown, it is not straightforward to establish universal guidelines for choosing a GGM estimation method. We address this problem by introducing SpiderLearner, an ensemble method that constructs a consensus network from multiple estimated GGMs. Given a set of candidate methods, SpiderLearner estimates the optimal convex combination of results from each method using a likelihood‐based loss function. ‐fold cross‐validation is applied in this process, reducing the risk of overfitting. In simulations, SpiderLearner performs better than or comparably to the best candidate methods according to a variety of metrics, including relative Frobenius norm and out‐of‐sample likelihood. We apply SpiderLearner to publicly available ovarian cancer gene expression data including 2013 participants from 13 diverse studies, demonstrating our tool's potential to identify biomarkers of complex disease. SpiderLearner is implemented as flexible, extensible, open‐source code in the R package ensembleGGM at https://github.com/katehoffshutta/ensembleGGM .

第 1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 页