论文检索

动态张量的 CP 因子模型AI 解读

Abstract Observations in various applications are frequently represented as a time series of multidimensional arrays, called tensor time series, preserving the inherent multidimensional structure. In this paper, we present a factor model approach, in a form similar to tensor CANDECOMP/PARAFAC (CP) decomposition, to the analysis of high-dimensional dynamic tensor time series. As the loading vectors are uniquely defined but not necessarily orthogonal, it is significantly…

处理依赖性右删失的近端生存分析AI 解读

Abstract Many epidemiological and clinical studies aim to analyse a time-to-event endpoint. A common complication is right censoring. In some cases, right censoring occurs when subjects are still surviving after the study terminates or move out of the study area. In such cases, right censoring is typically treated as independent or noninformative. This assumption can be further relaxed to conditional independent censoring by leveraging possibly time-varying covariate…

分组数据部分线性模型中提高估计精度的夹心提升法AI 解读

Abstract We study partially linear models in settings where observations are arranged in independent groups but may exhibit within-group dependence. Existing approaches estimate linear model parameters through weighted least squares, with optimal weights (given by the inverse covariance of the response, conditional on the covariates) typically estimated by maximizing a (restricted) likelihood from random effects modelling or by using generalized estimating equations. We…

未观测混杂下处理效应的模型辅助敏感性分析：正则化校准估计AI 解读

Abstract Consider sensitivity analysis for estimating average treatment effects under unmeasured confounding, assumed to satisfy a marginal sensitivity model. At the population level, we provide new representations for the sharp population bounds and doubly robust estimating functions. We also derive new, relaxed population bounds, depending on weighted linear outcome quantile regression. At the sample level, we develop new methods and theory for obtaining not only doubly…

基于测度运输的方向数据非参数方法AI 解读

Abstract This article proposes various nonparametric tools based on measure transportation for directional data. We use optimal transports to define new notions of distribution and quantile functions on the hypersphere, with meaningful quantile contours and regions and closed-form formulas under the classical assumption of rotational symmetry. The empirical versions of our distribution functions enjoy the expected Glivenko–Cantelli property of traditional distribution…

Green 匹配：复杂动力系统参数估计的高效方法AI 解读

Abstract Parameters of differential equations are essential to characterize intrinsic behaviours of dynamic systems. Numerous methods for estimating parameters in dynamic systems are computationally and/or statistically inadequate, especially for complex systems with general-order differential operators, such as motion dynamics. This article presents Green’s matching, a computationally tractable and statistically efficient two-step method, which only needs to approximate…

匹配设计中的协变量自适应随机化推断AI 解读

Abstract It is common to conduct causal inference in matched observational studies by proceeding as though treatment assignments within matched sets are assigned uniformly at random and using this distribution as the basis for inference. This approach ignores observed discrepancies in matched sets that may be consequential for the distribution of treatment, which are succinctly captured by within-set differences in the propensity score. We address this problem via…

高斯图模型的极小极大检测边界与精确最优检验AI 解读

Abstract In this article, we derive the minimax detection boundary for testing a sub-block of variables in a precision matrix under the Gaussian distribution. Compared to the results on the minimum rate of signals for testing precision matrices in literature, our result gives the exact minimum signal strength in a precision matrix that can be detected. We propose a thresholding test that is able to achieve the minimax detection boundary under certain cases by adaptively…

广播式非参数张量回归AI 解读

Abstract We propose a novel use of a broadcasting operation, which distributes univariate functions to all entries of the tensor covariate, to model the nonlinearity in tensor regression nonparametrically. A penalized estimation and the corresponding algorithm are proposed. Our theoretical investigation, which allows the dimensions of the tensor covariate to diverge, indicates that the proposed estimation yields a desirable convergence rate. We also provide a minimax lower…

多元极值统计推断的几何方法AI 解读

Abstract A geometric representation for multivariate extremes, based on the shapes of scaled sample clouds in light-tailed margins and their so-called limit sets, has recently been shown to connect several existing extremal dependence concepts. However, these results are purely probabilistic, and the geometric approach itself has not been fully exploited for statistical inference. We outline a method for parametric estimation of the limit set shape, which includes a useful…

安全检验AI 解读

Abstract We develop the theory of hypothesis testing based on the e-value, a notion of evidence that, unlike the p-value, allows for effortlessly combining results from several studies in the common scenario where the decision to perform a new study may depend on previous outcomes. Tests based on e-values are safe, i.e. they preserve type-I error guarantees, under such optional continuation. We define growth rate optimality (GRO) as an analogue of power in an optional…

对《网络潜在增长过程的根节点与社群推断》的致谢动议附议及讨论AI 解读

Patrick Rubin-Delanchy; Seconder of the vote of thanks to Crane and Xu and contribution to the Discussion of `Root and community inference on the latent gr

Feng 与 Sun 对“网络潜在增长过程的根与社群推断”的讨论AI 解读

We congratulate Drs. Crane and Xu for their fascinating piece of work. In the multiple roots PAPER model, one assumption is that different trees share the same affine preferential attachment (APA) growth parameters (α,β)⁠. In practice, the multiple trees in a network may have varying growth mechanisms, and it may be of interest to model each tree to have its own growth parameters. We consider such a heterogeneous affine preferential attachment (HAPA) model. Definition 1…

摘要暂缺

范旺、余怡与里纳尔多对网络潜在生长过程根与社区推断的讨论AI 解读

We congratulate Prof. Crane and Dr Xu for introducing a very interesting and appealing statistical model for Markovian network growth. The PAPER model enjoys several qualities. In particular, (i) it strikes a rare balance between analytic elegance and tractability, and expressive power; (ii) it allows for practicable algorithms for statistical inference that scale to networks of very large size, and (iii) it is very flexible and can be readily generalized to model a variety…

Andrej Srakar 对《网络潜在增长过程的根节点与社区推断》的讨论评论AI 解读

Paper presented by Harry Crane and Min Xu develops a rather novel area of network archaeology, which builds on findings of network science, probability theory and (in Crane and Xu's article) Bayesian statistics. My comments are directed to possible extensions for future work in this promising area of research. Firstly, in terms of network stochastic processes (authors use a combination of preferential attachment and Erdős–Rényi models) paper does little to explain…

Catalano等对《网络潜在生长过程的根与社群推断》的讨论AI 解读

We congratulate the authors for their methodological and theoretical contribution to the statistical literature on networks. A natural extension of the proposed PAPER model is included, with K communities growing simultaneously and where new nodes are either assigned to an existing community or elected as a new root. The employed assignment rule is of Pólya-urn type, which leads to a logarithmic growth of the number of communities (Korwar & Hollander, 1973) and is known to…

对 Crane 与 Xu《网络潜在生长过程的根与社区推断》的致谢与讨论AI 解读

We commend the authors on an illuminating article which significantly extends the state of the art in network archaeology. Notably, whereas most other literature in the area has provided methods for root inference which are theoretically grounded only in the case of random trees, the techniques in this paper have been designed to model nontree-structured networks, as well. This has important practical implications, as many real-world networks contain one or more cycles. The…

杨青与童昕对“网络潜在增长过程的根节点与社区推断”的讨论AI 解读

First, we congratulate Dr. Crane and Dr. Xu for this important contribution to statistical network analysis. To address an overlooked fact that most real networks are formed through a growth process, the authors introduce a useful PAPER model and its variations and skilfully construct computationally feasible confidence sets for the root node(s). In the data analysis, the authors also use their models as a new approach to community detection. On this note, our interest lies…

Wyse 等对《网络潜在增长过程的根节点与社区推断》的讨论AI 解读

We congratulate the authors on a thought provoking paper introducing innovative ideas for the statistical modelling of networks. The emphasis on identifying highly probable root nodes is both original and intriguing. In particular, using the root node credible set methods for node clustering within the PAPER(α,β,α0,θ) random K model (Section 6.3) is an interesting perspective. We wonder how these approaches might connect with latent space model-based node clustering methods…

江一聪与柯征对《网络潜在增长过程的根节点与社群推断》的讨论AI 解读

We congratulate the authors on an excellent paper! Crane and Xu (2021) proposed novel methods for finding ‘root nodes’ from a single snapshot of a dynamic network process, with several interesting real-data examples. We now consider a new application for finding ‘root papers’ in a citation network. The MADStat dataset (Ji et al., 2022; Ke et al., 2023) consists of the bibtex and citation information of over 83 K papers, which we use to construct paper citation networks.…

Sayan Banerjee 对《网络潜在生长过程的根与社区推断》的讨论AI 解读

I congratulate the authors on their elegant and computationally tractable approach to inference problems in network archaeology. This is one of the few papers which rigorously analyses inference for noisy temporal networks. The key idea is to compute the distribution of the possible arrival orders of vertices given an unlabelled network realization (online detection) and construct the confidence set for the root by sorting vertices according to their probability of arriving…

Tianxi Li 对《网络潜在生长过程的根节点与社群推断》的讨论AI 解读

I want to congratulate Prof. Crane and Prof. Xu for their impressive work. The paper introduces two novel components: the PAPER model and the inference framework for the tree. Both of them bring many insights into handling complex network data and open the doors to new problems. I will discuss extension problems from both aspects. The PAPER model assumes preferential attachment trees with additional the Erdős-Rényi (ER) edges. One nice property of the model lies in its…

Ascolani、Lijoi 与 Prünster 对《网络潜在生长过程的根与社群推断》的讨论AI 解读

We congratulate the authors for their timely and insightful contribution, which introduces a novel Bayesian approach to inferring the latent structure (early history and community detection) given a current observation of a network with n nodes. The Bayesian component of the model is summarized through a uniform prior on the random relabelling associated to the observed network. The methodological innovation is remarkably complemented by strong theoretical (frequentist)…