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].

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.

A note on constrained M-estimation and its recursive analog in multivariate linear regression models

In this paper, the constrained M-estimation of the regression coefficients and scatter parameters in a general multivariate linear regression model is considered. Since the constrained M-estimation is not easy to compute, an up-dating recursion procedure is proposed to simplify the computation of the estimators when a new observation is obtained. We show that, under mild conditions, the recursion estimates are strongly consistent. In addition, the asymptotic normality of the recursive constrained M-estimators of regression coefficients is established. A Monte Carlo simulation study of the recursion estimates is also provided. Besides, robustness and asymptotic behavior of constrained M-estimators are briefly discussed.

General relative error criterion and M-estimation

Relative error rather than the error itself is of the main interest in many practical applications. Criteria based on minimizing the sum of absolute relative errors （MRE） and the sum of squared relative errors （RLS） were proposed in the different areas. Motivated by K. Chen et al.＇s recent work [J. Amer. Statist. Assoc., 2010, 105： 1104-1112] on the least absolute relative error （LARE） estimation for the accelerated failure time （AFT） model, in this paper, we establish the connection between relative error estimators and the M-estimation in the linear model. This connection allows us to deduce the asymptotic properties of many relative error estimators （e.g., LARE） by the well-developed M-estimation theories. On the other hand, the asymptotic properties of some important estimators （e.g., MRE and RLS） cannot be established directly. In this paper, we propose a general relative error criterion （GREC） for estimating the unknown parameter in the AFT model. Then we develop the approaches to deal with the asymptotic normalities for M-estimators with differentiable loss functions on R or R／{0} in the linear model. The simulation studies are conducted to evaluate the performance of the proposed estimates for the different scenarios. Illustration with a real data example is also provided.

Two-stage local M-estimation of additive models

This paper studies local M-estimation of the nonparametric components of additive models. A two-stage local M-estimation procedure is proposed for estimating the additive components and their derivatives. Under very mild conditions, the proposed estimators of each additive component and its derivative are jointly asymptotically normal and share the same asymptotic distributions as they would be if the other components were known. The established asymptotic results also hold for two particular local M-estimations: the local least squares and least absolute deviation estimations. However, for general two-stage local M-estimation with continuous and nonlinear ψ-functions, its implementation is time-consuming. To reduce the computational burden, one-step approximations to the two-stage local M-estimators are developed. The one-step estimators are shown to achieve the same efficiency as the fully iterative two-stage local M-estimators, which makes the two-stage local M-estimation more feasible in practice. The proposed estimators inherit the advantages and at the same time overcome the disadvantages of the local least-squares based smoothers. In addition, the practical implementation of the proposed estimation is considered in details. Simulations demonstrate the merits of the two-stage local M-estimation, and a real example illustrates the performance of the methodology.

Notes on M-Estimation in Exponential Signal Models

An M-estimation of the parameters in an undamped exponential signal model was proposed in Wu and Tam(IEEE Trans Signal Process 49(2):373–380,2001),and the estimation was shown to be consistent under mild assumptions.In this paper,the limiting distributions of the M-estimators are investigated.It is shown that they are asymptotically normally distributed under similar conditions as assumed in Wu and Tam(IEEE Trans Signal Process 49(2):373–380,2001).In addition,a recursive algorithm for computing the M-estimators of frequencies is proposed,and the strong consistency of these estimators is established.Monte Carlo simulation studies using Huber’sρfunction are also provided.

Nonparametric M-estimation for Functional Stationary Ergodic Data

This paper considers a nonparametric M-estimator of a regression function for functional stationary ergodic data.More precisely,in the ergodic data setting,we consider the regression of a real random variable Y over an explanatory random variable X taking values in some semi-metric abstract space.Under some mild conditions,the weak consistency and the asymptotic normality of the M-estimator are established.Furthermore,a simulated example is provided to examine the finite sample performance of the M-estimator.

M-estimation for Periodic GARCH Model with High-frequency Data

This paper studies an M-estimator of a proxy periodic GARCH （p, q） scaling model and establishes its consistency and asymptotic normality. Simulation studies are carried out to assess the performance of the estimator. The numerical results show that our M-estimator is more efficient and robust than other estimators without the use of high-frequency data.

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.

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.

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.

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.

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

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

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.

MetaCost与重采样结合的不平衡分类算法——RS-MetaCost

不平衡分类是当今机器学习中的研究热点与难点。为提高不平衡数据的分类效果,提出MetaCost与重采样结合的不平衡分类算法——RS-MetaCost。首先在MetaCost划分子集前对不平衡数据集进行重采样,即过采样少数类或欠采样多数类,以降低或消除数据不平衡程度;其次在预测概率阶段,利用m-estimation提高少数类预测概率。采用6组模拟数据集与10组实例数据集,将RS-MetaCost与经典算法进行比较实验。结果表明,在大多数数据集上,RS-MetaCost在保证整体分类精度很高的前提下,还能提高少数类的分类精度,且过采样下的RS-MetaCost优于欠采样下的RS-MetaCost。

Nonlinear diffusion methods based on robust statistics for noise removal

A novel smoothness term of Bayesian regularization framework based on M-estimation of robust statistics is proposed, and from this term a class of fourth-order nonlinear diffusion methods is proposed. These methods attempt to approximate an observed image with a piecewise linear image, which looks more natural than piecewise constant image used to approximate an observed image by P-M model. It is known that M-estimators and W-estimators are essentially equivalent and solve the same minimization problem. Then, we propose PL bilateral filter from equivalent W-estimator. This new model is designed for piecewise linear image filtering, which is more effective than normal bilateral filter.

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.

A Novel Robust Nonlinear Dynamic Data Reconciliation

Outlier in one variable will smear the estimation of other measurements in data reconciliation （DR）. In this article, a novel robust method is proposed for nonlinear dynamic data reconciliation, to reduce the influence of outliers on the result of DR. This method introduces a penalty function matrix in a conventional least-square objective function, to assign small weights for outliers and large weights for normal measurements. To avoid the loss of data information, element-wise Mahalanobis distance is proposed, as an improvement on vector-wise distance, to construct a penalty function matrix. The correlation of measurement error is also considered in this article. The method introduces the robust statistical theory into conventional least square estimator by constructing the penalty weight matrix and gets not only good robustness but also simple calculation. Simulation of a continuous stirred tank reactor, verifies the effectiveness of the proposed algorithm.

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.