Module light_labyrinth.dim3

The light_labyrinth.dim3 module includes 3-dimensional Light Labyrinth models.

image/svg+xml P 000 P 001 P 01 ,w 1 P 00 ,w 1 P 100 P 101 P 10 ,w 1 P 110 P 11 ,w 1 P 1 h 1 , 0 P 1 h 1 , 1 P 011 P 0 h 1 , 1 Pd 100 Pd 101 Pd 111 Pd 1 h 1 , 1 P 111 d h w P 0 h 1 , 0 P 010 Pd 110 Pd 1 h 1 , 0 Pd 10 ,w 1 Pd 11 ,w 1 k k k

Expand source code
"""
The `light_labyrinth.dim3` module includes 3-dimensional Light Labyrinth models.

.. include:: ../../html_utils/3dclassifier.svg
"""

from ._LightLabyrinth3DClassifier import LightLabyrinth3DClassifier
from ._LightLabyrinth3DRandomClassifier import LightLabyrinth3DRandomClassifier

__all__ = ["LightLabyrinth3DClassifier", "LightLabyrinth3DRandomClassifier"]

Classes

class LightLabyrinth3DClassifier (height, width, depth, bias=True, activation=ReflectiveIndexCalculator3D.softmax_dot_product_3d, error=ErrorCalculator.mean_squared_error, optimizer=None, regularization=None, weights=None, weights_init=LightLabyrinthWeightsInit.Default, random_state=0)

A 3-dimensional Light Labyrinth model.

The 3-dimensional version of the Light Labyrinth model is built by stacking depth levels of 2-dimensional models and connecting all non-output nodes of adjacent levels with vertical upward edges.

This model is meant for multi-class classification. Note that since all levels have the same shape, the number of distinct classes l has to be given by the number of levels depth times the number of outputs per level k <= min(width, height). This implies that when l is a prime number, labyrinth's depth must be equal to l and l=1. If this leads to overly complex models, consider using Light Labyrinth 2D or adding one or more empty class(es) to the dataset and changing model's shape to more reasonable.

    X                     
    |__ __ __ __ __ y0
    |__|__|__|__ y1
    |__|__|__ y2
    |__|__ y3       __ __ __ __ __ y4
                   |__|__|__|__ y5
                   |__|__|__ y6
                   |__|__ y7         __ __ __ __ __ y8 
                                    |__|__|__|__ y9
                                    |__|__|__ y10
                                    |__|__ y11

An example of height = 4 by width = 5 by depth = 3 model with k = 4 outputs per level (for 12-class classification). Note that all non-output nodes are connected with the corresponding node on the lower level.

Parameters


height : int
Height of the Light Labyrinth. Note that height > 1.
width : int
Width of the Light Labyrinth. Note that width > 1.
depth : int
Depth (number of layers) of the Light Labyrinth. Note that depth > 1
bias : bool, default=True
Whether to use bias in each node.
activation : ReflectiveIndexCalculator3D, default=ReflectiveIndexCalculator3D.softmax_dot_product_3d

Activation function applied to each node's output.

-softmax_dot_product_3d - softmax function over product of weights and input light, for a given node.

error : ErrorCalculator, default=ErrorCalculator.mean_squared_error

Error function optimized during training.

-mean_squared_error - Mean Squared Error can be used for any classification or regression task.

-cross_entropy - Cross Entropy Loss is meant primarily for classification task but it can be used for regression as well.

-scaled_mean_squared_error - Adaptation of MSE meant primarily for multi-label classification. Output values of consecutive pairs of output nodes are scaled to add up to \frac{1}{k}, before applying MSE.

optimizer : object, default=GradientDescent(0.01)

Optimization algorithm.

-GradientDescent - Standard Gradient Descent with constant learning rate, default: learning_rate=0.01

-RMSprop - RMSprop optimization algorithm, default: learning_rate=0.01, rho=0.9, momentum=0.0, epsilon=1e-6

-Adam - Adam optimization algorithm, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6

-Nadam - Adam with Nesterov momentum, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6

regularization : object, default=RegularizationL1(0.01)

Regularization technique - either L1, L2, or None.

RegularizationNone - No regularization.

RegularizationL1 - L1 regularization: \lambda\sum|W|, default: lambda_factor=0.01

RegularizationL2 - L2 regularization: \frac{\lambda}{2}\sum||W||, default: lambda_factor=0.01

weights : ndarray, optional, default=None
Initial weights. If None, weights are set according to weights_init parameter.
weights_init : LightLabyrinthWeightsInit, default=LightLabyrinthWeightsInit.Default

Method for weights initialization.

-LightLabyrinthWeightsInit.Default - default initialization.

-LightLabyrinthWeightsInit.Random - weights are initialized randomly.

-LightLabyrinthWeightsInit.Zeros - weights are initialized with zeros.

random_state : int, optional, default=0
Initial random state. If 0, initial random state will be set randomly.

Attributes


height : int
Height of the LightLabyrinth.
width : int
Width of the LightLabyrinth.
depth : int
Depth of the LightLabyrinth.
trainable_params : int
Number of trainable parameters.
weights : ndarray of shape (height, width, depth, 3*(n_features + bias))
Array of weights optimized during training. If bias is set to False, n_features is equal to the number of features in the training set X. If bias is set to True, n_features is increased by 1.
history : LightLabyrinthLearningHistory
Learning history including accuracy and error on training and (if provided) validation sets.
bias : bool
Boolean value whether the model was trained with bias.
activation : ReflectiveIndexCalculator3D
Activation function used for training.
error_function : ErrorCalculator
Error function used for training.
optimizer : object
Optimization algorithm used for training, including its parameters.
regularization : object
Regularization used during training, including its parameters.
random_state : int
Random state passed during initialization.

Notes


LightLabyrinth3D trains iteratively. At each time step the partial derivatives of the loss function with respect to the model parameters are computed to update the weights.

It can also have a regularization term added to the loss function that shrinks model parameters to prevent overfitting.

This implementation works with data represented as dense numpy arrays of floating point values.

See Also

LightLabyrinthClassifier
2-dimensional Light Labyrinth classifier.
LightLabyrinth3DRandomClassifier
3-dimensional random Light Labyrinth classifier.
LightLabyrinth3DMultilabelClassifier
2-dimensional Light Labyrinth multilabel classifier.

Examples

>>> from light_labyrinth.dim3 import LightLabyrinth3DClassifier
>>> from light_labyrinth.hyperparams.regularization import RegularizationL2
>>> from light_labyrinth.hyperparams.error_function import ErrorCalculator
>>> from light_labyrinth.hyperparams.optimization import RMSprop
>>> from sklearn.datasets import make_classification
>>> from sklearn.model_selection import train_test_split
>>> from sklearn.metrics import accuracy_score
>>> X, y = make_classification(n_samples=1000, n_classes=12, n_informative=9)
>>> X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2, random_state=0)
>>> clf = LightLabyrinth3DClassifier(5, 6, 4,
...                                  error=ErrorCalculator.cross_entropy,
...                                  optimizer=RMSprop(0.01),
...                                  regularization=RegularizationL2(0.1),
...                                  weights_init=LightLabyrinthWeightsInit.Zeros)
>>> hist = clf.fit(X_train, y_train, epochs=10, batch_size=20)
>>> y_pred = clf.predict(X_test)
>>> accuracy_score(y_test, y_pred)
0.47
Expand source code
class LightLabyrinth3DClassifier(LightLabyrinth3D):
    """A 3-dimensional Light Labyrinth model.

        The 3-dimensional version of the Light Labyrinth model is
        built by stacking `depth` levels of 2-dimensional models
        and connecting all non-output nodes of adjacent levels 
        with vertical upward edges.

        This model is meant for multi-class classification. 
        Note that since all levels have the same shape, the number 
        of distinct classes `l` has to be given by the number of levels
        `depth` times the number of outputs per level `k <= min(width, height)`.
        This implies that when `l` is a prime number, labyrinth's `depth` must
        be equal to `l` and `l=1`. If this leads to overly complex models,
        consider using Light Labyrinth 2D or adding one or more empty
        class(es) to the dataset and changing model's shape to more reasonable.

        ```
            X                     
            |__ __ __ __ __ y0
            |__|__|__|__ y1
            |__|__|__ y2
            |__|__ y3       __ __ __ __ __ y4
                           |__|__|__|__ y5
                           |__|__|__ y6
                           |__|__ y7         __ __ __ __ __ y8 
                                            |__|__|__|__ y9
                                            |__|__|__ y10
                                            |__|__ y11
        ```

        An example of `height = 4` by `width = 5` by `depth = 3` model with `k = 4` 
        outputs per level (for 12-class classification). 
        Note that all non-output nodes are connected with the
        corresponding node on the lower level.

        Parameters
        ----------
        ----------
        height : int 
            Height of the Light Labyrinth. Note that `height > 1`.

        width : int
            Width of the Light Labyrinth. Note that `width > 1`.

        depth : int
            Depth (number of layers) of the Light Labyrinth. Note that `depth > 1`

        bias : bool, default=True
            Whether to use bias in each node.

        activation : `light_labyrinth.hyperparams.activation.ReflectiveIndexCalculator3D`, default=`light_labyrinth.hyperparams.activation.ReflectiveIndexCalculator3D.softmax_dot_product_3d`
            Activation function applied to each node's output.

            -`softmax_dot_product_3d` - softmax function over product of weights and input light, for a given node.

        error : `light_labyrinth.hyperparams.error_function.ErrorCalculator`, default=`light_labyrinth.hyperparams.error_function.ErrorCalculator.mean_squared_error`
            Error function optimized during training.

            -`mean_squared_error` - Mean Squared Error can be used for any classification or regression task.

            -`cross_entropy` - Cross Entropy Loss is meant primarily for classification task but it can be used for regression as well.

            -`scaled_mean_squared_error` - Adaptation of MSE meant primarily for multi-label classification.
            \tOutput values of consecutive pairs of output nodes are scaled to add up to \\(\\frac{1}{k}\\), before applying MSE.

        optimizer : object, default=`light_labyrinth.hyperparams.optimization.GradientDescent(0.01)`
            Optimization algorithm. 

            -`light_labyrinth.hyperparams.optimization.GradientDescent` - Standard Gradient Descent with constant learning rate, default: learning_rate=0.01

            -`light_labyrinth.hyperparams.optimization.RMSprop` - RMSprop optimization algorithm, default: learning_rate=0.01, rho=0.9, momentum=0.0, epsilon=1e-6

            -`light_labyrinth.hyperparams.optimization.Adam` - Adam optimization algorithm, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6

            -`light_labyrinth.hyperparams.optimization.Nadam` - Adam with Nesterov momentum, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6


        regularization : object, default=`light_labyrinth.hyperparams.regularization.RegularizationL1(0.01)`
            Regularization technique - either L1, L2, or None.

            `light_labyrinth.hyperparams.regularization.RegularizationNone` - No regularization.

            `light_labyrinth.hyperparams.regularization.RegularizationL1` - L1 regularization: \\(\\lambda\\sum|W|\\), default: lambda_factor=0.01

            `light_labyrinth.hyperparams.regularization.RegularizationL2` - L2 regularization: \\(\\frac{\\lambda}{2}\\sum||W||\\), default: lambda_factor=0.01

        weights: ndarray, optional, default=None
            Initial weights. If `None`, weights are set according to weights_init parameter.

        weights_init: `light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit`, default=`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Default`
            Method for weights initialization.

            -`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Default` - default initialization.

            -`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Random` - weights are initialized randomly.

            -`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Zeros` - weights are initialized with zeros.

        random_state: int, optional, default=0
            Initial random state. If 0, initial random state will be set randomly.

        Attributes
        ----------
        ----------
        height : int
            Height of the LightLabyrinth.

        width : int
            Width of the LightLabyrinth.

        depth : int
            Depth of the LightLabyrinth.

        trainable_params : int
            Number of trainable parameters.

        weights : ndarray of shape (height, width, depth, 3*(n_features + bias))
            Array of weights optimized during training. If bias is set to False, n_features is equal to the number of features in the training set X.
            If bias is set to True, n_features is increased by 1.

        history : `light_labyrinth.utils.LightLabyrinthLearningHistory`
            Learning history including accuracy and error on training and (if provided) validation sets.

        bias : bool
            Boolean value whether the model was trained with bias.

        activation : `light_labyrinth.hyperparams.activation.ReflectiveIndexCalculator3D`
            Activation function used for training.

        error_function : `light_labyrinth.hyperparams.error_function.ErrorCalculator`
            Error function used for training.

        optimizer : object
            Optimization algorithm used for training, including its parameters.

        regularization : object
            Regularization used during training, including its parameters.

        random_state : int
            Random state passed during initialization.

        Notes
        -----
        -----
        LightLabyrinth3D trains iteratively. At each time step
        the partial derivatives of the loss function with respect to the model
        parameters are computed to update the weights.

        It can also have a regularization term added to the loss function
        that shrinks model parameters to prevent overfitting.

        This implementation works with data represented as dense numpy arrays
        of floating point values.


        See Also
        --------
        light_labyrinth.dim2.LightLabyrinthClassifier : 2-dimensional Light Labyrinth classifier.
        light_labyrinth.dim3.LightLabyrinth3DRandomClassifier : 3-dimensional random Light Labyrinth classifier.
        light_labyrinth.multioutput.LightLabyrinth3DMultilabelClassifier : 2-dimensional Light Labyrinth multilabel classifier.

        Examples
        --------
        >>> from light_labyrinth.dim3 import LightLabyrinth3DClassifier
        >>> from light_labyrinth.hyperparams.regularization import RegularizationL2
        >>> from light_labyrinth.hyperparams.error_function import ErrorCalculator
        >>> from light_labyrinth.hyperparams.optimization import RMSprop
        >>> from sklearn.datasets import make_classification
        >>> from sklearn.model_selection import train_test_split
        >>> from sklearn.metrics import accuracy_score
        >>> X, y = make_classification(n_samples=1000, n_classes=12, n_informative=9)
        >>> X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2, random_state=0)
        >>> clf = LightLabyrinth3DClassifier(5, 6, 4,
        ...                                  error=ErrorCalculator.cross_entropy,
        ...                                  optimizer=RMSprop(0.01),
        ...                                  regularization=RegularizationL2(0.1),
        ...                                  weights_init=LightLabyrinthWeightsInit.Zeros)
        >>> hist = clf.fit(X_train, y_train, epochs=10, batch_size=20)
        >>> y_pred = clf.predict(X_test)
        >>> accuracy_score(y_test, y_pred)
        0.47
        """

    def __init__(self, height, width, depth, bias=True,
                 activation=ReflectiveIndexCalculator3D.softmax_dot_product_3d,
                 error=ErrorCalculator.mean_squared_error,
                 optimizer=None,
                 regularization=None,
                 weights=None,
                 weights_init=LightLabyrinthWeightsInit.Default,
                 random_state=0):
        super().__init__(height, width, depth, bias,
                         activation,
                         error,
                         optimizer,
                         regularization,
                         weights,
                         weights_init,
                         random_state)

    def fit(self, X, y, epochs, batch_size=1.0, stop_change=1e-4, n_iter_check=0, epoch_check=1, X_val=None, y_val=None, verbosity=LightLabyrinthVerbosityLevel.Nothing):
        """Fit the model to data matrix X and target(s) y.

        Parameters
        ----------
        ----------
        X : ndarray of shape (n_samples, n_features)
            The input data.

        y : ndarray of shape (n_samples,) or (n_samples, n_outputs)
            The target labels (either one-hot-encoded or label-encoded).

        epochs : int
            Number of iterations to be performed. The solver iterates until convergence
            (determined by `stop_change`, `n_iter_check`) or this number of iterations.

        batch_size : int or float, default=1.0
            Size of mini-batches for stochastic optimizers given either as portion of 
            samples (float) or the exact number (int).
            When type is float, `batch_size = max(1, int(batch_size * n_samples))`.

        stop_change : float, default=1e-4
            Tolerance for the optimization. When the loss or score is not improving
            by at least ``stop_change`` for ``n_iter_check`` consecutive iterations,
            convergence is considered to be reached and training stops.

        n_iter_check : int, default=0
            Maximum number of epochs to not meet ``stop_change`` improvement.
            When set to 0, exactly ``epochs`` iterations will be performed.

        epoch_check : int, default=1
            Determines how often the condition for convergence is checked.
            `epoch_check = i` means that the condition will be checked every i-th iteration.
            When set to 0 the condition will not be checked at all and the learning history will be empty.

        X_val : ndarray of shape (n_val_samples, n_features), default=None
            The validation data. 
            If `X_val` is given, `y_val` must be given as well.

        y_val : ndarray of shape (n_val_samples,) or (n_val_samples, n_outputs), default=None
            Target values of the validation set. 
            If `y_val` is given, `X_val` must be given as well.

        verbosity: `light_labyrinth.utils.LightLabyrinthVerbosityLevel`, default=`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing`
            Verbosity level.

            -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing` - No output is printed.

            -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Basic` - Display logs about important events during the learning process. 

            -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Full` - Detailed output from the learning process is displayed.

        Returns
        -------
        -------
        hist : object
            Returns a `light_labyrinth.utils.LightLabyrinthLearningHistory` object with fields: 
            accs_train, accs_val, errs_train, errs_val.
        """
        self._encoder = _SmartOneHotEncoder()
        y_transformed = self._encoder.fit_transform(y)
        y_val_transformed = self._encoder.transform(
            y_val) if y_val is not None else None
            
        return super().fit(X, y_transformed, epochs, batch_size, stop_change, n_iter_check, epoch_check, X_val, y_val_transformed, verbosity)

    def predict(self, X):
        """Predict using the Light Labyrinth classifier.

        Parameters
        ----------
        ----------
        X : ndarray of shape (n_samples, n_features)
            The input data.

        Returns
        -------
        -------
        y : ndarray of shape (n_samples,) or (n_samples, n_classes)
            The predicted classes.
        """
        y_pred = super().predict(X)
        return self._encoder.inverse_transform(y_pred)

    def predict_proba(self, X):
        """Probability estimates.

        Parameters
        ----------
        ----------
        X : ndarray of shape (n_samples, n_features)
            The input data.

        Returns
        -------
        -------
        y_prob : ndarray of shape (n_samples, n_classes)
            The predicted probability of the sample for each class in the
            model.
        """
        return super().predict(X)

    def __del__(self):
        super().__del__()

Ancestors

  • light_labyrinth._bare_model.LightLabyrinth3D
  • light_labyrinth._bare_model._LightLabyrinthModel

Methods

def fit(self, X, y, epochs, batch_size=1.0, stop_change=0.0001, n_iter_check=0, epoch_check=1, X_val=None, y_val=None, verbosity=LightLabyrinthVerbosityLevel.Nothing)

Fit the model to data matrix X and target(s) y.

Parameters


X : ndarray of shape (n_samples, n_features)
The input data.
y : ndarray of shape (n_samples,) or (n_samples, n_outputs)
The target labels (either one-hot-encoded or label-encoded).
epochs : int
Number of iterations to be performed. The solver iterates until convergence (determined by stop_change, n_iter_check) or this number of iterations.
batch_size : int or float, default=1.0
Size of mini-batches for stochastic optimizers given either as portion of samples (float) or the exact number (int). When type is float, batch_size = max(1, int(batch_size * n_samples)).
stop_change : float, default=1e-4
Tolerance for the optimization. When the loss or score is not improving by at least stop_change for n_iter_check consecutive iterations, convergence is considered to be reached and training stops.
n_iter_check : int, default=0
Maximum number of epochs to not meet stop_change improvement. When set to 0, exactly epochs iterations will be performed.
epoch_check : int, default=1
Determines how often the condition for convergence is checked. epoch_check = i means that the condition will be checked every i-th iteration. When set to 0 the condition will not be checked at all and the learning history will be empty.
X_val : ndarray of shape (n_val_samples, n_features), default=None
The validation data. If X_val is given, y_val must be given as well.
y_val : ndarray of shape (n_val_samples,) or (n_val_samples, n_outputs), default=None
Target values of the validation set. If y_val is given, X_val must be given as well.
verbosity : LightLabyrinthVerbosityLevel, default=LightLabyrinthVerbosityLevel.Nothing

Verbosity level.

-LightLabyrinthVerbosityLevel.Nothing - No output is printed.

-LightLabyrinthVerbosityLevel.Basic - Display logs about important events during the learning process.

-LightLabyrinthVerbosityLevel.Full - Detailed output from the learning process is displayed.

Returns


hist : object
Returns a LightLabyrinthLearningHistory object with fields: accs_train, accs_val, errs_train, errs_val.
Expand source code
def fit(self, X, y, epochs, batch_size=1.0, stop_change=1e-4, n_iter_check=0, epoch_check=1, X_val=None, y_val=None, verbosity=LightLabyrinthVerbosityLevel.Nothing):
    """Fit the model to data matrix X and target(s) y.

    Parameters
    ----------
    ----------
    X : ndarray of shape (n_samples, n_features)
        The input data.

    y : ndarray of shape (n_samples,) or (n_samples, n_outputs)
        The target labels (either one-hot-encoded or label-encoded).

    epochs : int
        Number of iterations to be performed. The solver iterates until convergence
        (determined by `stop_change`, `n_iter_check`) or this number of iterations.

    batch_size : int or float, default=1.0
        Size of mini-batches for stochastic optimizers given either as portion of 
        samples (float) or the exact number (int).
        When type is float, `batch_size = max(1, int(batch_size * n_samples))`.

    stop_change : float, default=1e-4
        Tolerance for the optimization. When the loss or score is not improving
        by at least ``stop_change`` for ``n_iter_check`` consecutive iterations,
        convergence is considered to be reached and training stops.

    n_iter_check : int, default=0
        Maximum number of epochs to not meet ``stop_change`` improvement.
        When set to 0, exactly ``epochs`` iterations will be performed.

    epoch_check : int, default=1
        Determines how often the condition for convergence is checked.
        `epoch_check = i` means that the condition will be checked every i-th iteration.
        When set to 0 the condition will not be checked at all and the learning history will be empty.

    X_val : ndarray of shape (n_val_samples, n_features), default=None
        The validation data. 
        If `X_val` is given, `y_val` must be given as well.

    y_val : ndarray of shape (n_val_samples,) or (n_val_samples, n_outputs), default=None
        Target values of the validation set. 
        If `y_val` is given, `X_val` must be given as well.

    verbosity: `light_labyrinth.utils.LightLabyrinthVerbosityLevel`, default=`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing`
        Verbosity level.

        -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing` - No output is printed.

        -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Basic` - Display logs about important events during the learning process. 

        -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Full` - Detailed output from the learning process is displayed.

    Returns
    -------
    -------
    hist : object
        Returns a `light_labyrinth.utils.LightLabyrinthLearningHistory` object with fields: 
        accs_train, accs_val, errs_train, errs_val.
    """
    self._encoder = _SmartOneHotEncoder()
    y_transformed = self._encoder.fit_transform(y)
    y_val_transformed = self._encoder.transform(
        y_val) if y_val is not None else None
        
    return super().fit(X, y_transformed, epochs, batch_size, stop_change, n_iter_check, epoch_check, X_val, y_val_transformed, verbosity)
def predict(self, X)

Predict using the Light Labyrinth classifier.

Parameters


X : ndarray of shape (n_samples, n_features)
The input data.

Returns


y : ndarray of shape (n_samples,) or (n_samples, n_classes)
The predicted classes.
Expand source code
def predict(self, X):
    """Predict using the Light Labyrinth classifier.

    Parameters
    ----------
    ----------
    X : ndarray of shape (n_samples, n_features)
        The input data.

    Returns
    -------
    -------
    y : ndarray of shape (n_samples,) or (n_samples, n_classes)
        The predicted classes.
    """
    y_pred = super().predict(X)
    return self._encoder.inverse_transform(y_pred)
def predict_proba(self, X)

Probability estimates.

Parameters


X : ndarray of shape (n_samples, n_features)
The input data.

Returns


y_prob : ndarray of shape (n_samples, n_classes)
The predicted probability of the sample for each class in the model.
Expand source code
def predict_proba(self, X):
    """Probability estimates.

    Parameters
    ----------
    ----------
    X : ndarray of shape (n_samples, n_features)
        The input data.

    Returns
    -------
    -------
    y_prob : ndarray of shape (n_samples, n_classes)
        The predicted probability of the sample for each class in the
        model.
    """
    return super().predict(X)
class LightLabyrinth3DRandomClassifier (height, width, depth, features, bias=True, indices=None, activation=ReflectiveIndexCalculator3DRandom.random_3d_softmax_dot_product, error=ErrorCalculator.mean_squared_error, optimizer=None, regularization=None, weights=None, weights_init=LightLabyrinthWeightsInit.Default, random_state=0)

A 3-dimensional Light Labyrinth model with a randomized subset of features used at each node.

This model is meant for multi-class classification. Note that since all levels have the same shape, the number of distinct classes l has to be given by the number of levels depth times the number of outputs per level k <= min(width, height).

    X                     
    |__,__.__ __ __ y0
    !__!__|__|__ y1
    |__|__!__ y2    .__ __.__,__ __ y3
                    |__!__|__|__ y4
                    |__!__!__ y5    ,__,__ __.__ __ y6
                                    |__|__|__!__ y7
                                    !__|__|__ y8

An example of height = 3 by width = 5 by depth = 3 model with k = 3 outputs per level (for 9-class classification). Note that all non-output nodes are connected with the corresponding node on the lower level.

Parameters


height : int
Height of the Light Labyrinth. Note that height > 1.
width : int
Width of the Light Labyrinth. Note that width > 1.
depth : int
Depth (number of layers) of the Light Labyrinth. Note that depth > 1
features : int or float
Portion/number of features to be used in each node. If float is given it should be within range (0.0, 1.0]. If int is given it should not be greater than n_features.
bias : bool, default=True
Whether to use bias in each node.
indices : ndarray, optional, default=None
An array of shape (height, width, depth, n_indices + bias) including indices to be used at each node. If None, indices will be selected randomly.
activation : ReflectiveIndexCalculator3DRandom, default=ReflectiveIndexCalculator3DRandom.random_3d_softmax_dot_product

Activation function applied to each node's output.

-random_3d_softmax_dot_product - softmax function over product of weights and input light, for a given node. Note that only some randomly selected subset of features will be used, according to features parameter.

error : ErrorCalculator, default=ErrorCalculator.mean_squared_error

Error function optimized during training.

-mean_squared_error - Mean Squared Error can be used for any classification or regression task.

-cross_entropy - Cross Entropy Loss is meant primarily for classification task but it can be used for regression as well.

-scaled_mean_squared_error - Adaptation of MSE meant primarily for multi-label classification. Output values of consecutive pairs of output nodes are scaled to add up to \frac{1}{k}, before applying MSE.

optimizer : object, default=GradientDescent(0.01)

Optimization algorithm.

-GradientDescent - Standard Gradient Descent with constant learning rate, default: learning_rate=0.01

-RMSprop - RMSprop optimization algorithm, default: learning_rate=0.01, rho=0.9, momentum=0.0, epsilon=1e-6

-Adam - Adam optimization algorithm, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6

-Nadam - Adam with Nesterov momentum, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6

regularization : object, default=RegularizationL1(0.01)

Regularization technique - either L1, L2, or None.

RegularizationNone - No regularization.

RegularizationL1 - L1 regularization: \lambda\sum|W|, default: lambda_factor=0.01

RegularizationL2 - L2 regularization: \frac{\lambda}{2}\sum||W||, default: lambda_factor=0.01

weights : ndarray, optional, default=None
Initial weights. If None, weights are set according to weights_init parameter.
weights_init : LightLabyrinthWeightsInit, default=LightLabyrinthWeightsInit.Default

Method for weights initialization.

-LightLabyrinthWeightsInit.Default - default initialization.

-LightLabyrinthWeightsInit.Random - weights are initialized randomly.

-LightLabyrinthWeightsInit.Zeros - weights are initialized with zeros.

random_state : int, optional, default=0
Initial random state. If 0, initial random state will be set randomly.

Attributes


width : int
Width of the LightLabyrinth.
height : int
Height of the LightLabyrinth.
depth : int
Depth of the LightLabyrinth.
trainable_params : int
Number of trainable parameters.
indices : ndarray of shape (height, width, depth, n_indices + bias)
Indices used in each node (including bias if used).
weights : ndarray of shape (height, width, depth, 3*(n_indices + bias))
Array of weights optimized during training.
history : LightLabyrinthLearningHistory
Learning history including accuracy and error on training and (if provided) validation sets.
bias : bool
Boolean value whether the model was trained with bias.
activation : ReflectiveIndexCalculator3DRandom
Activation function used for training.
error_function : ErrorCalculator
Error function used for training.
optimizer : object
Optimization algorithm used for training, including its parameters.
regularization : object
Regularization used during training, including its parameters.
random_state : int
Random state passed during initialization.

Notes


Random LightLabyrinth3D trains iteratively. At each time step the partial derivatives of the loss function with respect to the model parameters are computed to update the weights.

It can also have a regularization term added to the loss function that shrinks model parameters to prevent overfitting.

This implementation works with data represented as dense numpy arrays of floating point values.

See Also

LightLabyrinthClassifier
2-dimensional Light Labyrinth classifier.
LightLabyrinth3DClassifier
3-dimensional Light Labyrinth classifier.
LightLabyrinth3DMultilabelClassifier
2-dimensional Light Labyrinth multi-label classifier.

Examples

>>> from light_labyrinth.dim3 import LightLabyrinth3DRandomClassifier
>>> from light_labyrinth.hyperparams.regularization import RegularizationL2
>>> from light_labyrinth.hyperparams.error_function import ErrorCalculator
>>> from light_labyrinth.hyperparams.optimization import RMSprop
>>> from light_labyrinth.hyperparams.weights_init import LightLabyrinthWeightsInit
>>> from sklearn.datasets import make_classification
>>> from sklearn.model_selection import train_test_split
>>> from sklearn.metrics import accuracy_score
>>> X, y = make_classification(n_samples=1000, n_classes=4, n_informative=3)
>>> X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2, random_state=0)
>>> clf = LightLabyrinth3DClassifier(5, 3, 2, features=4,
...                                  error=ErrorCalculator.cross_entropy,
...                                  optimizer=RMSprop(0.05),
...                                  regularization=RegularizationL2(0.15),
...                                  weights_init=LightLabyrinthWeightsInit.Zeros)
>>> hist = clf.fit(X_train, y_train, epochs=10, batch_size=0.1)
>>> y_pred = clf.predict(X_test)
>>> accuracy_score(y_test, y_pred)
0.73
Expand source code
class LightLabyrinth3DRandomClassifier(RandomLightLabyrinth3D):
    """A 3-dimensional Light Labyrinth model with a randomized subset of features used at each node.

        This model is meant for multi-class classification. 
        Note that since all levels have the same shape, the number 
        of distinct classes `l` has to be given by the number of levels
        `depth` times the number of outputs per level `k <= min(width, height)`.

        ```
            X                     
            |__,__.__ __ __ y0
            !__!__|__|__ y1
            |__|__!__ y2    .__ __.__,__ __ y3
                            |__!__|__|__ y4
                            |__!__!__ y5    ,__,__ __.__ __ y6
                                            |__|__|__!__ y7
                                            !__|__|__ y8
        ```

        An example of `height = 3` by `width = 5` by `depth = 3` model with `k = 3` 
        outputs per level (for 9-class classification). 
        Note that all non-output nodes are connected with the
        corresponding node on the lower level.

        Parameters
        ----------
        ----------
        height : int 
            Height of the Light Labyrinth. Note that `height > 1`.

        width : int
            Width of the Light Labyrinth. Note that `width > 1`.

        depth : int
            Depth (number of layers) of the Light Labyrinth. Note that `depth > 1`

        features : int or float
            Portion/number of features to be used in each node.
            If float is given it should be within range (0.0, 1.0].
            If int is given it should not be greater than n_features.

        bias : bool, default=True
            Whether to use bias in each node.

        indices : ndarray, optional, default=None
            An array of shape (height, width, depth, n_indices + bias) including indices
            to be used at each node. If `None`, indices will be selected randomly.

        activation : `light_labyrinth.hyperparams.activation.ReflectiveIndexCalculator3DRandom`, default=`light_labyrinth.hyperparams.activation.ReflectiveIndexCalculator3DRandom.random_3d_softmax_dot_product`
            Activation function applied to each node's output.

            -`random_3d_softmax_dot_product` - softmax function over product of weights and input light, for a given node.
                Note that only some randomly selected subset of features will be used, according to `features` parameter.

        error : `light_labyrinth.hyperparams.error_function.ErrorCalculator`, default=`light_labyrinth.hyperparams.error_function.ErrorCalculator.mean_squared_error`
            Error function optimized during training.

            -`mean_squared_error` - Mean Squared Error can be used for any classification or regression task.

            -`cross_entropy` - Cross Entropy Loss is meant primarily for classification task but it can be used for regression as well.

            -`scaled_mean_squared_error` - Adaptation of MSE meant primarily for multi-label classification.
            \tOutput values of consecutive pairs of output nodes are scaled to add up to \\(\\frac{1}{k}\\), before applying MSE.

        optimizer : object, default=`light_labyrinth.hyperparams.optimization.GradientDescent(0.01)`
            Optimization algorithm. 

            -`light_labyrinth.hyperparams.optimization.GradientDescent` - Standard Gradient Descent with constant learning rate, default: learning_rate=0.01

            -`light_labyrinth.hyperparams.optimization.RMSprop` - RMSprop optimization algorithm, default: learning_rate=0.01, rho=0.9, momentum=0.0, epsilon=1e-6

            -`light_labyrinth.hyperparams.optimization.Adam` - Adam optimization algorithm, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6

            -`light_labyrinth.hyperparams.optimization.Nadam` - Adam with Nesterov momentum, default: learning_rate=0.01, beta1=0.9, beta2=0.999, epsilon=1e-6


        regularization : object, default=`light_labyrinth.hyperparams.regularization.RegularizationL1(0.01)`
            Regularization technique - either L1, L2, or None.

            `light_labyrinth.hyperparams.regularization.RegularizationNone` - No regularization.

            `light_labyrinth.hyperparams.regularization.RegularizationL1` - L1 regularization: \\(\\lambda\\sum|W|\\), default: lambda_factor=0.01

            `light_labyrinth.hyperparams.regularization.RegularizationL2` - L2 regularization: \\(\\frac{\\lambda}{2}\\sum||W||\\), default: lambda_factor=0.01

        weights: ndarray, optional, default=None
            Initial weights. If `None`, weights are set according to weights_init parameter.

        weights_init: `light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit`, default=`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Default`
            Method for weights initialization.

            -`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Default` - default initialization.

            -`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Random` - weights are initialized randomly.

            -`light_labyrinth.hyperparams.weights_init.LightLabyrinthWeightsInit.Zeros` - weights are initialized with zeros.

        random_state: int, optional, default=0
            Initial random state. If 0, initial random state will be set randomly.

        Attributes
        ----------
        ----------
        width : int
            Width of the LightLabyrinth.

        height : int
            Height of the LightLabyrinth.

        depth : int
            Depth of the LightLabyrinth.

        trainable_params : int
            Number of trainable parameters.

        indices : ndarray of shape (height, width, depth, n_indices + bias)
            Indices used in each node (including bias if used).

        weights : ndarray of shape (height, width, depth, 3*(n_indices + bias))
            Array of weights optimized during training.

        history : `light_labyrinth.utils.LightLabyrinthLearningHistory`
            Learning history including accuracy and error on training and (if provided) validation sets.

        bias : bool
            Boolean value whether the model was trained with bias.

        activation : `light_labyrinth.hyperparams.activation.ReflectiveIndexCalculator3DRandom`
            Activation function used for training.

        error_function : `light_labyrinth.hyperparams.error_function.ErrorCalculator`
            Error function used for training.

        optimizer : object
            Optimization algorithm used for training, including its parameters.

        regularization : object
            Regularization used during training, including its parameters.

        random_state : int
            Random state passed during initialization.

        Notes
        -----
        -----
        Random LightLabyrinth3D trains iteratively. At each time step
        the partial derivatives of the loss function with respect to the model
        parameters are computed to update the weights.

        It can also have a regularization term added to the loss function
        that shrinks model parameters to prevent overfitting.

        This implementation works with data represented as dense numpy arrays
        of floating point values.

        See Also
        --------
        light_labyrinth.dim2.LightLabyrinthClassifier : 2-dimensional Light Labyrinth classifier.
        light_labyrinth.dim3.LightLabyrinth3DClassifier : 3-dimensional Light Labyrinth classifier.
        light_labyrinth.multioutput.LightLabyrinth3DMultilabelClassifier : 2-dimensional Light Labyrinth multi-label classifier.

        Examples
        --------
        >>> from light_labyrinth.dim3 import LightLabyrinth3DRandomClassifier
        >>> from light_labyrinth.hyperparams.regularization import RegularizationL2
        >>> from light_labyrinth.hyperparams.error_function import ErrorCalculator
        >>> from light_labyrinth.hyperparams.optimization import RMSprop
        >>> from light_labyrinth.hyperparams.weights_init import LightLabyrinthWeightsInit
        >>> from sklearn.datasets import make_classification
        >>> from sklearn.model_selection import train_test_split
        >>> from sklearn.metrics import accuracy_score
        >>> X, y = make_classification(n_samples=1000, n_classes=4, n_informative=3)
        >>> X_train, X_test, y_train, y_test = train_test_split(X, y, test_size=0.2, random_state=0)
        >>> clf = LightLabyrinth3DClassifier(5, 3, 2, features=4,
        ...                                  error=ErrorCalculator.cross_entropy,
        ...                                  optimizer=RMSprop(0.05),
        ...                                  regularization=RegularizationL2(0.15),
        ...                                  weights_init=LightLabyrinthWeightsInit.Zeros)
        >>> hist = clf.fit(X_train, y_train, epochs=10, batch_size=0.1)
        >>> y_pred = clf.predict(X_test)
        >>> accuracy_score(y_test, y_pred)
        0.73
        """

    def __init__(self, height, width, depth, features, bias=True, indices=None,
                 activation=ReflectiveIndexCalculator3DRandom.random_3d_softmax_dot_product,
                 error=ErrorCalculator.mean_squared_error,
                 optimizer=None,
                 regularization=None,
                 weights=None,
                 weights_init=LightLabyrinthWeightsInit.Default,
                 random_state=0):
        super().__init__(height, width, depth, features, bias, indices,
                         activation,
                         error,
                         optimizer,
                         regularization,
                         weights,
                         weights_init,
                         random_state)

    def fit(self, X, y, epochs, batch_size=1.0, stop_change=1e-4, n_iter_check=0, epoch_check=1, X_val=None, y_val=None, verbosity=LightLabyrinthVerbosityLevel.Nothing):
        """Fit the model to data matrix X and target(s) y.

        Parameters
        ----------
        ----------
        X : ndarray of shape (n_samples, n_features)
            The input data.

        y : ndarray of shape (n_samples,) or (n_samples, n_outputs)
            The target labels (either one-hot-encoded or label-encoded).

        epochs : int
            Number of iterations to be performed. The solver iterates until convergence
            (determined by `stop_change`, `n_iter_check`) or this number of iterations.

        batch_size : int or float, default=1.0
            Size of mini-batches for stochastic optimizers given either as portion of 
            samples (float) or the exact number (int).
            When type is float, `batch_size = max(1, int(batch_size * n_samples))`.

        stop_change : float, default=1e-4
            Tolerance for the optimization. When the loss or score is not improving
            by at least ``stop_change`` for ``n_iter_check`` consecutive iterations,
            convergence is considered to be reached and training stops.

        n_iter_check : int, default=0
            Maximum number of epochs to not meet ``stop_change`` improvement.
            When set to 0, exactly ``epochs`` iterations will be performed.

        epoch_check : int, default=1
            Determines how often the condition for convergence is checked.
            `epoch_check = i` means that the condition will be checked every i-th iteration.
            When set to 0 the condition will not be checked at all and the learning history will be empty.

        X_val : ndarray of shape (n_val_samples, n_features), default=None
            The validation data. 
            If `X_val` is given, `y_val` must be given as well.

        y_val : ndarray of shape (n_val_samples,) or (n_val_samples, n_outputs), default=None
            Target values of the validation set. 
            If `y_val` is given, `X_val` must be given as well.

        verbosity: `light_labyrinth.utils.LightLabyrinthVerbosityLevel`, default=`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing`
            Verbosity level.

            -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing` - No output is printed.

            -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Basic` - Display logs about important events during the learning process. 

            -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Full` - Detailed output from the learning process is displayed.

        Returns
        -------
        -------
        hist : object
            Returns a `light_labyrinth.utils.LightLabyrinthLearningHistory` object with fields: 
            accs_train, accs_val, errs_train, errs_val.
        """
        # overwrite the number of features to be used in each node (if it was given by float)
        if isinstance(self._features, float):
            self._features = max(1, int(X.shape[1] * self._features))

        classes = len(np.unique(y))
        classes_rounded = int(self.depth * np.ceil(classes/self.depth))

        self._encoder = _SmartOneHotEncoder(classes_rounded)
        y_transformed = self._encoder.fit_transform(y)
        y_val_transformed = self._encoder.transform(
            y_val) if y_val is not None else None
            
        return super().fit(X, y_transformed, epochs, batch_size, stop_change, n_iter_check, epoch_check, X_val, y_val_transformed, verbosity)

    def predict(self, X):
        """Predict using the Light Labyrinth classifier.

        Parameters
        ----------
        ----------
        X : ndarray of shape (n_samples, n_features)
            The input data.

        Returns
        -------
        -------
        y : ndarray of shape (n_samples,) or (n_samples, n_classes)
            The predicted classes.
        """
        y_pred = super().predict(X)
        return self._encoder.inverse_transform(y_pred)

    def predict_proba(self, X):
        """Probability estimates.

        Parameters
        ----------
        ----------
        X : ndarray of shape (n_samples, n_features)
            The input data.

        Returns
        -------
        -------
        y_prob : ndarray of shape (n_samples, n_classes)
            The predicted probability of the sample for each class in the
            model.
        """
        return super().predict(X)

    def __del__(self):
        super().__del__()

Ancestors

  • light_labyrinth._bare_model.RandomLightLabyrinth3D
  • light_labyrinth._bare_model._LightLabyrinthModel

Methods

def fit(self, X, y, epochs, batch_size=1.0, stop_change=0.0001, n_iter_check=0, epoch_check=1, X_val=None, y_val=None, verbosity=LightLabyrinthVerbosityLevel.Nothing)

Fit the model to data matrix X and target(s) y.

Parameters


X : ndarray of shape (n_samples, n_features)
The input data.
y : ndarray of shape (n_samples,) or (n_samples, n_outputs)
The target labels (either one-hot-encoded or label-encoded).
epochs : int
Number of iterations to be performed. The solver iterates until convergence (determined by stop_change, n_iter_check) or this number of iterations.
batch_size : int or float, default=1.0
Size of mini-batches for stochastic optimizers given either as portion of samples (float) or the exact number (int). When type is float, batch_size = max(1, int(batch_size * n_samples)).
stop_change : float, default=1e-4
Tolerance for the optimization. When the loss or score is not improving by at least stop_change for n_iter_check consecutive iterations, convergence is considered to be reached and training stops.
n_iter_check : int, default=0
Maximum number of epochs to not meet stop_change improvement. When set to 0, exactly epochs iterations will be performed.
epoch_check : int, default=1
Determines how often the condition for convergence is checked. epoch_check = i means that the condition will be checked every i-th iteration. When set to 0 the condition will not be checked at all and the learning history will be empty.
X_val : ndarray of shape (n_val_samples, n_features), default=None
The validation data. If X_val is given, y_val must be given as well.
y_val : ndarray of shape (n_val_samples,) or (n_val_samples, n_outputs), default=None
Target values of the validation set. If y_val is given, X_val must be given as well.
verbosity : LightLabyrinthVerbosityLevel, default=LightLabyrinthVerbosityLevel.Nothing

Verbosity level.

-LightLabyrinthVerbosityLevel.Nothing - No output is printed.

-LightLabyrinthVerbosityLevel.Basic - Display logs about important events during the learning process.

-LightLabyrinthVerbosityLevel.Full - Detailed output from the learning process is displayed.

Returns


hist : object
Returns a LightLabyrinthLearningHistory object with fields: accs_train, accs_val, errs_train, errs_val.
Expand source code
def fit(self, X, y, epochs, batch_size=1.0, stop_change=1e-4, n_iter_check=0, epoch_check=1, X_val=None, y_val=None, verbosity=LightLabyrinthVerbosityLevel.Nothing):
    """Fit the model to data matrix X and target(s) y.

    Parameters
    ----------
    ----------
    X : ndarray of shape (n_samples, n_features)
        The input data.

    y : ndarray of shape (n_samples,) or (n_samples, n_outputs)
        The target labels (either one-hot-encoded or label-encoded).

    epochs : int
        Number of iterations to be performed. The solver iterates until convergence
        (determined by `stop_change`, `n_iter_check`) or this number of iterations.

    batch_size : int or float, default=1.0
        Size of mini-batches for stochastic optimizers given either as portion of 
        samples (float) or the exact number (int).
        When type is float, `batch_size = max(1, int(batch_size * n_samples))`.

    stop_change : float, default=1e-4
        Tolerance for the optimization. When the loss or score is not improving
        by at least ``stop_change`` for ``n_iter_check`` consecutive iterations,
        convergence is considered to be reached and training stops.

    n_iter_check : int, default=0
        Maximum number of epochs to not meet ``stop_change`` improvement.
        When set to 0, exactly ``epochs`` iterations will be performed.

    epoch_check : int, default=1
        Determines how often the condition for convergence is checked.
        `epoch_check = i` means that the condition will be checked every i-th iteration.
        When set to 0 the condition will not be checked at all and the learning history will be empty.

    X_val : ndarray of shape (n_val_samples, n_features), default=None
        The validation data. 
        If `X_val` is given, `y_val` must be given as well.

    y_val : ndarray of shape (n_val_samples,) or (n_val_samples, n_outputs), default=None
        Target values of the validation set. 
        If `y_val` is given, `X_val` must be given as well.

    verbosity: `light_labyrinth.utils.LightLabyrinthVerbosityLevel`, default=`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing`
        Verbosity level.

        -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Nothing` - No output is printed.

        -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Basic` - Display logs about important events during the learning process. 

        -`light_labyrinth.utils.LightLabyrinthVerbosityLevel.Full` - Detailed output from the learning process is displayed.

    Returns
    -------
    -------
    hist : object
        Returns a `light_labyrinth.utils.LightLabyrinthLearningHistory` object with fields: 
        accs_train, accs_val, errs_train, errs_val.
    """
    # overwrite the number of features to be used in each node (if it was given by float)
    if isinstance(self._features, float):
        self._features = max(1, int(X.shape[1] * self._features))

    classes = len(np.unique(y))
    classes_rounded = int(self.depth * np.ceil(classes/self.depth))

    self._encoder = _SmartOneHotEncoder(classes_rounded)
    y_transformed = self._encoder.fit_transform(y)
    y_val_transformed = self._encoder.transform(
        y_val) if y_val is not None else None
        
    return super().fit(X, y_transformed, epochs, batch_size, stop_change, n_iter_check, epoch_check, X_val, y_val_transformed, verbosity)
def predict(self, X)

Predict using the Light Labyrinth classifier.

Parameters


X : ndarray of shape (n_samples, n_features)
The input data.

Returns


y : ndarray of shape (n_samples,) or (n_samples, n_classes)
The predicted classes.
Expand source code
def predict(self, X):
    """Predict using the Light Labyrinth classifier.

    Parameters
    ----------
    ----------
    X : ndarray of shape (n_samples, n_features)
        The input data.

    Returns
    -------
    -------
    y : ndarray of shape (n_samples,) or (n_samples, n_classes)
        The predicted classes.
    """
    y_pred = super().predict(X)
    return self._encoder.inverse_transform(y_pred)
def predict_proba(self, X)

Probability estimates.

Parameters


X : ndarray of shape (n_samples, n_features)
The input data.

Returns


y_prob : ndarray of shape (n_samples, n_classes)
The predicted probability of the sample for each class in the model.
Expand source code
def predict_proba(self, X):
    """Probability estimates.

    Parameters
    ----------
    ----------
    X : ndarray of shape (n_samples, n_features)
        The input data.

    Returns
    -------
    -------
    y_prob : ndarray of shape (n_samples, n_classes)
        The predicted probability of the sample for each class in the
        model.
    """
    return super().predict(X)