Berwin A. Turlach | Searcharxiv

arXiv2019

A flexible sequential Monte Carlo algorithm for parametric constrained regression

An algorithm is proposed that enables the imposition of shape constraints on regression curves, without requiring the constraints to be written as closed-form expressions, nor assuming the functional form of the loss function. This algorithm is based on Sequential Monte Carlo-Simulated Annealing and only relies on an indicator function that assesses whether or not the constraints are fulfilled, thus allowing the enforcement of various complex constraints by specifying an appropriate indicator function without altering other parts of the algorithm. The algorithm is illustrated by fitting rational function and B-spline regression models subject to a monotonicity constraint. An implementation of the algorithm using R is freely available on GitHub.

stat.ME↗

arXiv2004

Least Angle Regression

The purpose of model selection algorithms such as All Subsets, Forward Selection and Backward Elimination is to choose a linear model on the basis of the same set of data to which the model will be applied. Typically we have available a large collection of possible covariates from which we hope to select a parsimonious set for the efficient prediction of a response variable. Least Angle Regression (LARS), a new model selection algorithm, is a useful and less greedy version of traditional forward selection methods. Three main properties are derived: (1) A simple modification of the LARS algorithm implements the Lasso, an attractive version of ordinary least squares that constrains the sum of the absolute regression coefficients; the LARS modification calculates all possible Lasso estimates for a given problem, using an order of magnitude less computer time than previous methods. (2) A different LARS modification efficiently implements Forward Stagewise linear regression, another promising new model selection method;

math.ST↗