Skip to content
/ ikpls Public

Fast CPU and GPU Python implementations of Improved Kernel Partial Least Squares (PLS) by Dayal and MacGregor (1997) and Fast Partition-Based Cross-Validation With Centering and Scaling for XTX and XTY by Engstrøm and Jensen (2025). This package also includes options to use sample weights for PLS modeling.

License

Notifications You must be signed in to change notification settings

sm00thix/ikpls

Repository files navigation

Improved Kernel Partial Least Squares (IKPLS) and Fast Cross-Validation

PyPI Version

Python Versions

Pepy - Total Downloads

PyPI - Downloads

License

Documentation Status

Tests Status

Test Coverage

Package Status

JOSS Status

The ikpls software package provides fast and efficient tools for PLS (Partial Least Squares) modeling. This package is designed to help researchers and practitioners handle PLS modeling faster than previously possible - particularly on large datasets.

Citation

If you use the ikpls software package for your work, please cite this Journal of Open Source Software article. If you use the fast cross-validation algorithm implemented in ikpls.fast_cross_validation.numpy_ikpls, please also cite this Journal of Chemometrics article.

Unlock the Power of Fast and Stable Partial Least Squares Modeling with IKPLS

Dive into cutting-edge Python implementations of the IKPLS (Improved Kernel Partial Least Squares) Algorithms #1 and #2 [1] for CPUs, GPUs, and TPUs. IKPLS is both fast [2] and numerically stable [3] making it optimal for PLS modeling.

  • Use our NumPy [4] based CPU implementations for seamless integration with scikit-learn's [5] ecosystem of machine learning algorithms and pipelines. As the implementations subclass scikit-learn's BaseEstimator, they can be used with scikit-learn's cross_validate.
  • Use our JAX [6] implementations on CPUs or leverage powerful GPUs and TPUs for PLS modelling. Our JAX implementations are end-to-end differentaible allowing gradient propagation when using PLS as a layer in a deep learning model.
  • Use our combination of IKPLS with Engstrøm's and Jensen's unbelievably fast cross-validation algorithm [7] to quickly determine the optimal combination of preprocessing and number of PLS components.
  • Use any of the above in combination with sample-weighted PLS [8].
  • Use our NumPy or JAX implementations for dimensionality reduction to score space with their respective transform methods.
  • Use our NumPy or JAX implementations for reconstruction of original space from score space with their respective inverse_transform methods.

The documentation is available at https://ikpls.readthedocs.io/en/latest/; examples can be found at https://github.com/Sm00thix/IKPLS/tree/main/examples.

Fast Cross-Validation

In addition to the standalone IKPLS implementations, this package contains an implementation of IKPLS combined with the novel, fast cross-validation algorithm by Engstrøm and Jensen [7]. The fast cross-validation algorithm benefit both IKPLS Algorithms and especially Algorithm #2. The fast cross-validation algorithm is mathematically equivalent to the classical cross-validation algorithm. Still, it is much quicker. The fast cross-validation algorithm correctly handles (column-wise) centering and scaling of the $\mathbf{X}$ and $\mathbf{Y}$ input matrices using training set means and standard deviations to avoid data leakage from the validation set. This centering and scaling can be enabled or disabled independently from eachother and for $\mathbf{X}$ and $\mathbf{Y}$ by setting the parameters center_X, center_Y, scale_X, and scale_Y, respectively. In addition to correctly handling (column-wise) centering and scaling, the fast cross-validation algorithm correctly handles row-wise preprocessing that operates independently on each sample such as (row-wise) centering and scaling of the $\mathbf{X}$ and $\mathbf{Y}$ input matrices, convolution, or other preprocessing. Row-wise preprocessing can safely be applied before passing the data to the fast cross-validation algorithm.

Installation

  • Install the package for Python3 using the following command:

    pip3 install ikpls
  • Now you can import the NumPy implementations with:

    from ikpls.numpy_ikpls import PLS as NpPLS
    from ikpls.fast_cross_validation.numpy_ikpls import PLS as NpPLS_FastCV
  • You can also install the optional JAX dependency to get JAX implementations of IKPLS

    pip3 install "ikpls[jax]"
  • Now, you can import the JAX implementations with:

    from ikpls.jax_ikpls_alg_1 import PLS as JAXPLS_Alg_1
    from ikpls.jax_ikpls_alg_2 import PLS as JAXPLS_Alg_2

Prerequisites for JAX

The JAX implementations support running on both CPU, GPU, and TPU.

  • To enable NVIDIA GPU execution, install JAX and CUDA with:

    pip3 install -U "jax[cuda13]"
  • To enable Google Cloud TPU execution, install JAX with:

    pip3 install -U "jax[tpu]"

These are typical installation instructions that will be what most users are looking for. For customized installations, follow the instructions from the JAX Installation Guide.

To ensure that JAX implementations use float64, set the environment variable JAX_ENABLE_X64=True as per the Common Gotchas. Alternatively, float64 can be enabled with the following function call:

import jax
jax.config.update("jax_enable_x64", True)

Quick Start

Use the ikpls package for PLS modeling

import numpy as np

from ikpls.numpy_ikpls import PLS


N = 100  # Number of samples.
K = 50  # Number of features.
M = 10  # Number of targets.
A = 20  # Number of latent variables (PLS components).

X = np.random.uniform(size=(N, K)) # Predictor variables
Y = np.random.uniform(size=(N, M)) # Target variables
w = np.random.uniform(size=(N, )) # sample weights

# The other PLS algorithms and implementations have the same interface for fit()
# and predict(). The fast cross-validation implementation with IKPLS has a
# different interface.
np_ikpls_alg_1 = PLS(algorithm=1)
np_ikpls_alg_1.fit(X, Y, A, w)

# Has shape (A, N, M) = (20, 100, 10). Contains a prediction for all possible
# numbers of components up to and including A.
y_pred = np_ikpls_alg_1.predict(X)

# Has shape (N, M) = (100, 10).
y_pred_20_components = np_ikpls_alg_1.predict(X, n_components=20)
(y_pred_20_components == y_pred[19]).all()  # True

# The internal model parameters can be accessed as follows:

# Regression coefficients tensor of shape (A, K, M) = (20, 50, 10).
np_ikpls_alg_1.B

# X weights matrix of shape (K, A) = (50, 20).
np_ikpls_alg_1.W

# X loadings matrix of shape (K, A) = (50, 20).
np_ikpls_alg_1.P

# Y loadings matrix of shape (M, A) = (10, 20).
np_ikpls_alg_1.Q

# X rotations matrix of shape (K, A) = (50, 20).
np_ikpls_alg_1.R

# Mapping from n_components to Y rotations matrix of shape (M, n_components).
# This is not required to compute np_ikpls_alg_1.B and is therefore lazily evaluated and cached.
np_ikpls_alg_1.R_Y

# Y rotations matrix of shape (M, A) = (10, 20)
np_ikpls_alg_1.R_Y[20] # R_Y is now cached for 20 components.

# Y rotations matrix for 19 components of shape (M, 19) = (10, 19)
# This is NOT the same as np_ikpls_alg_1.R_Y[20][:, :19]
np_ikpls_alg_1.R_Y[19] # R_Y is now cached for 20 and 19 components.

# X scores matrix of shape (N, A) = (100, 20).
# This is only computed for IKPLS Algorithm #1.
np_ikpls_alg_1.T

Examples

In examples, you will find:

Changelog

See CHANGELOG.md for version history and release notes.

Contribute

To contribute, please read the Contribution Guidelines.

References

  1. Dayal, B. S. and MacGregor, J. F. (1997). Improved PLS algorithms. Journal of Chemometrics, 11(1), 73-85.
  2. Alin, A. (2009). Comparison of PLS algorithms when the number of objects is much larger than the number of variables. Statistical Papers, 50, 711-720.
  3. Andersson, M. (2009). A comparison of nine PLS1 algorithms. Journal of Chemometrics, 23(10), 518-529.
  4. NumPy
  5. scikit-learn
  6. JAX
  7. Engstrøm, O.-C. G. and Jensen, M. H. (2025). Fast Partition-Based Cross-Validation With Centering and Scaling for $\mathbf{X}^\mathbf{T}\mathbf{X}$ and $\mathbf{X}^\mathbf{T}\mathbf{Y}$
  8. Becker and Ismail (2016). Accounting for sampling weights in PLS path modeling: Simulations and empirical examples. European Management Journal, 34(6), 606-617.

Funding

About

Fast CPU and GPU Python implementations of Improved Kernel Partial Least Squares (PLS) by Dayal and MacGregor (1997) and Fast Partition-Based Cross-Validation With Centering and Scaling for XTX and XTY by Engstrøm and Jensen (2025). This package also includes options to use sample weights for PLS modeling.

Topics

Resources

License

Contributing

Stars

Watchers

Forks

Packages

No packages published

Contributors 2

  •  
  •