奇异线性模型最小二乘估计的相对效率

刘爱义，王松挂在文[1]中提出了线性模型未知参数的最小二采估计的一种新的相对效率，本文将在奇异线性模型下，研究量小二乘估计的相对效率的下界。     

惩罚的偏最小二乘

本文研究了二个推广的惩罚的偏小二乘模型,将惩罚估计的算法作用于偏最小二乘估计上,得到了参数的最终估计.将此模型运用到一个实际数据,在预测方面获得了较好的结果.     

关于广义压缩最小二乘估计的注记

本文研究了广义压缩最小二乘估计（ＧＳＬＳＥ）的一些性质，给出了它的均方误差（ＭＳＥ）的一个无偏估计量（ＵＥ），采用极小该ＵＥ的方法确定了ＧＳＬＳＥ的参数选取公式，并把这个统一化的方法应用于广义岭估计，岭估计、Ｍａｓｓｙ主成分估计、Ｓｔｅｉｎ型压缩估计以及根方有偏估计等，从而得到了它们的一种选取参数的方法，最后，结合Ｈａｌｄ实例进行比较分析，结果表明，本文的方法是实用的，有效的。     

奇异线性模型最小二乘估计的相对效率

对于奇异线性模型引入了参数β的最小二乘估计相对与最佳线性无偏估计的一种新的相对效率，并讨论了它的下界。     

生长曲线模型的惩罚最小二乘估计

主要考虑了生长曲线模型中的参数矩阵的估计.首先基于Potthoff-Roy变换后的生长曲线模型,采用不同的惩罚函数:Hard Thresholding函数,LASSO,ENET,改进LASSO,SACD给出了参数矩阵的惩罚最小二乘估计.接着对不做变换的生长曲线模型,直接定义其惩罚最小二乘估计,基于Nelder-Mead法给出了估计的数值解算法.最后对提出的参数估计方法进行了数据模拟.结果表明自适应LASSO在估计方面效果比较好.     

线性模型中最小二乘估计的一种新的相对效率

对于线性模型未知参数最小二乘估计，本文提出了一种新的相对效率，并研究了它的性质，以及与Bloonfield-Watson等，讨论过的另一种相对效率的关系。     

模糊线性回归模型的约束最小二乘估计

自Tanaka等1982年提出模糊回归概念以来,该问题已得到广泛的研究。作为主要估计方法之一的模糊最小二乘估计以其与统计最小二乘估计的密切联系更受到人们的重视。本文依据适当定义的两个模糊数之间的距离,提出了模糊线性回归模型的一个约束最小二乘估计方法,该方法不仅能使估计的模糊参数的宽度具有非负性而且估计的模糊参数的中心线与传统的最小二乘估计相一致。最后,通过数值例子说明了所提方法的具体应用。     

纵向数据广义部分线性模型的惩罚GMM估计

对纵向数据的部分线性模型,通常的做法是用样条方法或者核方法逼近非参数部分,然后再用广义估计方程的估计方法去估计参数部分.本文使用P-样条拟合非参数函数,对不同的矩条件用不同的广义矩方法对模型的参数和非参数进行估计,并且给出了估计量的大样本性质;并用计算机模拟和实例证明了当模型中存在不同的矩条件时,采用不同的惩罚广义矩方法可以显著地提高估计精度.     

回归系数最小二乘估计的Bootstrap估计

本文对线性模型的回归系数β的线性函数α＾Ｔβ的最小二乘估计α＾Ｔβ建立了一种新的ｂｏｏｔｓｔｒａｐ逼近，给出了逼近的相合性定量，得到了ｏ（ｎ＾－１／２）的逼近速度。     

广义压缩最小二乘估计

本文引进了线性模型中回归系数的一个估计类。许多常用的估计,例如岭回归估计、主成分估计、压缩最小二乘估计以及迭代估计都属于这个估计类。本文讨论该估计类中估计的容许性问题以及矩阵均方误差准则下估计的比较问题。     

A Note on the Optimality of Generalized Cross-validation Bandwidth Selection in Partially Linear Models with Kernel Smoothing Estimator

The issue of selection of bandwidth in kernel smoothing method is considered within the context of partially linear models, hi this paper, we study the asymptotic behavior of the bandwidth choice based on generalized cross-validation （CCV） approach and prove that this bandwidth choice is asymptotically optimal. Numerical simulation are also conducted to investigate the empirical performance of generalized cross-valldation.     

Infill Asymptotics Inside Increasing Domains for the Least Squares Estimator in Linear Models

A linear model observed in a spatial domain is considered. Consistency and asymptotic normality of the least squares estimator is proved when the observations become dense in a sequence of increasing domains and the error terms are weakly dependent. Similar statements are obtained for the linear errors-in-variables model. This revised version was published online in June 2006 with corrections to the Cover Date.     

线性模型中加权混合估计相对于最小二乘估计的两种相对效率

本文提出了线性模型中加权混合估计相对于最小二乘估计的两种相对效率,并给出了这些相对效率的上下界.     

On the Convergence of the Generalized Linear Least Squares Algorithm

This paper considers the issue of parameter estimation for biomedical applications using nonuniformly sampled data. The generalized linear least squares (GLLS) algorithm, first introduced by Feng and Ho (1993), is used in the medical imaging community for removal of bias when the data defining the model are correlated. GLLS provides an efficient iterative linear algorithm for the solution of the non linear parameter estimation problem. This paper presents a theoretical discussion of GLLS and introduces use of both Gauss Newton and an alternating Gauss Newton for solution of the parameter estimation problem in nonlinear form. Numerical examples are presented to contrast the algorithms and emphasize aspects of the theoretical discussion. AMS subject classification (2000) 65F10.R. A. Renaut: This work was partially supported by the Arizona Center for Alzheimer’s Disease Research, by NIH grant EB 2553301 and for the second author by NSF CMG-02223.Received December 2003. Revised November 2004. Communicated by Lars Eldén.     

Linear Least Squares Estimation of Regression Models for Two-Dimensional Random Fields

We consider the problem of estimating regression models of two-dimensional random fields. Asymptotic properties of the least squares estimator of the linear regression coefficients are studied for the case where the disturbance is a homogeneous random field with an absolutely continuous spectral distribution and a positive and piecewise continuous spectral density. We obtain necessary and sufficient conditions on the regression sequences such that a linear estimator of the regression coefficients is asymptotically unbiased and mean square consistent. For such regression sequences the asymptotic covariance matrix of the linear least squares estimator of the regression coefficients is derived.     

Penalized Estimation in Large-Scale Generalized Linear Array Models

Large-scale generalized linear array models (GLAMs) can be challenging to fit. Computation and storage of its tensor product design matrix can be impossible due to time and memory constraints, and previously considered design matrix free algorithms do not scale well with the dimension of the parameter vector. A new design matrix free algorithm is proposed for computing the penalized maximum likelihood estimate for GLAMs, which, in particular, handles nondifferentiable penalty functions. The proposed algorithm is implemented and available via the R package glamlasso. It combines several ideas—previously considered separately—to obtain sparse estimates while at the same time efficiently exploiting the GLAM structure. In this article, the convergence of the algorithm is treated and the performance of its implementation is investigated and compared to that of glmnet on simulated as well as real data. It is shown that the computation time for glamlasso scales favorably with the size of the problem when compared to glmnet. Supplementary materials, in the form of R code, data and visualizations of results, are available online.     

Iterative Weighted Semiparametric Least Squares Estimation in Repeated Measurement Partially Linear Regression Models

Consider a repeated measurement partially linear regression model with an unknown vector parameter β, an unknown function g(.), and unknown heteroscedastic error variances. In order to improve the semiparametric generalized least squares estimator (SGLSE) of β, we propose an iterative weighted semiparametric least squares estimator (IWSLSE) and show that it improves upon the SGLSE in terms of asymptotic covariance matrix. An adaptive procedure is given to determine the number of iterations. We also show that when the number of replicates is less than or equal to two, the IWSLSE can not improve upon the SGLSE. These results are generalizations of those in [2] to the case of semiparametric regressions.     

Computation of Optimal Backward Perturbation Bounds for Large Sparse Linear Least Squares Problems

In this note we propose an algorithm based on the Lanczos bidiagonalization to approximate the backward perturbation bound for the large sparse linear squares problem. The algorithm requires ((m + n)l) operations where m and n are the size of the matrix under consideration and l <#60;<#60; min(m,n). The import of the proposed algorithm is illustrated by some examples coming from the Harwell-Boeing collection of test matrices.This revised version was published online in October 2005 with corrections to the Cover Date.     

Normal Approximation Rate of the Kernel Smoothing Estimator in a Partial Linear Model

By establishing the asymptotic normality for the kernel smoothing estimatorβ_nof the parametric componentsβin the partial linear modelY=X′β+g(T)+, P. Speckman (1988,J. Roy. Statist. Soc. Ser. B50, 413–456) proved that the usual parametric raten^−1/2is attainable under the usual “optimal” bandwidth choice which permits the achievement of the optimal nonparametric rate for the estimation of the nonparametric componentg. In this paper we investigate the accuracy of the normal approximation forβ_nand find that, contrary to what we might expect, the optimal Berry–Esseen raten^−1/2is not attainable unlessgis undersmoothed, that is, the bandwidth is chosen with faster rate of tending to zero than the “optimal” bandwidth choice.