-
作者：Javanmard, Adel; Montanari, Andrea
作者单位：University of Southern California; Stanford University; Stanford University
摘要：Multiple hypothesis testing is a core problem in statistical inference and arises in almost every scientific field. Given a set of null hypotheses H(n) = (H-1,..., H-n), Benjamini and Hochberg [J.R. Stat. Soc. Ser. B. Stat. Methodol. 57 (1995) 289-300] introduced the false discovery rate (FDR), which is the expected proportion of false positives among rejected null hypotheses, and proposed a testing procedure that controls FDR below a preassigned significance level. Nowadays FDR is the criteri...
-
作者：Wang, Guanghui; Zou, Changliang; Yin, Guosheng
作者单位：Nankai University; Nankai University; University of Hong Kong
摘要：We consider a sequence of multinomial data for which the probabilities associated with the categories are subject to abrupt changes of unknown magnitudes at unknown locations. When the number of categories is comparable to or even larger than the number of subjects allocated to these categories, conventional methods such as the classical Pearson's chi-squared test and the deviance test may not work well. Motivated by high-dimensional homogeneity tests, we propose a novel change-point detection...
-
作者：Zhao, Anqi; Ding, Peng; Mukerjee, Rahul; Dasgupta, Tirthankar
作者单位：Harvard University; University of California System; University of California Berkeley; Indian Institute of Management (IIM System); Indian Institute of Management Calcutta; Rutgers University System; Rutgers University New Brunswick
摘要：Under the potential outcomes framework, we propose a randomization based estimation procedure for causal inference from split-plot designs, with special emphasis on 2(2) designs that naturally arise in many social, behavioral and biomedical experiments. Point estimators of factorial effects are obtained and their sampling variances are derived in closed form as linear combinations of the between- and within-group covariances of the potential outcomes. Results are compared to those under comple...
-
作者：Escanciano, Juan Carlos; Carlos Pardo-Fernandez, Juan; Van Keilegom, Ingrid
作者单位：Indiana University System; Indiana University Bloomington; Universidade de Vigo; KU Leuven
摘要：This article proposes a new general methodology for constructing nonparametric and semiparametric Asymptotically Distribution-Free (ADF) tests for semiparametric hypotheses in regression models for possibly dependent data coming from a strictly stationary process. Classical tests based on the difference between the estimated distributions of the restricted and unrestricted regression errors are not ADF. In this article, we introduce a novel transformation of this difference that leads to ADF t...
-
作者：Chen, Xi; Liu, Weidong
作者单位：New York University; Shanghai Jiao Tong University; Shanghai Jiao Tong University
摘要：Testing independence among a number of (ultra) high-dimensional random samples is a fundamental and challenging problem. By arranging n identically distributed p-dimensional random vectors into a p x n data matrix, we investigate the problem of testing independence among columns under the matrix-variate normal modeling of data. We propose a computationally simple and tuning-free test statistic, characterize its limiting null distribution, analyze the statistical power and prove its minimax opt...
-
作者：Lv, Shaogao; Lin, Huazhen; Lian, Heng; Huang, Jian
作者单位：Nanjing Audit University; Southwestern University of Finance & Economics - China; City University of Hong Kong; University of Iowa
摘要：This paper considers the estimation of the sparse additive quantile regression (SAQR) in high-dimensional settings. Given the nonsmooth nature of the quantile loss function and the nonparametric complexities of the component function estimation, it is challenging to analyze the theoretical properties of ultrahigh-dimensional SAQR. We propose a regularized learning approach with a two-fold Lasso-type regularization in a reproducing kernel Hilbert space (RKHS) for SAQR. We establish nonasymptoti...
-
作者：Pretorius, Charl; Swanepoel, Jan W. H.
作者单位：North West University - South Africa
摘要：We propose a new method, based on sample splitting, for constructing bootstrap confidence bounds for a parameter appearing in the regular smooth function model. It has been demonstrated in the literature, for example, by Hall [Ann. Statist. 16 (1988) 927-985; The Bootstrap and Edgeworth Expansion (1992) Springer], that the well-known percentile-t method for constructing bootstrap confidence bounds typically incurs a coverage error of order O(n(-1)), with n being the sample size. Our version of...
-
作者：Jankova, Jana; van de Geer, Sara
作者单位：Swiss Federal Institutes of Technology Domain; ETH Zurich
摘要：Asymptotic lower bounds for estimation play a fundamental role in assessing the quality of statistical procedures. In this paper, we propose a framework for obtaining semiparametric efficiency bounds for sparse high-dimensional models, where the dimension of the parameter is larger than the sample size. We adopt a semiparametric point of view: we concentrate on one-dimensional functions of a high-dimensional parameter. We follow two different approaches to reach the lower bounds: asymptotic Cr...
-
作者：Rockova, Veronika
作者单位：University of Chicago
摘要：We introduce a new framework for estimation of sparse normal means, bridging the gap between popular frequentist strategies (LASSO) and popular Bayesian strategies (spike-and-slab). The main thrust of this paper is to introduce the family of Spike-and-Slab LASSO (SS-LASSO) priors, which form a continuum between the Laplace prior and the point-mass spike-and-slab prior. We establish several appealing frequentist properties of SS-LASSO priors, contrasting them with these two limiting cases. Firs...
-
作者：Jiang, Bai; Wu, Tung-Yu; Jin, Yifan; Wong, Wing H.
作者单位：Stanford University; Stanford University
摘要：The Contrastive Divergence ( CD) algorithm has achieved notable success in training energy-based models including Restricted Boltzmann Machines and played a key role in the emergence of deep learning. The idea of this algorithm is to approximate the intractable term in the exact gradient of the log-likelihood function by using short Markov chain Monte Carlo (MCMC) runs. The approximate gradient is computationally-cheap but biased. Whether and why the CD algorithm provides an asymptotically con...
