LIMITING BEHAVIOR OF RECURSIVE M-ESTIMATORS IN MULTIVARIATE LINEAR REGRESSION MODELS AND THEIR ASYMPTOTIC EFFICIENCIES

Recursive algorithms are very useful for computing M-estimators of regression coefficients and scatter parameters. In this article, it is shown that for a nondecreasing ul （t）, under some mild conditions the recursive M-estimators of regression coefficients and scatter parameters are strongly consistent and the recursive M-estimator of the regression coefficients is also asymptotically normal distributed. Furthermore, optimal recursive M-estimators, asymptotic efficiencies of recursive M-estimators and asymptotic relative efficiencies between recursive M-estimators of regression coefficients are studied.

Algorithmic Study of M-Estimators for Multi-Function Sensor Data Reconstruction

This paper describes a data reconstruction technique for a multi-function sensor based on the Mestimator, which uses least squares and weighted least squares method. The algorithm has better robustness than conventional least squares which can amplify the errors of inaccurate data. The M-estimator places particular emphasis on reducing the effects of large data errors, which are further overcome by an iterative regression process which gives small weights to large off-group data errors and large weights to small data errors. Simulation results are consistent with the hypothesis with 81 groups of regression data having an average accuracy of 3.5%, which demonstrates that the M-estimator provides more accurate and reliable data reconstruction.

Moderate Deviations for M-estimators in Linear Models with φ-mixing Errors

In this paper, the moderate deviations for the M-estimators of regression parameter in a linear model are obtained when the errors form a strictly stationary Ф-mixing sequence. The results are applied to study many different types of M-estimators such as Huber＇s estimator, L^P-regression estimator, least squares estimator and least absolute deviation estimator.

SELECTING AN ADAPTIVE SEQUENCE FOR COMPUTING RECURSIVE M-ESTIMATORS IN MULTIVARIATE LINEAR REGRESSION MODELS

In this paper, the authors consider an adaptive recursive algorithm by selecting an adaptive sequence for computing M-estimators in multivariate linear regression models. Its asymptotic property is investigated. The recursive algorithm given by Miao and Wu （1996） is modified accordingly. Simu- lation studies of the Mgorithm is also provided. In addition, the Newton-Raphson iterative algorithm is considered for the purpose of comparison.

Rates of convergence of M-estimators for partly linear models involving time series

The asymptotic behaviour of M-estimalors constructed with B-spline method based on strictly stationary β-mixing observations of a partly linear model is dealt with. Under some regular conditions, it is proved that the M-estimators of the vector of parameters are asymptotically normal and the M-estimators of the nonparametric component achieve the optimal convergence rates for nonparametric regression. Our asymptotic theory includes L1-, L2-, Lp-norm, and Huber estimators as special cases.

ON B-SPLINE M-ESTIMATORS IN A SEMIPARAMETRIC REGRESSION MODEL

ＯＮＢ－ＳＰＬＩＮＥＭ－ＥＳＴＩＭＡＴＯＲＳＩＮＡＳＥＭＩＰＡＲＡＭＥＴＲＩＣＲＥＧＲＥＳＳＩＯＮＭＯＤＥＬ￥ＳＨＩＰｅｉｄｅ（ＤｅｐａｒｔｍｅｎｔｏｆＰｒｏｂａｂｉｌｉｔｙａｎｄＳｔａｔｉｓｔｉｃｓ，ＰｅｋｉｎｇＵｎｉｖｅｒｓｉｔｙ，Ｂｅｉｊｎｇ１...

Bahadur Representation of Nonparametric M-Estimators for Spatial Processes

Under some mild conditions, we establish a strong Bahadur representation of a general class of nonparametric local linear M-estimators for mixing processes on a random field. If the socalled optimal bandwidth hn = O（｜n｜^-1/5）, n ∈ Z^d, is chosen, then the remainder rates in the Bahadur representation for the local M-estimators of the regression function and its derivative are of order O（｜n｜^-4/5 log ｜n｜）. Moreover, we derive some asymptotic properties for the nonparametric local linear M-estimators as applications of our result.

THE RATES OF CONVERGENCE OF M-ESTIMATORS FOR PARTLY LINEAR MODELS IN DEPENDENT CASES

Consider the partly linear model K = X1& + go(Ti) + ei, where {(Ti, Xi)}T is a strictlystationary Sequence of random variable8, the ei’8 are i.i.d. random errorsl the K’s are realvalued responsest fo is a &vector of parameters, X is a &vector of explanatory variables,Ti is another explanatory variable ranging over a nondegenerate compact interval. Bnd ona segmnt of observations (T1, Xi 1 Y1 ),’’’ f (Tn, X;, Yn), this article investigates the rates ofconvrgence of the M-estimators for Po and go obtained from the minimisation problemwhere H is a space of B-spline functions of order m + 1 and p(-) is a function chosen suitablyUnder some regularity conditions, it is shown that the estimator of go achieves the optimalglobal rate of convergence of estimators for nonparametric regression, and the estdriator offo is asymptotically normal. The M-estimators here include regression quantile estimators,Li-estimators, Lp-norm estimators, Huber’s type M-estimators and usual least squares estimators. Applications of the asymptotic theory to testing the hypothesis H0: A’β0 =β are alsodiscussed, where β is a given vector and A is a known d × do matrix with rank d0.

Bayesian Classifier Based on Robust Kernel Density Estimation and Harris Hawks Optimisation

In real-world applications, datasets frequently contain outliers, which can hinder the generalization ability of machine learning models. Bayesian classifiers, a popular supervised learning method, rely on accurate probability density estimation for classifying continuous datasets. However, achieving precise density estimation with datasets containing outliers poses a significant challenge. This paper introduces a Bayesian classifier that utilizes optimized robust kernel density estimation to address this issue. Our proposed method enhances the accuracy of probability density distribution estimation by mitigating the impact of outliers on the training sample’s estimated distribution. Unlike the conventional kernel density estimator, our robust estimator can be seen as a weighted kernel mapping summary for each sample. This kernel mapping performs the inner product in the Hilbert space, allowing the kernel density estimation to be considered the average of the samples’ mapping in the Hilbert space using a reproducing kernel. M-estimation techniques are used to obtain accurate mean values and solve the weights. Meanwhile, complete cross-validation is used as the objective function to search for the optimal bandwidth, which impacts the estimator. The Harris Hawks Optimisation optimizes the objective function to improve the estimation accuracy. The experimental results show that it outperforms other optimization algorithms regarding convergence speed and objective function value during the bandwidth search. The optimal robust kernel density estimator achieves better fitness performance than the traditional kernel density estimator when the training data contains outliers. The Naïve Bayesian with optimal robust kernel density estimation improves the generalization in the classification with outliers.

A Robust Collaborative Recommendation Algorithm Based on k-distance and Tukey M-estimator

The existing collaborative recommendation algorithms have lower robustness against shilling attacks.With this problem in mind,in this paper we propose a robust collaborative recommendation algorithm based on k-distance and Tukey M-estimator.Firstly,we propose a k-distancebased method to compute user suspicion degree(USD).The reliable neighbor model can be constructed through incorporating the user suspicion degree into user neighbor model.The influence of attack profiles on the recommendation results is reduced through adjusting similarities among users.Then,Tukey M-estimator is introduced to construct robust matrix factorization model,which can realize the robust estimation of user feature matrix and item feature matrix and reduce the influence of attack profiles on item feature matrix.Finally,a robust collaborative recommendation algorithm is devised by combining the reliable neighbor model and robust matrix factorization model.Experimental results show that the proposed algorithm outperforms the existing methods in terms of both recommendation accuracy and robustness.

An Approximate M-estimation for the Parameters of Mixed Regression Model

In this paper, to keep scale inveriance, we propose an approximate M-estrmation for the mixed regression model and show consistency of the estimation under weaker conditions than that in [1].

Study of M-estimator Variational Retrieval Using Simulated Feng Yun-3A Data

This paper adopts satellite channel brightness temperature simulation to study M-estimator variational retrieval. This approach combines both the advantages of classical variational inversion and robust M-estimators. Classical variational inversion depends on prior quality control to elim- inate outliers, and its errors follow a Gaussian distribution. We coupled the M-estimators to the framework of classical variational inversion to obtain a M-estimator variational inversion. The cost function contains the M-estimator to guarantee the robustness to outliers and improve the retrieval re- sults. The experimental evaluation adopts Feng Yun-3A （FY-3A） simulated data to add to the Gaussian and Non-Gaussian error. The variational in- version is used to obtain the inversion brightness temperature, and temperature and humidity data are used for validation. The preliminary results demonstrate the potential of M-estimator variational retrieval.

The M-estimate of Local Linear Regression with Variable Window Breadth

In this paper, by using the Brouwer fixed point theorem, we consider the existence and uniqueness of the solution for local linear regression with variable window breadth.

A Study on Fast and Robust Vanishing Point Detection System Using Fast M-Estimation Method and Regional Division for In-vehicle Camera

The vanishing point detection technology helps automatic driving. In this paper, the straight lines on the road associated with the vanishing point are extracted efficiently by using the regional division and angle limitation. And, the vanishing point is detected robustly by using the fast M-estimation method. Proposed method could detect straight-line features associated with vanishing point detection efficient on the road. And the vanishing point was detected exactly by the effect of the fast M-estimation method when the straight-line features not associated with vanishing point detection were detected. The processing time of the proposed method was faster than the camera flame rate （30 fps）. Thus, the proposed method is capable of real-time processing.

基于自适应权值的点云三维物体重建算法研究

基于三维扫描点云数据的三维物体重建是计算机图形学中非常重要的课题,在计算机动画、医学图像处理等多方面都有应用。其中基于最小二乘问题的Levenberg-Marquart算法和基于极大似然估计的M-Estimator算法都是不错的方案。但是当点的数量过多过少或者点云中有噪声时,这些方案产生的结果都会有较大的误差,影响重建的效果。为了解决这两个问题,结合Levenberg-Marquart算法和M-Estimator算法,提出了一种新的算法。该算法结合Levenberg-Marquart算法较快的收敛性和M-Estimator算法的抗噪性,能很好地解决点数量较多和噪声点影响结果的问题。通过在M-Estimator的权重函数上进行改进,提出自适应的权值函数,用灵活变动和自适应的值代替原来的固定值,使算法在噪声等级较高时也能表现良好。最后将算法应用在球体和圆柱上,并和最新的研究成果进行对比,数据说明算法无论是在点云数量较多还是在噪声等级较高的情况下都明显优于其他已知算法。

Likelihood and Quadratic Distance Methods for the Generalized Asymmetric Laplace Distribution for Financial Data

Maximum likelihood (ML) estimation for the generalized asymmetric Laplace (GAL) distribution also known as Variance gamma using simplex direct search algorithms is investigated. In this paper, we use numerical direct search techniques for maximizing the log-likelihood to obtain ML estimators instead of using the traditional EM algorithm. The density function of the GAL is only continuous but not differentiable with respect to the parameters and the appearance of the Bessel function in the density make it difficult to obtain the asymptotic covariance matrix for the entire GAL family. Using M-estimation theory, the properties of the ML estimators are investigated in this paper. The ML estimators are shown to be consistent for the GAL family and their asymptotic normality can only be guaranteed for the asymmetric Laplace (AL) family. The asymptotic covariance matrix is obtained for the AL family and it completes the results obtained previously in the literature. For the general GAL model, alternative methods of inferences based on quadratic distances (QD) are proposed. The QD methods appear to be overall more efficient than likelihood methods infinite samples using sample sizes n ≤5000 and the range of parameters often encountered for financial data. The proposed methods only require that the moment generating function of the parametric model exists and has a closed form expression and can be used for other models.

Unified Asymptotic Results for Maximum Spacing and Generalized Spacing Methods for Continuous Models

Asymptotic results are obtained using an approach based on limit theorem results obtained for α-mixing sequences for the class of general spacings (GSP) methods which include the maximum spacings (MSP) method. The MSP method has been shown to be very useful for estimating parameters for univariate continuous models with a shift at the origin which are often encountered in loss models of actuarial science and extreme models. The MSP estimators have also been shown to be as efficient as maximum likelihood estimators in general and can be used as an alternative method when ML method might have numerical difficulties for some parametric models. Asymptotic properties are presented in a unified way. Robustness results for estimation and parameter testing results which facilitate the applications of the GSP methods are also included and related to quasi-likelihood results.

Robust Inference for Time-Varying Coefficient Models with Longitudinal Data

Time-varying coefficient models are useful in longitudinal data analysis. Various efforts have been invested for the estimation of the coefficient functions, based on the least squares principle. Related work includes smoothing spline and kernel methods among others, but these methods suffer from the shortcoming of non-robustness. In this paper, we introduce a local M-estimation method for estimating the coefficient functions and develop a robustified generalized likelihood ratio (GLR) statistic to test if some of the coefficient functions are constants or of certain parametric forms. The robustified GLR test is robust against outliers and the error distribution. This provides a useful robust inference tool for the models with longitudinal data. The bandwidth selection issue is also addressed to facilitate the implementation in practice. Simulations show that the proposed testing method is more powerful in some situations than its counterpart based on the least squares principle. A real example is also given for illustration.

Controlled-source electromagnetic data processing based on gray system theory and robust estimation

We propose a novel method that combines gray system theory and robust M-estimation method to suppress the interference in controlled-source electromagnetic data. We estimate the standard deviation of the data using a gray model because of the weak dependence of the gray system on data distribution and size. We combine the proposed and threshold method to identify and eliminate outliers. Robust M-estimation is applied to suppress the effect of the outliers and improve the accuracy. We treat the M-estimators of the preserved data as the true data. We use our method to reject the outliers in simulated signals containing noise to verify the feasibility of our proposed method. The processed values are observed to be approximate to the expected values with high accuracy. The maximum relative error is 3.6676%, whereas the minimum is 0.0251%. In processing field data, we observe that the proposed method eliminates outliers, minimizes the root-mean-square error, and improves the reliability of controlled-source electromagnetic data in follow-up processing and interpretation.

Data driven particle size estimation of hematite grinding process using stochastic configuration network with robust technique

As a production quality index of hematite grinding process,particle size(PS)is hard to be measured in real time.To achieve the PS estimation,this paper proposes a novel data driven model of PS using stochastic configuration network(SCN)with robust technique,namely,robust SCN(RSCN).Firstly,this paper proves the universal approximation property of RSCN with weighted least squares technique.Secondly,three robust algorithms are presented by employing M-estimation with Huber loss function,M-estimation with interquartile range(IQR)and nonparametric kernel density estimation(NKDE)function respectively to set the penalty weight.Comparison experiments are first carried out based on the UCI standard data sets to verify the effectiveness of these methods,and then the data-driven PS model based on the robust algorithms are established and verified.Experimental results show that the RSCN has an excellent performance for the PS estimation.