论文检索

随机实验中处理效应的半参数估计AI 解读

Abstract We develop new semi-parametric methods for estimating treatment effects. We focus on settings where the outcome distributions may be thick tailed, where treatment effects may be small, where sample sizes are large, and where assignment is completely random. This setting is of particular interest in recent online experimentation. We propose using parametric models for the treatment effects, leading to semi-parametric models for the outcome distributions. We derive…

Bickel 等对《Varimax 经典因子分析实现统计推断》的讨论意见AI 解读

We compliment the authors for their unification of old and new latent variable models. Their motivation seems to have come from Thurstone’s Factor Analysis and the wish to explain the somewhat mysterious success of Kaiser’s Varimax rule in that context. However, their major applications and notation stem from overlapping network community detection and Latent Dirichlet Allocation (LDA) (Blei et al., 2003). Inference for these models can be unified in another way via a…

大型稀疏网络社区检测的伪似然方法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 解读

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…

利用自学习位图估计不同元素数量AI 解读

Counting the number of distinct elements (cardinality) in a dataset is a fundamental problem in database management. In recent years, there has been significant interest to address the distinct counting problem in a data stream setting, where each incoming data can be seen only once and cannot be stored for long periods of time. Many probabilistic approaches based on either sampling or sketching have been proposed in the computer science literature that only require limited…

高效独立成分分析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…