论文检索

随机区块模型的似然模型选择AI 解读

The stochastic block model (SBM) provides a popular framework for modeling community structures in networks. However, more attention has been devoted to problems concerning estimating the latent node labels and the model parameters than the issue of choosing the number of blocks. We consider an approach based on the log likelihood ratio statistic and analyze its asymptotic properties under model misspecification. We show the limiting distribution of the statistic in the case…

用于网络自动社群发现的假设检验AI 解读

Summary Community detection in networks is a key exploratory tool with applications in a diverse set of areas, ranging from finding communities in social and biological networks to identifying link farms in the World Wide Web. The problem of finding communities or clusters in a network has received much attention from statistics, physics and computer science. However, most clustering algorithms assume knowledge of the number of clusters k. We propose to determine k…

网络计数特征的子抽样 BootstrapAI 解读

Analysis of stochastic models of networks is quite important in light of the huge influx of network data in social, information and bio sciences, but a proper statistical analysis of features of different stochastic models of networks is still underway. We propose bootstrap subsampling methods for finding empirical distribution of count features or “moments” (Bickel, Chen and Levina [Ann. Statist. 39 (2011) 2280–2301]) and smooth functions of these features for the networks.…

大型稀疏网络社区检测的伪似然方法AI 解读

Many algorithms have been proposed for fitting network models with communities, but most of them do not scale well to large networks, and often fail on sparse networks. Here we propose a new fast pseudo-likelihood method for fitting the stochastic block model for networks, as well as a variant that allows for an arbitrary degree distribution by conditioning on degrees. We show that the algorithms perform well under a range of settings, including on very sparse networks, and…

自协方差矩阵的带状正则化：时间序列参数估计与预测AI 解读

Summary The paper addresses a ‘large p–small n’ problem in a time series framework and considers properties of banded regularization of an empirical autocovariance matrix of a time series process. Utilizing the banded autocovariance matrix enables us to fit a much longer auto-regressive AR(p) model to the observed data than typically suggested by the Akaike information criterion, while controlling how many parameters are to be estimated precisely and the level of accuracy.…

网络模型的矩方法与度分布AI 解读

Probability models on graphs are becoming increasingly important in many applications, but statistical tools for fitting such models are not yet well developed. Here we propose a general method of moments approach that can be used to fit a large class of probability models through empirical counts of certain patterns in a graph. We establish some general asymptotic properties of empirical graph moments and prove consistency of the estimates as the graph size grows for all…

Lasso 与 Dantzig selector 的统一分析AI 解读

We show that, under a sparsity scenario, the Lasso estimator and the Dantzig selector exhibit similar behavior. For both methods, we derive, in parallel, oracle inequalities for the prediction risk in the general nonparametric regression model, as well as bounds on the ℓp estimation loss for 1≤p≤2 in the linear model when the number of variables can be much larger than the sample size.

通过阈值化实现协方差正则化AI 解读

This paper considers regularizing a covariance matrix of p variables estimated from n observations, by hard thresholding. We show that the thresholded estimate is consistent in the operator norm as long as the true covariance matrix is sparse in a suitable sense, the variables are Gaussian or sub-Gaussian, and (log p)/n→0, and obtain explicit rates. The results are uniform over families of covariance matrices which satisfy a fairly natural notion of sparsity. We discuss an…

大型协方差矩阵的正则化估计AI 解读

This paper considers estimating a covariance matrix of p variables from n observations by either banding or tapering the sample covariance matrix, or estimating a banded version of the inverse of the covariance. We show that these estimates are consistent in the operator norm as long as (log p)/n→0, and obtain explicit rates. The results are uniform over some fairly natural well-conditioned families of covariance matrices. We also introduce an analogue of the Gaussian white…

高效独立成分分析AI 解读

Independent component analysis (ICA) has been widely used for blind source separation in many fields, such as brain imaging analysis, signal processing and telecommunication. Many statistical techniques based on M-estimates have been proposed for estimating the mixing matrix. Recently, several nonparametric methods have been developed, but in-depth analysis of asymptotic efficiency has not been available. We analyze ICA using semiparametric theories and propose a…

纹理合成与随机场的非参数重抽样AI 解读

This paper introduces a nonparametric algorithm for bootstrapping a stationary random field and proves certain consistency properties of the algorithm for the case of mixing random fields. The motivation for this paper comes from relating a heuristic texture synthesis algorithm popular in computer vision to general nonparametric bootstrapping of stationary random fields. We give a formal resampling scheme for the heuristic texture algorithm and prove that it produces a…

面向半参数假设的定制拟合优度检验AI 解读

We introduce a new framework for constructing tests of general semiparametric hypotheses which have nontrivial power on the n−1/2 scale in every direction, and can be tailored to put substantial power on alternatives of importance. The approach is based on combining test statistics based on stochastic processes of score statistics with bootstrap critical values.

关于提升方法论文的讨论及作者回应AI 解读

Discussions of: "Process consistency for AdaBoost" [Ann. Statist. 32 (2004), no. 1, 13-29] by W. Jiang; "On the Bayes-risk consistency of regularized boosting methods" [ibid., 30-55] by G. Lugosi and N. Vayatis; and "Statistical behavior and consistency of classification methods based on convex risk minimization" [ibid., 56-85] by T. Zhang. Includes rejoinders by the authors.

可用于代入估计的非参数估计量AI 解读

We consider nonparametric estimation of an object such as a probability density or a regression function. Can such an estimator achieve the ratewise minimax rate of convergence on suitable function spaces, while, at the same time, when "plugged-in," estimate efficiently (at a rate of~$n^{-1/2}$ with the best constant) many functionals of the object? For example, can we have a density estimator whose definite integrals are efficient estimators of the cumulative distribution…

摘要暂缺

一般隐马尔可夫模型极大似然估计量的渐近正态性AI 解读

Hidden Markov models (HMMs) have during the last decade become a widespread tool for modeling sequences of dependent random variables. Inference for such models is usually based on the maximum-likelihood estimator (MLE), and consistency of the MLE for general HMMs was recently proved by Leroux. In this paper we show that under mild conditions the MLE is also asymptotically normal and prove that the observed information matrix is a consistent estimator of the Fisher…

具有灵活协变量效应的半参数生存模型AI 解读

A semiparametric hazard model with parametrized time but general covariate dependency is formulated and analyzed inside the framework of counting process theory. A profile likelihood principle is introduced for estimation of the parameters: the resulting estimator is $n^{1/2}$-consistent, asymptotically normal and achieves the semiparametric efficiency bound. An estimation procedure for the nonparametric part is also given and its asymptotic properties are derived. We…

有限总体偏倚抽样下的非参数推断AI 解读

We consider a biased sampling model that has been found useful in incorporating size biases inherent in many types of discovery data. The model postulates that the data are obtained from a finite population by selecting successively without replacement and with probability proportional to some measure of size. Unlike the ppswor scheme in survey sampling, it is assumed here that the size measure is a function of the unknown population values. In this article, we consider…

已知边际分布时概率测度线性泛函的有效估计AI 解读

Suppose that $P$ is the distribution of a pair of random variables $(X, Y)$ on a product space $\mathbb{X} \times \mathbb{Y}$ with known marginal distributions $P_X$ and $P_Y$. We study efficient estimation of functions $\theta(h) = \int h dP$ for fixed $h: \mathbb{X} \times \mathbb{Y} \rightarrow R$ under iid sampling of $(X, Y)$ pairs from $P$ and a regularity condition on $P$. Our proposed estimator is based on partitions of both $\mathbb{X}$ and $\mathbb{Y}$ and the…

有偏抽样回归模型估计的大样本理论（一）AI 解读

Biased sampling regression models were introduced by Jewell, generalizing the truncated regression model studied by Bhattacharya, Chernoff and Yang. If the independent variable takes on only a finite number of values (as does the stratum variable), we show: 1. That if the slope of the underlying regression model is assumed known, then the nonparametric maximum likelihood estimates of the distribution of the independent and dependent variables (a) can be calculated from…

Let $l(\theta) = n^{-1} \log p(x, \theta)$ be the log likelihood of an $n$-dimensional $X$ under a $p$-dimensional $\theta$. Let $\hat{\theta}_j$ be the mle under $H_j: \theta^1 = \theta^1_0, \ldots, \theta^j = \theta^j_0$ and $\hat{\theta}_0$ be the unrestricted mle. Define $T_j$ as $\lbrack 2n\{l(\hat{\theta}_{j - 1}) - l(\hat{\theta}_j)\}\rbrack^{1/2} \operatorname{sgn}(\hat{\theta}^j_{j - 1} - \theta^j_0).$ Let $T = (T_1, \ldots, T_p)$. Then under regularity conditions,…

摘要暂缺

Bootstrap 的若干渐近理论AI 解读

Efron's "bootstrap" method of distribution approximation is shown to be asymptotically valid in a large number of situations, including $t$-statistics, the empirical and quantile processes, and von Mises functionals. Some counter-examples are also given, to show that the approximation does not always succeed.

重新审视数据变换分析AI 解读

Following Box and Cox (1964), we assume that a transform Z i = h(Yi , λ) of our original data {Yi } satisfies a linear model. Consistency properties of the Box-Cox estimates (MLE's) of λ and the parameters in the linear model, as well as the asymptotic variances of these estimates, are considered. We find that in some structured models such as transformed linear regression with small to moderate error variances, the asymptotic variances of the estimates of the parameters in…