pith. sign in

arxiv: 1810.01072 · v3 · pith:TQ6KS2P3new · submitted 2018-10-02 · 📊 stat.ME · stat.CO

A flexible sequential Monte Carlo algorithm for parametric constrained regression

classification 📊 stat.ME stat.CO
keywords algorithmconstraintsfunctionregressionindicatormontesequentialwithout
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.