reppi
A Python library for representation learning — sparse coding and dictionary learning algorithms implemented close to their original formulations.
Installation
pip install reppi
Algorithms
| Algorithm | Class | Reference |
|---|---|---|
| Orthogonal Matching Pursuit | OMP |
Elad et al., 2008 |
| K-SVD | KSVD |
Aharon et al., 2006 |
| Label Consistent K-SVD | LCKSVD |
Jiang et al., 2011 |
| Frozen Dictionary Learning | IncrementalFrozenDictionary |
Carroll et al., 2017 |
Convention
reppi follows the column-major convention common in the sparse representation literature: signals are columns, so data matrices are shaped (n_features, n_samples). This matches the MATLAB toolboxes the implementations are based on. If your data is in sklearn's (n_samples, n_features) layout, transpose before passing it in.
Quick Start
Sparse Coding with OMP
from reppi import OMP
import numpy as np
# D: (n_features, n_atoms), unit-norm columns
# X: (n_features, n_samples)
omp = OMP(n_nonzero_coefs=10)
Gamma = omp.encode(X, D) # (n_atoms, n_samples)
Dictionary Learning with K-SVD
from reppi import KSVD
ksvd = KSVD(
n_components=128, # number of atoms
n_nonzero_coefs=10, # sparsity level T
n_iter=20,
verbose=True,
)
ksvd.fit(X_train) # X_train: (n_features, n_samples)
D = ksvd.D_ # learned dictionary (n_features, n_components)
Gamma = ksvd.transform(X) # sparse codes (n_components, n_samples)
Discriminative Dictionary Learning with LC-KSVD
LC-KSVD jointly learns a dictionary and a linear classifier from labelled data. Labels are passed as a one-hot matrix H of shape (n_classes, n_samples).
LC-KSVD1 — reconstruction + label-consistency:
from reppi import LCKSVD
model = LCKSVD(
n_components=570,
n_nonzero_coefs=30,
alpha=4.0, # weight for label-consistency term
variant="lcksvd1",
n_iter=50,
n_iter_init=20, # K-SVD iterations for initialisation
verbose=True,
)
model.fit(X_train, H_train)
Gamma = model.transform(X_test) # (n_components, n_samples)
LC-KSVD2 — reconstruction + label-consistency + classification error:
model = LCKSVD(
n_components=570,
n_nonzero_coefs=30,
alpha=4.0,
beta=2.0, # weight for classifier term
variant="lcksvd2",
n_iter=50,
n_iter_init=20,
verbose=True,
)
model.fit(X_train, H_train)
predictions = model.predict(X_test) # integer class indices
accuracy = model.score(X_test, H_test) # float in [0, 1]
References
- M. Aharon, M. Elad, A. Bruckstein. "The K-SVD: An Algorithm for Designing Overcomplete Dictionaries for Sparse Representation". IEEE Trans. Signal Processing, 54(11), 2006.
- M. Elad, R. Rubinstein, M. Zibulevsky. "Efficient Implementation of the K-SVD Algorithm using Batch Orthogonal Matching Pursuit". Technion Technical Report, 2008.
- Z. Jiang, Z. Lin, L. Davis. "Learning A Discriminative Dictionary for Sparse Coding via Label Consistent K-SVD". CVPR, 2011.
- B. T. Carroll, B. M. Whitaker, W. Daley, D. V. Anderson. "Outlier Learning via Augmented Frozen Dictionaries". IEEE/ACM Transactions on Audio, Speech, and Language Processing, 2017.
Metadata
Release files for reppi 1.0.0
For a detailed explanation of source distributions (sdists) and built distributions (wheels), please see the package formats documentation.
Source distribution (sdist)
| File | Size | Uploaded | Provenance | |
|---|---|---|---|---|
| reppi-1.0.0.tar.gz | 60.6 kB | With provenance | Details |
Built distribution (wheel)
| File | Interpreter | ABI | Platform | Reset |
|---|---|---|---|---|
| reppi-1.0.0-py3-none-any.whl | Python 3 | none | any | Details |
Total release size: 137.6 kB
Release files / reppi-1.0.0.tar.gz
| Download URL | reppi-1.0.0.tar.gz |
|---|---|
| Size | 60.6 kB |
| Tags | Source |
|
SHA-256 checksum How to use checksums |
3c9770ee32481449b9fbf4530ea05878339102cb92c78c118128299bb911a2fa
|
|
BLAKE2b-256 checksum How to use checksums |
af508a64c2117991bd2a2f5eb76656d87aca18da2776879e22fe944de83fe23f
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
Yes |
| Uploaded via |
twine/7.0.0 CPython/3.13.14
|
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
PyPI Publish Attestation
PyPI verified that this artifact, at this checksum, originated from the publisher listed below.
Signed by GitHub Actions, verified by PyPI on Sep 5, 2026.
Transparency logRelease files / reppi-1.0.0-py3-none-any.whl
| Download URL | reppi-1.0.0-py3-none-any.whl |
|---|---|
| Size | 77.0 kB |
| Tags | Python 3 |
|
SHA-256 checksum How to use checksums |
d8e700d8ddc0cb76f133672b123c6b163899d53dbc0665203176e1d160de1f5f
|
|
BLAKE2b-256 checksum How to use checksums |
0578aac6c88f95824f5d4de4f088534373294ea3b0682a0e85828c5ea8293f16
|
| Upload date | |
|
Uploaded using Trusted Publishing? What is trusted publishing? |
Yes |
| Uploaded via |
twine/7.0.0 CPython/3.13.14
|
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
PyPI Publish Attestation
PyPI verified that this artifact, at this checksum, originated from the publisher listed below.
Signed by GitHub Actions, verified by PyPI on Sep 5, 2026.
Transparency logSecurity for reppi 1.0.0
Provenance
Provenance describes where a file came from. On PyPI, provenance is shared via attestations, which provide a verifiable record of the build or publishing details. View details, limitations and caveats.
Full provenance
All 2 files in this release have been uploaded with provenance metadata.
Attestation for reppi-1.0.0.tar.gz
PyPI Publish Attestation
PyPI verified that this artifact, at this checksum, originated from the publisher listed below.
Signed by GitHub Actions, verified by PyPI on Sep 5, 2026.
Transparency logA note on package security
PyPI is a repository for distributing packages, not a service for auditing them. While third-party security researchers and our staff do their best to detect and remove malicious packages, PyPI cannot guarantee the quality, security or suitability of any given package.