论文检索

异时采样分子数据的高效溯祖模型AI 解读

Molecular sequence variation at a locus informs about the evolutionary history of the sample and past population size dynamics. The Kingman coalescent is used in a generative model of molecular sequence variation to infer evolutionary parameters. However, it is well understood that inference under this model does not scale well with sample size. Here, we build on recent work based on a lower resolution coalescent process, the Tajima coalescent, to model longitudinal samples.…

噪声下函数局部极值的半参数贝叶斯推断AI 解读

There is a wide range of applications where the local extrema of a function are the key quantity of interest. However, there is surprisingly little work on methods to infer local extrema with uncertainty quantification in the presence of noise. By viewing the function as an infinite-dimensional nuisance parameter, a semiparametric formulation of this problem poses daunting challenges, both methodologically and theoretically, as (i) the number of local extrema may be unknown,…

利用变分贝叶斯与拉普拉斯近似拟合潜在非高斯模型AI 解读

Latent Gaussian models (LGMs) are perhaps the most commonly used class of models in statistical applications. Nevertheless, in areas ranging from longitudinal studies in biostatistics to geostatistics, it is easy to find datasets that contain inherently non-Gaussian features, such as sudden jumps or spikes, that adversely affect the inferences and predictions made using an LGM. These datasets require more general latent non-Gaussian models (LnGMs) that can handle…

利用耦合界定 Wasserstein 距离AI 解读

Markov chain Monte Carlo (MCMC) provides asymptotically consistent estimates of intractable posterior expectations as the number of iterations tends to infinity. However, in large data applications, MCMC can be computationally expensive per iteration. This has catalyzed interest in approximating MCMC in a manner that improves computational speed per iteration but does not produce asymptotically consistent estimates. In this article, we propose estimators based on couplings…

贝叶斯样条隐马尔可夫模型及其活动与睡眠分析应用AI 解读

B-spline-based hidden Markov models employ B-splines to specify the emission distributions, offering a more flexible modelling approach to data than conventional parametric HMMs. We introduce a Bayesian framework for inference, enabling the simultaneous estimation of all unknown model parameters including the number of states. A parsimonious knot configuration of the B-splines is identified by the use of a trans-dimensional Markov chain sampling algorithm, while model…

非参数与高维模型中的贝叶斯可忽略性是一种信息性先验AI 解读

In problems with large amounts of missing data one must model two distinct data generating processes: the outcome process, which generates the response, and the missing data mechanism, which determines the data we observe. Under the ignorability condition of Rubin, however, likelihood-based inference for the outcome process does not depend on the missing data mechanism so that only the former needs to be estimated; partially because of this simplification, ignorability is…

超图数据的潜在空间建模AI 解读

The increasing prevalence of relational data describing interactions among a target population has motivated a wide literature on statistical network analysis.In many applications, interactions may involve more than two members of the population and this data is more appropriately represented by a hypergraph.In this article, we present a model for hypergraph data that extends the well-established latent space approach for graphs and, by drawing a connection to constructs…

基于 Rayleigh 商的稀疏典型相关分析极小极大准贝叶斯估计AI 解读

Canonical correlation analysis (CCA) is a popular statistical technique for exploring relationships between datasets. In recent years, the estimation of sparse canonical vectors has emerged as an important but challenging variant of the CCA problem, with widespread applications. Unfortunately, existing rate-optimal estimators for sparse canonical vectors have high computational cost. We propose a quasi-Bayesian estimation procedure that not only achieves the minimax…

面向可能不平衡二元及分类数据的高效 Pólya–Gamma 采样器AI 解读

Modeling binary and categorical data is one of the most commonly encountered tasks of applied statisticians and econometricians.While Bayesian methods in this context have been available for decades now, they often require a high level of familiarity with Bayesian statistics or suffer from issues such as low sampling efficiency.To contribute to the accessibility of Bayesian models for binary and categorical data, we introduce novel latent variable representations based on…

高维多变量二元响应的贝叶斯推断AI 解读

It has become increasingly common to collect high-dimensional binary response data; for example, with the emergence of new sampling techniques in ecology. In smaller dimensions, multivariate probit (MVP) models are routinely used for inferences. However, algorithms for fitting such models face issues in scaling up to high dimensions due to the intractability of the likelihood, involving an integral over a multivariate normal distribution having no analytic form. Although a…

状态空间模型的分块相关伪边际采样器AI 解读

Pseudo Marginal Metropolis-Hastings (PMMH) is a general approach to Bayesian inference when the likelihood is intractable, but can be estimated unbiasedly.Our article develops an efficient PMMH method that scales up better to higher dimensional state vectors than previous approaches.The improvement is achieved by the following innovations.First, a novel block version of PMMH that works with multiple particle filters is proposed.Second, the trimmed mean of the unbiased…

利用多国非参数分位数因子模型研究增长风险AI 解读

We develop a nonparametric quantile panel regression model.Within each quantile, the quantile function is a combination of linear and nonlinear parts, which we approximate using Bayesian Additive Regression Trees (BART).Cross-sectional information is captured through a conditionally heteroscedastic latent factor.The nonparametric feature enhances flexibility, while the panel feature increases the number of observations in the tails.We develop Bayesian methods for inference…

非共同结构断点AI 解读

We develop a new Bayesian approach to estimate noncommon structural breaks in panel regression models. Any subset of the cross-section may be hit at different times within a break window. Break-specific parameters are learned from the cross-section. They reflect whether (i) breaks hit many or few series and (ii) there is a long or short lag between the first and final series hit by a break. In an empirical application to international stock return predictability, the method…

连接频率学派与贝叶斯变点方法AI 解读

We show that the two-stage minimum description length (MDL) criterion widely used to estimate linear change-point (CP) models corresponds to the marginal likelihood of a Bayesian model with a specific class of prior distributions. This allows results from the frequentist and Bayesian paradigms to be bridged together. Thanks to this link, one can rely on the consistency of the number and locations of the estimated CPs and the computational efficiency of frequentist methods,…

稀疏趋势估计AI 解读

Abstract The low-frequency movements of economic variables play a prominent role in policy analysis and decision-making. We develop a robust estimation approach for these slow-moving trend processes which is guided by a judicious choice of priors and is characterized by sparsity. We present novel stylized facts from longer-run survey expectations that inform the structure of the estimation procedure. The general version of the proposed Bayesian estimator with a…

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.…

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)…

中心量族推断：针对一族分布中心的假设检验AI 解读

Summary Statistical hypotheses are translations of scientific hypotheses into statements about one or more distributions, often concerning their centre. Tests that assess statistical hypotheses of centre implicitly assume a specific centre, e.g., the mean or median. Yet, scientific hypotheses do not always specify a particular centre. This ambiguity leaves the possibility for a gap between scientific theory and statistical practice that can lead to rejection of a true null.…

支持全范围信息借用的非参数先验AI 解读

Summary Modelling of the dependence structure across heterogeneous data is crucial for Bayesian inference, since it directly impacts the borrowing of information. Despite extensive advances over the past two decades, most available methods only allow for nonnegative correlations. We derive a new class of dependent nonparametric priors that can induce correlations of any sign, thus introducing a new and more flexible idea of borrowing of information. This is achieved thanks…