论文检索

高维矩阵因子模型的投影估计AI 解读

In this study, we propose a projection estimation method for large-dimensional matrix factor models with cross-sectionally spiked eigenvalues. By projecting the observation matrix onto the row or column factor space, we simplify factor analysis for matrix series to that of a lower-dimensional tensor. This method also reduces the magnitudes of the idiosyncratic error components, thereby increasing the signal-to-noise ratio, because the projection matrix linearly filters the…

多资产因子模型：强因子、弱因子与两步估计AI 解读

This paper re-examines the problem of estimating risk premia in unconditional linear factor pricing models. Typically, the data used in the empirical literature are characterized by weakness of some pricing factors, strong cross-sectional dependence in the errors, and (moderately) high cross-sectional dimensionality. Using an asymptotic framework where the number of assets/portfolios grows with the time span of the data while the risk exposures of weak factors are…

高维广义因子模型的极大似然估计与推断：因子扩展回归应用AI 解读

This paper reestablishes the main results in Bai (2003) and Bai and Ng (2006) for generalized factor models, with slightly stronger conditions on the relative magnitude of N (number of subjects) and T (number of time periods). Convergence rates of the estimated factor space and loading space and asymptotic normality of the estimated factors and loadings are established under mild conditions that allow for linear, Logit, Probit, Tobit, Poisson and some other single-index…

基于成对比较的最优完整排序AI 解读

We consider the problem of ranking n players from partial pairwise comparison data under the Bradley–Terry–Luce model. For the first time in the literature, the minimax rate of this ranking problem is derived with respect to the Kendall’s tau distance that measures the difference between two rank vectors by counting the number of inversions. The minimax rate of ranking exhibits a transition between an exponential rate and a polynomial rate depending on the magnitude of the…

具有对称不变性的高斯模型空间中的模型选择AI 解读

We consider multivariate centered Gaussian models for the random variable Z=(Z1,…,Zp), invariant under the action of a subgroup of the group of permutations on {1,…,p}. Using the representation theory of the symmetric group on the field of reals, we derive the distribution of the maximum likelihood estimate of the covariance parameter Σ and also the analytic expression of the normalizing constant of the Diaconis–Ylvisaker conjugate prior for the precision parameter K=Σ−1. We…

基于计数数据的 Hawkes 过程谱估计AI 解读

This paper presents a parametric estimation method for ill-observed linear stationary Hawkes processes. When the exact locations of points are not observed, but only counts over time intervals of fixed size, methods based on the likelihood are not feasible. We show that spectral estimation based on Whittle’s method is adapted to this case and provides consistent and asymptotically normal estimators, provided a mild moment condition on the reproduction function. Simulated…

稀疏纵向观测的内蕴黎曼函数型数据分析AI 解读

A new framework is developed to intrinsically analyze sparsely observed Riemannian functional data. It features four innovative components: a frame-independent covariance function, a smooth vector bundle termed covariance vector bundle, a parallel transport and a smooth bundle metric on the covariance vector bundle. The introduced intrinsic covariance function links estimation of covariance structure to smoothing problems that involve raw covariance observations derived from…

形状约束下密度水平集估计的数据自适应方法AI 解读

Given a random sample of points from some unknown density, we propose a method for estimating density level sets, for a positive threshold t, under the r-convexity assumption. This shape condition generalizes the convexity property and allows to consider level sets with more than one connected component. The main problem in practice is that r is an unknown geometric characteristic of the set related to its curvature, which may depend on t. A stochastic algorithm is proposed…

Wasserstein 距离下光滑密度的极小极大估计AI 解读

We study nonparametric density estimation problems where error is measured in the Wasserstein distance, a metric on probability distributions popular in many areas of statistics and machine learning. We give the first minimax-optimal rates for this problem for general Wasserstein distances for two classes of densities: smooth probability densities on [0,1]d bounded away from 0, and sub-Gaussian densities lying in the Hölder class Cs, s∈(0,1). Unlike classical nonparametric…

多元最大稳定分布贝叶斯推断的一致性AI 解读

Predicting extreme events is important in many applications in risk analysis. Extreme-value theory suggests modelling extremes by max-stable distributions. The Bayesian approach provides a natural framework for statistical prediction. Although various Bayesian inferential procedures have been proposed in the literature of univariate extremes and some for multivariate extremes, the study of their asymptotic properties has been left largely untouched. In this paper we focus on…

密度水平集经验估计量的立方根弱收敛AI 解读

Given n independent random vectors with common density f on Rd, we study the weak convergence of three empirical-measure based estimators of the convex λ-level set Lλ of f, namely the excess mass set, the minimum volume set and the maximum probability set, all selected from a class of convex sets A that contains Lλ. Since these set-valued estimators approach Lλ, even the formulation of their weak convergence is nonstandard. We identify the joint limiting distribution of the…

重新审视岭回归：去偏、阈值化与自助法AI 解读

The success of the Lasso in the era of high-dimensional data can be attributed to its conducting an implicit model selection, that is, zeroing out regression coefficients that are not significant. By contrast, classical ridge regression cannot reveal a potential sparsity of parameters, and may also introduce a large bias under the high-dimensional setting. Nevertheless, recent work on the Lasso involves debiasing and thresholding, the latter in order to further enhance the…

部分线性Cox模型的深度学习方法AI 解读

While deep learning approaches to survival data have demonstrated empirical success in applications, most of these methods are difficult to interpret and mathematical understanding of them is lacking. This paper studies the partially linear Cox model, where the nonlinear component of the model is implemented using a deep neural network. The proposed approach is flexible and able to circumvent the curse of dimensionality, yet it facilitates interpretability of the effects of…

ARFIMA 过程的一致阶数选择AI 解读

Estimating the orders of the autoregressive fractionally integrated moving average (ARFIMA) model has been a long-standing problem in time series analysis. This paper tackles this challenge by establishing the consistency of the Bayesian information criterion (BIC) for ARFIMA models with independent errors. Since the memory parameter of the model can be any real number, this consistency result is valid for short memory, long memory and nonstationary time series. This paper…

低次多项式估计的计算障碍AI 解读

One fundamental goal of high-dimensional statistics is to detect or recover planted structure (such as a low-rank matrix) hidden in noisy data. A growing body of work studies low-degree polynomials as a restricted model of computation for such problems: it has been demonstrated in various settings that low-degree polynomials of the data can match the statistical performance of the best known polynomial-time algorithms. Prior work has studied the power of low-degree…

前 k 名排序的部分恢复：极大似然最优性与谱方法的次优性AI 解读

Given partially observed pairwise comparison data generated by the Bradley–Terry–Luce (BTL) model, we study the problem of top-k ranking. That is, to optimally identify the set of top-k players. We derive the minimax rate with respect to a normalized Hamming loss. This provides the first result in the literature that characterizes the partial recovery error in terms of the proportion of mistakes for top-k ranking. We also derive the optimal signal to noise ratio condition…

局部弗雷歇回归的一致收敛及其在极值定位与时间配准中的应用AI 解读

Local Fréchet regression is a nonparametric regression method for metric space valued responses and Euclidean predictors, which can be utilized to obtain estimates of smooth trajectories taking values in general metric spaces from noisy metric space valued random objects. We derive uniform rates of convergence, which so far have eluded theoretical analysis of this method, for both fixed and random target trajectories, where we utilize tools from empirical processes. These…

Variance estimation is important for statistical inference. It becomes nontrivial when observations are masked by serial dependence structures and time-varying mean structures. Existing methods either ignore or sub-optimally handle these nuisance structures. This paper develops a general framework for the estimation of the long-run variance for time series with nonconstant means. The building blocks are difference statistics. The proposed class of estimators is general…

双重去偏 lasso：隐藏混杂下的高维推断AI 解读

Inferring causal relationships or related associations from observational data can be invalidated by the existence of hidden confounding. We focus on a high-dimensional linear regression setting, where the measured covariates are affected by hidden confounding and propose the doubly debiased lasso estimator for individual components of the regression coefficient vector. Our advocated method simultaneously corrects both the bias due to estimation of high-dimensional…

能否利用 Twitter 测度通胀预期？AI 解读

Drawing on Italian tweets, we employ textual data and machine learning techniques to build new real-time measures of consumers’ inflation expectations. First, we select keywords to identify tweets related to prices and expectations thereof. Second, we build a set of daily measures of inflation expectations around the selected tweets, combining the Latent Dirichlet Allocation (LDA) with a dictionary-based approach, using manually labeled bi-grams and tri-grams. Finally, we…

利用成本数据识别和估计差异化产品模型：无需工具变量的方法AI 解读

We propose a new methodology for identifying and estimating demand in differentiated products models when demand and cost data are available. The method deals with the endogeneity of prices to demand shocks and the endogeneity of outputs to cost shocks by using cost data rather than instruments. Further, we allow for unobserved market size. Using Monte Carlo experiments, we show that our method works well in contexts where commonly used instruments are invalid. We also apply…

预测分布的无限马尔可夫汇合AI 解读

This paper introduces novel approaches to forecast pooling methods based on a nonparametric prior for a weight vector combining predictive densities. The first approach places a Dirichlet process prior on the weight vector and generalizes the static linear pool. The second approach uses a hierarchical Dirichlet process prior to allow the weight vector to follow an infinite hidden Markov chain. This generalizes dynamic prediction pools to the nonparametric setting. Efficient…

SONIC：结合影响者与社群的社交网络分析AI 解读

The integration of social media characteristics into an econometric framework requires modeling a high dimensional dynamic network with dimensions of parameter typically much larger than the number of observations. To cope with this problem, we introduce SONIC, a new high-dimensional network model that assumes that (1) only few influencers drive the network dynamics; (2) the community structure of the network is characterized by homogeneity of response to specific…

经济增长建模的综合面板数据方法AI 解读

Empirical growth analysis is plagued with three problems – variable selection, parameter heterogeneity and cross-sectional dependence – which are addressed independently from each other in most studies. This study is to propose an integrated framework that allows for parameter heterogeneity and cross-sectional error dependence, while simultaneously performing variable selection. We derive the asymptotic properties of the estimator, and apply the framework to a dataset of 89…