2021 年的期刊文章 · 第 17 页

共 1542 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2021-06-08 到 2021-06-01。

按期刊、按主题看 →

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

Biometrics Genetics & Omics Nonparametric & Semiparametric · 发表于 2021-06-08

A semiparametric model for between‐subject attributes: Applications to beta‐diversity of microbiome data

J. Liu, Xinlian Zhang, T. Chen, T. Wu, T. Lin, L. Jiang, S. Lang, L. Liu, L. Natarajan, J.X. Tu, T. Kosciolek, J. Morton, T.T. Nguyen, B. Schnabl, R. Knight, C. Feng, Y. Zhong, X.M. Tu

摘要

The human microbiome plays an important role in our health and identifying factors associated with microbiome composition provides insights into inherent disease mechanisms. By amplifying and sequencing the marker genes in high‐throughput sequencing, with highly similar sequences binned together, we obtain operational taxonomic units (OTUs) profiles for each subject. Due to the high‐dimensionality and nonnormality features of the OTUs, the measure of diversity is introduced as a summarization at the microbial community level, including the distance‐based beta‐diversity between individuals. Analyses of such between‐subject attributes are not amenable to the predominant within‐subject‐based statistical paradigm, such as t‐tests and linear regression. In this paper, we propose a new approach to model beta‐diversity as a response within a regression setting by utilizing the functional response models (FRMs), a class of semiparametric models for between‐ as well as within‐subject attributes. The new approach not only addresses limitations of current methods for beta‐diversity with cross‐sectional data, but also provides a premise for extending the approach to longitudinal and other clustered data in the future. The proposed approach is illustrated with both real and simulated data.

Biometrics Genetics & Omics Econometrics & Economics · 发表于 2021-06-08

A multiview model for relative and absolute microbial abundances

Brian D. Williamson, James P. Hughes, Amy D. Willis

摘要

The absolute abundance of bacterial taxa in human host‐associated environments plays a critical role in reproductive and gastrointestinal health. However, obtaining the absolute abundance of many bacterial species is typically prohibitively expensive. In contrast, relative abundance data for many species are comparatively cheap and easy to collect (e.g., with universal primers for the 16S rRNA gene). In this paper, we propose a method to jointly model relative abundance data for many taxa and absolute abundance data for a subset of taxa. Our method provides point and interval estimates for the absolute abundance of all taxa. Crucially, our proposal accounts for differences in the efficiency of taxon detection in the relative and absolute abundance data. We show that modeling taxon‐specific efficiencies substantially reduces the estimation error for absolute abundance, and controls the coverage of interval estimators. We demonstrate the performance of our proposed method via a simulation study, a study of the effect of HIV acquisition on microbial abundances, and a sensitivity study where we jackknife the taxa with observed absolute abundances.

SiM Missing Data & Measurement Error Longitudinal Data · 发表于 2021-06-08

A comparison of multiple imputation strategies for handling missing data in multi‐item scales: Guidance for longitudinal studies

Rheanna Mainzer, Jemishabye Apajee, Cattram D. Nguyen, John B. Carlin, Katherine J. Lee

摘要

Medical research often involves using multi‐item scales to assess individual characteristics, disease severity, and other health‐related outcomes. It is common to observe missing data in the scale scores, due to missing data in one or more items that make up that score. Multiple imputation (MI) is a popular method for handling missing data. However, it is not clear how best to use MI in the context of scale scores, particularly when they are assessed at multiple waves of data collection resulting in large numbers of items. The aim of this article is to provide practical advice on how to impute missing values in a repeatedly measured multi‐item scale using MI when inference on the scale score is of interest. We evaluated the performance of five MI strategies for imputing missing data at either the item or scale level using simulated data and a case study based on four waves of the Longitudinal Study of Australian Children (LSAC). MI was implemented using both multivariate normal imputation and fully conditional specification, with two rules for calculating the scale score. A complete case analysis was also performed for comparison. Based on our results, we caution against the use of a MI strategy that does not include the scale score in the imputation model(s) when the scale score is required for analysis.

SiM Missing Data & Measurement Error Bayesian Methods Functional Data · 发表于 2021-06-08

A Bayesian multiple imputation approach to bivariate functional data with missing components

Jeong Hoon Jang, Amita K. Manatunga, Changgee Chang, Qi Long

摘要

Existing missing data methods for functional data mainly focus on reconstructing missing measurements along a single function—a univariate functional data setting. Motivated by a renal study, we focus on a bivariate functional data setting, where each sampling unit is a collection of two distinct component functions, one of which may be missing. Specifically, we propose a Bayesian multiple imputation approach based on a bivariate functional latent factor model that exploits the joint changing patterns of the component functions to allow accurate and stable imputation of one component given the other. We further extend the framework to address multilevel bivariate functional data with missing components by modeling and exploiting inter‐component and intra‐subject correlations. We develop a Gibbs sampling algorithm that simultaneously generates multiple imputations of missing component functions and posterior samples of model parameters. For multilevel bivariate functional data, a partially collapsed Gibbs sampler is implemented to improve computational efficiency. Our simulation study demonstrates that our methods outperform other competing methods for imputing missing components of bivariate functional data under various designs and missingness rates. The motivating renal study aims to investigate the distribution and pharmacokinetic properties of baseline and post‐furosemide renogram curves that provide further insights into the underlying mechanism of renal obstruction, with post‐furosemide renogram curves missing for some subjects. We apply the proposed methods to impute missing post‐furosemide renogram curves and obtain more refined insights.

SiM Clinical Trials Bayesian Methods · 发表于 2021-06-07

A Bayesian hierarchical monitoring design for phase II cancer clinical trials: Incorporating information on response duration into monitoring rules

Jian Wang, Junsheng Ma, Chunyan Cai, Naval Daver, Jing Ning

摘要

We propose a Bayesian hierarchical monitoring design for single‐arm phase II clinical trials of cancer treatments that incorporates the information on the duration of response (DOR) into the monitoring rules. To screen a new treatment by evaluating its preliminary therapeutic effect, futility monitoring rules are commonly used in phase II clinical trials to make “go/no‐go” decisions timely and efficiently. These futility monitoring rules are usually focused on a single outcome (eg, response rate), although a single outcome may not adequately determine the efficacy of the experimental treatment. For example, targeted agents with a long response duration but a similar response rate may be worth further evaluation in cancer research. To address this issue, we propose Bayesian hierarchical futility monitoring rules to consider both the response rate and duration. The first level of monitoring evaluates whether the response rate provides evidence that the experimental treatment is worthy of further evaluation. If the evidence from the response rate does not support continuing the trial, the second level monitoring rule, which is based on the DOR, will be triggered. If both stopping rules are satisfied, the trial will be stopped for futility. We conducted simulation studies to evaluate the operating characteristics of the proposed monitoring rules and compared them to those of standard method. We illustrated the proposed design with a single‐arm phase II cancer clinical trial to assess the safety and efficacy of combined treatment of nivolumab and azacitidine in patients with relapsed/refractory acute myeloid leukemia. The proposed design avoids an aggressive early termination for futility when the experimental treatment substantially prolongs the DOR but fails to improve the response rate.

Biometrics Causal Inference Missing Data & Measurement Error Bayesian Methods · 发表于 2021-06-06

Simulation‐based estimators of analytically intractable causal effects

Antonio R. Linero

摘要

In causal inference problems, one is often tasked with estimating causal effects which are analytically intractable functionals of the data‐generating mechanism. Relevant settings include estimating intention‐to‐treat effects in longitudinal problems with missing data or computing direct and indirect effects in mediation analysis. One approach to computing these effects is to use the g‐formula implemented via Monte Carlo integration; when simulation‐based methods such as the nonparametric bootstrap or Markov chain Monte Carlo are used for inference, Monte Carlo integration must be nested within an already computationally intensive algorithm. We develop a widely‐applicable approach to accelerating this Monte Carlo integration step which greatly reduces the computational burden of existing g‐computation algorithms. We refer to our method as accelerated g‐computation (AGC). The algorithms we present are similar in spirit to multiple imputation, but require removing within‐imputation variance from the standard error rather than adding it. We illustrate the use of AGC on a mediation analysis problem using a beta regression model and in a longitudinal clinical trial subject to nonignorable missingness using a Bayesian additive regression trees model.

Biometrika High-Dimensional · 发表于 2021-06-05

Sparse functional linear discriminant analysis

Juhyun Park, Jeongyoun Ahn, Yongho Jeon

摘要

Summary: Functional linear discriminant analysis provides a simple yet efficient method for classification, with the possibility of achieving perfect classification. Several methods have been proposed in the literature that mostly address the dimensionality of the problem. On the other hand, there is growing interest in interpretability of the analysis, which favours a simple and sparse solution. In this paper we propose a new approach that incorporates a type of sparsity that identifies nonzero subdomains in the functional setting, yielding a solution that is easier to interpret without compromising performance. Given the need to embed additional constraints in the solution, we reformulate functional linear discriminant analysis as a regularization problem with an appropriate penalty. Inspired by the success of $\ell_1$-type regularization at inducing zero coefficients for scalar variables, we develop a new regularization method for functional linear discriminant analysis that incorporates an $L^1$-type penalty, $\int |f|$, to induce zero regions. We demonstrate that our formulation has a well-defined solution that contains zero regions, achieving functional sparsity in the sense of domain selection. In addition, the misclassification probability of the regularized solution is shown to converge to the Bayes error if the data are Gaussian. Our method does not assume that the underlying function has zero regions in the domain, but it produces a sparse estimator that consistently estimates the true function whether or not the latter is sparse. Using both simulated and real data examples, we demonstrate this property of our method in finite samples through comparisons with existing methods.

SiM Spatial & Time Series · 发表于 2021-06-04

Analyzing categorical time series in the presence of missing observations

Christian H. Weiß

摘要

In real applications, time series often exhibit missing observations such that standard analytical tools cannot be applied. While there are approaches of how to handle missing data in quantitative time series, the case of categorical time series seems not to have been treated so far. Both for the case of ordinal and nominal time series, solutions are developed that allow to analyze their marginal and serial properties in the presence of missing observations. This is achieved by adapting the concept of amplitude modulation, which allows to obtain closed‐form asymptotic expressions for the derived statistics' distribution (assuming that missingness happens independently of the actual process). The proposed methods are investigated with simulations, and they are applied in a project on migraine patients, where the monitored qualitative time series are often incomplete.

SiM Diagnostics & Prediction Survival Analysis Testing & Uncertainty · 发表于 2021-06-03

Estimation and construction of confidence intervals for biomarker cutoff‐points under the shortest Euclidean distance from the ROC surface to the perfection corner

Brian R. Mosier, Leonidas E. Bantis

摘要

Pancreatic ductal adenocarcinoma (PDAC) is an aggressive type of cancer with a 5‐year survival rate of less than 5%. As in many other diseases, its diagnosis might involve progressive stages. It is common that in biomarker studies referring to PDAC, recruitment involves three groups: healthy individuals, patients that suffer from chronic pancreatitis, and PDAC patients. Early detection and accurate classification of the state of the disease are crucial for patients' successful treatment. ROC analysis is the most popular way to evaluate the performance of a biomarker and the Youden index is commonly employed for cutoff derivation. The so‐called generalized Youden index has a drawback in the three‐class case of not accommodating the full data set when estimating the optimal cutoffs. In this article, we explore the use of the Euclidean distance of the ROC to the perfection corner for the derivation of cutoffs in trichotomous settings. We construct an inferential framework that involves both parametric and nonparametric techniques. Our methods can accommodate the full information of a given data set and thus provide more accurate estimates in terms of the decision‐making cutoffs compared with a Youden‐based strategy. We evaluate our approaches through extensive simulations and illustrate them on a PDAC biomarker study.

JASA Latent Variables & Mixtures High-Dimensional · 发表于 2021-06-03

Eigen Selection in Spectral Clustering: A Theory-Guided Practice

Xiao Han, Xin Tong, Yingying Fan

摘要

Based on a Gaussian mixture type model of K components, we derive eigen selection procedures that improve the usual spectral clustering algorithms in high-dimensional settings, which typically act on the top few eigenvectors of an affinity matrix (e.g., X⊤X) derived from the data matrix X. Our selection principle formalizes two intuitions: (i) eigenvectors should be dropped when they have no clustering power; (ii) some eigenvectors corresponding to smaller spiked eigenvalues should be dropped due to estimation inaccuracy. Our selection procedures lead to new spectral clustering algorithms: ESSC for K = 2 and GESSC for K > 2. The newly proposed algorithms enjoy better stability and compare favorably against canonical alternatives, as demonstrated in extensive simulation and multiple real data studies. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

SMMR Longitudinal Data High-Dimensional · 发表于 2021-06-02

l2-Penalized temporal logit-mixed models for the estimation of regional obesity prevalence over time

Jan P Burgard, Joscha Krause, Ralf Münnich, Domingo Morales

摘要

Obesity is considered to be one of the primary health risks in modern industrialized societies. Estimating the evolution of its prevalence over time is an essential element of public health reporting. This requires the application of suitable statistical methods on epidemiologic data with substantial local detail. Generalized linear-mixed models with medical treatment records as covariates mark a powerful combination for this purpose. However, the task is methodologically challenging. Disease frequencies are subject to both regional and temporal heterogeneity. Medical treatment records often show strong internal correlation due to diagnosis-related grouping. This frequently causes excessive variance in model parameter estimation due to rank-deficiency problems. Further, generalized linear-mixed models are often estimated via approximate inference methods as their likelihood functions do not have closed forms. These problems combined lead to unacceptable uncertainty in prevalence estimates over time. We propose an l2-penalized temporal logit-mixed model to solve these issues. We derive empirical best predictors and present a parametric bootstrap to estimate their mean-squared errors. A novel penalized maximum approximate likelihood algorithm for model parameter estimation is stated. With this new methodology, the regional obesity prevalence in Germany from 2009 to 2012 is estimated. We find that the national prevalence ranges between 15 and 16%, with significant regional clustering in eastern Germany.

SiM Survey & Sampling · 发表于 2021-06-02

Optimal allocation in stratified cluster‐based outcome‐dependent sampling designs

Sara Sauer, Bethany Hedt‐Gauthier, Sebastien Haneuse

摘要

In public health research, finite resources often require that decisions be made at the study design stage regarding which individuals to sample for detailed data collection. At the same time, when study units are naturally clustered, as patients are in clinics, it may be preferable to sample clusters rather than the study units, especially when the costs associated with travel between clusters are high. In this setting, aggregated data on the outcome and select covariates are sometimes routinely available through, for example, a country's Health Management Information System. If used wisely, this information can be used to guide decisions regarding which clusters to sample, and potentially obtain gains in efficiency over simple random sampling. In this article, we derive a series of formulas for optimal allocation of resources when a single‐stage stratified cluster‐based outcome‐dependent sampling design is to be used and a marginal mean model is specified to answer the question of interest. Specifically, we consider two settings: (i) when a particular parameter in the mean model is of primary interest; and, (ii) when multiple parameters are of interest. We investigate the finite population performance of the optimal allocation framework through a comprehensive simulation study. Our results show that there are trade‐offs that must be considered at the design stage: optimizing for one parameter yields efficiency gains over balanced and simple random sampling, while resulting in losses for the other parameters in the model. Optimizing for all parameters simultaneously yields smaller gains in efficiency, but mitigates the losses for the other parameters in the model.

SMMR Clinical Trials Causal Inference · 发表于 2021-06-02

Frequentist rules for regulatory approval of subgroups in phase III trials: A fresh look at an old problem

K Edgar, D Jackson, K Rhodes, T Duffy, C-F Burman, LD Sharples

摘要

Background: The number of Phase III trials that include a biomarker in design and analysis has increased due to interest in personalised medicine. For genetic mutations and other predictive biomarkers, the trial sample comprises two subgroups, one of which, say [Formula: see text] is known or suspected to achieve a larger treatment effect than the other [Formula: see text]. Despite treatment effect heterogeneity, trials often draw patients from both subgroups, since the lower responding [Formula: see text] subgroup may also gain benefit from the intervention. In this case, regulators/commissioners must decide what constitutes sufficient evidence to approve the drug in the [Formula: see text] population. Methods and Results: Assuming trial analysis can be completed using generalised linear models, we define and evaluate three frequentist decision rules for approval. For rule one, the significance of the average treatment effect in [Formula: see text] should exceed a pre-defined minimum value, say [Formula: see text]. For rule two, the data from the low-responding group [Formula: see text] should increase statistical significance. For rule three, the subgroup-treatment interaction should be non-significant, using type I error chosen to ensure that estimated difference between the two subgroup effects is acceptable. Rules are evaluated based on conditional power, given that there is an overall significant treatment effect. We show how different rules perform according to the distribution of patients across the two subgroups and when analyses include additional (stratification) covariates in the analysis, thereby conferring correlation between subgroup effects. Conclusions: When additional conditions are required for approval of a new treatment in a lower response subgroup, easily applied rules based on minimum effect sizes and relaxed interaction tests are available. Choice of rule is influenced by the proportion of patients sampled from the two subgroups but less so by the correlation between subgroup effects.

SiM Missing Data & Measurement Error Bayesian Methods Longitudinal Data · 发表于 2021-06-02

Bayesian sensitivity analyses for longitudinal data with dropouts that are potentially missing not at random: A high dimensional pattern‐mixture model

Niko A. Kaciroti, Roderick J.A. Little

摘要

Randomized clinical trials with outcome measured longitudinally are frequently analyzed using either random effect models or generalized estimating equations. Both approaches assume that the dropout mechanism is missing at random (MAR) or missing completely at random (MCAR). We propose a Bayesian pattern‐mixture model to incorporate missingness mechanisms that might be missing not at random (MNAR), where the distribution of the outcome measure at the follow‐up time , conditional on the prior history, differs across the patterns of missing data. We then perform sensitivity analysis on estimates of the parameters of interest. The sensitivity parameters relate the distribution of the outcome of interest between subjects from a missing‐data pattern at time with that of the observed subjects at time . The large number of the sensitivity parameters is reduced by treating them as random with a prior distribution having some pre‐specified mean and variance, which are varied to explore the sensitivity of inferences. The missing at random (MAR) mechanism is a special case of the proposed model, allowing a sensitivity analysis of deviations from MAR. The proposed approach is applied to data from the Trial of Preventing Hypertension.

AoS Other · 发表于 2021-06-01

Total positivity in exponential families with application to binary variables

Steffen Lauritzen, Caroline Uhler, Piotr Zwiernik

摘要

We study exponential families of distributions that are multivariate totally positive of order 2 (MTP2), show that these are convex exponential families and derive conditions for existence of the MLE. Quadratic exponential familes of MTP2 distributions contain attractive Gaussian graphical models and ferromagnetic Ising models as special examples. We show that these are defined by intersecting the space of canonical parameters with a polyhedral cone whose faces correspond to conditional independence relations. Hence MTP2 serves as an implicit regularizer for quadratic exponential families and leads to sparsity in the estimated graphical model. We prove that the maximum likelihood estimator (MLE) in an MTP2 binary exponential family exists if and only if both of the sign patterns (1,−1) and (−1,1) are represented in the sample for every pair of variables; in particular, this implies that the MLE may exist with n=d observations, in stark contrast to unrestricted binary exponential families where 2d observations are required. Finally, we provide a novel and globally convergent algorithm for computing the MLE for MTP2 Ising models similar to iterative proportional scaling and apply it to the analysis of data from two psychological disorders.

AoS High-Dimensional · 发表于 2021-06-01

SuperMix: Sparse regularization for mixtures

Y. De Castro, S. Gadat, C. Marteau, C. Maugis-Rabusseau

摘要

This paper investigates the statistical estimation of a discrete mixing measure μ0 involved in a kernel mixture model. Using some recent advances in ℓ1-regularization over the space of measures, we introduce a “data fitting and regularization” convex program for estimating μ0 in a grid-less manner from a sample of mixture law, this method is referred to as Beurling-LASSO. Our contribution is two-fold: we derive a lower bound on the bandwidth of our data fitting term depending only on the support of μ0 and its so-called “minimum separation” to ensure quantitative support localization error bounds; and under a so-called “nondegenerate source condition” we derive a nonasymptotic support stability property. This latter shows that for a sufficiently large sample size n, our estimator has exactly as many weighted Dirac masses as the target μ0, converging in amplitude and localization towards the true ones. Finally, we also introduce some tractable algorithms for solving this convex program based on “Sliding Frank–Wolfe” or “Conic Particle Gradient Descent”. Statistical performances of this estimator are investigated designing a so-called “dual certificate”, which is appropriate to our setting. Some classical situations as, for example, mixtures of super-smooth distributions (see, e.g., Gaussian distributions) or ordinary-smooth distributions (see, e.g., Laplace distributions), are discussed at the end of the paper.

AoS Bayesian Methods Spatial & Time Series High-Dimensional · 发表于 2021-06-01

Strong selection consistency of Bayesian vector autoregressive models based on a pseudo-likelihood approach

Satyajit Ghosh, Kshitij Khare, George Michailidis

摘要

Vector autoregressive (VAR) models aim to capture linear temporal interdependencies among multiple time series. They have been widely used in macroeconomics and financial econometrics and more recently have found novel applications in functional genomics and neuroscience. These applications have also accentuated the need to investigate the behavior of the VAR model in a high-dimensional regime, which will provide novel insights into the role of temporal dependence for regularized estimates of the models parameters. However, hardly anything is known regarding posterior model selection consistency for Bayesian VAR models in such regimes. In this work, we develop a pseudo-likelihood based Bayesian approach for consistent variable selection in high-dimensional VAR models by considering hierarchical normal priors on the autoregressive coefficients, as well as on the model space. We establish strong selection consistency of the proposed method, namely that the posterior probability assigned to the true underlying VAR model converges to one under high-dimensional scaling where the dimension p of the VAR system grows nearly exponentially with the sample size n. Further, the result is established under mild regularity conditions on the problem parameters. Finally, as a by-product of these results, we also establish strong selection consistency for the sparse high-dimensional linear regression model with serially correlated regressors and errors.

AoS High-Dimensional Nonparametric & Semiparametric · 发表于 2021-06-01

Statistical inference in sparse high-dimensional additive models

Karl Gregory, Enno Mammen, Martin Wahl

摘要

In this paper, we discuss the estimation of a nonparametric component f1 of a nonparametric additive model Y=f1(X1)+⋯+fq(Xq)+ϵ. We allow the number q of additive components to grow to infinity and we make sparsity assumptions about the number of nonzero additive components. We compare this estimation problem with that of estimating f1 in the oracle model Z=f1(X1)+ϵ, for which the additive components f2,…,fq are known. We construct a two-step presmoothing-and-resmoothing estimator of f1 and state finite-sample bounds for the difference between our estimator and a corresponding smoothing estimator fˆ1(oracle) in the oracle model. In an asymptotic setting, these bounds can be used to show asymptotic equivalence of our estimator and the oracle estimator; the paper thus shows that, asymptotically, under strong enough sparsity conditions, knowledge of f2,…,fq has no effect on estimation accuracy. Our first step is to estimate f1 with an undersmoothed estimator based on near-orthogonal projections with a group Lasso bias correction. In the second step, we construct pseudo responses Yˆ by evaluating this undersmoothed estimator of f1 at the design points and then apply the smoothing method of the oracle estimator fˆ1(oracle) to the nonparametric regression problem with “responses” Yˆ and covariates X1. Our mathematical exposition centers primarily on establishing properties of the presmoothing estimator. We present simulation results demonstrating close-to-oracle performance of our estimator in practical applications.

AoS Latent Variables & Mixtures · 发表于 2021-06-01

Robust Bregman clustering

Claire Brécheteau, Aurélie Fischer, Clément Levrard

摘要

Clustering with Bregman divergences encompasses a wide family of clustering procedures that are well suited to mixtures of distributions from exponential families (J. Mach. Learn. Res. 6 (2005) 1705–1749). However, these techniques are highly sensitive to noise. To address the issue of clustering data with possibly adversarial noise, we introduce a robustified version of Bregman clustering based on a trimming approach. We investigate its theoretical properties, showing for instance that our estimator converges at a sub-Gaussian rate 1/n, where n denotes the sample size, under mild tail assumptions. We also show that it is robust to a certain amount of noise, stated in terms of breakdown point. We also derive a Lloyd-type algorithm with a trimming parameter, along with a heuristic to select this parameter and the number of clusters from sample. Some numerical experiments assess the performance of our method on simulated and real datasets.

AoS Longitudinal Data · 发表于 2021-06-01

Principal components in linear mixed models with general bulk

Zhou Fan, Yi Sun, Zhichao Wang

摘要

We study the principal components of covariance estimators in multivariate mixed-effects linear models. We show that, in high dimensions, the principal eigenvalues and eigenvectors may exhibit bias and aliasing effects that are not present in low-dimensional settings. We derive the first-order limits of the principal eigenvalue locations and eigenvector projections in a high-dimensional asymptotic framework, allowing for general population spectral distributions for the random effects and extending previous results from a more restrictive spiked model. Our analysis uses free probability techniques, and we develop two general tools of independent interest—strong asymptotic freeness of GOE and deterministic matrices and a free deterministic equivalent approximation for bilinear forms of resolvents.

AoS High-Dimensional · 发表于 2021-06-01

On statistical learning of simplices: Unmixing problem revisited

Amir Najafi, Saeed Ilchi, Amir Hossein Saberi, Seyed Abolfazl Motahari, Babak H. Khalaj, Hamid R. Rabiee

摘要

We study the sample complexity of learning a high-dimensional simplex from a set of points uniformly sampled from its interior. Learning of simplices is a long studied problem in computer science and has applications in computational biology and remote sensing, mostly under the name of “spectral unmixing.” We theoretically show that a sufficient sample complexity for reliable learning of a K-dimensional simplex up to a total-variation error of ϵ is O(K2ϵlogKϵ), which yields a substantial improvement over existing bounds. Based on our new theoretical framework, we also propose a heuristic approach for the inference of simplices. Experimental results on synthetic and real-world datasets demonstrate a comparable performance for our method on noiseless samples, while we outperform the state-of-the-art in noisy cases.

AoS High-Dimensional · 发表于 2021-06-01

On cross-validated Lasso in high dimensions

Denis Chetverikov, Zhipeng Liao, Victor Chernozhukov

摘要

In this paper, we derive nonasymptotic error bounds for the Lasso estimator when the penalty parameter for the estimator is chosen using K-fold cross-validation. Our bounds imply that the cross-validated Lasso estimator has nearly optimal rates of convergence in the prediction, L2, and L1 norms. For example, we show that in the model with the Gaussian noise and under fairly general assumptions on the candidate set of values of the penalty parameter, the estimation error of the cross-validated Lasso estimator converges to zero in the prediction norm with the slogp/n×log(pn) rate, where n is the sample size of available data, p is the number of covariates and s is the number of nonzero coefficients in the model. Thus, the cross-validated Lasso estimator achieves the fastest possible rate of convergence in the prediction norm up to a small logarithmic factor log(pn), and similar conclusions apply for the convergence rate both in L2 and in L1 norms. Importantly, our results cover the case when p is (potentially much) larger than n and also allow for the case of non-Gaussian noise. Our paper therefore serves as a justification for the widely spread practice of using cross-validation as a method to choose the penalty parameter for the Lasso estimator.

JASA Other · 发表于 2021-06-01

Linear-Cost Covariance Functions for Gaussian Random Fields

Jie Chen, Michael L. Stein

摘要

Gaussian random fields (GRF) are a fundamental stochastic model for spatiotemporal data analysis. An essential ingredient of GRF is the covariance function that characterizes the joint Gaussian distribution of the field. Commonly used covariance functions give rise to fully dense and unstructured covariance matrices, for which required calculations are notoriously expensive to carry out for large data. In this work, we propose a construction of covariance functions that result in matrices with a hierarchical structure. Empowered by matrix algorithms that scale linearly with the matrix dimension, the hierarchical structure is proved to be efficient for a variety of random field computations, including sampling, kriging, and likelihood evaluation. Specifically, with n scattered sites, sampling and likelihood evaluation has an O(n) cost and kriging has an O( log n) cost after preprocessing, particularly favorable for the kriging of an extremely large number of sites (e.g., predicting on more sites than observed). We demonstrate comprehensive numerical experiments to show the use of the constructed covariance functions and their appealing computation time. Numerical examples on a laptop include simulated data of size up to one million, as well as a climate data product with over two million observations. *(abstract via OpenAlex)*

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

Learning models with uniform performance via distributionally robust optimization

John C. Duchi, Hongseok Namkoong

摘要

A common goal in statistics and machine learning is to learn models that can perform well against distributional shifts, such as latent heterogeneous subpopulations, unknown covariate shifts or unmodeled temporal effects. We develop and analyze a distributionally robust stochastic optimization (DRO) framework that learns a model providing good performance against perturbations to the data-generating distribution. We give a convex formulation for the problem, providing several convergence guarantees. We prove finite-sample minimax upper and lower bounds, showing that distributional robustness sometimes comes at a cost in convergence rates. We give limit theorems for the learned parameters, where we fully specify the limiting distribution so that confidence intervals can be computed. On real tasks including generalizing to unknown subpopulations, fine-grained recognition and providing good tail performance, the distributionally robust approach often exhibits improved performance.

AoS High-Dimensional · 发表于 2021-06-01

LASSO-driven inference in time and space

Victor Chernozhukov, Wolfgang Karl Härdle, Chen Huang, Weining Wang

摘要

We consider the estimation and inference in a system of high-dimensional regression equations allowing for temporal and cross-sectional dependency in covariates and error processes, covering rather general forms of weak temporal dependence. A sequence of regressions with many regressors using LASSO (Least Absolute Shrinkage and Selection Operator) is applied for variable selection purpose, and an overall penalty level is carefully chosen by a block multiplier bootstrap procedure to account for multiplicity of the equations and dependencies in the data. Correspondingly, oracle properties with a jointly selected tuning parameter are derived. We further provide high-quality de-biased simultaneous inference on the many target parameters of the system. We provide bootstrap consistency results of the test procedure, which are based on a general Bahadur representation for the Z-estimators with dependent data. Simulations demonstrate good performance of the proposed inference procedure. Finally, we apply the method to quantify spillover effects of textual sentiment indices in a financial market and to test the connectedness among sectors.

AoS Other · 发表于 2021-06-01

Frame-constrained total variation regularization for white noise regression

Miguel del Álamo, Housen Li, Axel Munk

摘要

Despite the popularity and practical success of total variation (TV) regularization for function estimation, surprisingly little is known about its theoretical performance in a statistical setting. While TV regularization has been known for quite some time to be minimax optimal for denoising one-dimensional signals, for higher dimensions this remains elusive until today. In this paper, we consider frame-constrained TV estimators including many well-known (overcomplete) frames in a white noise regression model, and prove their minimax optimality w.r.t. Lq-risk (1≤q<∞) up to a logarithmic factor in any dimension d≥1. Overcomplete frames are an established tool in mathematical imaging and signal recovery, and their combination with TV regularization has been shown to give excellent results in practice, which our theory now confirms. Our results rely on a novel connection between frame-constraints and certain Besov norms, and on an interpolation inequality to relate them to the risk functional. Additionally, our results explain a phase transition in the minimax risk for BV functions.

JASA Testing & Uncertainty Networks & Graphs · 发表于 2021-06-01

Filtering the Rejection Set While Preserving False Discovery Rate Control

Eugene Katsevich, Chiara Sabatti, Marina Bogomolov

摘要

Scientific hypotheses in a variety of applications have domain-specific structures, such as the tree structure of the International Classification of Diseases (ICD), the directed acyclic graph structure of the Gene Ontology (GO), or the spatial structure in genome-wide association studies. In the context of multiple testing, the resulting relationships among hypotheses can create redundancies among rejections that hinder interpretability. This leads to the practice of filtering rejection sets obtained from multiple testing procedures, which may in turn invalidate their inferential guarantees. We propose Focused BH, a simple, flexible, and principled methodology to adjust for the application of any pre-specified filter. We prove that Focused BH controls the false discovery rate under various conditions, including when the filter satisfies an intuitive monotonicity property and the p-values are positively dependent. We demonstrate in simulations that Focused BH performs well across a variety of settings, and illustrate this method's practical utility via analyses of real datasets based on ICD and GO. *(abstract via PubMed)*

AoS Latent Variables & Mixtures · 发表于 2021-06-01

Factor-driven two-regime regression

Sokbae Lee, Yuan Liao, Myung Hwan Seo, Youngki Shin

摘要

We propose a novel two-regime regression model where regime switching is driven by a vector of possibly unobservable factors. When the factors are latent, we estimate them by the principal component analysis of a panel data set. We show that the optimization problem can be reformulated as mixed integer optimization, and we present two alternative computational algorithms. We derive the asymptotic distribution of the resulting estimator under the scheme that the threshold effect shrinks to zero. In particular, we establish a phase transition that describes the effect of first-stage factor estimation as the cross-sectional dimension of panel data increases relative to the time-series dimension. Moreover, we develop bootstrap inference and illustrate our methods via numerical studies.

AoS Testing & Uncertainty Diagnostics & Prediction · 发表于 2021-06-01

E-values: Calibration, combination and applications

Vladimir Vovk, Ruodu Wang

摘要

Multiple testing of a single hypothesis and testing multiple hypotheses are usually done in terms of p-values. In this paper, we replace p-values with their natural competitor, e-values, which are closely related to betting, Bayes factors and likelihood ratios. We demonstrate that e-values are often mathematically more tractable; in particular, in multiple testing of a single hypothesis, e-values can be merged simply by averaging them. This allows us to develop efficient procedures using e-values for testing multiple hypotheses.

AoS Nonparametric & Semiparametric · 发表于 2021-06-01

Central limit theorem for linear spectral statistics of large dimensional Kendall’s rank correlation matrices and its applications

Zeng Li, Qinwen Wang, Runze Li

摘要

This paper is concerned with the limiting spectral behaviors of large dimensional Kendall’s rank correlation matrices generated by samples with independent and continuous components. The statistical setting in this paper covers a wide range of highly skewed and heavy-tailed distributions since we do not require the components to be identically distributed, and do not need any moment conditions. We establish the central limit theorem (CLT) for the linear spectral statistics (LSS) of the Kendall’s rank correlation matrices under the Marchenko–Pastur asymptotic regime, in which the dimension diverges to infinity proportionally with the sample size. We further propose three nonparametric procedures for high dimensional independent test and their limiting null distributions are derived by implementing this CLT. Our numerical comparisons demonstrate the robustness and superiority of our proposed test statistics under various mixed and heavy-tailed cases.

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

Causal discovery in heavy-tailed models

Nicola Gnecco, Nicolai Meinshausen, Jonas Peters, Sebastian Engelke

摘要

Causal questions are omnipresent in many scientific problems. While much progress has been made in the analysis of causal relationships between random variables, these methods are not well suited if the causal mechanisms only manifest themselves in extremes. This work aims to connect the two fields of causal inference and extreme value theory. We define the causal tail coefficient that captures asymmetries in the extremal dependence of two random variables. In the population case, the causal tail coefficient is shown to reveal the causal structure if the distribution follows a linear structural causal model. This holds even in the presence of latent common causes that have the same tail index as the observed variables. Based on a consistent estimator of the causal tail coefficient, we propose a computationally highly efficient algorithm that estimates the causal structure. We prove that our method consistently recovers the causal order and we compare it to other well-established and nonextremal approaches in causal discovery on synthetic and real data. The code is available as an open-access R package. *(abstract via OpenAlex)*

AoS Testing & Uncertainty · 发表于 2021-06-01

Bootstrap long memory processes in the frequency domain

Javier Hidalgo

摘要

The aim of the paper is to describe a bootstrap, contrary to the sieve bootstrap, valid under either long memory (LM) or short memory (SM) dependence. One of the reasons of the failure of the sieve bootstrap in our context is that under LM dependence, the sieve bootstrap may not be able to capture the true covariance structure of the original data. We also describe and examine the validity of the bootstrap scheme for the least squares estimator of the parameter in a regression model and for model specification. The motivation for the latter example comes from the observation that the asymptotic distribution of the test is intractable. *(abstract via OpenAlex)*

JASA Testing & Uncertainty Nonparametric & Semiparametric · 发表于 2021-06-01

Bootstrap Inference for Quantile-based Modal Regression

Tao Zhang, Kengo Kato, David Ruppert

摘要

In this article, we develop uniform inference methods for the conditional mode based on quantile regression. Specifically, we propose to estimate the conditional mode by minimizing the derivative of the estimated conditional quantile function defined by smoothing the linear quantile regression estimator, and develop two bootstrap methods, a novel pivotal bootstrap and the nonparametric bootstrap, for our conditional mode estimator. Building on high-dimensional Gaussian approximation techniques, we establish the validity of simultaneous confidence rectangles constructed from the two bootstrap methods for the conditional mode. We also extend the preceding analysis to the case where the dimension of the covariate vector is increasing with the sample size. Finally, we conduct simulation experiments and a real data analysis using the U.S. wage data to demonstrate the finite sample performance of our inference method. The supplemental materials include the wage dataset, R codes and an appendix containing proofs of the main results, additional simulation results, discussion of model misspecification and quantile crossing, and additional details of the numerical implementation. *(abstract via OpenAlex)*

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

Approximate and exact designs for total effects

Xiangshun Kong, Mingao Yuan, Wei Zheng

摘要

This paper considers both approximate and exact designs for estimating the total effects under one crossover and two interference models. They are different from the traditional block designs in the sense that the assigned treatments also affect their neighboring plots, hence a design is understood as a collection of sequences of treatments. A notable result in literature is that the circular neighbor balanced design (CNBD) is optimal among designs, which do not allow treatments to be neighbors of themselves. However, we find it necessary to allow self-neighboring, and further show that it is the best to allocate each treatment in a subblock of adjacent plots with equal or almost equal numbers of replications. This explains why the efficiency of CNBD drops down to 50% as the sequence length, say k, increases. Unlike CNBD or the designs for direct effects, our proposed designs do not try to put as many treatments in a sequence as possible. The optimal number of distinct treatments in a sequence is around 2k for crossover designs and k/0.96 for interference models, whenever they are smaller than the total number of treatments under consideration. We systematically study necessary and sufficient conditions for any design to be universally optimal under the approximate design framework, based on which algorithms for deriving optimal or efficient exact designs are proposed. This hybrid nature of cohesively combining theories with algorithms makes our method more flexible than existing ones in the following aspects. (i) Not only symmetric designs are studied, general procedures for producing asymmetric designs are also provided. (ii) Our method applies to any form of within-block covariance matrix instead of specific forms. (iii) We cover all configurations of the numbers of treatments and sequence lengths, especially for large values of them when purely computational methods are not applicable. (iv) On top of the latter, we cover a continuous spectrum of the number of sequences instead of special numbers decided by combinatorial constraints.

JASA Causal Inference Testing & Uncertainty · 发表于 2021-06-01

An Exact and Robust Conformal Inference Method for Counterfactual and Synthetic Controls

Victor Chernozhukov, Kaspar Wüthrich, Yinchu Zhu

摘要

We introduce new inference procedures for counterfactual and synthetic control methods for policy evaluation. We recast the causal inference problem as a counterfactual prediction and a structural breaks testing problem. This allows us to exploit insights from conformal prediction and structural breaks testing to develop permutation inference procedures that accommodate modern high-dimensional estimators, are valid under weak and easy-to-verify conditions, and are provably robust against misspecification. Our methods work in conjunction with many different approaches for predicting counterfactual mean outcomes in the absence of the policy intervention. Examples include synthetic controls, difference-in-differences, factor and matrix completion models, and (fused) time series panel data models. Our approach demonstrates an excellent small-sample performance in simulations and is taken to a data application where we re-evaluate the consequences of decriminalizing indoor prostitution. Open-source software for implementing our conformal inference methods is available. *(abstract via OpenAlex)*

AoS High-Dimensional · 发表于 2021-06-01

Adaptive robust estimation in sparse vector model

L. Comminges, O. Collier, M. Ndaoud, A. B. Tsybakov

摘要

For the sparse vector model, we consider estimation of the target vector, of its ℓ2-norm and of the noise variance. We construct adaptive estimators and establish the optimal rates of adaptive estimation when adaptation is considered with respect to the triplet “noise level—noise distribution—sparsity.” We consider classes of noise distributions with polynomially and exponentially decreasing tails as well as the case of Gaussian noise. The obtained rates turn out to be different from the minimax nonadaptive rates when the triplet is known. A crucial issue is the ignorance of the noise variance. Moreover, knowing or not knowing the noise distribution can also influence the rate. For example, the rates of estimation of the noise variance can differ depending on whether the noise is Gaussian or sub-Gaussian without a precise knowledge of the distribution. Estimation of noise variance in our setting can be viewed as an adaptive variant of robust estimation of scale in the contamination model, where instead of fixing the “nominal” distribution in advance we assume that it belongs to some class of distributions.

SMMR Latent Variables & Mixtures Bayesian Methods · 发表于 2021-06-01

A supervised clustering MCMC methodology for large categorical feature spaces

Simón Ramírez, Adolfo J Quiroz, Alvaro J Riascos

摘要

There is a well-established tradition within the statistics literature that explores different techniques for reducing the dimensionality of large feature spaces. The problem is central to machine learning and it has been largely explored under the unsupervised learning paradigm. We introduce a supervised clustering methodology that capitalizes on a Metropolis Hastings algorithm to optimize the partition structure of a large categorical feature space tailored towards minimizing the test error of a learning algorithm. This is a general methodology that can be applied to any supervised learning problem with a large categorical feature space. We show the benefits of the algorithm by applying this methodology to the problem of risk adjustment in competitive health insurance markets. We use a large claims data set that records ICD-10 codes, a large categorical feature space. We aim at improving risk adjustment by clustering diagnostic codes into risk groups suitable for health expenditure prediction. We test the performance of our methodology against common alternatives using panel data from a representative sample of twenty three million citizens in Colombian Healthcare System. Our results outperform common alternatives and suggest that it has potential to improve risk adjustment.

AoS High-Dimensional · 发表于 2021-06-01

A shrinkage principle for heavy-tailed data: High-dimensional robust low-rank matrix recovery

Jianqing Fan, Weichen Wang, Ziwei Zhu

摘要

This paper introduces a simple principle for robust statistical inference via appropriate shrinkage on the data. This widens the scope of high-dimensional techniques, reducing the distributional conditions from subexponential or sub-Gaussian to more relaxed bounded second or fourth moment. As an illustration of this principle, we focus on robust estimation of the low-rank matrix Θ∗ from the trace regression model Y=Tr(Θ∗⊤X)+ε. It encompasses four popular problems: sparse linear model, compressed sensing, matrix completion and multitask learning. We propose to apply the penalized least-squares approach to the appropriately truncated or shrunk data. Under only bounded 2+δ moment condition on the response, the proposed robust methodology yields an estimator that possesses the same statistical error rates as previous literature with sub-Gaussian errors. For sparse linear model and multitask regression, we further allow the design to have only bounded fourth moment and obtain the same statistical rates. As a byproduct, we give a robust covariance estimator with concentration inequality and optimal rate of convergence in terms of the spectral norm, when the samples only bear bounded fourth moment. This result is of its own interest and importance. We reveal that under high dimensions, the sample covariance matrix is not optimal whereas our proposed robust covariance can achieve optimality. Extensive simulations are carried out to support the theories.

AoS High-Dimensional Optimization & Learning Theory · 发表于 2021-06-01

A convex optimization approach to high-dimensional sparse quadratic discriminant analysis

T. Tony Cai, Linjun Zhang

摘要

In this paper, we study high-dimensional sparse Quadratic Discriminant Analysis (QDA) and aim to establish the optimal convergence rates for the classification error. Minimax lower bounds are established to demonstrate the necessity of structural assumptions such as sparsity conditions on the discriminating direction and differential graph for the possible construction of consistent high-dimensional QDA rules. We then propose a classification algorithm called SDAR using constrained convex optimization under the sparsity assumptions. Both minimax upper and lower bounds are obtained and this classification rule is shown to be simultaneously rate optimal over a collection of parameter spaces, up to a logarithmic factor. Simulation studies demonstrate that SDAR performs well numerically. The algorithm is also illustrated through an analysis of prostate cancer data and colon tissue data. The methodology and theory developed for high-dimensional QDA for two groups in the Gaussian setting are also extended to multigroup classification and to classification under the Gaussian copula model. *(abstract via OpenAlex)*

AoS Testing & Uncertainty Causal Inference · 发表于 2021-06-01

A causal bootstrap

Guido Imbens, Konrad Menzel

摘要

The bootstrap, introduced by The Jackknife, the Bootstrap and Other Resampling Plans ((1982), SIAM), has become a very popular method for estimating variances and constructing confidence intervals. A key insight is that one can approximate the properties of estimators by using the empirical distribution function of the sample as an approximation for the true distribution function. This approach views the uncertainty in the estimator as coming exclusively from sampling uncertainty. We argue that for causal estimands the uncertainty arises entirely, or partially, from a different source, corresponding to the stochastic nature of the treatment received. We develop a bootstrap procedure for inference regarding the average treatment effect that accounts for this uncertainty, and compare its properties to that of the classical bootstrap. We consider completely randomized and observational designs as well as designs with imperfect compliance.

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