线性模型中F-检验的稳健性

本文讨论了一般线性模型中关于均值参数β的线性假设基于广义最小二乘估计的F-检验统计量的稳健性问题.主要研究了当误差的协方差矩阵含有参数时,设计阵可以列降秩情况下的F-检验统计量的稳健性,得到了F(V(θ))为该假设下F-检验统计量的误差协方差矩阵的最大类.并讨论了分块线性模型中,关于分块参数的线性假设的F-检验统计量的稳健性.     

两级抽样回归模型中估计与检验的稳健性

对于两级抽样(two-stage sampling)回归模型,协方差阵含有未知的类内相关系数(intraclustercorrelation)ρ本文研究在设计阵满足何种条件时,回归系数的估计与F-检验不受ρ的影响。即估计与F-检验关于协方差阵具有稳健性。本文对最小二乘估计与似然比F-检验统计量的稳健性分别给出了充要条件、充分条件和必要条件。     

相依回归系统参数的预检验估计

对由m个相依线性回归方程组成的线性回归系统,本文提出了基于最小二乘估计和协方差改进估计的一种新型估计,即预检验估计。文章讨论了度量附加信息和样本信息之间相关程度的统计量,给出了估计的一些优良性结果,并与最小二乘估计及协方差改进估计作了比较,最后通过随机模拟验证了预检验估计所具有的良好性质。     

关于t（n）、F（m，n）分布数字特征的计算

在统计推断中，需用统计量来估计未知参数θ或g(θ)的数值，如要进一步分析一个估计量的好坏，就需知道估计量的分布，或至少要知道统计量的某些数字特征．众所周知，t统计量、F统计量在参数的点估计、区间估计、假设检验中起着重要的作用．文献[1]中介绍了几种重要分布：     

约束Welsch—Kuh统计量与约束Cook距离

本文讨论线性回归模型中约束条件下最小二乘估计的影响问题,利用约束下的Welsch-Kuh统计量研讨了剔除第i组数据(x＇_4,y_4)后,对x_i和x_y处拟合值的影响,另又用Cook统计量讨论了第i组数据对约束最小二乘估计的影响。     

约束最小二乘估计的优良性

对于线性模型y=Xθ ε,ε服从椭球等高单峰分布,未知参数θ满足不等式约束a′θ≥0,证明了在参数估计优良性的集中概率准则下,θ的约束最小二乘估计θ~*优于最小二乘估计θ.     

纵向数据模型均值参数和方差参数的影响分析

本文主要研究了纵向数据模型的均值参数和方差参数的统计诊断问题,基于均值参数的加权最小二乘估计和方差参数的REML估计，我们定义了两类参数的广义Cook距离，并求得了计算公式，同时我们研究异常个体的检验问题，得到了两个检验统计量．最后通过实际例子证实了我们的方法的有效性。     

广义偏最小二乘(PLS)估计类

本文研究了一类含有偏最小二乘（partialleastsquaresPLS）估计的估计类．给出了PLS估计的一般代数形式；讨论了含有PLS估计的广义PPLS估计类的统计性质；给出了该估计类优于最小二乘估计的条件．     

非线性回归模型参数估计量的随机展开及偏和方差的讨论

§1.引言 对于非线性回归模型y_t=f(x_t,θ)+ε_t, t=1,2,… (1.1) 若记 S(θ)=sum from t=1 to n([y_t-f(x_t,θ)]~2) (1.2) 则维数假定为p的参数向量θ的一个最小二乘估计量(简记为LSE)定义为满足下式的统计量(y):     

基于联合估计方法的广义随机系数自回归模型的统计推断

本文利用联合估计函数方法(CEF)对广义随机系数自回归(GRCA)模型进行统计研究.应用联合估计函数方法得到广义随机系数自回归模型参数估计量,证明了提出的参数估计量的相合性和渐近正态性,利用数值模拟对提出的参数统计量进行对比分析,数值模拟结果表明,联合估计方法的参数估计量优于基于估计函数方法、伪极大似然方法、最小二乘方法的参数估计量,实证研究也说明CEF方法具有较好的效果.     

Bernstein–Frechet inequalities for the parameter of the first order autoregressive process

The autoregressive process takes an important part in predicting problems leading to decision making. In practice, we use the least squares method to estimate the parameter of the autoregressive process. In the case of the first order autoregressive process, we know that the least squares estimator converges in probability to the unknown parameter θ. In this Note, we show that the least squares estimator converges almost completely to θ and so we construct the inequalities of type Bernstein–Frechet for the coefficient of the first order autoregressive process. Using these inequalities a confidence interval is then obtained. To cite this article: A. Dahmani, M. Tari, C. R. Acad. Sci. Paris, Ser. I 340 (2005).     

Some observations on local least squares

In previous work we introduced a construction to produce biorthogonal multiresolutions from given subdivisions. The approach involved estimating the solution to a least squares problem by means of a number of smaller least squares approximations on local portions of the data. In this work we use a result by Dahlquist, et al. on the method of averages to make observational comparisons between this local least squares estimation and full least squares approximation. We have explored examples in two problem domains: data reduction and data approximation. We observe that, particularly for design matrices with a repetitive pattern of column entries, the least squares solution is often well estimated by local least squares, that the estimation rapidly improves with the size of the local least squares problems, and that the quality of the estimate is largely independent of the size of the full problem. In memory of Germund Dahlquist (1925–2005).AMS subject classification (2000) 93E24     

Detection of outliers in weighted least squares regression

In multiple linear regression model, we have presupposed assumptions (independence, normality, variance homogeneity and so on) on error term. When case weights are given because of variance heterogeneity, we can estimate efficiently regression parameter using weighted least squares estimator. Unfortunately, this estimator is sensitive to outliers like ordinary least squares estimator. Thus, in this paper, we proposed some statistics for detection of outliers in weighted least squares regression.     

四元数矩阵方程(AXB,CXD)=(E,F)的最小范数最小二乘Hermitian解

提出了研究四元数矩阵方程(AXB, CXD)=(E, F)的最小范数最小二乘Hermitian解的一个有效方法.首先应用四元数矩阵的实表示矩阵以及实表示矩阵的特殊结构,把四元数矩阵方程转化为相应的实矩阵方程,然后求出四元数矩阵方程(AXB, CXD)=(E, F)的最小二乘Hermitian解集,进而得到其最小范数最小二乘Hermitian解.所得到的结果只涉及实矩阵,相应的算法只涉及实运算,因此非常有效.最后的两个数值例子也说明了这一点.     

一个Krasnoselski定理的推广

主要讨论了非线性方程F(λ,u)=λu-G(u)=θ的分歧问题,其中G:X→X为非线性可微映射,X为Banach空间.在G′(θ)为紧算子,N(λ~*I-G′(θ))\R(λ~*I-G′(θ))≠{θ}的条件下,利用Lyapunov-Schmidt约化过程和隐函数定理证得了方程F(λ,u)=θ在多重特征值处的分歧定理,推广了Krasnoselski的经典分歧定理.     

An adaptive estimation of MAVE

Minimum average variance estimation (MAVE, Xia et al. (2002) [29]) is an effective dimension reduction method. It requires no strong probabilistic assumptions on the predictors, and can consistently estimate the central mean subspace. It is applicable to a wide range of models, including time series. However, the least squares criterion used in MAVE will lose its efficiency when the error is not normally distributed. In this article, we propose an adaptive MAVE which can be adaptive to different error distributions. We show that the proposed estimate has the same convergence rate as the original MAVE. An EM algorithm is proposed to implement the new adaptive MAVE. Using both simulation studies and a real data analysis, we demonstrate the superior finite sample performance of the proposed approach over the existing least squares based MAVE when the error distribution is non-normal and the comparable performance when the error is normal.     

离散时间系统的适应控制与稳定性

利用最小二乘 ( LS)和加权最小二乘 ( WLS)为线性 ARX系统和能被线性函数控制的非线性 ARX系统分别设计了适应控制器 ,并且证明了闭环系统是全局稳定的 .     

Robust anti-synchronization of uncertain chaotic systems based on multiple-kernel least squares support vector machine modeling

In this paper, we propose a robust anti-synchronization scheme based on multiple-kernel least squares support vector machine (MK-LSSVM) modeling for two uncertain chaotic systems. The multiple-kernel regression, which is a linear combination of basic kernels, is designed to approximate system uncertainties by constructing a multiple-kernel Lagrangian function and computing the corresponding regression parameters. Then, a robust feedback control based on MK-LSSVM modeling is presented and an improved update law is employed to estimate the unknown bound of the approximation error. The proposed control scheme can guarantee the asymptotic convergence of the anti-synchronization errors in the presence of system uncertainties and external disturbances. Numerical examples are provided to show the effectiveness of the proposed method.     

Backward perturbation analysis for scaled total least‐squares problems

The scaled total least‐squares (STLS) method unifies the ordinary least‐squares (OLS), the total least‐squares (TLS), and the data least‐squares (DLS) methods. In this paper we perform a backward perturbation analysis of the STLS problem. This also unifies the backward perturbation analyses of the OLS, TLS and DLS problems. We derive an expression for an extended minimal backward error of the STLS problem. This is an asymptotically tight lower bound on the true minimal backward error. If the given approximate solution is close enough to the true STLS solution (as is the goal in practice), then the extended minimal backward error is in fact the minimal backward error. Since the extended minimal backward error is expensive to compute directly, we present a lower bound on it as well as an asymptotic estimate for it, both of which can be computed or estimated more efficiently. Our numerical examples suggest that the lower bound gives good order of magnitude approximations, while the asymptotic estimate is an excellent estimate. We show how to use our results to easily obtain the corresponding results for the OLS and DLS problems in the literature. Copyright © 2009 John Wiley & Sons, Ltd.