论文检索

自协方差矩阵的带状正则化：时间序列参数估计与预测AI 解读

Summary The paper addresses a ‘large p–small n’ problem in a time series framework and considers properties of banded regularization of an empirical autocovariance matrix of a time series process. Utilizing the banded autocovariance matrix enables us to fit a much longer auto-regressive AR(p) model to the observed data than typically suggested by the Akaike information criterion, while controlling how many parameters are to be estimated precisely and the level of accuracy.…

连续更新估计量的性质及其矩存在性问题的修正AI 解读

In this paper, we analyze properties of the Continuous Updating Estimator (CUE) proposed by Hansen et al. (1996), which has been suggested as a solution to the finite sample bias problems of the two-step GMM estimator. We show that the estimator should be expected to perform poorly in finite samples under weak identification, in particular, the estimator is not guaranteed to have finite moments of any order. We propose the Regularized CUE (RCUE) as a solution to this…

地统计学中的惩罚最大似然估计与变量选择AI 解读

We consider the problem of selecting covariates in spatial linear models with Gaussian process errors. Penalized maximum likelihood estimation (PMLE) that enables simultaneous variable selection and parameter estimation is developed and, for ease of computation, PMLE is approximated by one-step sparse estimation (OSE). To further improve computational efficiency, particularly with large sample sizes, we propose penalized maximum covariance-tapered likelihood estimation…

经验贝叶斯方法与贝叶斯敏感性分析的计算途径AI 解读

We consider situations in Bayesian analysis where we have a family of priors νh on the parameter θ, where h varies continuously over a space $\mathcal{H}$, and we deal with two related problems. The first involves sensitivity analysis and is stated as follows. Suppose we fix a function f of θ. How do we efficiently estimate the posterior expectation of f(θ) simultaneously for all h in $\mathcal{H}$? The second problem is how do we identify subsets of $\mathcal{H}$ which give…

采用广义g先验的完全贝叶斯因子AI 解读

For the normal linear model variable selection problem, we propose selection criteria based on a fully Bayes formulation with a generalization of Zellner’s g-prior which allows for p > n. A special case of the prior formulation is seen to yield tractable closed forms for marginal densities and Bayes factors which reveal new model evaluation characteristics of potential interest.

高维回归分析中的因子模型与变量选择AI 解读

The paper considers linear regression problems where the number of predictor variables is possibly larger than the sample size. The basic motivation of the study is to combine the points of view of model selection and functional regression by using a factor approach: it is assumed that the predictor vector can be decomposed into a sum of two uncorrelated random components reflecting common factors and specific variabilities of the explanatory variables. It is shown that the…

含噪低秩矩阵补全的核范数惩罚与最优收敛率AI 解读

This paper deals with the trace regression model where n entries or linear combinations of entries of an unknown m1 × m2 matrix A0 corrupted by noise are observed. We propose a new nuclear-norm penalized estimator of A0 and establish a general sharp oracle inequality for this estimator for arbitrary values of n, m1, m2 under the condition of isometry in expectation. Then this method is applied to the matrix completion problem. In this case, the estimator admits a simple…

函数型混合效应谱分析AI 解读

In many experiments, time series data can be collected from multiple units and multiple time series segments can be collected from the same unit. This article introduces a mixed effects Cramér spectral representation which can be used to model the effects of design covariates on the second-order power spectrum while accounting for potential correlations among the time series segments collected from the same unit. The transfer function is composed of a deterministic component…

未知分布加性噪声下的数据驱动密度估计AI 解读

Summary We study the model Y = X+ε. We assume that we have at our disposal independent identically distributed observations Y1,…,Yn and ε−1,…,ε−M. The (Xj)1 ⩽j ⩽n are independent identically distributed with density f, independent of the (εj)1 ⩽j ⩽n, independent identically distributed with density f. The aim of the paper is to estimate f without knowing f. We first define an estimator, for which we provide bounds for the integrated L2-risk. We consider ordinary smooth and…

多期预测中的变量选择、估计与推断AI 解读

This paper conducts a broad-based comparison of iterated and direct multi-period forecasting approaches applied to both univariate and multivariate models in the form of parsimonious factor-augmented vector autoregressions. To account for serial correlation in the residuals of the multi-period direct forecasting models we propose a new SURE-based estimation method and modified Akaike information criteria for model selection. Empirical analysis of the 170 variables studied by…

线性与二元回归中贝叶斯变量选择和模型平均的 Rao–Blackwell 化AI 解读

Choosing the subset of covariates to use in regression or generalized linear models is a ubiquitous problem. The Bayesian paradigm addresses the problem of model uncertainty by considering models corresponding to all possible subsets of the covariates, where the posterior distribution over models is used to select models or combine them via Bayesian model averaging (BMA). Although conceptually straightforward, BMA is often difficult to implement in practice, since either the…

非洲有多不同？对 Masanjala 与 Papageorgiou 的评论AI 解读

Masanjala and Papageorgiou (Rough and lonely road to prosperity: a reexamination of the sources of growth in Africa using Bayesian model averaging, Journal of Applied Econometrics 2008; 23(5): 671–682) use Bayesian model averaging to evaluate the existence of parameter heterogeneity between African and non-African countries in the framework of cross-country growth regressions. We show that their results are not robust to the use of a prior over the model space that respects…

组稀疏性下的预言不等式与最优统计推断AI 解读

We consider the problem of estimating a sparse linear regression vector β* under a Gaussian noise model, for the purpose of both prediction and model selection. We assume that prior knowledge is available on the sparsity pattern, namely the set of variables is partitioned into prescribed groups, only few of which are relevant in the estimation process. This group sparsity assumption suggests us to consider the Group Lasso method as a means to estimate β*. We establish oracle…

高维回归的稀疏拉普拉斯收缩估计量AI 解读

We propose a new penalized method for variable selection and estimation that explicitly incorporates the correlation patterns among predictors. This method is based on a combination of the minimax concave penalty and Laplacian quadratic associated with a graph as the penalty function. We call it the sparse Laplacian shrinkage (SLS) method. The SLS uses the minimax concave penalty for encouraging sparsity and Laplacian quadratic penalty for promoting smoothness among…

连续字典下的随机展开：Lévy 自适应回归核AI 解读

This article describes a new class of prior distributions for nonparametric function estimation. The unknown function is modeled as a limit of weighted sums of kernels or generator functions indexed by continuous parameters that control local and global features such as their translation, dilation, modulation and shape. Lévy random fields and their stochastic integrals are employed to induce prior distributions for the unknown functions or, equivalently, for the number of…

不同混合条件下平稳数据密度估计的最优模型选择AI 解读

We propose a block-resampling penalization method for marginal density estimation with nonnecessary independent observations. When the data are β or τ-mixing, the selected estimator satisfies oracle inequalities with leading constant asymptotically equal to 1. We also prove in this setting the slope heuristic, which is a data-driven method to optimize the leading constant in the penalty.

广义可加部分线性模型的估计与变量选择AI 解读

We study generalized additive partial linear models, proposing the use of polynomial spline smoothing for estimation of nonparametric functions, and deriving quasi-likelihood based estimators for the linear parameters. We establish asymptotic normality for the estimators of the parametric components. The procedure avoids solving large systems of equations as in kernel-based procedures and thus results in gains in computational simplicity. We further develop a class of…

共同价值二价拍卖结构模型的贝叶斯推断AI 解读

Structural econometric auction models with explicit game-theoretic modeling of bidding strategies have been quite a challenge from a methodological perspective, especially within the common value framework. We develop a Bayesian analysis of the hierarchical Gaussian common value model with stochastic entry introduced by Bajari and Hortaçsu. A key component of our approach is an accurate and easily interpretable analytical approximation of the equilibrium bid function,…

求解动态经济模型的数值稳定且准确的随机模拟方法AI 解读

We develop numerically stable and accurate stochastic simulation approaches for solving dynamic economic models. First, instead of standard least-squares approximation methods, we examine a variety of alternatives, including least-squares methods using singular value decomposition and Tikhonov regularization, least-absolute deviations methods, and principal component regression method, all of which are numerically stable and can handle ill-conditioned problems. Second,…

稀疏贝叶斯无限因子模型AI 解读

We focus on sparse modelling of high-dimensional covariance matrices using Bayesian latent factor models. We propose a multiplicative gamma process shrinkage prior on the factor loadings which allows introduction of infinitely many factors, with the loadings increasingly shrunk towards zero as the column index increases. We use our prior on a parameter-expanded loading matrix to avoid the order dependence typical in factor analysis models and develop an efficient Gibbs…

通过 Lasso 进行回归收缩与选择：回顾AI 解读

Summary In the paper I give a brief review of the basic idea and some history and then discuss some developments since the original paper on regression shrinkage and selection via the lasso.

用于超高维变量选择的惩罚复合准似然AI 解读

Summary In high dimensional model selection problems, penalized least square approaches have been extensively used. The paper addresses the question of both robustness and efficiency of penalized model selection methods and proposes a data-driven weighted linear combination of convex loss functions, together with weighted L1-penalty. It is completely data adaptive and does not require prior knowledge of the error distribution. The weighted L1-penalty is used both to ensure…

基于尖峰与厚尾先验的变量选择：上界化—最小化方法AI 解读

We develop a method to carry out MAP estimation for a class of Bayesian regression models in which coefficients are assigned with Gaussian-based spike and slab priors. The objective function in the corresponding optimization problem has a Lagrangian form in that regression coefficients are regularized by a mixture of squared l2 and l0 norms. A tight approximation to the l0 norm using majorization–minimization techniques is derived, and a coordinate descent algorithm in…

广义 lasso 的解路径AI 解读

We present a path algorithm for the generalized lasso problem. This problem penalizes the ℓ1 norm of a matrix D times the coefficient vector, and has a wide range of applications, dictated by the choice of D. Our algorithm is based on solving the dual of the generalized lasso, which greatly facilitates computation of the path. For D = I (the usual lasso), we draw a connection between our approach and the well-known LARS algorithm. For an arbitrary D, we derive an unbiased…