空间回归模型估计中的最小二乘法

空间回归模型由于引入了空间地理信息而使得其参数估计变得复杂,因为主要采用最大似然法,致使一般人认为在空间回归模型参数估计中不存在最小二乘法。通过分析空间回归模型的参数估计技术,研究发现,最小二乘法和最大似然法分别用于估计空间回归模型的不同的参数,只有将两者结合起来才能快速有效地完成全部的参数估计。数理论证结果表明,空间回归模型参数最小二乘估计量是最佳线性无偏估计量。空间回归模型的回归参数可以在估计量为正态性的条件下而实施显著性检验,而空间效应参数则不可以用此方法进行检验。     

经典最小二乘与全最小二乘法及其参数估计

文章对经典的最小二乘和全最小二乘方法的应用背景、原理与算法进行了介绍,给出了它们在线性模型参数估计中的MATLAB实现;通过计算机仿真说明了在模型中所有变量均具有不可忽略的误差时,全最小二乘法得到的参数估计更接近于真实参数.     

线性模型中混合估计与最小二乘估计的新相对效率

文章讨论了当线性模型有一定的附加信息时,回归系数的混合估计与最小二乘估计的相对效率问题;在误差矩阵为正定矩阵时,给出了一种新的相对效率,并导出了它的上界.     

半参数模型中两步估计与最小二乘估计的比较

文章在MSE准则下对半参数模型中的参数的两步估计和最小二乘估计进行了比较,给出了参数的两步估计优于最小二乘估计的充分条件。     

正交最小一乘回归系数估计的算法

文章对正交最小一乘方法的背景与原理进行了介绍,给出了线性模型参数估计算法和在MATLAB中的实现,通过计算机仿真说明了本文算法的正确性和正交最小一乘法较正交最小二乘法更具有稳健性.     

光滑正交最小一乘估计算法的比较

文章首先对线性EV模型与正交最小一乘估计进行了简要介绍.对正交距离的绝对值作了一个近似处理,使得原先不可导的目标函数为一个光滑可导的函数,从而极大地方便了求解.并且通过与正交最小二乘估计、正交最小-乘估计及其算法比较,分析了这种光滑正交最小-乘的合理性和有用性.     

MATLAB中方程组的解与回归模型的最小二乘估计

本文讨论了线性回归模型与线性方程组之间的内在联系与形式上的差异,基于MATLAB对线性方程组的解进行了扩展,指出超定方程组的近似解就是对应线性回归模型的最小二乘解,并且给出了实例和相应模拟程序.     

病态加权最小二乘混合模型的k-Liu估计解法

文章综合加权多源观测模型及最小二乘混合模型,组合两种有偏估计算法得到组合有偏估计算法。利用岭估计与Liu估计形成一种新的有偏估计——k-Liu估计,其可以抵抗法方程系数矩阵的病态性,同时可以有效降低参数估值的均方误差。通过构建目标函数导出k-Liu估计在病态最小二乘混合模型中参数的通用解式、均方误差式和协因数的计算式,推导出k-Liu估计中修正因子的计算式,通过广义交叉检核法确定岭参数。最后,通过多种估计法参与算例解算,得出k-Liu估计可以进一步提升混合最小二乘模型的解算精度。     

模糊线性回归模型的最小二乘方法

针对自变量和因变量皆模糊的数据系统中的回归分析问题,为避免自变量退化成数值变量时可能引致的估计误差增大而带来的问题,提出系统中引入模糊调整项的回归模型的一般结构,并运用基于模糊数间完备距离的最小二乘法研究模型解析表达式;利用水平截集概念将模糊多元回归模型转化成两个传统回归模型,根据模糊数间距离采用最小二乘法得到参数估计,给出员工工作绩效评估的算例说明方法的有效性,并结合Bootstrap方法的应用,研究回归参数所具有的随机不确定性动态变化。     

求解非线性多结构回归模型的加权最小二乘估计法

文章针对基于非线性多结构回归模型的参数估计问题,提出了带权值的最小二乘估计法;讨论并证明了最优加权的存在性和优越性;通过数值仿真分析比较,验证了此方法的精度.     

Tuning Parameter Estimation in Penalized Least Squares Methodology

The efficiency of the penalized methods (Fan and Li, 2001 Fan , J. , Li , R. ( 2001 ). Variable selection via nonconcave penalized likelihood and its oracle properties . Journal of the American Statistical Association 96 : 1348 – 1360 .[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) depends strongly on a tuning parameter due to the fact that it controls the extent of penalization. Therefore, it is important to select it appropriately. In general, tuning parameters are chosen by data-driven approaches, such as the commonly used generalized cross validation. In this article, we propose an alternative method for the derivation of the tuning parameter selector in penalized least squares framework, which can lead to an ameliorated estimate. Simulation studies are presented to support theoretical findings and a comparison of the Type I and Type II error rates, considering the L ₁, the hard thresholding and the Smoothly Clipped Absolute Deviation penalty functions, is performed. The results are given in tables and discussion follows.     

A Comparison of Partially Adaptive and Reweighted Least Squares Estimation

The small sample performance of least median of squares, reweighted least squares, least squares, least absolute deviations, and three partially adaptive estimators are compared using Monte Carlo simulations. Two data problems are addressed in the paper: (1) data generated from non-normal error distributions and (2) contaminated data. Breakdown plots are used to investigate the sensitivity of partially adaptive estimators to data contamination relative to RLS. One partially adaptive estimator performs especially well when the errors are skewed, while another partially adaptive estimator and RLS perform particularly well when the errors are extremely leptokur-totic. In comparison with RLS, partially adaptive estimators are only moderately effective in resisting data contamination; however, they outperform least squares and least absolute deviation estimators.     

Estimated Generalized Least Squares for Random Coefficient Regression Models

ABSTRACT. This paper considers a general class of random coefficient regression (RCR) models to represent pooled cross-sectional and time series data. A new method is given to estimate the covariance matrix of the error component in these RCR models. Also, the asymptotic and small sample properties of the estimated generalized least squares estimator of the regression coefficient vector are established. Procedures for testing a linear restriction on the mean vector of the random coefficients are derived. Finally, a test for non-randomness in the RCR model is devised, and the asymptotic distribution of the test statistic is obtained.     

A Note on Criterion-Robust Optimal Designs for Model Discrimination and Parameter Estimation in Polynomial Regression Models

Consider the problem of discriminating between the polynomial regression models on [?1, 1] and estimating parameters in the models. Zen and Tsai (2002 Zen , M. M. , Tsai , M. H. ( 2002 ). Some criterion-robust optimal designs for the dual problem of model discrimination and parameter estimation . Sankhya Ind. J. Statist. 64 : (Series B, Pt. 3) : 322 – 338 . [Google Scholar]) proposed a multiple-objective optimality criterion, M _γ-criterion, which uses weight γ (0 ≤ γ ≤ 1) for model discrimination and α = β = (1 ? γ)/2 for parameter estimation in each model. In this article, we generalize it to a wider setup with different values of α and β. For instance, α = 2 β suggests that the “smaller” model is more likely to be the true model. Using similar techniques, the corresponding criterion-robust optimal design is investigated. A study for the original criterion-robust optimal design with α = β, through M-efficiency, shows that it is good enough for any wider setup.     

An On-Line Estimation Algorithm for Periodic Autoregressive Models

This paper develops an on-line estimation algorithm for periodic autoregressive models (PAR). Indeed, we provide an adaptation of the well known recursive least squares algorithm (RLS), which has been successfully applied to classical autoregressive models (AR), to deal with PAR models. The obtained estimators are shown to be asymptotically efficient under mild conditions. Moreover, the performance of the periodic least squares algorithm (PRLS) is assessed via an intensive simulation study.     

Local Polynomial Estimation of Regression Functions for Mixing Processes

Local polynomial fitting has many exciting statistical properties which where established under i.i.d. setting. However, the need for non-linea r time series modeling, constructing predictive intervals, understanding divergence of non-linear time series requires the development of the theory of local polynomial fitting for dependent data. In this paper, we study the problem of estimating conditional mean functions and their derivatives via a local polynomial fit. The functions include conditional moments, conditional distribution as well as conditional density functions. Joint asymptotic normality for derivative estimation is established for both strongly mixing and ρ-mixing processes.     

Smoothing Time Series with Local Polynomial Regression on Time

Time series smoothers estimate the level of a time series at time t as its conditional expectation given present, past and future observations, with the smoothed value depending on the estimated time series model. Alternatively, local polynomial regressions on time can be used to estimate the level, with the implied smoothed value depending on the weight function and the bandwidth in the local linear least squares fit. In this article we compare the two smoothing approaches and describe their similarities. Through simulations, we assess the increase in the mean square error that results when approximating the estimated optimal time series smoother with the local regression estimate of the level.     

Penalized Weighted Least Squares to Small Area Estimation

In this paper, a penalized weighted least squares approach is proposed for small area estimation under the unit level model. The new method not only unifies the traditional empirical best linear unbiased prediction that does not take sampling design into account and the pseudo‐empirical best linear unbiased prediction that incorporates sampling weights but also has the desirable robustness property to model misspecification compared with existing methods. The empirical small area estimator is given, and the corresponding second‐order approximation to mean squared error estimator is derived. Numerical comparisons based on synthetic and real data sets show superior performance of the proposed method to currently available estimators in the literature.