ndarray-glm

Rust library for solving linear, logistic, and generalized linear models through iteratively reweighted least squares, using the ndarray-linalg module.

Crate Documentation Build Status Downloads

Status

This package is in alpha and the interface could undergo changes. Even the return value of certain functions may change from one release to the next. Correctness is not guaranteed.

The regression algorithm uses iteratively re-weighted least squares (IRLS) with a step-halving procedure applied when the next iteration of guesses does not increase the likelihood.

Suggestions (via issues) and pull requests are welcome.

Prerequisites

The recommended approach is to use a system BLAS implementation. For instance, to install OpenBLAS on Debian/Ubuntu: sudo apt update && sudo apt install -y libopenblas-dev Then use this crate with the openblas-system feature.

To use an alternative backend or to build a static BLAS implementation, refer to the ndarray-linalg documentation. Use this crate with the appropriate feature flag and it will be forwarded to ndarray-linalg.

Example

To use in your crate, add the following to the Cargo.toml:

ndarray = { version = "0.15", features = ["blas"]} ndarray-glm = { version = "0.0.12", features = ["openblas-system"] }

An example for linear regression is shown below.

``` rust use ndarray_glm::{array, Linear, ModelBuilder, utility::standardize};

// define some test data let datay = array![0.3, 1.3, 0.7]; let datax = array![[0.1, 0.2], [-0.4, 0.1], [0.2, 0.4]]; // The design matrix can optionally be standardized, where the mean of each independent // variable is subtracted and each is then divided by the standard deviation of that variable. let datax = standardize(datax); let model = ModelBuilder::::data(&datay, &datax).build()?; // L2 (ridge) regularization can be applied with l2reg(). let fit = model.fitoptions().l2_reg(1e-5).fit()?; // Currently the result is a simple array of the MLE estimators, including the intercept term. println!("Fit result: {}", fit.result); ```

Custom non-canonical link functions can be defined by the user, although the interface is currently not particularly ergonomic. See tests/custom_link.rs for examples.

Features

Troubleshooting

Lasso/L1 regularization can converge slowly in some cases, particularly when the data is poorly-behaved, seperable, etc.

The following tips are recommended things to try if facing convergence issues generally, but are more likely to be necessary in a L1 regularization problem.

If you encounter problems that persist even after these techniques are applied, please file an issue so the algorithm can be improved.

References