Mini-batch dictionary learning.
Finds a dictionary (a set of atoms) that performs well at sparsely encoding the fitted data.
Solves the optimization problem:
(U^*,V^*) = argmin 0.5 || X - U V ||_Fro^2 + alpha * || U ||_1,1
(U,V)
with || V_k ||_2 <= 1 for all 0 <= k < n_components
||.||_Fro stands for the Frobenius norm and ||.||_1,1 stands for the entry-wise matrix norm which is the sum of the absolute values of all the entries in the matrix.
Read more in the User Guide.
Number of dictionary elements to extract.
Sparsity controlling parameter.
Maximum number of iterations over the complete dataset before stopping independently of any early stopping criterion heuristics.
Added in version 1.1.
The algorithm used:
'lars': uses the least angle regression method to solve the lasso problem (linear_model.lars_path)'cd': uses the coordinate descent method to compute the Lasso solution (linear_model.Lasso). Lars will be faster if the estimated components are sparse.Number of parallel jobs to run. None means 1 unless in a joblib.parallel_backend context. -1 means using all processors. See Glossary for more details.
Number of samples in each mini-batch.
Changed in version 1.3: The default value of batch_size changed from 3 to 256 in version 1.3.
Whether to shuffle the samples before forming batches.
Initial value of the dictionary for warm restart scenarios.
Algorithm used to transform the data:
'lars': uses the least angle regression method (linear_model.lars_path);'lasso_lars': uses Lars to compute the Lasso solution.'lasso_cd': uses the coordinate descent method to compute the Lasso solution (linear_model.Lasso). 'lasso_lars' will be faster if the estimated components are sparse.'omp': uses orthogonal matching pursuit to estimate the sparse solution.'threshold': squashes to zero all coefficients less than alpha from the projection dictionary * X'.Number of nonzero coefficients to target in each column of the solution. This is only used by algorithm='lars' and algorithm='omp'. If None, then transform_n_nonzero_coefs=int(n_features / 10).
If algorithm='lasso_lars' or algorithm='lasso_cd', alpha is the penalty applied to the L1 norm. If algorithm='threshold', alpha is the absolute value of the threshold below which coefficients will be squashed to zero. If None, defaults to alpha.
Changed in version 1.2: When None, default value changed from 1.0 to alpha.
To control the verbosity of the procedure.
Whether to split the sparse feature vector into the concatenation of its negative part and its positive part. This can improve the performance of downstream classifiers.
Used for initializing the dictionary when dict_init is not specified, randomly shuffling the data when shuffle is set to True, and updating the dictionary. Pass an int for reproducible results across multiple function calls. See Glossary.
Whether to enforce positivity when finding the code.
Added in version 0.20.
Whether to enforce positivity when finding the dictionary.
Added in version 0.20.
Maximum number of iterations to perform if algorithm='lasso_cd' or 'lasso_lars'.
Added in version 0.22.
A callable that gets invoked at the end of each iteration.
Added in version 1.1.
Control early stopping based on the norm of the differences in the dictionary between 2 steps.
To disable early stopping based on changes in the dictionary, set tol to 0.0.
Added in version 1.1.
Control early stopping based on the consecutive number of mini batches that does not yield an improvement on the smoothed cost function.
To disable convergence detection based on cost function, set max_no_improvement to None.
Added in version 1.1.
Components extracted from the data.
Number of features seen during fit.
Added in version 0.24.
n_features_in_,)
Names of features seen during fit. Defined only when X has feature names that are all strings.
Added in version 1.0.
Number of iterations over the full dataset.
Number of mini-batches processed.
Added in version 1.1.
See also
DictionaryLearningFind a dictionary that sparsely encodes data.
MiniBatchSparsePCAMini-batch Sparse Principal Components Analysis.
SparseCoderFind a sparse representation of data from a fixed, precomputed dictionary.
SparsePCASparse Principal Components Analysis.
J. Mairal, F. Bach, J. Ponce, G. Sapiro, 2009: Online dictionary learning for sparse coding (https://www.di.ens.fr/~fbach/mairal_icml09.pdf)
>>> import numpy as np >>> from sklearn.datasets import make_sparse_coded_signal >>> from sklearn.decomposition import MiniBatchDictionaryLearning >>> X, dictionary, code = make_sparse_coded_signal( ... n_samples=30, n_components=15, n_features=20, n_nonzero_coefs=10, ... random_state=42) >>> dict_learner = MiniBatchDictionaryLearning( ... n_components=15, batch_size=3, transform_algorithm='lasso_lars', ... transform_alpha=0.1, max_iter=20, random_state=42) >>> X_transformed = dict_learner.fit_transform(X)
We can check the level of sparsity of X_transformed:
>>> np.mean(X_transformed == 0) > 0.5 np.True_
We can compare the average squared euclidean norm of the reconstruction error of the sparse coded signal relative to the squared euclidean norm of the original signal:
>>> X_hat = X_transformed @ dict_learner.components_ >>> np.mean(np.sum((X_hat - X) ** 2, axis=1) / np.sum(X ** 2, axis=1)) np.float64(0.052...)
Fit the model from data in X.
Training vector, where n_samples is the number of samples and n_features is the number of features.
Not used, present for API consistency by convention.
Returns the instance itself.
Fit to data, then transform it.
Fits transformer to X and y with optional parameters fit_params and returns a transformed version of X.
Input samples.
Target values (None for unsupervised transformations).
Additional fit parameters.
Transformed array.
Get output feature names for transformation.
The feature names out will prefixed by the lowercased class name. For example, if the transformer outputs 3 features, then the feature names out are: ["class_name0", "class_name1", "class_name2"].
Only used to validate feature names with the names seen in fit.
Transformed feature names.
Get metadata routing of this object.
Please check User Guide on how the routing mechanism works.
A MetadataRequest encapsulating routing information.
Get parameters for this estimator.
If True, will return the parameters for this estimator and contained subobjects that are estimators.
Parameter names mapped to their values.
Update the model using the data in X as a mini-batch.
Training vector, where n_samples is the number of samples and n_features is the number of features.
Not used, present for API consistency by convention.
Return the instance itself.
Set output container.
See Introducing the set_output API for an example on how to use the API.
Configure output of transform and fit_transform.
"default": Default output format of a transformer"pandas": DataFrame output"polars": Polars outputNone: Transform configuration is unchangedAdded in version 1.4: "polars" option was added.
Estimator instance.
Set the parameters of this estimator.
The method works on simple estimators as well as on nested objects (such as Pipeline). The latter have parameters of the form <component>__<parameter> so that it’s possible to update each component of a nested object.
Estimator parameters.
Estimator instance.
Encode the data as a sparse combination of the dictionary atoms.
Coding method is determined by the object parameter transform_algorithm.
Test data to be transformed, must have the same number of features as the data used to train the model.
Transformed data.
© 2007–2025 The scikit-learn developers
Licensed under the 3-clause BSD License.
https://scikit-learn.org/1.6/modules/generated/sklearn.decomposition.MiniBatchDictionaryLearning.html