On least absolute values estimation

The resistance of least absolute values (L₁) estimators to outliers and their robustness to heavy-tailed distributions make these estimators useful alternatives to the usual least squares estimators. The recent development of efficient algorithms for L₁ estimation in linear models has permitted their use in practical data analysis. Although in general the L₁ estimators are not unique, there are a number of properties they all share. The set of all L₁ estimators for a given model and data set can be characterized as the convex hull of some extreme estimators. Properties of the extreme estimators and of the L₁-estimate set are considered.     

Weighted L1-estimates for the First-order Bifurcating Autoregressive Model

We developed robust estimators that minimize a weighted L₁ norm for the first-order bifurcating autoregressive model. When all of the weights are fixed, our estimate is an L₁ estimate that is robust against outlying points in the response space and more efficient than the least squares estimate for heavy-tailed error distributions. When the weights are random and depend on the points in the factor space, the weighted L₁ estimate is robust against outlying points in the factor space. Simulated and artificial examples are presented. The behavior of the proposed estimate is modeled through a Monte Carlo study.     

Unbiased L1 and L∞ estimation

Sielken and Heartely 1973 have shown that the L₁ and L_∞ estimation problems may be formulated in such a way as to yield unbiased estimators of in the standard linear model y = Xβ + ε In this paper we will show that the L₁ estimation problem is closely related to the dual of the L_∞ estimation problem and vice versa. We will use this resu;t to obtain four fistiner lineat programming problems which yield unbiased L₁ and L_∞ estimators of β.     

Least-squares estimation of distribution functions in johnson's translation system

To summarize a set of data by a distribution function in Johnson's translation system, we use a least-squares approach to parameter estimation wherein we seek to minimize the distance between the vector of "uniformized" oeder statistics and the corresponding vector of expected values. We use the software package FITTRI to apply this technique to three problems arising respectively in medicine, applied statistics, and civil engineering. Compared to traditional methods of distribution fitting based on moment matching, percentile matchingL ₁ estimation, and L _? estimation, the least-squares technique is seen to yield fits of similar accuracy and to converge more rapidly and reliably to a set of acceptable parametre estimates.     

Asymptotic expaxsioxs for the joint distribution of cirrelated hotellings t2 statlstics under normality

Let T² _i=z′_iS^?1z_i, i==,…k be correlated Hotelling's T² statistics under normality. where z=(z′_i,…,z′_k)′ and nS are independently distributed as N_kp((O,ρ?∑) and Wishart distribution W_p(∑, n), respectively. The purpose of this paper is to study the distribution function F(x₁,…,x_k) of (T² _i,…,T² _k) when n is large. First we derive an asymptotic expansion of the characteristic function of (T² _i,…,T² _k) up to the order n^?2. Next we give asymptotic expansions for (T² _i,…,T² _k) in two cases (i)ρ=I_k and (ii) k=2 by inverting the expanded characteristic function up to the orders n^?2 and n^?1, respectively. Our results can be applied to the distribution function of max (T² _i,…,T² _k) as a special case.     

Lp convergence and complete convergence for weighted sums of AANA random variables

Let {X_n, n ? 1} be a sequence of asymptotically almost negatively associated (AANA, for short) random variables which is stochastically dominated by a random variable X, and {d_ni, 1 ? i ? n, n ? 1} be a sequence of real function, which is defined on a compact set E. Under some suitable conditions, we investigate some convergence properties for weighted sums of AANA random variables, especially the L^p convergence and the complete convergence. As an application, the Marcinkiewicz–Zygmund-type strong law of large numbers for AANA random variables is obtained.     

Lower Bounds on the Symmetric L 2-Discrepancy and Their Application

The role of uniformity measured by the symmetric L ₂-discrepancy given in Hickernell (1998 Hickernell , F. J. (1998). A generalized discrepancy and quadrature error bound. Math. Computat. 67:299–322.[Crossref], [Web of Science ®] , [Google Scholar]) has been studied in fractional factorial designs. The issue of lower bounds on the symmetric L ₂-discrepancy is crucial in the construction of uniform designs. This article reports some new lower bounds on the symmetric L ₂-discrepancy for symmetric fractional factorials and for a set of asymmetric fractional factorials. It is valuable to use these lower bounds to measure uniformity of given designs.     

Remarks on the L1 distance in statistical data analysis

We propose the L₁ distance between the distribution of a binned data sample and a probability distribution from which it is hypothetically drawn as a statistic for testing agreement between the data and a model. We study the distribution of this distance for N-element samples drawn from k bins of equal probability and derive asymptotic formulae for the mean and dispersion of L₁ in the large-N limit. We argue that the L₁ distance is asymptotically normally distributed, with the mean and dispersion being accurately reproduced by asymptotic formulae even for moderately large values of N and k.     

Robust Coordinate Descent Algorithm Robust Solution Path for High-dimensional Sparse Regression Modeling

The L₁-type regularization provides a useful tool for variable selection in high-dimensional regression modeling. Various algorithms have been proposed to solve optimization problems for L₁-type regularization. Especially the coordinate descent algorithm has been shown to be effective in sparse regression modeling. Although the algorithm shows a remarkable performance to solve optimization problems for L₁-type regularization, it suffers from outliers, since the procedure is based on the inner product of predictor variables and partial residuals obtained from a non-robust manner. To overcome this drawback, we propose a robust coordinate descent algorithm, especially focusing on the high-dimensional regression modeling based on the principal components space. We show that the proposed robust algorithm converges to the minimum value of its objective function. Monte Carlo experiments and real data analysis are conducted to examine the efficiency of the proposed robust algorithm. We observe that our robust coordinate descent algorithm effectively performs for the high-dimensional regression modeling even in the presence of outliers.     

Comparison of computer programs for simple linear L 1 regression

A number of efficient computer codes are available for the simple linear L ₁ regression problem. However, a number of these codes can be made more efficient by utilizing the least squares solution. In fact, a couple of available computer programs already do so.

We report the results of a computational study comparing several openly available computer programs for solving the simple linear L ₁ regression problem with and without computing and utilizing a least squares solution.     

$${\mathcal{L}}_p$$ loss functions: a robust bayesian approach

In bayesian inference, the Bayes estimator is the alternative with the minimum expected loss. In most cases, the loss function shows the distance between the alternative and the parameter. Therefore, any distance can lead to a loss function. Among the best known distance functions is L _p one, where the choice of value p may be difficult and arbitrary. This paper examines robust models where the loss function is modelled by family L _p . Our solution concept is the non-dominated alternative. We characterize the non-dominated set by having the posterior distribution function satisfy a particular asymmetry property. We also include an example to illustrate the methodology described.     

Admissible tests for the mean with additional information

Let X be a po-normal random vector with unknown µ and unknown covariance matrix ∑ and let X be partitioned as X = (X^′ ₍₁₎, …, X^′ _(r))′ where X_(j)is a subvector of X with dimension p_jsuch that ∑^r _j=1Pj = P0. Some admissible tests are derived for testing H₀: μ = 0 versus H₁: μ ¦0 based on a sample drawn from the whole vector X of dimension p and r additional samples drawn from X₍₁₎, X₍₂₎, …, X(r) respectively, All (r+1) samples are assumed to be independent. The distribution of some of the tests' statistics involved are also derived.     

Location adjustment for the minimum volume ellipsoid estimator

Estimating multivariate location and scatter with both affine equivariance and positive breakdown has always been difficult. A well-known estimator which satisfies both properties is the Minimum Volume Ellipsoid Estimator (MVE). Computing the exact MVE is often not feasible, so one usually resorts to an approximate algorithm. In the regression setup, algorithms for positive-breakdown estimators like Least Median of Squares typically recompute the intercept at each step, to improve the result. This approach is called intercept adjustment. In this paper we show that a similar technique, called location adjustment, can be applied to the MVE. For this purpose we use the Minimum Volume Ball (MVB), in order to lower the MVE objective function. An exact algorithm for calculating the MVB is presented. As an alternative to MVB location adjustment we propose L ₁ location adjustment, which does not necessarily lower the MVE objective function but yields more efficient estimates for the location part. Simulations compare the two types of location adjustment. We also obtain the maxbias curves of L ₁ and the MVB in the multivariate setting, revealing the superiority of L ₁.     

Dependence Structure of Spacings of Order Statistics

Let X_1:n ≤ X_2:n ≤···≤ X_n:n denote the order statistics of a sample of n independent random variables X₁, X₂,…, X_n, all identically distributed as some X. It is shown that if X has a log-convex [log-concave] density function, then the general spacing vector (X_k1:n, X_k2:n ? X_k1:n,…, X_kr:n ? X_kr?1:n) is MTP₂ [S-MRR₂] whenever 1 ≤ k₁ < k₂ <···< k_r ≤ n and 1 ≤ r ≤ n. Multivariate likelihood ratio ordering of such general spacing vectors corresponding to two random samples is also considered. These extend some of the results in the literature for usual spacing vectors.     

Dimension reduction boosting

L₂Boosting is an effective method for constructing model. In the case of high-dimensional setting, Bühlmann and Yu (2003 Bühlmann, P., Yu, B. (2003). Boosting with the L₂-loss: regression and classification. J. Amer. Stat. Assoc. 98:324–339.[Taylor &; Francis Online], [Web of Science ®] , [Google Scholar]) proposed the componentwise L₂Boosting, but componentwise L₂Boosting can only fit a special limited model. In this paper, by combining a boosting and sufficient dimension reduction method, e.g., sliced inverse regression (SIR), we propose a new method for regression, called dimension reduction boosting (DRBoosting). Compared with L₂Boosting, the computation of DRBoosting is less intensive and its prediction is better, especially for high-dimensional data. Simulations confirm the advantage of the new method.     

A lower bound for the centred L 2-discrepancy on combined designs under the asymmetric factorials

The foldover is a useful technique in the construction of two-level factorial designs for follow-up experiments. To search an optimal foldover plans is an important issue. In this paper, for a set of asymmetric fractional factorials such as the original designs, a lower bound for centred L ₂-discrepancy of combined designs under a general foldover plan is obtained, which can be used as a benchmark for searching optimal foldover plans. All of our results are the extended ones of Ou et al. [Lower bounds of various discrepancies on combined designs, Metrika 74 (2011), pp. 109–119] for symmetric designs to asymmetric designs. Moreover, it also provides a theoretical justification for optimal foldover plans in terms of uniformity criterion.     

Asymptotics of the Lp-Norms of Density Estimators in the Nonlinear Autoregressive Models

This article investigates the asymptotic behavior of the error density function in nonlinear autoregressive stationary time series regression models. For any 1 ? p < ∞, the kernel density estimator of residuals is shown to be consistent for the error estimator concerning the L_p-distance, which extends the result developed by Cheng and Sun (2008 Cheng, F. X. (2005). Asymptotic distributions of error density estimators in first-order autoregression models. Sankhy Ind. J. Statist. 67:553–567. [Google Scholar]) in L₂-norm. Moreover, the result developed in this article is extended the results of Horváth and Zitikis (2003 Horváth, L., Zitikis, R. (2003). Asymptotics of the L_p-norms of density estimators in the first-order autoregressive models. Statist. Probab. Lett. 65:331342.[Crossref], [Web of Science ®] , [Google Scholar]) to nonlinear autoregressive models.     

On the performance of L2E estimation in modelling heterogeneous count responses with extreme values

In healthcare studies, count data sets measured with covariates often exhibit heterogeneity and contain extreme values. To analyse such count data sets, we use a finite mixture of regression model framework and investigate a robust estimation approach, called the L₂E [D.W. Scott, On fitting and adapting of density estimates, Comput. Sci. Stat. 30 (1998), pp. 124–133], to estimate the parameters. The L₂E is based on an integrated L₂ distance between parametric conditional and true conditional mass functions. In addition to studying the theoretical properties of the L₂E estimator, we compare the performance of L₂E with the maximum likelihood (ML) estimator and a minimum Hellinger distance (MHD) estimator via Monte Carlo simulations for correctly specified and gross-error contaminated mixture of Poisson regression models. These show that the L₂E is a viable robust alternative to the ML and MHD estimators. More importantly, we use the L₂E to perform a comprehensive analysis of a Western Australia hospital inpatient obstetrical length of stay (LOS) (in days) data that contains extreme values. It is shown that the L₂E provides a two-component Poisson mixture regression fit to the LOS data which is better than those based on the ML and MHD estimators. The L₂E fit identifies admission type as a significant covariate that profiles the predominant subpopulation of normal-stayers as planned patients and the small subpopulation of long-stayers as emergency patients.     

Using a Truncated C p Statistic for Variable Selection in Multiple Linear Regression

In multiple linear regression analysis each lower-dimensional subspace L of a known linear subspace M of ? ⁿ corresponds to a non empty subset of the columns of the regressor matrix. For a fixed subspace L, the C _p statistic is an unbiased estimator of the mean square error if the projection of the response vector onto L is used to estimate the expected response. In this article, we consider two truncated versions of the C _p statistic that can also be used to estimate this mean square error. The C _p statistic and its truncated versions are compared in two example data sets, illustrating that use of the truncated versions may result in models different from those selected by standard C _p .     

Consistency of l 1 estimates in censored linear regression models

In this paper, the regression model with a nonnegativity constraint on the dependent variable is considered. Under weak conditions, L ₁ estimates of the regression coefficients are shown to be consistent.