2023 年的期刊文章 · 第 15 页

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

按期刊、按主题看 →

第 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 页

SMMR Other · 发表于 2023-06-07

Test sensitivity in a prospective cancer screening program: A critique of a common proxy measure

Jane Lange, Yibai Zhao, Kemal Caglar Gogebakan, Antonio Olivas-Martinez, Marc D. Ryser, Charlotte C. Gard, Ruth Etzioni

摘要

The true sensitivity of a cancer screening test, defined as the frequency with which the test returns a positive result if the cancer is present, is a key indicator of diagnostic performance. Given the challenges of directly assessing test sensitivity in a prospective screening program, proxy measures for true sensitivity are frequently reported. We call one such proxy empirical sensitivity, as it is given by the observed ratio of screen-detected cancers to the sum of screen-detected and interval cancers. In the setting of the canonical three-state Markov model for progression from preclinical onset to clinical diagnosis, we formulate a mathematical relationship for how empirical sensitivity varies with the screening interval and the mean preclinical sojourn time and identify conditions under which empirical sensitivity exceeds or falls short of true sensitivity. In particular, when the inter-screening interval is short relative to the mean sojourn time, empirical sensitivity tends to exceed true sensitivity, unless true sensitivity is high. The Breast Cancer Surveillance Consortium (BCSC) has reported an estimate of 0.87 for the empirical sensitivity of digital mammography. We show that this corresponds to a true sensitivity of 0.82 under a mean sojourn time of 3.6 years estimated based on breast cancer screening trials. However, the BCSC estimate of empirical sensitivity corresponds to even lower true sensitivity under more contemporary, longer estimates of mean sojourn time. Consistently applied nomenclature that distinguishes empirical sensitivity from true sensitivity is needed to ensure that published estimates of sensitivity from prospective screening studies are properly interpreted.

SiM Diagnostics & Prediction Survival Analysis Bayesian Methods · 发表于 2023-06-07

Tackling dynamic prediction of death in patients with recurrent cardiovascular events

Menglu Liang, Zheng Li, Liang Li, Vernon M. Chinchilli, Lijun Zhang, Ming Wang

摘要

In the field of cardiovascular disease, recurrent events such as stroke or myocardial infarction (MI) are often encountered, leading to an increase in the risk of death. Accurately evaluating the prognosis of patients and dynamically predicting the risk of death by considering the historical recurrent events can improve medical decisions and lead to better health care outcomes. Recently proposed joint modeling approaches within the Bayesian framework have inspired the development of a dynamic prediction tool, which can be applied for subject‐level prediction of death with implementation in software packages. The prediction model incorporates subject heterogeneity with subject‐level random effects that account for unobserved time‐invariant factors and an extra copula function capturing the part caused by unmeasured time‐dependent factors. Thereafter, given the prespecified landmark time , the survival probability for a prediction horizon time of interest can be estimated for each individual. The prediction accuracy is assessed by time‐dependent receiving operating characteristic curve and the area under the curve and the Brier score with calibration plots is compared to traditional joint frailty models. Finally, the tool is applied to patients with multiple attacks of stroke or MI in the Cardiovascular Health study and the Atherosclerosis Risk in Communities study for illustration.

SiM Causal Inference High-Dimensional · 发表于 2023-06-07

Rule ensemble method with adaptive group lasso for heterogeneous treatment effect estimation

Ke Wan, Kensuke Tanioka, Toshio Shimokawa

摘要

The increasing scientific attention given to precision medicine based on real‐world data has led to many recent studies clarifying the relationships between treatment effects and patient characteristics. However, this is challenging because of ubiquitous heterogeneity in the treatment effect for individuals and the real‐world data on their backgrounds being complex and noisy. Because of their flexibility, various machine learning (ML) methods have been proposed for estimating heterogeneous treatment effect (HTE). However, most ML methods incorporate black‐box models that hamper direct interpretation of the relationships between an individual's characteristics and treatment effects. This study proposes an ML method for estimating HTE based on the rule ensemble method RuleFit. The main advantages of RuleFit are interpretability and accuracy. However, HTEs are always defined in the potential outcome framework, and RuleFit cannot be applied directly. Thus, we modified RuleFit and proposed a method to estimate HTEs that directly interpret the relationships among the individuals' features from the model. Actual data from an HIV study, the ACTG 175 dataset, was used to illustrate the interpretation based on the ensemble of rules created by the proposed method. The numerical results confirm that the proposed method has high prediction accuracy compared to previous methods, indicating that the proposed method establishes an interpretable model with sufficient prediction accuracy.

SiM Bayesian Methods · 发表于 2023-06-07

Approximate Bayesian computation for the natural history of breast cancer, with application to data from a Milan cohort study

Laura Bondi, Marco Bonetti, Denitsa Grigorova, Antonio Russo

摘要

Summary: We explore models for the natural history of breast cancer, where the main events of interest are the start of asymptomatic detectability of the disease (through screening) and the time of symptomatic detection (through symptoms). We develop several parametric specifications based on a cure rate structure, and present the results of the analysis of data collected as part of a motivating study from Milan. Participants in the study were part of a regional breast cancer screening program, and their ten‐year trajectories were obtained from administrative data available from the Italian national health care system. We first present a tractable model for which we develop the likelihood contributions of the observed trajectories and perform maximum likelihood inference on the latent process. Likelihood based inference is not feasible for more flexible models, and we implement approximate Bayesian computation (ABC) for inference. Issues that arise from the use of ABC for model choice and parameter estimation are discussed, including the problem of choosing appropriate summary statistics. The estimated parameters of the underlying disease process allow for the study of the effect of different examination schedules (age range and frequency of screening examinations) on a population of asymptomatic subjects.

SMMR Clinical Trials · 发表于 2023-06-07

An overview of optimal designs under a given budget in cluster randomized trials with a binary outcome

Jingxia Liu, Lei Liu, Aimee S. James, Graham A. Colditz

摘要

Cluster randomized trial design may raise financial concerns because the cost to recruit an additional cluster is much higher than to enroll an additional subject in subject-level randomized trials. Therefore, it is desirable to develop an optimal design. For local optimal designs, optimization means the minimum variance of the estimated treatment effect under the total budget. The local optimal design derived from the variance needs the input of an association parameter [Formula: see text] in terms of a “working” correlation structure [Formula: see text] in the generalized estimating equation models. When the range of [Formula: see text] instead of an exact value is available, the parameter space is defined as the range of [Formula: see text] and the design space is defined as enrollment feasibility, for example, the number of clusters or cluster size. For any value [Formula: see text] within the range, the optimal design and relative efficiency for each design in the design space is obtained. Then, for each design in the design space, the minimum relative efficiency within the parameter space is calculated. MaxiMin design is the optimal design that maximizes the minimum relative efficiency among all designs in the design space. Our contributions are threefold. First, for three common measures (risk difference, risk ratio, and odds ratio), we summarize all available local optimal designs and MaxiMin designs utilizing generalized estimating equation models when the group allocation proportion is predetermined for two-level and three-level parallel cluster randomized trials. We then propose the local optimal designs and MaxiMin designs using the same models when the group allocation proportion is undecided. Second, for partially nested designs, we develop the optimal designs for three common measures under the setting of equal number of subjects per cluster and exchangeable working correlation structure in the intervention group. Third, we create three new Statistical Analysis System (SAS) macros and update two existing SAS macros for all the optimal designs. We provide two examples to illustrate our methods.

Biometrics Networks & Graphs · 发表于 2023-06-07

A Stochastic Block Ising Model for Multi-Layer Networks with Inter-Layer Dependence

Jingnan Zhang, Chengye Li, Junhui Wang

摘要

Community detection has attracted tremendous interests in network analysis, which aims at finding group of nodes with similar characteristics. Various detection methods have been developed to detect homogeneous communities in multi-layer networks, where inter-layer dependence is a widely acknowledged but severely under-investigated issue. In this paper, we propose a novel stochastic block Ising model (SBIM) to incorporate the inter-layer dependence to help with community detection in multi-layer networks. The community structure is modeled by the stochastic block model (SBM) and the inter-layer dependence is incorporated via the popular Ising model. Furthermore, we develop an efficient variational EM algorithm to tackle the resultant optimization task and establish the asymptotic consistency of the proposed method. Extensive simulated examples and a real example on gene co-expression multi-layer network data are also provided to demonstrate the advantage of the proposed method.

SMMR Clinical Trials Bayesian Methods · 发表于 2023-06-06

qTPI: A quasi-toxicity probability interval design for phase I trials with multiple-grade toxicities

Haodong Ling, Haolun Shi, Nan Yuan, Yuan Ji, Xiaolei Lin

摘要

The common terminology criteria for adverse events by the National Cancer Institute has greatly facilitated the revolution of drug development and an increasing number of Phase I trials have started to collect multiple-grade toxicity endpoints. Appropriate and yet transparent Phase I statistical designs for multiple-grade toxicities are therefore in great needs. In this article, we propose a quasi-toxicity probability interval (qTPI) design that incorporates a quasi-continuous measure of the toxicity probability ([Formula: see text]) into the Bayesian theoretic framework of the interval based designs. Multiple-grade toxicity outcomes of each patient are mapped to [Formula: see text] according to a severity weight matrix. Dose–toxicity curve underlying the dosing decisions in the qTPI design is continuously updated using accumulating trial data. Numerical simulations investigating the operating characteristics of qTPI show that qTPI achieved better safety, accuracy and reliability compared to designs that rely on binary toxicity data. Furthermore, parameter elicitation in qTPI is simple and does not involve multiple hypothetical cohorts specification. Finally, a hypothetical soft tissue sarcoma trial with six toxicity types and grade 0 to grade 4 severity grades is illustrated with patient-by-patient dose allocation under the qTPI design.

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

Mixture of longitudinal factor analyzers and their application to the assessment of chronic pain

Amine Ounajim, Yousri Slaoui, Pierre‐Yves Louis, Maxime Billot, Denis Frasca, Philippe Rigoard

摘要

Multivariate longitudinal data are used in a variety of research areas not only because they allow to analyze time trajectories of multiple indicators, but also to determine how these trajectories are influenced by other covariates. In this article, we propose a mixture of longitudinal factor analyzers. This model could be used to extract latent factors representing multiple longitudinal noisy indicators in heterogeneous longitudinal data and to study the impact of one or several covariates on these latent factors. One of the advantages of this model is that it allows for measurement non‐invariance, which arises in practice when the factor structure varies between groups of individuals due to cultural or physiological differences. This is achieved by estimating different factor models for different latent classes. The proposed model could also be used to extract latent classes with different latent factor trajectories over time. Other advantages of the model include its ability to take into account heteroscedasticity of errors in the factor analysis model by estimating different error variances for different latent classes. We first define the mixture of longitudinal factor analyzers and its parameters. Then, we propose an EM algorithm to estimate these parameters. We propose a Bayesian information criterion to identify both the number of components in the mixture and the number of latent factors. We then discuss the comparability of the latent factors obtained between subjects in different latent groups. Finally, we apply the model to simulated and real data of patients with chronic postoperative pain.

SMMR Clinical Trials · 发表于 2023-06-06

Matching ratio and sample size for optimal sequential testing with binomial data

Ivair R. Silva, Fernando Oliveira

摘要

Statistical sequential analysis of binary data is an important tool in clinical trials such as placebo-controlled trials, where a total of [Formula: see text] individuals are randomly allocated into two groups, one of size [Formula: see text] receiving the treatment/drug, and the other of size [Formula: see text] for placebo. The ratio [Formula: see text], namely “matching ratio,” determines the expected proportion of adverse events from the treatment group among the [Formula: see text] individuals. Bernoulli-based designs are used for monitoring the safety of post-licensed drugs and vaccines as well. For instance, in a self-control design, [Formula: see text] is the ratio between the risk and the control time windows. Irrespective of the type of application, the choice of [Formula: see text] is a critical design criterion as it determines the sample size, the statistical power, the expected sample size, and the expected time to signal the sequential procedure. In this paper, we run exact calculations to offer a statistical rule of thumb for the choice of [Formula: see text]. All the calculations and examples are performed using the R Sequential package.

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

Estimating transformations for evaluating diagnostic tests with covariate adjustment

Ainesh Sewak, Torsten Hothorn

摘要

Receiver operating characteristic analysis is one of the most popular approaches for evaluating and comparing the accuracy of medical diagnostic tests. Although various methodologies have been developed for estimating receiver operating characteristic curves and their associated summary indices, there is no consensus on a single framework that can provide consistent statistical inference while handling the complexities associated with medical data. Such complexities might include non-normal data, covariates that influence the diagnostic potential of a test, ordinal biomarkers or censored data due to instrument detection limits. We propose a regression model for the transformed test results which exploits the invariance of receiver operating characteristic curves to monotonic transformations and accommodates these features. Simulation studies show that the estimates based on transformation models are unbiased and yield coverage at nominal levels. The methodology is applied to a cross-sectional study of metabolic syndrome where we investigate the covariate-specific performance of weight-to-height ratio as a non-invasive diagnostic test. Software implementations for all the methods described in the article are provided in the tram add-on package to the R system for statistical computing and graphics.

JASA Other · 发表于 2023-06-05

Ridge Regression Under Dense Factor Augmented Models

Yi He

摘要

This article establishes a comprehensive theory of the optimality, robustness, and cross-validation selection consistency for the ridge regression under factor-augmented models with possibly dense idiosyncratic information.Using spectral analysis for random matrices, we show that the ridge regression is asymptotically efficient in capturing both factor and idiosyncratic information by minimizing the limiting predictive loss among the entire class of spectral regularized estimators under large-dimensional factor models and mixedeffects hypothesis.We derive an asymptotically optimal ridge penalty in closed form and prove that a biascorrected k-fold cross-validation procedure can adaptively select the best ridge penalty in large samples.We extend the theory to the autoregressive models with many exogenous variables and establish a consistent cross-validation procedure using the what-we-called double ridge regression method.Our results allow for nonparametric distributions for, possibly heavy-tailed, martingale difference errors and idiosyncratic random coefficients and adapt to the cross-sectional and temporal dependence structures of the largedimensional predictors.We demonstrate the performance of our ridge estimators in simulated examples as well as an economic dataset.All the proofs are available in the supplementary materials, which also includes more technical discussions and remarks, extra simulation results, and useful lemmas that may be of independent interest. *(abstract via OpenAlex)*

JASA Survival Analysis Causal Inference Machine Learning · 发表于 2023-06-05

Inference for Treatment-Specific Survival Curves Using Machine Learning

Ted Westling, Alex Luedtke, Peter B. Gilbert, Marco Carone

摘要

In the absence of data from a randomized trial, researchers may aim to use observational data to draw causal inference about the effect of a treatment on a time-to-event outcome. In this context, interest often focuses on the treatment-specific survival curves, that is, the survival curves were the population under study to be assigned to receive the treatment or not. Under certain conditions, including that all confounders of the treatment-outcome relationship are observed, the treatment-specific survival curve can be identified with a covariate-adjusted survival curve. In this article, we propose a novel cross-fitted doubly-robust estimator that incorporates data-adaptive (e.g. machine learning) estimators of the conditional survival functions. We establish conditions on the nuisance estimators under which our estimator is consistent and asymptotically linear, both pointwise and uniformly in time. We also propose a novel ensemble learner for combining multiple candidate estimators of the conditional survival estimators. Notably, our methods and results accommodate events occurring in discrete or continuous time, or an arbitrary mix of the two. We investigate the practical performance of our methods using numerical studies and an application to the effect of a surgical treatment to prevent metastases of parotid carcinoma on mortality. *(abstract via PubMed)*

SiM Other · 发表于 2023-06-05

Exact inference for fixed effects meta‐analysis of 2×2$$ 2\times 2 $$ tables

Spencer Hansen, Kenneth Rice

摘要

Meta‐analysis of associations between rare outcomes and binary exposures are particularly important in studies of a drug's potential side‐effects. But meta‐analysis of the resulting contingency tables presents substantial practical difficulties, as analysts are currently forced to pick between “exact” inference—that eliminates concern over using large‐sample approximations with small cell counts—and explicitly allowing for heterogeneity of the underlying effects. A controversial example is given by the Avandia meta‐analysis (Nissen and Wolski. N Engl J Med. 2007;356(24):2457–2471) of rosiglitazone's effects on myocardial infarction and death. While the initial Avandia analysis—using simple methods—found a significant effect, its results conflict with subsequent re‐analyses that use either exact methods, or that explicitly acknowledge the plausible heterogeneity. In this article, we aim to resolve these difficulties, by providing an exact (albeit conservative) method that is valid under heterogeneity. We also provide a measure of the degree of conservatism, that indicates the approximate extent of the excess coverage. Applied to the Avandia data, we find support for Nissen and Wolski 2007's original results. Given that our method does not require strong assumptions or large cell counts, and provides intervals around the well‐known conditional maximum likelihood estimate, we anticipate that it could be an attractive default method for meta‐analysis of tables featuring rare events.

JASA Testing & Uncertainty · 发表于 2023-06-05

Anytime-Valid Tests of Conditional Independence Under Model-X

Peter Grünwald, Alexander Henzi, Tyron Lardy

摘要

We propose a sequential, anytime-valid method to test the conditional independence of a response Y and a predictor X given a random vector Z. The proposed test is based on e-statistics and test martingales, which generalize likelihood ratios and allow valid inference at arbitrary stopping times. In accordance with the recently introduced model-X setting, our test depends on the availability of the conditional distribution of X given Z, or at least a sufficiently sharp approximation thereof. Within this setting, we derive a general method for constructing e-statistics for testing conditional independence, show that it leads to growth-rate optimal e-statistics for simple alternatives, and prove that our method yields tests with asymptotic power one in the special case of a logistic regression model. A simulation study is done to demonstrate that the approach is competitive in terms of power when compared to established sequential and nonsequential testing methods, and robust with respect to violations of the model-X assumption. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

JASA Nonparametric & Semiparametric Testing & Uncertainty · 发表于 2023-06-05

A Unified Inference for Predictive Quantile Regression

Xiaohui Liu, Wei Long, Liang Peng, Bingduo Yang

摘要

The asymptotic behavior of quantile regression inference becomes dramatically different when it involves a persistent predictor with zero or nonzero intercept. Distinguishing various properties of a predictor is empirically challenging. In this article, we develop a unified predictability test for quantile regression regardless of the presence of intercept and persistence of a predictor. The developed test is a novel combination of data splitting, weighted inference, and a random weighted bootstrap method. Monte Carlo simulations show that the new approach displays significantly better size and power performance than other competing methods in various scenarios, particularly when the predictive regressor contains a nonzero intercept. In an empirical application, we revisit the quantile predictability of the monthly S&P 500 returns between 1980 and 2019. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SiM High-Dimensional Latent Variables & Mixtures Bayesian Methods · 发表于 2023-06-05

A Bayesian hierarchical sparse factor model for estimating simultaneous covariance matrices for gestational outcomes in consecutive pregnancies

Debamita Kundu, Ritendranath Mitra, Paul S. Albert, Jeremy T. Gaskins

摘要

Covariance estimation for multiple groups is a key feature for drawing inference from a heterogeneous population. One should seek to share information about common features in the dependence structures across the various groups. In this paper, we introduce a novel approach for estimating the covariance matrices for multiple groups using a hierarchical latent factor model that shrinks the factor loadings across groups toward a global value. Using a sparse spike and slab model on these loading coefficients allows for a sparse formulation of our model. Parameter estimation is accomplished through a Markov chain Monte Carlo scheme, and a model selection approach is used to select the number of factors to use. We validate our model through extensive simulation studies. Finally, we apply our methodology to the NICHD Consecutive Pregnancies Study to estimate the correlations between birth weights and gestational ages of three consecutive birth within four different subgroups (underweight, normal, overweight, and obese) of women.

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

Ying Zhou and Xinyi Zhang's contribution to the Discussion of ‘Vintage Factor Analysis with Varimax Performs Statistical Inference’ by Rohe & Zeng

Ying Zhou, Xinyi Zhang

摘要

We congratulate Rohe and Zeng for their inspiring work on providing theoretical support for Varimax rotation in factor analysis. A key contribution of the article is the demonstration that if the factors in the semi-parametric factor model follow heavy-tailed distribution, then performing principal components analysis (PCA) on the observed data matrix along with Varimax rotation applied to the principal components does produce interpretable explanatory variables. We have the following comments and questions: The article mainly discussed the semi-parametric model, which seems to exclude the classical factor model in the form AT=LF+ε⁠, where observation matrix A∈Rn×d⁠, loading matrix L∈Rd×k⁠, factor matrix F∈Rk×n⁠, error term matrix ε∈Rd×n⁠. One question is whether there is a similar result applicable to the classical factor model. If not, what are the obstacles? And what properties of semi-parametric factor model facilitate the identification? The main theorem in the article concerns the factor matrix F (A in their notation), while in many applications, people are interested in the loading matrix L. It appears there is no loading matrix in semi-parametric factor model. Perhaps BYT in Definition 1 is somewhat related to loading matrix. This lead to the question that, if there is a parallel result for Y. As one of the modern factor models, the Independent Components Analysis is an unsupervised learning algorithm and can be applied for feature extraction. Would it be possible to integrate class information with the Varimax rotation for extracting features that belong to well-separated classes? It would be interesting to see if the Vintage Factor Analysis can be used in a supervised fashion. If we understand it correctly, derivation of the population results for PCA with latent variable models and Varimax uses Σ^Z−1/2 to show how U can be recovered from Z. In theory, dimension d can be of the same order as n. However, in this case, the sample covariance matrix Σ^Z may not be invertible and an alternative estimation of ΣZ−1/2 is needed. Can similar results be established? The factors Z are allowed to be correlated, will the corresponding theory be a direct generalisation from the independent setting? The authors replied later, in writing, as follows. *(abstract via OpenAlex)*

SiM Genetics & Omics · 发表于 2023-06-02

Experimental design and power calculation in omics circadian rhythmicity detection using the cosinor model

Wei Zong, Marianne L. Seney, Kyle D. Ketchesin, Michael T. Gorczyca, Andrew C. Liu, Karyn A. Esser, George C. Tseng, Colleen A. McClung, Zhiguang Huo

摘要

Summary: Circadian clocks are 24‐h endogenous oscillators in physiological and behavioral processes. Though recent transcriptomic studies have been successful in revealing the circadian rhythmicity in gene expression, the power calculation for omics circadian analysis have not been fully explored. In this paper, we develop a statistical method, namely CircaPower, to perform power calculation for circadian pattern detection. Our theoretical framework is determined by three key factors in circadian gene detection: sample size, intrinsic effect size and sampling design. Via simulations, we systematically investigate the impact of these key factors on circadian power calculation. We not only demonstrate that CircaPower is fast and accurate, but also show its underlying cosinor model is robust against variety of violations of model assumptions. In real applications, we demonstrate the performance of CircaPower using mouse pan‐tissue data and human post‐mortem brain data, and illustrate how to perform circadian power calculation using mouse skeleton muscle RNA‐Seq pilot as case study. Our method CircaPower has been implemented in an R package, which is made publicly available on GitHub ( https://github.com/circaPower/circaPower).

AoS Other · 发表于 2023-06-01

Universal regression with adversarial responses

Moïse Blanchard, Patrick Jaillet

摘要

We provide algorithms for regression with adversarial responses under large classes of non-i.i.d. instance sequences, on general separable metric spaces, with provably minimal assumptions. We also give characterizations of learnability in this regression context. We consider universal consistency, which asks for strong consistency of a learner without restrictions on the value responses. Our analysis shows that such an objective is achievable for a significantly larger class of instance sequences than stationary processes, and unveils a fundamental dichotomy between value spaces: whether finite-horizon mean estimation is achievable or not. We further provide optimistically universal learning rules, that is, such that if they fail to achieve universal consistency, any other algorithms will fail as well. For unbounded losses, we propose a mild integrability condition under which there exist algorithms for adversarial regression under large classes of non-i.i.d. instance sequences. In addition, our analysis also provides a learning rule for mean estimation in general metric spaces that is consistent under adversarial responses without any moment conditions on the sequence, a result of independent interest.

AoS Networks & Graphs · 发表于 2023-06-01

Universal rank inference via residual subsampling with application to large networks

Xiao Han, Qing Yang, Yingying Fan

摘要

Determining the precise rank is an important problem in many large-scale applications with matrix data exploiting low-rank plus noise models. In this paper, we suggest a universal approach to rank inference via residual subsampling (RIRS) for testing and estimating rank in a wide family of models, including many popularly used network models such as the degree corrected mixed membership model as a special case. Our procedure constructs a test statistic via subsampling entries of the residual matrix after extracting the spiked components. The test statistic converges in distribution to the standard normal under the null hypothesis, and diverges to infinity with asymptotic probability one under the alternative hypothesis. The effectiveness of RIRS procedure is justified theoretically, utilizing the asymptotic expansions of eigenvectors and eigenvalues for large random matrices recently developed in (J. Amer. Statist. Assoc. 117 (2022) 996–1009) and (J. R. Stat. Soc. Ser. B. Stat. Methodol. 84 (2022) 630–653). The advantages of the newly suggested procedure are demonstrated through several simulation and real data examples.

AoS Other · 发表于 2023-06-01

Total positivity in multivariate extremes

Frank Röttger, Sebastian Engelke, Piotr Zwiernik

摘要

Positive dependence is present in many real world data sets and has appealing stochastic properties that can be exploited in statistical modeling and in estimation. In particular, the notion of multivariate total positivity of order 2 (MTP2) is a convex constraint and acts as an implicit regularizer in the Gaussian case. We study positive dependence in multivariate extremes and introduce EMTP2, an extremal version of MTP2. This notion turns out to appear prominently in extremes, and in fact, it is satisfied by many classical models. For a Hüsler–Reiss distribution, the analogue of a Gaussian distribution in extremes, we show that it is EMTP2 if and only if its precision matrix is a Laplacian of a connected graph. We propose an estimator for the parameters of the Hüsler–Reiss distribution under EMTP2 as the solution of a convex optimization problem with Laplacian constraint. We prove that this estimator is consistent and typically yields a sparse model with possibly nondecomposable extremal graphical structure. Applying our methods to a data set of Danube River flows, we illustrate this regularization and the superior performance compared to existing methods. *(abstract via OpenAlex)*

AoS Spatial & Time Series · 发表于 2023-06-01

Pairwise interaction function estimation of stationary Gibbs point processes using basis expansion

Ismaïla Ba, Jean-François Coeurjolly, Francisco Cuevas-Pacheco

摘要

The class of Gibbs point processes (GPP) is a large class of spatial point processes able to model both clustered and repulsive point patterns. They are specified by their conditional intensity, which for a point pattern x and a location u, is roughly speaking the probability that an event occurs in an infinitesimal ball around u given the rest of the configuration is x. The most simple and natural class of models is the class of pairwise interaction point processes where the conditional intensity depends on the number of points and pairwise distances between them. This paper is concerned with the problem of estimating the pairwise interaction function nonparametrically. We propose to estimate it using an orthogonal series expansion of its logarithm. Such an approach has numerous advantages compared to existing ones. The estimation procedure is simple, fast and completely data-driven. We provide asymptotic properties such as consistency and asymptotic normality and show the efficiency of the procedure through simulation experiments and illustrate it with several data sets.

AoS Other · 发表于 2023-06-01

Orthogonal statistical learning

Dylan J. Foster, Vasilis Syrgkanis

摘要

We provide nonasymptotic excess risk guarantees for statistical learning in a setting where the population risk with respect to which we evaluate the target parameter depends on an unknown nuisance parameter that must be estimated from data. We analyze a two-stage sample splitting meta-algorithm that takes as input arbitrary estimation algorithms for the target parameter and nuisance parameter. We show that if the population risk satisfies a condition called Neyman orthogonality, the impact of the nuisance estimation error on the excess risk bound achieved by the meta-algorithm is of second order. Our theorem is agnostic to the particular algorithms used for the target and nuisance and only makes an assumption on their individual performance. This enables the use of a plethora of existing results from machine learning to give new guarantees for learning with a nuisance component. Moreover, by focusing on excess risk rather than parameter estimation, we can provide rates under weaker assumptions than in previous works and accommodate settings in which the target parameter belongs to a complex nonparametric class. We provide conditions on the metric entropy of the nuisance and target classes such that oracle rates of the same order, as if we knew the nuisance parameter, are achieved.

AoS Other · 发表于 2023-06-01

Optimal reach estimation and metric learning

Eddie Aamari, Clément Berenfeld, Clément Levrard

摘要

We study the estimation of the reach, an ubiquitous regularity parameter in manifold estimation and geometric data analysis. Given an i.i.d. sample over an unknown d-dimensional Ck-smooth submanifold M of RD, we provide optimal nonasymptotic bounds for the estimation of its reach. We build upon a formulation of the reach in terms of maximal curvature on one hand and geodesic metric distortion on the other. The derived rates are adaptive, with rates depending on whether the reach of M arises from curvature or from a bottleneck structure. In the process we derive optimal geodesic metric estimation bounds.

AoS Meta-Analysis & Data Integration High-Dimensional Nonparametric & Semiparametric · 发表于 2023-06-01

Optimal high-dimensional and nonparametric distributed testing under communication constraints

Botond Szabó, Lasse Vuursteen, Harry van Zanten

摘要

We derive minimax testing errors in a distributed framework where the data is split over multiple machines and their communication to a central machine is limited to b bits. We investigate both the d- and infinite-dimensional signal detection problem under Gaussian white noise. We also derive distributed testing algorithms reaching the theoretical lower bounds. Our results show that distributed testing is subject to fundamentally different phenomena that are not observed in distributed estimation. Among our findings we show that testing protocols that have access to shared randomness can perform strictly better in some regimes than those that do not. We also observe that consistent nonparametric distributed testing is always possible, even with as little as one bit of communication, and the corresponding test outperforms the best local test using only the information available at a single local machine. Furthermore, we also derive adaptive nonparametric distributed testing strategies and the corresponding theoretical lower bounds.

AoS Latent Variables & Mixtures High-Dimensional · 发表于 2023-06-01

Optimal discriminant analysis in high-dimensional latent factor models

Xin Bing, Marten Wegkamp

摘要

In high-dimensional classification problems, a commonly used approach is to first project the high-dimensional features into a lower-dimensional space, and base the classification on the resulting lower-dimensional projections. In this paper, we formulate a latent-variable model with a hidden low-dimensional structure to justify this two-step procedure and to guide which projection to choose. We propose a computationally efficient classifier that takes certain principal components (PCs) of the observed features as projections, with the number of retained PCs selected in a data-driven way. A general theory is established for analyzing such two-step classifiers based on any projections. We derive explicit rates of convergence of the excess risk of the proposed PC-based classifier. The obtained rates are further shown to be optimal up to logarithmic factors in the minimax sense. Our theory allows the lower dimension to grow with the sample size and is also valid even when the feature dimension (greatly) exceeds the sample size. Extensive simulations corroborate our theoretical findings. The proposed method also performs favorably relative to other existing discriminant methods on three real data examples.

AoS Other · 发表于 2023-06-01

Optimal Permutation Estimation in CrowdSourcing problems

Emmanuel Pilliat, Alexandra Carpentier, Nicolas Verzelen

摘要

Motivated by crowdsourcing applications, we consider a model where we have partial observations from a bivariate isotonic n×d matrix with an unknown permutation π∗ acting on its rows. Focusing on the twin problems of recovering the permutation π∗ and estimating the unknown matrix, we introduce a polynomial-time procedure achieving the minimax risk for these two problems, this for all possible values of n, d, and all possible sampling efforts. Along the way we establish that, in some regimes, recovering the unknown permutation π∗ is considerably simpler than estimating the matrix.

AoS Machine Learning · 发表于 2023-06-01

Minimax rate of distribution estimation on unknown submanifolds under adversarial losses

Rong Tang, Yun Yang

摘要

Statistical inference from high-dimensional data with low-dimensional structures has recently attracted a lot of attention. In machine learning, deep generative modelling approaches implicitly estimate distributions of complex objects by creating new samples from the underlying distribution, and have achieved great success in generating synthetic realistic-looking images and texts. A key step in these approaches is the extraction of latent features or representations (encoding) that can be used for accurately reconstructing the original data (decoding). In other words, low-dimensional manifold structure is implicitly assumed and utilized in the distribution modelling and estimation. To understand the benefit of low-dimensional manifold structure in generative modelling, we build a general minimax framework for distribution estimation on unknown submanifold under adversarial losses, with suitable smoothness assumptions on the target distribution and the manifold. The established minimax rate elucidates how various problem characteristics, including intrinsic dimensionality of the data and smoothness levels of the target distribution and the manifold, affect the fundamental limit of high-dimensional distribution estimation. To prove the minimax upper bound, we construct an estimator based on a mixture of locally fitted generative models, which is motivated by the partition of unity technique from differential geometry and is necessary to cover cases where the underlying data manifold does not admit a global parametrization. We also propose a data-driven adaptive estimator that is shown to simultaneously attain within a logarithmic factor of the optimal rate over a large collection of distribution classes.

AoS Networks & Graphs · 发表于 2023-06-01

Inference in Ising models on dense regular graphs

Yuanzhe Xu, Sumit Mukherjee

摘要

In this paper, we derive the limit of experiments for one-parameter Ising models on dense regular graphs. In particular, we show that the limiting experiment is Gaussian in the “low temperature” regime, and non-Gaussian in the “critical” regime. We also derive the limiting distributions of the maximum likelihood and maximum pseudolikelihood estimators, and study limiting power for tests of hypothesis against contiguous alternatives. To the best of our knowledge, this is the first attempt at establishing the classical limits of experiments for Ising models (and more generally, Markov random fields).

AoS Causal Inference · 发表于 2023-06-01

Inference for low-rank models

Victor Chernozhukov, Christian Hansen, Yuan Liao, Yinchu Zhu

摘要

This paper studies inference in linear models with a high-dimensional parameter matrix that can be well approximated by a “spiked low-rank matrix.” A spiked low-rank matrix has rank that grows slowly compared to its dimensions and nonzero singular values that diverge to infinity. We show that this framework covers a broad class of models of latent variables, which can accommodate matrix completion problems, factor models, varying coefficient models and heterogeneous treatment effects. For inference, we apply a procedure that relies on an initial nuclear-norm penalized estimation step followed by two ordinary least squares regressions. We consider the framework of estimating incoherent eigenvectors and use a rotation argument to argue that the eigenspace estimation is asymptotically unbiased. Using this framework, we show that our procedure provides asymptotically normal inference and achieves the semiparametric efficiency bound. We illustrate our framework by providing low-level conditions for its application in a treatment effects context where treatment assignment might be strongly dependent.

AoS Optimization & Learning Theory · 发表于 2023-06-01

Finite-sample complexity of sequential Monte Carlo estimators

Joe Marion, Joseph Mathews, Scott C. Schmidler

摘要

We present bounds for the finite-sample error of sequential Monte Carlo samplers on static spaces. Our approach explicitly relates the performance of the algorithm to properties of the chosen sequence of distributions and mixing properties of the associated Markov kernels. This allows us to give the first finite-sample comparison to other Monte Carlo schemes. We obtain bounds for the complexity of sequential Monte Carlo approximations for a variety of target distributions such as finite spaces, product measures and log-concave distributions including Bayesian logistic regression. The bounds obtained are within a logarithmic factor of similar bounds obtainable for Markov chain Monte Carlo.

AoS Other · 发表于 2023-06-01

Extreme value inference for heterogeneous power law data

John H.J. Einmahl, Yi He

摘要

We extend extreme value statistics to independent data with possibly very different distributions. In particular, we present novel asymptotic normality results for the Hill estimator, which now estimates the extreme value index of the average distribution. Due to the heterogeneity, the asymptotic variance can be substantially smaller than that in the i.i.d. case. As a special case, we consider a heterogeneous scales model where the asymptotic variance can be calculated explicitly. The primary tool for the proofs is the functional central limit theorem for a weighted tail empirical process. We also present asymptotic normality results for the extreme quantile estimator. A simulation study shows the good finite-sample behavior of our limit theorems. We also present applications to assess the tail heaviness of earthquake energies and of cross-sectional stock market losses.

AoS Other · 发表于 2023-06-01

Efficiency of estimators for locally asymptotically normal quantum statistical models

Akio Fujiwara, Koichi Yamagata

摘要

We herein establish an asymptotic representation theorem for locally asymptotically normal quantum statistical models. This theorem enables us to study the asymptotic efficiency of quantum estimators, such as quantum regular estimators and quantum minimax estimators, leading to a universal tight lower bound beyond the i.i.d. assumption. This formulation complements the theory of quantum contiguity developed in the previous paper [Fujiwara and Yamagata, Bernoulli 26 (2020) 2105–2141], providing a solid foundation of the theory of weak quantum local asymptotic normality.

AoS Other · 发表于 2023-06-01

Dispersal density estimation across scales

Marc Hoffmann, Mathias Trabs

摘要

We consider a space structured population model generated by two-point clouds: a homogeneous Poisson process M with intensity n→∞ as a model for a parent generation together with a Cox point process N as offspring generation, with conditional intensity given by the convolution of M with a scaled dispersal density σ−1f(·/σ). Based on a realisation of M and N, we study the nonparametric estimation of f and the estimation of the physical scale parameter σ>0 simultaneously for all regimes σ=σn. We establish that the optimal rates of convergence do not depend monotonously on the scale and we construct minimax estimators accordingly whether σ is known or considered as a nuisance, in which case we can estimate it and achieve asymptotic minimaxity by plug-in. The statistical reconstruction exhibits a competition between a direct and a deconvolution problem. Our study reveals in particular the existence of a least favorable intermediate inference scale, a phenomenon that seems to be new.

AoS High-Dimensional Bayesian Methods · 发表于 2023-06-01

Complexity analysis of Bayesian learning of high-dimensional DAG models and their equivalence classes

Quan Zhou, Hyunwoong Chang

摘要

Structure learning via MCMC sampling is known to be very challenging because of the enormous search space and the existence of Markov equivalent DAGs. Theoretical results on the mixing behavior are lacking. In this work, we prove the rapid mixing of a random walk Metropolis–Hastings algorithm, which reveals that the complexity of Bayesian learning of sparse equivalence classes grows only polynomially in n and p, under some high-dimensional assumptions. A series of high-dimensional consistency results is obtained, including the strong selection consistency of an empirical Bayes model for structure learning. Our proof is based on two new results. First, we derive a general mixing time bound on finite-state spaces, which can be applied to local MCMC schemes for other model selection problems. Second, we construct high-probability search paths on the space of equivalence classes with node degree constraints by proving a combinatorial property of DAG comparisons. Simulation studies on the proposed MCMC sampler are conducted to illustrate the main theoretical findings.

AoS Spatial & Time Series High-Dimensional · 发表于 2023-06-01

AutoRegressive approximations to nonstationary time series with inference and applications

Xiucai Ding, Zhou Zhou

摘要

Understanding the time-varying structure of complex temporal systems is one of the main challenges of modern time-series analysis. In this paper, we show that every uniformly-positive-definite-in-covariance and sufficiently short-range dependent nonstationary and nonlinear time series can be well approximated globally by a white-noise-driven autoregressive (AR) process of slowly diverging order. To our best knowledge, it is the first time such a structural approximation result is established for general classes of nonstationary time series. A high-dimensional L2 test and an associated multiplier bootstrap procedure are proposed for the inference of the AR approximation coefficients. In particular, an adaptive stability test is proposed to check whether the AR approximation coefficients are time-varying, a frequently encountered question for practitioners and researchers of time series. As an application, globally optimal sffollowing hort-term forecasting theory and methodology for a wide class of locally stationary time series are established via the method of sieves.

AoS Other · 发表于 2023-06-01

Asymptotic normality for eigenvalue statistics of a general sample covariance matrix when p/n→∞ and applications

Jiaxin Qiu, Zeng Li, Jianfeng Yao

摘要

The asymptotic normality for a large family of eigenvalue statistics of a general sample covariance matrix is derived under the ultrahigh-dimensional setting, that is, when the dimension to sample size ratio p/n→∞. Based on this CLT result, we extend the covariance matrix test problem to the new ultra-high-dimensional context, and apply it to test a matrix-valued white noise. Simulation experiments are conducted for the investigation of finite-sample properties of the general asymptotic normality of eigenvalue statistics, as well as the two developed tests.

AoS Testing & Uncertainty High-Dimensional · 发表于 2023-06-01

A power analysis for model-X knockoffs with ℓp-regularized statistics

Asaf Weinstein, Weijie J. Su, Małgorzata Bogdan, Rina Foygel Barber, Emmanuel J. Candès

摘要

Variable selection properties of procedures utilizing penalized-likelihood estimates is a central topic in the study of high-dimensional linear regression problems. Existing literature emphasizes the quality of ranking of the variables by such procedures as reflected in the receiver operating characteristic curve or in prediction performance. Specifically, recent works have harnessed modern theory of approximate message-passing (AMP) to obtain, in a particular setting, exact asymptotic predictions of the type I, type II error tradeoff for selection procedures that rely on ℓp-regularized estimators. In practice, effective ranking by itself is often not sufficient because some calibration for Type I error is required. In this work, we study theoretically the power of selection procedures that similarly rank the features by the size of an ℓp-regularized estimator, but further use Model-X knockoffs to control the false discovery rate in the realistic situation where no prior information about the signal is available. In analyzing the power of the resulting procedure, we extend existing results in AMP theory to handle the pairing between original variables and their knockoffs. This is used to derive exact asymptotic predictions for power. We apply the general results to compare the power of the knockoffs versions of Lasso and thresholded-Lasso selection, and demonstrate that in the i.i.d. covariate setting under consideration, tuning by cross-validation on the augmented design matrix is nearly optimal. We further demonstrate how the techniques allow to analyze also the Type S error, and a corresponding notion of power, when selections are supplemented with a decision on the sign of the coefficient.

AoS Other · 发表于 2023-06-01

A general characterization of optimal tie-breaker designs

Harrison H. Li, Art B. Owen

摘要

Tie-breaker designs trade off a measure of statistical efficiency against a short-term gain from preferentially assigning a binary treatment to subjects with higher values of a running variable x. The efficiency measure can be any continuous function of the expected information matrix in a two-line regression model. The short-term gain is expressed as the covariance between the running variable and the treatment indicator. We investigate how to choose design functions p(x) specifying the probability of treating a subject with running variable x in order to optimize these competing objectives, under external constraints on the number of subjects receiving treatment. Our results include sharp existence and uniqueness guarantees, while accommodating the ethically appealing requirement that p(x) be nondecreasing in x. Under this condition, there is always an optimal treatment probability function p(x) that is constant on the sets (−∞,t) and (t,∞) for some threshold t and generally discontinuous at x=t. When the running variable distribution is not symmetric or the fraction of subjects receiving the treatment is not 1/2, our optimal designs improve upon a D-optimality objective without sacrificing short-term gain, compared to a typical three-level tie-breaker design that fixes treatment probabilities at 0, 1/2 and 1. We illustrate our optimal designs with data from Head Start, an early childhood government intervention program.

JASA Clinical Trials · 发表于 2023-05-30

Statistical Thinking in Clinical Trials

Susan S. Ellenberg

摘要

REVIEWSMany books on design and analysis of clinical trials are now available, but Michael Proschan offers something unique in his new book, Statistical Thinking in Clinical Trials—intuitive explan... *(abstract via OpenAlex)*

第 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 页