论文检索

稀疏图函数学习与广义 Kesten–Stigum 阈值AI 解读

The problem of learning graphons has attracted considerable attention across several scientific communities, with significant progress over the recent years in sparser regimes. Yet, the current techniques still require diverging degrees in order to succeed with efficient algorithms in the challenging cases where the local structure of the graph is homogeneous. This paper provides an efficient algorithm to learn graphons in the constant expected degree regime. The algorithm…

近似流形上的深度非参数回归：具有多项式前因子的非渐近误差界AI 解读

We study the properties of nonparametric least squares regression using deep neural networks. We derive nonasymptotic upper bounds for the excess risk of the empirical risk minimizer of feedforward deep neural regression. Our error bounds achieve minimax optimal rate and improve over the existing ones in the sense that they depend polynomially on the dimension of the predictor, instead of exponentially on dimension. We show that the neural regression estimator can circumvent…

利用匹配数据或纵向网络数据估计溢出效应AI 解读

Social interactions often play a key role in determining the impact of policies, but measuring the magnitude of spillover effects empirically is notoriously challenging because, in most applications, a person’s relationships are likely to reflect her own characteristics (homophily), and people who are connected are likely to be affected by the same shocks (common factors). In addition, a significant share of social interactions is likely to occur through variables that are…

同伴群体随机分配的检验AI 解读

Summary Identification of peer effects is complicated by the fact that the individuals under study may select their peers. Random assignment to peer groups has proven useful to sidestep such a concern. In the absence of a formal randomization mechanism, it needs to be argued that assignment is “as good as” random. This paper introduces a simple yet powerful test to do so. We provide theoretical results for this test. As a by‐product, we equally obtain such results for an…

双重差分推断：独立聚类假设有多可信？AI 解读

Summary We analyze the challenges for inference in difference‐in‐differences (DID) when there is spatial correlation. We present novel theoretical insights and empirical evidence on the settings in which ignoring spatial correlation should lead to more or less distortions in DID applications. We show that details, such as the time frame used in the estimation, the choice of the treated and control groups, and the choice of the estimator, are key determinants of distortions…

最低工资的就业效应：基于选择比率的处理效应测量AI 解读

Summary I develop a method for measuring a binary treatment's effects when more than one control group is available but each control group is imperfect. To study effects of the minimum wage, for example, I compare border counties where the minimum wage increases to the set of neighboring counties, the set of neighbor‐of‐neighboring counties, and so forth. The key innovation is to model the ratio of the biases present in these comparisons. Crucially, the model contains a…

重印：方差分解的网络拓扑与金融企业关联度测量AI 解读

We propose several connectedness measures built from pieces of variance decompositions, and we argue that they provide natural and insightful measures of connectedness. We also show that variance decompositions define weighted, directed networks, so that our connectedness measures are intimately related to key measures of connectedness used in the network literature. Building on these insights, we track daily time-varying connectedness of major U.S. financial institutions’…

因子结构误差下网络溢出效应的收缩估计AI 解读

This paper explores the estimation of a panel data model with cross-sectional interaction that is flexible both in its approach to specifying the network of connections between cross-sectional units, and in controlling for unobserved heterogeneity. It is assumed that there are different sources of information available on a network, which can be represented in the form of multiple weights matrices. These matrices may reflect observed links, different measures of…

用于神经网络贝叶斯学习与 MCMC 的迹类高斯先验AI 解读

Abstract This paper introduces a new neural network based prior for real valued functions. Each weight and bias of the neural network has an independent Gaussian prior, with the key novelty that the variances decrease in the width of the network in such a way that the resulting function is well defined in the limit of an infinite width network. We show that the induced posterior over functions is amenable to Monte Carlo sampling using Hilbert space Markov chain Monte Carlo…

复杂网络中的信息核心识别AI 解读

Abstract In a complex network, the core component with interesting structures is usually hidden within noninformative connections. The noises and bias introduced by the noninformative component can obscure the salient structure and limit many network modeling procedures’ effectiveness. This paper introduces a novel core–periphery model for the noninformative periphery structure of networks without imposing a specific form of the core. We propose spectral algorithms for core…

最小假设下稀疏图子的子抽样AI 解读

Summary We study the properties of two subsampling procedures for networks, vertex subsampling and $p$-subsampling, under the sparse graphon model. The consistency of network subsampling is demonstrated under the minimal assumptions of weak convergence of the corresponding network statistics and an expected subsample size growing to infinity more slowly than the number of vertices in the network. Furthermore, under appropriate sparsity conditions, we derive limiting…

可交换关系数组的回归AI 解读

Summary Relational arrays represent measures of association between pairs of actors, often in varied contexts or over time. Trade flows between countries, financial transactions between individuals, contact frequencies between school children in classrooms and dynamic protein-protein interactions are all examples of relational arrays. Elements of a relational array are often modelled as a linear function of observable covariates. Uncertainty estimates for regression…

异方差空间模型中的连续更新间接推断AI 解读

Spatial units typically vary over many of their characteristics, introducing potential unobserved heterogeneity which invalidates commonly used homoskedasticity conditions. In the presence of unobserved heteroskedasticity, methods based on the quasi-likelihood function generally produce inconsistent estimates of both the spatial parameter and the coefficients of the exogenous regressors. A robust generalized method of moments estimator as well as a modified likelihood method…

网络形成模型的近似变分估计AI 解读

Abstract We develop approximate estimation methods for exponential random graph models (ERGMs), whose likelihood is proportional to an intractable normalizing constant. The usual approach approximates this constant with Monte Carlo simulations; however, convergence may be exponentially slow. We propose a deterministic method, based on a variational mean-field approximation of the ERGM's normalizing constant. We compute lower and upper bounds for the approximation error for…

利用函数型预测变量的贝叶斯空间变系数模型预测作物产量AI 解读

Reliable prediction for crop yield is crucial for economic planning, food security monitoring, and agricultural risk management. This study aims to develop a crop yield forecasting model at large spatial scales using meteorological variables closely related to crop growth. The influence of climate patterns on agricultural productivity can be spatially inhomogeneous due to local soil and environmental conditions. We propose a Bayesian spatially varying functional model…

通过推断潜在位置估计同质性社会网络中的因果同伴影响AI 解读

Social influence cannot be identified from purely observational data on social networks, because such influence is generically confounded with latent homophily, that is, with a node’s network partners being informative about the node’s attributes and therefore its behavior. If the network grows according to either a latent community (stochastic block) model, or a continuous latent space model, then latent homophilous attributes can be consistently estimated from the global…

适用于空间依赖数据的随机森林AI 解读

Spatial linear mixed-models, consisting of a linear covariate effect and a Gaussian process (GP) distributed spatial random effect, are widely used for analyses of geospatial data. We consider the setting where the covariate effect is nonlinear. Random forests (RF) are popular for estimating nonlinear functions but applications of RF for spatial data have often ignored the spatial correlation. We show that this impacts the performance of RF adversely. We propose RF-GLS, a…

随机点积图潜在位置的高效一步估计AI 解读

We propose a one-step procedure to estimate the latent positions in random dot product graphs efficiently. Unlike the classical spectral-based methods, the proposed one-step procedure takes advantage of both the low-rank structure of the expected adjacency matrix and the Bernoulli likelihood information of the sampling model simultaneously. We show that for each vertex, the corresponding row of the one-step estimator (OSE) converges to a multivariate normal distribution…

相关张量分解及其在空间影像数据中的应用AI 解读

Multi-dimensional tensor data have gained increasing attention in the recent years, especially in biomedical imaging analyses. However, the most existing tensor models are only based on the mean information of imaging pixels. Motivated by multimodal optical imaging data in a breast cancer study, we develop a new tensor learning approach to use pixel-wise correlation information, which is represented through the higher order correlation tensor. We proposed a novel…

动态交互半参数函数对标量回归模型AI 解读

Motivated by recent work studying massive functional data, such as the COVID-19 data, we propose a new dynamic interaction semiparametric function-on-scalar (DISeF) model. The proposed model is useful to explore the dynamic interaction among a set of covariates and their effects on the functional response. The proposed model includes many important models investigated recently as special cases. By tensor product B-spline approximating the unknown bivariate coefficient…

条件函数型图模型AI 解读

Graphical modeling of multivariate functional data is becoming increasingly important in a wide variety of applications. The changes of graph structure can often be attributed to external variables, such as the diagnosis status or time, the latter of which gives rise to the problem of dynamic graphical modeling. Most existing methods focus on estimating the graph by aggregating samples, but largely ignore the subject-level heterogeneity due to the external variables. In this…

在保持错误发现率控制的同时筛选拒绝集合AI 解读

Scientific hypotheses in a variety of applications have domain-specific structures, such as the tree structure of the international classification of diseases (ICD), the directed acyclic graph structure of the gene ontology (GO), or the spatial structure in genome-wide association studies. In the context of multiple testing, the resulting relationships among hypotheses can create redundancies among rejections that hinder interpretability. This leads to the practice of…

稀疏性诱导的弱因子模型估计AI 解读

This article investigates estimation of sparsity-induced weak factor (sWF) models, with large cross-sectional and time-series dimensions (N and T, respectively). It assumes that the kth largest eigenvalue of a data covariance matrix grows proportionally to Nαk with unknown exponents 0<αk≤1 for k=1,…,r. Employing the same rotation of the principal components (PC) estimator, the growth rate αk is linked to the degree of sparsity of kth factor loadings. This is much weaker than…

网络演化的时间序列方法：预测与估计AI 解读

The article analyzes nonnegative multivariate time series which we interpret as weighted networks. We introduce a model where each coordinate of the time series represents a given edge across time. The number of time periods is treated as large compared to the size of the network. The model specifies the temporal evolution of a weighted network that combines classical autoregression with nonnegativity, a positive probability of vanishing, and peer effect interactions between…