2022 年的期刊文章 · 第 19 页

共 1481 篇,按发表时间排,新的在前,每页 40 篇。这一页是 2022-04-05 到 2022-03-29。

按期刊、按主题看 →

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

Biometrika High-Dimensional · 发表于 2022-04-05

Testing generalized linear models with high-dimensional nuisance parameters

Jinsong Chen, Quefeng Li, Hua Yun Chen

摘要

Summary: Generalized linear models often have high-dimensional nuisance parameters, as seen in applications such as testing gene-environment interactions or gene-gene interactions. In these scenarios, it is essential to test the significance of a high-dimensional subvector of the model’s coefficients. Although some existing methods can tackle this problem, they often rely on the bootstrap to approximate the asymptotic distribution of the test statistic, and are thus computationally expensive. Here, we propose a computationally efficient test with a closed-form limiting distribution, which allows the parameter being tested to be either sparse or dense. We show that, under certain regularity conditions, the Type-I error of the proposed method is asymptotically correct, and we establish its power under high-dimensional alternatives. Extensive simulations demonstrate the good performance of the proposed test and its robustness when certain sparsity assumptions are violated. We also apply the proposed method to Chinese famine sample data in order to show its performance when testing the significance of gene-environment interactions.

SiM Other · 发表于 2022-04-05

A novel regression method for the analysis of multireader multicase‐free‐response receiver operating characteristics studies

Xueqing Liu, Jiarui Sun, Xiao‐Hua Zhou

摘要

In diagnostic radiology, the multireader multicase (MRMC) design and the free‐response receiver operating characteristics (FROC) method are often used in combination. The cross‐correlated data generated by the MRMC‐FROC study leads to difficulties in the corresponding analysis, and the need to include covariates in the model further complicates the subsequent analysis. In this paper, we propose a regression approach based on three new measures with good interpretability. The correlation structure of the original test results is taken directly into account in the estimation procedure. The proposed method also allows the inclusion of continuous or discrete covariates. Consistent and asymptotically normal estimators are derived for the new measures. Simulation studies are conducted to evaluate the performance of the proposed approach. The simulation results show that the regression approach performs well under a wide range of scenarios. We also apply the proposed regression approach to a diagnostic study of computer‐aided diagnosis in lung cancer.

SMMR Latent Variables & Mixtures Survival Analysis · 发表于 2022-04-04

Joint analysis of multivariate failure time data with latent variables

Deng Pan, Xinyuan Song, Junhao Pan

摘要

We propose a joint modeling approach to investigate the observed and latent risk factors of the multivariate failure times of interest. The proposed model comprises two parts. The first part is a distribution-free confirmatory factor analysis model that characterizes the latent factors by correlated multiple observed variables. The second part is a multivariate additive hazards model that assesses the observed and latent risk factors of the failure times. A hybrid procedure that combines the borrow-strength estimation approach and the asymptotically distribution-free generalized least square method is developed to estimate the model parameters. The asymptotic properties of the proposed estimators are derived. Simulation studies demonstrate that the proposed method performs well for practical settings. An application to a study concerning the risk factors of multiple diabetic complications is provided.

JRSSB Bayesian Methods · 发表于 2022-04-03

Robust Generalised Bayesian Inference for Intractable Likelihoods

Takuo Matsubara, Jeremias Knoblauch, François-Xavier Briol, Chris J. Oates

摘要

Generalised Bayesian inference updates prior beliefs using a loss function, rather than a likelihood, and can therefore be used to confer robustness against possible mis-specification of the likelihood. Here we consider generalised Bayesian inference with a Stein discrepancy as a loss function, motivated by applications in which the likelihood contains an intractable normalisation constant. In this context, the Stein discrepancy circumvents evaluation of the normalisation constant and produces generalised posteriors that are either closed form or accessible using the standard Markov chain Monte Carlo. On a theoretical level, we show consistency, asymptotic normality, and bias-robustness of the generalised posterior, highlighting how these properties are impacted by the choice of Stein discrepancy. Then, we provide numerical experiments on a range of intractable distributions, including applications to kernel-based exponential family models and non-Gaussian graphical models.

JRSSB Bayesian Methods Nonparametric & Semiparametric · 发表于 2022-04-03

Optimal Thinning of MCMC Output

Marina Riabiz, Wilson Ye Chen, Jon Cockayne, Pawel Swietach, Steven A. Niederer, Lester Mackey, Chris. J. Oates

摘要

The use of heuristics to assess the convergence and compress the output of Markov chain Monte Carlo can be sub-optimal in terms of the empirical approximations that are produced. Typically a number of the initial states are attributed to ‘burn in’ and removed, while the remainder of the chain is ‘thinned’ if compression is also required. In this paper, we consider the problem of retrospectively selecting a subset of states, of fixed cardinality, from the sample path such that the approximation provided by their empirical distribution is close to optimal. A novel method is proposed, based on greedy minimisation of a kernel Stein discrepancy, that is suitable when the gradient of the log-target can be evaluated and approximation using a small number of states is required. Theoretical results guarantee consistency of the method and its effectiveness is demonstrated in the challenging context of parameter inference for ordinary differential equations. Software is available in the Stein Thinning package in Python, R and MATLAB.

AoS High-Dimensional · 发表于 2022-04-01

Testability of high-dimensional linear models with nonsparse structures

Jelena Bradic, Jianqing Fan, Yinchu Zhu

摘要

Understanding statistical inference under possibly nonsparse high-dimensional models has gained much interest recently. For a given component of the regression coefficient, we show that the difficulty of the problem depends on the sparsity of the corresponding row of the precision matrix of the covariates, not the sparsity of the regression coefficients. We develop new concepts of uniform and essentially uniform nontestability that allow the study of limitations of tests across a broad set of alternatives. Uniform nontestability identifies a collection of alternatives such that the power of any test, against any alternative in the group, is asymptotically at most equal to the nominal size. Implications of the new constructions include new minimax testability results that, in sharp contrast to the current results, do not depend on the sparsity of the regression parameters. We identify new tradeoffs between testability and feature correlation. In particular, we show that, in models with weak feature correlations, minimax lower bound can be attained by a test whose power has the n rate, regardless of the size of the model sparsity.

AoS High-Dimensional Machine Learning Networks & Graphs · 发表于 2022-04-01

Surprises in high-dimensional ridgeless least squares interpolation

Trevor Hastie, Andrea Montanari, Saharon Rosset, Ryan J. Tibshirani

摘要

Interpolators—estimators that achieve zero training error—have attracted growing attention in machine learning, mainly because state-of-the art neural networks appear to be models of this type. In this paper, we study minimum ℓ2 norm (“ridgeless”) interpolation least squares regression, focusing on the high-dimensional regime in which the number of unknown parameters p is of the same order as the number of samples n. We consider two different models for the feature distribution: a linear model, where the feature vectors xi∈Rp are obtained by applying a linear transform to a vector of i.i.d. entries, xi=Σ1/2zi (with zi∈Rp); and a nonlinear model, where the feature vectors are obtained by passing the input through a random one-layer neural network, xi=φ(Wzi) (with zi∈Rd, W∈Rp×d a matrix of i.i.d. entries, and φ an activation function acting componentwise on Wzi). We recover—in a precise quantitative way—several phenomena that have been observed in large-scale neural networks and kernel machines, including the “double descent” behavior of the prediction risk, and the potential benefits of overparametrization.

AoS Other · 发表于 2022-04-01

Statistical inference for principal components of spiked covariance matrices

Zhigang Bao, Xiucai Ding, Jingming Wang, Ke Wang

摘要

In this paper, we study the asymptotic behavior of the extreme eigenvalues and eigenvectors of the high-dimensional spiked sample covariance matrices, in the supercritical case when a reliable detection of spikes is possible. In particular, we derive the joint distribution of the extreme eigenvalues and the generalized components of the associated eigenvectors, that is, the projections of the eigenvectors onto arbitrary given direction, assuming that the dimension and sample size are comparably large. In general, the joint distribution is given in terms of linear combinations of finitely many Gaussian and Chi-square variables, with parameters depending on the projection direction and the spikes. Our assumption on the spikes is fully general. First, the strengths of spikes are only required to be slightly above the critical threshold and no upper bound on the strengths is needed. Second, multiple spikes, that is, spikes with the same strength, are allowed. Third, no structural assumption is imposed on the spikes. Thanks to the general setting, we can then apply the results to various high dimensional statistical hypothesis testing problems involving both the eigenvalues and eigenvectors. Specifically, we propose accurate and powerful statistics to conduct hypothesis testing on the principal components. These statistics are data-dependent and adaptive to the underlying true spikes. Numerical simulations also confirm the accuracy and powerfulness of our proposed statistics and illustrate significantly better performance compared to the existing methods in the literature. In particular, our methods are accurate and powerful even when either the spikes are small or the dimension is large.

AoS High-Dimensional · 发表于 2022-04-01

Sparse high-dimensional linear regression. Estimating squared error and a phase transition

David Gamarnik, Ilias Zadik

摘要

We consider a sparse high-dimensional regression model where the goal is to recover a k-sparse unknown binary vector β∗ from n noisy linear observations of the form Y=Xβ∗+W∈Rn where X∈Rn×p has i.i.d. N(0,1) entries and W∈Rn has i.i.d. N(0,σ2) entries. In the high signal-to-noise ratio regime and sublinear sparsity regime, while the order of the sample size needed to recover the unknown vector information-theoretically is known to be n∗:=2klogp/log(k/σ2+1), no polynomial-time algorithm is known to succeed unless n>nalg:=(2k+σ2)logp. In this work, we offer a series of results investigating multiple computational and statistical aspects of the recovery task in the regime n∈[n∗,nalg]. First, we establish a novel information-theoretic property of the MLE of the problem happening around n=n∗ samples, which we coin as an “all-or-nothing behavior”: when n>n∗ it recovers almost perfectly the support of β∗, while if n0 when nCnalg OGP disappears. OGP is a geometric “disconnectivity” property, which initially appeared in the theory of spin glasses and is known to suggest algorithmic hardness when it occurs. Finally, using certain technical results obtained to establish the OGP phase transition, we additionally establish various novel positive and negative algorithmic results for the recovery task of interest, including the failure of LASSO with access to nCnalg samples.

AoS Other · 发表于 2022-04-01

Refined Cramér-type moderate deviation theorems for general self-normalized sums with applications to dependent random variables and winsorized mean

Lan Gao, Qi-Man Shao, Jiasheng Shi

摘要

Let {(Xi,Yi)}i=1n be a sequence of independent bivariate random vectors. In this paper, we establish a refined Cramér-type moderate deviation theorem for the general self-normalized sum ∑ i=1nXi/(∑i=1nYi2)1/2, which unifies and extends the classical Cramér (Actual. Sci. Ind. 736 (1938) 5–23) theorem and the self-normalized Cramér-type moderate deviation theorems by Jing, Shao and Wang (Ann. Probab. 31 (2003) 2167–2215) as well as the further refined version by Wang (J. Theoret. Probab. 24 (2011) 307–329). The advantage of our result is evidenced through successful applications to weakly dependent random variables and self-normalized winsorized mean. Specifically, by applying our new framework on general self-normalized sum, we significantly improve Cramér-type moderate deviation theorems for one-dependent random variables, geometrically β-mixing random variables and causal processes under geometrical moment contraction. As an additional application, we also derive the Cramér-type moderate deviation theorems for self-normalized winsorized mean. *(abstract via OpenAlex)*

AoS Causal Inference · 发表于 2022-04-01

Reconciling design-based and model-based causal inferences for split-plot experiments

Anqi Zhao, Peng Ding

摘要

The split-plot design arose from agricultural science with experimental units, also known as the subplots, nested within groups known as the whole plots. It assigns different interventions at the whole-plot and subplot levels, respectively, providing a convenient way to accommodate hard-to-change factors. By design, subplots within the same whole plot receive the same level of the whole-plot intervention, and thereby induce a group structure on the final treatment assignments. A common strategy is to run an ordinary least squares (ols) regression of the outcome on the treatment indicators coupled with the robust standard errors clustered at the whole-plot level. It does not give consistent estimators for the treatment effects of interest when the whole-plot sizes vary. Another common strategy is to fit a linear mixed-effects model of the outcome with normal random effects and errors. It is a purely model-based approach and can be sensitive to violations of the parametric assumptions. In contrast, design-based inference assumes no outcome models and relies solely on the controllable randomization mechanism determined by the physical experiment. We first extend the existing design-based inference based on the Horvitz–Thompson estimator to the Hajek estimator, and establish the finite-population central limit theorem for both under split-plot randomization. We then reconcile the results with those under the model-based approach, and propose two regression strategies, namely (i) the weighted least squares (wls) fit of the unit-level data based on the inverse probability weighting and (ii) the ols fit of the aggregate data based on whole-plot total outcomes, to reproduce the Hajek and Horvitz–Thompson estimators, respectively. This, together with the asymptotic conservativeness of the corresponding cluster-robust covariances for estimating the true design-based covariances as we establish in the process, justifies the validity of the regression estimators for design-based inference. In light of the flexibility of regression formulation for covariate adjustment, we further extend the theory to the case with covariates, and demonstrate the efficiency gain by regression-based covariate adjustment via both asymptotic theory and simulation. Importantly, all our theories are either numeric or design-based, and hold regardless of how well the regression equations represent the true data generating process.

AoS Nonparametric & Semiparametric · 发表于 2022-04-01

Parametric copula adjusted for non- and semiparametric regression

Yue Zhao, Irène Gijbels, Ingrid Van Keilegom

摘要

We consider a multivariate response regression model where each coordinate is described by a location-scale non- or semiparametric regression and where the dependence structure of the “noise term” is described by a parametric copula. Our goal is to estimate the associated Euclidean copula parameter, given a sample of the response and the covariate. In the absence of the copula sample, the usual oracle ranks are no longer computable. Instead, we study the normal scores estimator for the Gaussian copula and generalized pseudo-likelihood estimation for general parametric copulas, both based on residual ranks calculated from preliminary non- or semiparametric estimators of the location and scale functions. We show that the residual-based estimators are asymptotically equivalent to their oracle counterparts and provide explicit rate of convergence. Partially to serve this objective, we also study weighted convergence of the residual empirical process under the non- or semiparametric regression model.

AoS Testing & Uncertainty · 发表于 2022-04-01

Optimal false discovery rate control for large scale multiple testing with auxiliary information

Hongyuan Cao, Jun Chen, Xianyang Zhang

摘要

Large-scale multiple testing is a fundamental problem in high dimensional statistical inference. It is increasingly common that various types of auxiliary information, reflecting the structural relationship among the hypotheses, are available. Exploiting such auxiliary information can boost statistical power. To this end, we propose a framework based on a two-group mixture model with varying probabilities of being null for different hypotheses a priori, where a shape-constrained relationship is imposed between the auxiliary information and the prior probabilities of being null. An optimal rejection rule is designed to maximize the expected number of true positives when average false discovery rate is controlled. Focusing on the ordered structure, we develop a robust EM algorithm to estimate the prior probabilities of being null and the distribution of p-values under the alternative hypothesis simultaneously. We show that the proposed method has better power than state-of-the-art competitors while controlling the false discovery rate, both empirically and theoretically. Extensive simulations demonstrate the advantage of the proposed method. Datasets from genome-wide association studies are used to illustrate the new methodology.

AoS Other · 发表于 2022-04-01

Necessary and sufficient conditions for asymptotically optimal linear prediction of random fields on compact metric spaces

Kristin Kirchner, David Bolin

摘要

Optimal linear prediction (aka. kriging) of a random field {Z(x)}x∈X indexed by a compact metric space (X,dX) can be obtained if the mean value function m:X→R and the covariance function ϱ:X×X→R of Z are known. We consider the problem of predicting the value of Z(x∗) at some location x∗∈X based on observations at locations {xj}j=1n, which accumulate at x∗ as n→∞ (or, more generally, predicting φ(Z) based on {φj(Z)}j=1n for linear functionals φ,φ1,…,φn). Our main result characterizes the asymptotic performance of linear predictors (as n increases) based on an incorrect second-order structure (m˜,ϱ˜), without any restrictive assumptions on ϱ, ϱ˜ such as stationarity. We, for the first time, provide necessary and sufficient conditions on (m˜,ϱ˜) for asymptotic optimality of the corresponding linear predictor holding uniformly with respect to φ. These general results are illustrated by weakly stationary random fields on X⊂Rd with Matérn or periodic covariance functions, and on the sphere X= S2 for the case of two isotropic covariance functions.

AoS Nonparametric & Semiparametric Optimization & Learning Theory · 发表于 2022-04-01

Multivariate ranks and quantiles using optimal transport: Consistency, rates and nonparametric testing

Promit Ghosal, Bodhisattva Sen

摘要

In this paper, we study multivariate ranks and quantiles, defined using the theory of optimal transport, and build on the work of Chernozhukov et al. (Ann. Statist. 45 (2017) 223–256) and Hallin et al. (Ann. Statist. 49 (2021) 1139–1165). We study the characterization, computation and properties of the multivariate rank and quantile functions and their empirical counterparts. We derive the uniform consistency of these empirical estimates to their population versions, under certain assumptions. In fact, we prove a Glivenko–Cantelli type theorem that shows the asymptotic stability of the empirical rank map in any direction. Under mild structural assumptions, we provide global and local rates of convergence of the empirical quantile and rank maps. We also provide a sub-Gaussian tail bound for the global L2-loss of the empirical quantile function. Further, we propose tuning parameter-free multivariate nonparametric tests—a two-sample test and a test for mutual independence—based on our notion of multivariate quantiles/ranks. Asymptotic consistency of these tests are shown and the rates of convergence of the associated test statistics are derived, both under the null and alternative hypotheses.

AoS Testing & Uncertainty Networks & Graphs · 发表于 2022-04-01

Motif estimation via subgraph sampling: The fourth-moment phenomenon

Bhaswar B. Bhattacharya, Sayan Das, Sumit Mukherjee

摘要

Network sampling is an indispensable tool for understanding features of large complex networks where it is practically impossible to search over the entire graph. In this paper, we develop a framework for statistical inference for counting network motifs, such as edges, triangles and wedges, in the widely used subgraph sampling model, where each vertex is sampled independently, and the subgraph induced by the sampled vertices is observed. We derive necessary and sufficient conditions for the consistency and the asymptotic normality of the natural Horvitz–Thompson (HT) estimator, which can be used for constructing confidence intervals and hypothesis testing for the motif counts based on the sampled graph. In particular, we show that the asymptotic normality of the HT estimator exhibits an interesting fourth-moment phenomenon, which asserts that the HT estimator (appropriately centered and rescaled) converges in distribution to the standard normal whenever its fourth-moment converges to 3 (the fourth-moment of the standard normal distribution). As a consequence, we derive the exact thresholds for consistency and asymptotic normality of the HT estimator in various natural graph ensembles, such as sparse graphs with bounded degree, Erdős–Rényi random graphs, random regular graphs and dense graphons.

AoS High-Dimensional Longitudinal Data · 发表于 2022-04-01

Max-sum tests for cross-sectional independence of high-dimensional panel data

Long Feng, Tiefeng Jiang, Binghui Liu, Wei Xiong

摘要

We consider a testing problem for cross-sectional independence for high-dimensional panel data, where the number of cross-sectional units is potentially much larger than the number of observations. The cross-sectional independence is described through linear regression models. We study three tests named the sum, the max and the max-sum tests, where the latter two are new. The sum test is initially proposed by Breusch and Pagan (1980). We design the max and sum tests for sparse and nonsparse correlation coefficients of random errors between the linear regression models, respectively. And the max-sum test is devised to compromise both situations on the correlation coefficients. Indeed, our simulation shows that the max-sum test outperforms the previous two tests. This makes the max-sum test very useful in practice where sparsity or not for a set of numbers is usually vague. Toward the theoretical analysis of the three tests, we have settled two conjectures regarding the sum of squares of sample correlation coefficients asked by Pesaran (2004 and 2008). In addition, we establish the asymptotic theory for maxima of sample correlation coefficients appeared in the linear regression model for panel data, which is also the first successful attempt to our knowledge. To study the max-sum test, we create a novel method to show asymptotic independence between maxima and sums of dependent random variables. We expect the method itself is useful for other problems of this nature. Finally, an extensive simulation study as well as a case study are carried out. They demonstrate advantages of our proposed methods in terms of both empirical powers and robustness for correlation coefficients of residuals regardless of sparsity or not.

AoS Latent Variables & Mixtures · 发表于 2022-04-01

Iterative algorithm for discrete structure recovery

Chao Gao, Anderson Y. Zhang

摘要

We propose a general modeling and algorithmic framework for discrete structure recovery that can be applied to a wide range of problems. Under this framework, we are able to study the recovery of clustering labels, ranks of players, signs of regression coefficients, cyclic shifts and even group elements from a unified perspective. A simple iterative algorithm is proposed for discrete structure recovery, which generalizes methods including Lloyd’s algorithm and the power method. A linear convergence result for the proposed algorithm is established in this paper under appropriate abstract conditions on stochastic errors and initialization. We illustrate our general theory by applying it on several representative problems: (1) clustering in Gaussian mixture model, (2) approximate ranking, (3) sign recovery in compressed sensing, (4) multireference alignment and (5) group synchronization, and show that minimax rate is achieved in each case.

AoS Other · 发表于 2022-04-01

Inference for low-rank tensors—no need to debias

Dong Xia, Anru R. Zhang, Yuchen Zhou

摘要

In this paper, we consider the statistical inference for several low-rank tensor models. Specifically, in the Tucker low-rank tensor PCA or regression model, provided with any estimates achieving some attainable error rate, we develop the data-driven confidence regions for the singular subspace of the parameter tensor based on the asymptotic distribution of an updated estimate by two-iteration alternating minimization. The asymptotic distributions are established under some essential conditions on the signal-to-noise ratio (in PCA model) or sample size (in regression model). If the parameter tensor is further orthogonally decomposable, we develop the methods and nonasymptotic theory for inference on each individual singular vector. For the rank-one tensor PCA model, we establish the asymptotic distribution for general linear forms of principal components and confidence interval for each entry of the parameter tensor. Finally, numerical simulations are presented to corroborate our theoretical discoveries. In all of these models, we observe that different from many matrix/vector settings in existing work, debiasing is not required to establish the asymptotic distribution of estimates or to make statistical inference on low-rank tensors. In fact, due to the widely observed statistical-computational-gap for low-rank tensor estimation, one usually requires stronger conditions than the statistical (or information-theoretic) limit to ensure the computationally feasible estimation is achievable. Surprisingly, such conditions “incidentally” render a feasible low-rank tensor inference without debiasing.

AoS High-Dimensional Spatial & Time Series · 发表于 2022-04-01

Inference for change points in high-dimensional data via selfnormalization

Runmin Wang, Changbo Zhu, Stanislav Volgushev, Xiaofeng Shao

摘要

This article considers change-point testing and estimation for a sequence of high-dimensional data. In the case of testing for a mean shift for high-dimensional independent data, we propose a new test which is based on U-statistic in Chen and Qin (Ann. Statist. 38 (2010) 808–835) and utilizes the self-normalization principle (Shao J. R. Stat. Soc. Ser. B. Stat. Methodol. 72 (2010) 343–366; Shao and Zhang J. Amer. Statist. Assoc. 105 (2010) 1228–1240). Our test targets dense alternatives in the high-dimensional setting and involves no tuning parameters. To extend to change-point testing for high-dimensional time series, we introduce a trimming parameter and formulate a self-normalized test statistic with trimming to accommodate the weak temporal dependence. On the theory front we derive the limiting distributions of self-normalized test statistics under both the null and alternatives for both independent and dependent high-dimensional data. At the core of our asymptotic theory, we obtain weak convergence of a sequential U-statistic based process for high-dimensional independent data, and weak convergence of sequential trimmed U-statistic based processes for high-dimensional linear processes, both of which are of independent interests. Additionally, we illustrate how our tests can be used in combination with wild binary segmentation to estimate the number and location of multiple change points. Numerical simulations demonstrate the competitiveness of our proposed testing and estimation procedures in comparison with several existing methods in the literature.

AoS Missing Data & Measurement Error · 发表于 2022-04-01

General and feasible tests with multiply-imputed datasets

Kin Wai Chan

摘要

Multiple imputation (MI) is a technique especially designed for handling missing data in public-use datasets. It allows analysts to perform incomplete-data inference straightforwardly by using several already imputed datasets released by the dataset owners. However, the existing MI tests require either a restrictive assumption on the missing-data mechanism, known as equal odds of missing information (EOMI), or an infinite number of imputations. Some of them also require analysts to have access to restrictive or nonstandard computer subroutines. Besides, the existing MI testing procedures cover only Wald’s tests and likelihood ratio tests but not Rao’s score tests, therefore, these MI testing procedures are not general enough. In addition, the MI Wald’s tests and MI likelihood ratio tests are not procedurally identical, so analysts need to resort to distinct algorithms for implementation. In this paper, we propose a general MI procedure, called stacked multiple imputation (SMI), for performing Wald’s tests, likelihood ratio tests and Rao’s score tests by a unified algorithm. SMI requires neither EOMI nor an infinite number of imputations. It is particularly feasible for analysts as they just need to use a complete-data testing device for performing the corresponding incomplete-data test.

AoS Nonparametric & Semiparametric · 发表于 2022-04-01

Functional sufficient dimension reduction through average Fréchet derivatives

Kuang-Yao Lee, Lexin Li

摘要

Sufficient dimension reduction (SDR) embodies a family of methods that aim for reduction of dimensionality without loss of information in a regression setting. In this article, we propose a new method for nonparametric function-on-function SDR, where both the response and the predictor are a function. We first develop the notions of functional central mean subspace and functional central subspace, which form the population targets of our functional SDR. We then introduce an average Fréchet derivative estimator, which extends the gradient of the regression function to the operator level and enables us to develop estimators for our functional dimension reduction spaces. We show the resulting functional SDR estimators are unbiased and exhaustive, and more importantly, without imposing any distributional assumptions such as the linearity or the constant variance conditions that are commonly imposed by all existing functional SDR methods. We establish the uniform convergence of the estimators for the functional dimension reduction spaces, while allowing both the number of Karhunen–Loève expansions and the intrinsic dimension to diverge with the sample size. We demonstrate the efficacy of the proposed methods through both simulations and two real data examples.

AoS Testing & Uncertainty · 发表于 2022-04-01

False discovery rate control with unknown null distribution: Is it possible to mimic the oracle?

Etienne Roquain, Nicolas Verzelen

摘要

Classical multiple testing theory prescribes the null distribution, which is often too stringent an assumption for nowadays large scale experiments. This paper presents theoretical foundations to understand the limitations caused by ignoring the null distribution, and how it can be properly learned from the same data set, when possible. We explore this issue in the setting where the null distributions are Gaussian with unknown rescaling parameters (mean and variance) whereas the alternative distributions are let arbitrary. In that case, an oracle procedure is the Benjamini–Hochberg procedure applied with the true (unknown) null distribution and we aim at building a procedure that asymptotically mimics the performances of the oracle (AMO in short). Our main result establishes a phase transition at the sparsity boundary n/log(n): an AMO procedure exists if and only if the number of false nulls is of order less than n/log(n), where n is the total number of tests. Further sparsity boundaries are derived for general location models where the shape of the null distribution is not necessarily Gaussian. In light of our impossibility results, we also pursue the less stringent aim of building a nonparametric confidence region for the null distribution. From a practical perspective, this provides goodness-of-fit tests for the null distribution and allows to assess the reliability of empirical null procedures via novel diagnostic graphs. Our results are illustrated on numerical experiments and real data sets, as detailed in a companion vignette (Roquain and Verzelen (2021)).

AoS Networks & Graphs Testing & Uncertainty High-Dimensional · 发表于 2022-04-01

Edgeworth expansions for network moments

Yuan Zhang, Dong Xia

摘要

Network method of moments (Ann. Statist. 39 (2011) 2280–2301) is an important tool for nonparametric network inference. However, there has been little investigation on accurate descriptions of the sampling distributions of network moment statistics. In this paper, we present the first higher-order accurate approximation to the sampling CDF of a studentized network moment by Edgeworth expansion. In sharp contrast to classical literature on noiseless U-statistics, we show that the Edgeworth expansion of a network moment statistic as a noisy U-statistic can achieve higher-order accuracy without nonlattice or smoothness assumptions but just requiring weak regularity conditions. Behind this result is our surprising discovery that the two typically-hated factors in network analysis, namely, sparsity and edgewise observational errors, jointly play a blessing role, contributing a crucial self-smoothing effect in the network moment statistic and making it analytically tractable. Our assumptions match the minimum requirements in related literature. For sparse networks, our theory shows that our empirical Edgeworth expansion and a simple normal approximation both achieve the same gradually depreciating Berry–Esseen-type bound as the network becomes sparser. This result also significantly refines the best previous theoretical result. For practitioners, our empirical Edgeworth expansion is highly accurate and computationally efficient. It is also easy to implement and convenient for parallel computing. We demonstrate the clear advantage of our method by several comprehensive simulation studies. As a byproduct, we also provide a finite-sample analysis of the network jackknife. We showcase three applications of our results in network inference. We prove, to our knowledge, the first theoretical guarantee of higher-order accuracy for some network bootstrap schemes, and moreover, the first theoretical guidance for selecting the subsample size for network subsampling. We also derive a one-sample test and the Cornish–Fisher confidence interval for a given moment with higher-order accurate controls of confidence level and type I error, respectively.

AoS Meta-Analysis & Data Integration Nonparametric & Semiparametric · 发表于 2022-04-01

Distributed nonparametric function estimation: Optimal rate of convergence and cost of adaptation

T. Tony Cai, Hongji Wei

摘要

Distributed minimax estimation and distributed adaptive estimation under communication constraints for Gaussian sequence model and white noise model are studied. The minimax rate of convergence for distributed estimation over a given Besov class, which serves as a benchmark for the cost of adaptation, is established. We then quantify the exact communication cost for adaptation and construct an optimally adaptive procedure for distributed estimation over a range of Besov classes. The results demonstrate significant differences between nonparametric function estimation in the distributed setting and the conventional centralized setting. For global estimation, adaptation in general cannot be achieved for free in the distributed setting. The new technical tools to obtain the exact characterization for the cost of adaptation can be of independent interest.

AoS Other · 发表于 2022-04-01

All-in-one robust estimator of the Gaussian mean

Arnak S. Dalalyan, Arshak Minasyan

摘要

The goal of this paper is to show that a single robust estimator of the mean of a multivariate Gaussian distribution can enjoy five desirable properties. First, it is computationally tractable in the sense that it can be computed in a time, which is at most polynomial in dimension, sample size and the logarithm of the inverse of the contamination rate. Second, it is equivariant by translations, uniform scaling and orthogonal transformations. Third, it has a high breakdown point equal to 0.5, and a nearly minimax rate breakdown point approximately equal to 0.28. Fourth, it is minimax rate optimal, up to a logarithmic factor, when data consists of independent observations corrupted by adversarially chosen outliers. Fifth, it is asymptotically efficient when the rate of contamination tends to zero. The estimator is obtained by an iterative reweighting approach. Each sample point is assigned a weight that is iteratively updated by solving a convex optimization problem. We also establish a dimension-free nonasymptotic risk bound for the expected error of the proposed estimator. It is the first result of this kind in the literature and involves only the effective rank of the covariance matrix. Finally, we show that the obtained results can be extended to sub-Gaussian distributions, as well as to the cases of unknown rate of contamination or unknown covariance matrix.

AoS Nonparametric & Semiparametric · 发表于 2022-04-01

Adaptive test of independence based on HSIC measures

Mélisande Albert, Béatrice Laurent, Amandine Marrel, Anouar Meynaoui

摘要

The Hilbert–Schmidt Independence Criterion (HSIC) is a dependence measure based on reproducing kernel Hilbert spaces that is widely used to test independence between two random vectors. Remains the delicate choice of the kernel. In this work, we develop a new HSIC-based aggregated procedure which avoids such a kernel choice, and provide theoretical guarantees for this procedure. To achieve this, on the one hand, we introduce non-asymptotic single tests based on Gaussian kernels with a given bandwidth, which are of prescribed level. Then, we aggregate several single tests with different bandwidths, and prove sharp upper bounds for the uniform separation rate of the aggregated procedure over Sobolev balls. On the other hand, we provide a lower bound for the non-asymptotic minimax separation rate of testing over Sobolev balls, and deduce that the aggregated procedure is adaptive in the minimax sense over such regularity spaces. Finally, from a practical point of view, we perform numerical studies in order to assess the efficiency of our aggregated procedure and compare it to existing tests in the literature.

AoS High-Dimensional · 发表于 2022-04-01

Adaptive estimation in multivariate response regression with hidden variables

Xin Bing, Yang Ning, Yaosheng Xu

摘要

A prominent concern of scientific investigators is the presence of unobserved hidden variables in association analysis. Ignoring hidden variables often yields biased statistical results and misleading scientific conclusions. Motivated by this practical issue, this paper studies the multivariate response regression with hidden variables, Y=(Ψ∗)TX+(B∗)TZ+E, where Y∈Rm is the response vector, X∈Rp is the observable feature, Z∈RK represents the vector of unobserved hidden variables, possibly correlated with X, and E is an independent error. The number of hidden variables K is unknown and both m and p are allowed, but not required, to grow with the sample size n. Though Ψ∗ is shown to be nonidentifiable due to the presence of hidden variables, we propose to identify the projection of Ψ∗ onto the orthogonal complement of the row space of B∗, denoted by Θ∗. The quantity (Θ∗)TX measures the effect of X on Y that cannot be explained through the hidden variables, and thus Θ∗ is treated as the parameter of interest. Motivated by the identifiability proof, we propose a novel estimation algorithm for Θ∗, called HIVE, under homoscedastic errors. The first step of the algorithm estimates the best linear prediction of Y given X, in which the unknown coefficient matrix exhibits an additive decomposition of Ψ∗ and a dense matrix due to the correlation between X and Z. Under the sparsity assumption on Ψ∗, we propose to minimize a penalized least squares loss by regularizing Ψ∗ and the dense matrix via group-lasso and multivariate ridge, respectively. Nonasymptotic deviation bounds of the in-sample prediction error are established. Our second step estimates the row space of B∗ by leveraging the covariance structure of the residual vector from the first step. In the last step, we estimate Θ∗ via projecting Y onto the orthogonal complement of the estimated row space of B∗ to remove the effect of hidden variables. Nonasymptotic error bounds of our final estimator of Θ∗, which are valid for any m,p,K and n, are established. We further show that, under mild assumptions, the rate of our estimator matches the best possible rate with known B∗ and is adaptive to the unknown sparsity of Θ∗ induced by the sparsity of Ψ∗. The model identifiability, estimation algorithm and statistical guarantees are further extended to the setting with heteroscedastic errors. Thorough numerical simulations and two real data examples are provided to back up our theoretical results.

SMMR Longitudinal Data · 发表于 2022-03-31

Receiver operating characteristic estimation and threshold selection criteria in three-class classification problems for clustered data

Duc-Khanh To, Gianfranco Adimari, Monica Chiogna, Davide Risso

摘要

Statistical evaluation of diagnostic tests, and, more generally, of biomarkers, is a constantly developing field, in which complexity of the assessment increases with the complexity of the design under which data are collected. One particularly prevalent type of data is clustered data, where individual units are naturally nested into clusters. In these cases, Bias can arise from omission, in the evaluation process, of cluster-level effects and/or individual covariates. Focusing on the three-class case and for continuous-valued diagnostic tests, we investigate how to exploit the clustered structure of data within a linear-mixed model approach, both when the assumption of normality holds and when it does not. We provide a method for the estimation of covariate-specific receiver operating characteristic surfaces and discuss methods for the choice of optimal thresholds, proposing three possible estimators. A proof of consistency and asymptotic normality of the proposed threshold estimators is given. All considered methods are evaluated by extensive simulation experiments. As an application, we study the use of the Lysosomal Associated Membrane Protein Family Member 5 gene expression as a biomarker to distinguish among three types of glutamatergic neurons.

JASA High-Dimensional Meta-Analysis & Data Integration · 发表于 2022-03-31

Generalized Liquid Association Analysis for Multimodal Data Integration

Lexin Li, Jing Zeng, Xin Zhang

摘要

Multimodal data are now prevailing in scientific research. One of the central questions in multimodal integrative analysis is to understand how two data modalities associate and interact with each other given another modality or demographic variables. The problem can be formulated as studying the associations among three sets of random variables, a question that has received relatively less attention in the literature. In this article, we propose a novel generalized liquid association analysis method, which offers a new and unique angle to this important class of problems of studying three-way associations. We extend the notion of liquid association of Li (2002) from the univariate setting to the sparse, multivariate, and high-dimensional setting. We establish a population dimension reduction model, transform the problem to sparse Tucker decomposition of a three-way tensor, and develop a higher-order orthogonal iteration algorithm for parameter estimation. We derive the non-asymptotic error bound and asymptotic consistency of the proposed estimator, while allowing the variable dimensions to be larger than and diverge with the sample size. We demonstrate the efficacy of the method through both simulations and a multimodal neuroimaging application for Alzheimer's disease research. *(abstract via PubMed)*

JASA Nonparametric & Semiparametric · 发表于 2022-03-31

Estimation of Copulas via Maximum Mean Discrepancy

Pierre Alquier, Badr-Eddine Chérief-Abdellatif, Alexis Derumigny, Jean-David Fermanian

摘要

This article deals with robust inference for parametric copula models. Estimation using canonical maximum likelihood might be unstable, especially in the presence of outliers. We propose to use a procedure based on the maximum mean discrepancy (MMD) principle. We derive nonasymptotic oracle inequalities, consistency and asymptotic normality of this new estimator. In particular, the oracle inequality holds without any assumption on the copula family, and can be applied in the presence of outliers or under misspecification. Moreover, in our MMD framework, the statistical inference of copula models for which there exists no density with respect to the Lebesgue measure on [0,1]d, as the Marshall-Olkin copula, becomes feasible. A simulation study shows the robustness of our new procedures, especially compared to pseudo-maximum likelihood estimation. An R package implementing the MMD estimator for copula models is available. Supplementary materials for this article are available online. *(abstract via OpenAlex)*

Biometrics Spatial & Time Series Causal Inference Nonparametric & Semiparametric · 发表于 2022-03-30

Spatial+: A novel approach to spatial confounding

Emiko Dupont, Simon N. Wood, Nicole H. Augustin

摘要

In spatial regression models, collinearity between covariates and spatial effects can lead to significant bias in effect estimates. This problem, known as spatial confounding, is encountered modeling forestry data to assess the effect of temperature on tree health. Reliable inference is difficult as results depend on whether or not spatial effects are included in the model. We propose a novel approach, spatial+, for dealing with spatial confounding when the covariate of interest is spatially dependent but not fully determined by spatial location. Using a thin plate spline model formulation we see that, in this case, the bias in covariate effect estimates is a direct result of spatial smoothing. Spatial+ reduces the sensitivity of the estimates to smoothing by replacing the covariates by their residuals after spatial dependence has been regressed away. Through asymptotic analysis we show that spatial+ avoids the bias problems of the spatial model. This is also demonstrated in a simulation study. Spatial+ is straightforward to implement using existing software and, as the response variable is the same as that of the spatial model, standard model selection criteria can be used for comparisons. A major advantage of the method is also that it extends to models with non‐Gaussian response distributions. Finally, while our results are derived in a thin plate spline setting, the spatial+ methodology transfers easily to other spatial model formulations.

JRSSB Networks & Graphs · 发表于 2022-03-30

Simple: Statistical Inference on Membership Profiles in Large Networks

Jianqing Fan, Yingying Fan, Xiao Han, Jinchi Lv

摘要

Network data are prevalent in many contemporary big data applications in which a common interest is to unveil important latent links between different pairs of nodes. Yet a simple fundamental question of how to precisely quantify the statistical uncertainty associated with the identification of latent links still remains largely unexplored. In this paper, we propose the method of statistical inference on membership profiles in large networks (SIMPLE) in the setting of degree-corrected mixed membership model, where the null hypothesis assumes that the pair of nodes share the same profile of community memberships. In the simpler case of no degree heterogeneity, the model reduces to the mixed membership model for which an alternative more robust test is also proposed. Both tests are of the Hotelling-type statistics based on the rows of empirical eigenvectors or their ratios, whose asymptotic covariance matrices are very challenging to derive and estimate. Nevertheless, their analytical expressions are unveiled and the unknown covariance matrices are consistently estimated. Under some mild regularity conditions, we establish the exact limiting distributions of the two forms of SIMPLE test statistics under the null hypothesis and contiguous alternative hypothesis. They are the chi-square distributions and the noncentral chi-square distributions, respectively, with degrees of freedom depending on whether the degrees are corrected or not. We also address the important issue of estimating the unknown number of communities and establish the asymptotic properties of the associated test statistics. The advantages and practical utility of our new procedures in terms of both size and power are demonstrated through several simulation examples and real network applications.

SiM Causal Inference Nonparametric & Semiparametric Genetics & Omics · 发表于 2022-03-30

Nonparametric bounds in two‐sample summary‐data Mendelian randomization: Some cautionary tales for practice

Ralph Møller Trane, Hyunseung Kang

摘要

Recently, in genetic epidemiology, Mendelian randomization (MR) has become a popular approach to estimate causal exposure effects by using single nucleotide polymorphisms from genome‐wide association studies (GWAS) as instruments. The most popular type of MR study, a two‐sample summary‐data MR study, relies on having summary statistics from two independent GWAS and using parametric methods for estimation. However, little is understood about using a nonparametric bound‐based analysis, a popular approach in traditional instrumental variables frameworks, to study causal effects in two‐sample MR. In this article, we explore using a nonparametric, bound‐based analysis in two‐sample MR studies, focusing primarily on implications for practice. We also propose a framework to assess how likely one can obtain more informative bounds if we used a different MR design, notably a one‐sample MR design. We conclude by demonstrating our findings through two real data analyses concerning the causal effect of smoking on lung cancer and the causal effect of high cholesterol on heart attacks. Overall, our results suggest that while a bound‐based analysis may be appealing due to its nonparametric nature, it is far more conservative in two‐sample settings than in one‐sample settings to get informative bounds on the causal exposure effect.

SiM Clinical Trials Longitudinal Data · 发表于 2022-03-30

Limitations of clinical trial sample size estimate by subtraction of two measurements

Kewei Chen, Xiaojuan Guo, Rong Pan, Chengjie Xiong, Danielle J. Harvey, Yinghua Chen, Li Yao, Yi Su, Eric M. Reiman, for the Alzheimer's Disease Neuroimaging Initiative

摘要

In planning randomized clinical trials (RCTs) for diseases such as Alzheimer's disease (AD), researchers frequently rely on the use of existing data obtained from only two time points to estimate sample size via the subtraction of baseline from follow‐up measurements in each subject. However, the inadequacy of this method has not been reported. The aim of this study is to discuss the limitation of sample size estimation based on the subtraction of available data from only two time points for RCTs. Mathematical equations are derived to demonstrate the condition under which the obtained data pairs with variable time intervals could be used to adequately estimate sample size. The MRI‐based hippocampal volume measurements from the Alzheimer's Disease Neuroimaging Initiative (ADNI) and Monte Carlo simulations (MCS) were used to illustrate the existing bias and variability of estimates. MCS results support the theoretically derived condition under which the subtraction approach may work. MCS also show the systematically under‐ or over‐estimated sample sizes by up to 32.27 bias. Not used properly, such subtraction approach outputs the same sample size regardless of trial durations partly due to the way measurement errors are handled. Estimating sample size by subtracting two measurements should be treated with caution. Such estimates can be biased, the magnitude of which depends on the planned RCT duration. To estimate sample sizes, we recommend using more than two measurements and more comprehensive approaches such as linear mixed effect models.

SiM Causal Inference Genetics & Omics · 发表于 2022-03-30

Efficient estimation of indirect effects in case‐control studies using a unified likelihood framework

Glen A. Satten, Sarah W. Curtis, Claudia Solis‐Lemus, Elizabeth J. Leslie, Michael P. Epstein

摘要

Mediation models are a set of statistical techniques that investigate the mechanisms that produce an observed relationship between an exposure variable and an outcome variable in order to deduce the extent to which the relationship is influenced by intermediate mediator variables. For a case‐control study, the most common mediation analysis strategy employs a counterfactual framework that permits estimation of indirect and direct effects on the odds ratio scale for dichotomous outcomes, assuming either binary or continuous mediators. While this framework has become an important tool for mediation analysis, we demonstrate that we can embed this approach in a unified likelihood framework for mediation analysis in case‐control studies that leverages more features of the data (in particular, the relationship between exposure and mediator) to improve efficiency of indirect effect estimates. One important feature of our likelihood approach is that it naturally incorporates cases within the exposure‐mediator model to improve efficiency. Our approach does not require knowledge of disease prevalence and can model confounders and exposure‐mediator interactions, and is straightforward to implement in standard statistical software. We illustrate our approach using both simulated data and real data from a case‐control genetic study of lung cancer.

Biometrics Functional Data Testing & Uncertainty · 发表于 2022-03-30

Domain Selection and Familywise Error Rate for Functional Data: A Unified Framework

Konrad Abramowicz, Alessia Pini, Lina Schelin, Sara Sjöstedt de Luna, Aymeric Stamm, Simone Vantini

摘要

Functional data are smooth, often continuous, random curves, which can be seen as an extreme case of multivariate data with infinite dimensionality. Just as componentwise inference for multivariate data naturally performs feature selection, subsetwise inference for functional data performs domain selection. In this paper, we present a unified testing framework for domain selection on populations of functional data. In detail, p-values of hypothesis tests performed on pointwise evaluations of functional data are suitably adjusted for providing control of the familywise error rate (FWER) over a family of subsets of the domain. We show that several state-of-the-art domain selection methods fit within this framework and differ from each other by the choice of the family over which the control of the FWER is provided. In the existing literature, these families are always defined a priori. In this work, we also propose a novel approach, coined thresholdwise testing, in which the family of subsets is instead built in a data-driven fashion. The method seamlessly generalizes to multidimensional domains in contrast to methods based on a priori defined families. We provide theoretical results with respect to consistency and control of the FWER for the methods within the unified framework. We illustrate the performance of the methods within the unified framework on simulated and real data examples and compare their performance with other existing methods.

Biometrics Other · 发表于 2022-03-30

A Note on Familywise Error Rate for a Primary and Secondary Endpoint

Michael A. Proschan, Dean A. Follmann

摘要

Hung et al. (2007) considered the problem of controlling the type I error rate for a primary and secondary endpoint in a clinical trial using a gatekeeping approach in which the secondary endpoint is tested only if the primary endpoint crosses its monitoring boundary. They considered a two-look trial and showed by simulation that the naive method of testing the secondary endpoint at full level α at the time the primary endpoint reaches statistical significance does not control the familywise error rate at level α. Tamhane et al. (2010) derived analytic expressions for familywise error rate and power and confirmed the inflated error rate of the naive approach. Nonetheless, many people mistakenly believe that the closure principle can be used to prove that the naive procedure controls the familywise error rate. The purpose of this note is to explain in greater detail why there is a problem with the naive approach and show that the degree of alpha inflation can be as high as that of unadjusted monitoring of a single endpoint.

Biometrics Missing Data & Measurement Error · 发表于 2022-03-29

Score Test for Missing at Random or Not under Logistic Missingness Models

Hairu Wang, Zhiping Lu, Yukun Liu

摘要

Missing data are frequently encountered in various disciplines and can be divided into three categories: missing completely at random (MCAR), missing at random (MAR), and missing not at random (MNAR). Valid statistical approaches to missing data depend crucially on correct identification of the underlying missingness mechanism. Although the problem of testing whether this mechanism is MCAR or MAR has been extensively studied, there has been very little research on testing MAR versus MNAR. A critical challenge that is faced when dealing with this problem is the issue of model identification under MNAR. In this paper, under a logistic model for the missing probability, we develop two score tests for the problem of whether the missingness mechanism is MAR or MNAR under a parametric model and a semiparametric location model on the regression function. The implementation of the score tests circumvents the identification issue as it requires only parameter estimation under the null MAR assumption. Our simulations and analysis of human immunodeficiency virus data show that the score tests have well-controlled type I errors and desirable powers.

SMMR Other · 发表于 2022-03-29

On recurrent-event win ratio

Lu Mao, KyungMann Kim, Yi Li

摘要

The win ratio approach proposed by Pocock et al. (2012) has become a popular tool for analyzing composite endpoints of death and non-fatal events like hospitalization. Its standard version, however, draws on the non-fatal event only through the first occurrence. For statistical efficiency and clinical interpretability, we construct and compare different win ratio variants that make fuller use of recurrent events. We pay special attention to a variant called last-event-assisted win ratio, which compares two patients on the cumulative frequency of the non-fatal event, with ties broken by the time of its latest episode. It is shown that last-event-assisted win ratio uses more data than the standard win ratio does but reduces to the latter when the non-fatal event occurs at most once. We further prove that last-event-assisted win ratio rejects the null hypothesis with large probability if the treatment stochastically delays all events. Simulations under realistic settings show that the last-event-assisted win ratio test consistently enjoys higher power than the standard win ratio and other competitors. Analysis of a real cardiovascular trial provides further evidence for the practical advantages of the last-event-assisted win ratio. Finally, we discuss future work to develop meaningful effect size estimands based on the extended rules of comparison. The R-code for the proposed methods is included in the package WR openly available on the Comprehensive R Archive Network.

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