论文检索

最小角回归AI 解读

The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to select a parsimonious set for the efficient prediction of a response variable. Least Angle Regression (LARS), a new model selection algorithm, is a useful and less greedy version…

利用渐近枢轴估计函数推断无限维参数AI 解读

Suppose that a consistent estimator for an infinite‐dimensional parameter can be readily obtained via a set of estimating functions which has a ‘good’ local linear approximation around the true value of the parameter. However, it may be difficult to estimate the variance function of this estimator well. We show that, if the set of estimating functions evaluated at the true parameter value is ‘asymptotically pivotal’, then the ‘fiducial’ distribution of the parameter can be…

提升核密度估计：一种偏差缩减技术？AI 解读

This paper proposes an algorithm for boosting kernel density estimates. We show that boosting is closely linked to a previously proposed method of bias reduction and indicate how it should enjoy similar properties. Numerical examples and simulations are used to illustrate the findings, and we also suggest further areas of research.

径向基函数网络的贝叶斯信息准则与平滑参数选择AI 解读

By extending Schwarz's (1978) basic idea we derive a Bayesian information criterion which enables us to evaluate models estimated by the maximum penalised likelihood method or the method of regularisation. The proposed criterion is applied to the choice of smoothing parameters and the number of basis functions in radial basis function network models. Monte Carlo experiments were conducted to examine the performance of the nonlinear modelling strategy of estimating the weight…

依赖随机测度的 ANOVA 模型AI 解读

We consider dependent nonparametric models for related random probability distributions. For example, the random distributions might be indexed by a categorical covariate indicating the treatment levels in a clinical trial and might represent random effects distributions under the respective treatment combinations. We propose a model that describes dependence across random distributions in an analysis of variance (ANOVA)-type fashion. We define a probability model in such a…

用半参数惩罚样条估计公司债利率期限结构AI 解读

This article provides a new methodology for estimating the term structure of corporate debt using a semiparametric penalized spline model. The method is applied to a case study of AT&T bonds. Typically, very few data are available on individual corporate bond prices, too little to find a nonparametric estimate of term structure from these bonds alone. This problem is solved by “borrowing strength” from Treasury bond data. More specifically, we combine a nonparametric model…

辍学者会因辍学受损吗？广义选择模型中的结果增益估计与预测AI 解读

Abstract In this paper we describe methods for predicting distributions of outcome gains in the framework of a latent variable selection model. We describe such procedures for Student‐ t selection models and a finite mixture of Gaussian selection models. Importantly, our algorithms for fitting these models are simple to implement in practice, and also permit learning to take place about the non‐identified cross‐regime correlation parameter. Using data from High School and…

单一方差分量线性混合模型中的似然比检验AI 解读

Summary We consider the problem of testing null hypotheses that include restrictions on the variance component in a linear mixed model with one variance component and we derive the finite sample and asymptotic distribution of the likelihood ratio test and the restricted likelihood ratio test. The spectral representations of the likelihood ratio test and the restricted likelihood ratio test statistics are used as the basis of efficient simulation algorithms of their null…

惩罚三角网模型：二维平滑的全变差正则化AI 解读

Summary Hansen, Kooperberg and Sardy introduced a family of continuous, piecewise linear functions defined over adaptively selected triangulations of the plane as a general approach to statistical modelling of bivariate densities and regression and hazard functions. These triograms enjoy a natural affine equivariance that offers distinct advantages over competing tensor product methods that are more commonly used in statistical applications. Triograms employ basis functions…

关于提升方法论文的讨论及作者回应AI 解读

Discussions of: "Process consistency for AdaBoost" [Ann. Statist. 32 (2004), no. 1, 13-29] by W. Jiang; "On the Bayes-risk consistency of regularized boosting methods" [ibid., 30-55] by G. Lugosi and N. Vayatis; and "Statistical behavior and consistency of classification methods based on convex risk minimization" [ibid., 56-85] by T. Zhang. Includes rejoinders by the authors.

正则化提升方法的贝叶斯风险一致性AI 解读

The probability of error of classification methods based on convex combinations of simple base classifiers by "boosting" algorithms is investigated. The main result of the paper is that certain regularized boosting algorithms provide Bayes-risk consistent classifiers under the sole assumption that the Bayes classifier may be approximated by a convex combination of the base classifiers. Nonasymptotic distribution-free bounds are also developed which offer interesting new…

AdaBoost 的过程相合性AI 解读

Recent experiments and theoretical studies show that AdaBoost can overfit in the limit of large time. If running the algorithm forever is suboptimal, a natural question is how low can the prediction error be during the process of AdaBoost? We show under general regularity conditions that during the process of AdaBoost a consistent prediction is generated, which has the prediction error approximating the optimal Bayes error as the sample size increases. This result suggests…

三篇关于提升法的论文：导言AI 解读

The notion of boosting originated in the Machine Learning literature in the 1980's [VALIANT, L.G. (1984). A theory of the learnable. In Proc. 16th Annual ACM Symposium on Theory of Computing 436-445. ACM Press, New York]. The goal of boosting is to improve the generalization performance of weak (or base) learning algorithms by combining them in a certain way. The first algorithm of this type was discovered by Schapire [SCHAPIRE, R.E. (1990). The strength of weak…

Boosting 集成的总体理论AI 解读

Tree ensembles are looked at in distribution space, that is, the limit case of "infinite" sample size. It is shown that the simplest kind of trees is complete in D-dimensional $L_2(P)$ space if the number of terminal nodes T is greater than D. For such trees we show that the AdaBoost algorithm gives an ensemble converging to the Bayes risk.

基于凸风险最小化的分类方法：统计性质与一致性AI 解读

We study how closely the optimal Bayes error rate can be approximately reached using a classification algorithm that computes a classifier by minimizing a convex upper bound of the classification error function. The measurement of closeness is characterized by the loss function used in the estimation. We show that such a classification scheme can be generally regarded as a (nonmaximum-likelihood) conditional in-class probability estimate, and we use this analysis to compare…

何时应控制协变量？处理效应估计的面板式渐近分析AI 解读

The problem of when to control for continuous or high-dimensional discrete covariate vectors arises in both experimental and observational studies. Large-cell asymptotic arguments suggest that full control for covariates or stratification variables is always efficient, even if treatment is assigned independently of covariates or strata. Here, we approximate the behavior of different estimators using a panel-data-type asymptotic sequence with fixed cell sizes and the number…

融资约束与农场投资AI 解读

This study contributes to the q-based empirical investment literature by using a Bayesian approach to analyze the impact of internal financial variables on a q-based investment model, accounting specifically for variable selection and incorporating outliers explicitly within the advocated modeling framework. For the balanced panel analyzed, a farm's liquidity situation is found to affect its investment significantly. Incorporation of an outlier detection component changes…

纵向数据大规模协方差矩阵的非参数估计AI 解读

Estimation of an unstructured covariance matrix is difficult because of its positive‐definiteness constraint. This obstacle is removed by regressing each variable on its predecessors, so that estimation of a covariance matrix is shown to be equivalent to that of estimating a sequence of varying‐coefficient and varying‐order regression models. Our framework is similar to the use of increasing‐order autoregressive models in approximating the covariance matrix or the spectrum…

协方差选择模型的高效估计AI 解读

A Bayesian method is proposed for estimating an inverse covariance matrix from Gaussian data. The method is based on a prior that allows the off‐diagonal elements of the inverse covariance matrix to be zero, and in many applications results in a parsimonious parameterisation of the covariance matrix. No assumption is made about the structure of the corresponding graphical model, so the method applies to both nondecomposable and decomposable graphs. All the parameters are…

因变量可能受限的可分模型半参数估计AI 解读

In this paper we introduce a general method for estimating semiparametrically the different components in separable models. The family of separable models is quite popular in economic research because this structure offers clear interpretation, has straightforward economic consequences, and is often justified by theory. This family is also of statistical interest because it allows us to estimate high-dimensional complexity semiparametrically without running into the curse of…

利用广义谱与非线性时间序列模型推断汇率可预测性AI 解读

It is often documented, based on autocorrelation, variance ratio, and power spectrum, that exchange rates approximately follow a martingale process. Because these data check serial uncorrelatedness rather than martingale difference, they may deliver misleading conclusions in favor of the martingale hypothesis when the test statistics are insignificant. In this paper, we explore whether there exists a gap between serial uncorrelatedness and martingale difference for exchange…

循环神经网络的可识别性AI 解读

We examine the identifiability of a nonlinear state space system under general assumptions. The discrete time evolution of the state is generated by a recurrent Elman network. For a large set of Elman networks we determine the class of observationally equivalent minimal systems, i.e., minimal systems that exhibit the same input-output behavior.The authors are grateful for discussions with M. Deistler and D. Bauer. A.A. Al-Falou was funded by the ERNSI network within the…

ψ学习研究AI 解读

The concept of large margins have been recognized as an important principle in analyzing learning methodologies, including boosting, neural networks, and support vector machines (SVMs). However, this concept alone is not adequate for learning in nonseparable cases. We propose a learning methodology, called ψ-learning, that is derived from a direct consideration of generalization errors. We provide a theory for ψ-learning and show that it essentially attains the optimal rates…

用于时变谱分析的平滑样条 ANOVAAI 解读

In this article we propose a smoothing spline ANOVA model (SS-ANOVA) to estimate and to make inference on the time-varying log-spectrum of a locally stationary process. The time-varying spectrum is assumed to be smooth in both time and frequency. This assumption essentially turns a time-frequency spectral estimation problem into a 2-dimensional surface estimation problem. A smooth localized complex exponential (SLEX) basis is used to calculate the initial periodograms, and a…