Lasso with convex loss: Model selection consistency and estimation

Abstract

Variable selection is a fundamental challenge in statistical learning if one works with data sets containing huge amount of predictors. In this artical we consider procedures popular in model selection: Lasso and adaptive Lasso. Our goal is to investigate properties of estimators based on minimization of Lasso-type penalized empirical risk with a convex loss function, in particular nondifferentiable. We obtain theorems concerning rate of convergence in estimation, consistency in model selection and oracle properties for Lasso estimators if the number of predictors is fixed, i.e. it does not depend on the sample size. Moreover, we study properties of Lasso and adaptive Lasso estimators on simulated and real data sets.     

On selecting the best population

This paper deals with the problem of selecting the “best” population from a given number of populations in a decision theoretic framework. The class of selection rules considered is based on a suitable partition of the sample space. A selection rule is given which is shown to have certain optimum properties among the selection rules in the given class for a mal rules are known.     

Variable Selection via Regression Trees in the Presence of Irrelevant Variables

Many tree algorithms have been developed for regression problems. Although they are regarded as good algorithms, most of them suffer from loss of prediction accuracy when there are many irrelevant variables and the number of predictors exceeds the number of observations. We propose the multistep regression tree with adaptive variable selection to handle this problem. The variable selection step and the fitting step comprise the multistep method.

The multistep generalized unbiased interaction detection and estimation (GUIDE) with adaptive forward selection (fg) algorithm, as a variable selection tool, performs better than some of the well-known variable selection algorithms such as efficacy adaptive regression tube hunting (EARTH), FSR (false selection rate), LSCV (least squares cross-validation), and LASSO (least absolute shrinkage and selection operator) for the regression problem. The results based on simulation study show that fg outperforms other algorithms in terms of selection result and computation time. It generally selects the important variables correctly with relatively few irrelevant variables, which gives good prediction accuracy with less computation time.     

Variable Selection in Joint Location and Scale Models of the Skew-t-Normal Distribution

Variable selection is an important issue in all regression analysis, and in this article, we investigate the simultaneous variable selection in joint location and scale models of the skew-t-normal distribution when the dataset under consideration involves heavy tail and asymmetric outcomes. We propose a unified penalized likelihood method which can simultaneously select significant variables in the location and scale models. Furthermore, the proposed variable selection method can simultaneously perform parameter estimation and variable selection in the location and scale models. With appropriate selection of the tuning parameters, we establish the consistency and the oracle property of the regularized estimators. These estimators are compared by simulation studies.     

Group Variable Selection with Oracle Property by Weight-Fused Adaptive Elastic Net Model for Strongly Correlated Data

This paper is the generalization of weight-fused elastic net (Fu and Xu, 2012 Fu, G., Xu, Q. (2012). Grouping variable selection by weight fused elastic net for multi-collinear data. Communications in Statistics-Simulation and Computation 41(2):205–221.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]), which performs group variable selection by combining weight-fused LASSO(wfLasso) and elastic net (Zou and Hastie, 2005 Zou, H., Hastie, T. (2005). Regularization and variable selection via the elastic net. Journal of the Royal Statistical Society: Series B (Statistical Methodology) 67(2):301–320.[Crossref], [Web of Science ®] , [Google Scholar]) penalties. In this study, the elastic net penalty is replaced by adaptive elastic net penalty (AdaEnet) (Zou and Zhang, 2009 Zou, H., Zhang, H. (2009). On the adaptive elastic-net with a diverging number of parameters. Annals of Statistics 37(4):1733–1751.[Crossref], [PubMed], [Web of Science ®] , [Google Scholar]), and a new group variable selection algorithm with oracle property (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(456):1348–1360.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]; Zou, 2006 Zou, H. (2006). The adaptive lasso and its oracle properties. Journal of the American Statistical Association 101(476):1418–1429.[Taylor & Francis Online], [Web of Science ®] , [Google Scholar]) is obtained.     

Exponentiated power Lindley power series class of distributions: Theory and applications

ABSTRACT

We introduce a new four-parameter generalization of the exponentiated power Lindley (EPL) distribution, called the exponentiated power Lindley power series (EPLPS) distribution. The new distribution arises on a latent complementary risks scenario, in which the lifetime associated with a particular risk is not observable; rather, we observe only the minimum lifetime value among all risks. The distribution exhibits a variety of bathtub-shaped hazard rate functions. It contains as particular cases several lifetime distributions. Various properties of the distribution are investigated including closed-form expressions for the density function, cumulative distribution function, survival function, hazard rate function, the rth raw moment, and also the moments of order statistics. Expressions for the Rényi and Shannon entropies are also given. Moreover, we discuss maximum likelihood estimation and provide formulas for the elements of the Fisher information matrix. Finally, two data applications are given showing flexibility and potentiality of the EPLPS distribution.     

Chain pooling model selection for two-level fixed effects factorial experiments

As many as three iterated statistical model deletion procedures are considered for an experiment.Population model coeff cients were chosen to simulate a saturated 2⁴experiment having an unfavorable distribution of parameter values.Using random number studies, three model selection strategies were developed, namely, (1) a strategy to be used in anticipation of large coefficients of variation (neighborhood of 65 percent), (2) strategy to be used in anticipation of small coefficients of variation (4 percent or less), and (3) a security regret strategy to be used in the absence of such prior knowledge     

On the estimation of the true probability of a correct selection

For ranking and selection problems, the true probabiIity of a correct selection P(CS) is unknown even if a selection is made under the indifference-zone approach. Thus to estimate the true P(CS) some Bayes estimators and a bootstrap estimator are proposed for two normcal populations with common known variance. Also a bootstrap estimator and a bootstrap confidence interval are proposed for normal populations with common unknown variance. Some comparisons between proposed estimators and some other known estimators are made via Monte Carlo simulations.     

An efficient cross-validation algorithm for window width selection for nonparametric kernel regression

This paper presents an approach to cross-validated window width choice which greatly reduces computation time, which can be used regardless of the nature of the kernel function, and which avoids the use of the Fast Fourier Transform. This approach is developed for window width selection in the context of kernel estimation of an unknown conditional mean.