Improved speed and memory of multilabel pair generation #322
Add this suggestion to a batch that can be applied as a single commit.
This suggestion is invalid because no changes were made to the code.
Suggestions cannot be applied while the pull request is closed.
Suggestions cannot be applied while viewing a subset of changes.
Only one suggestion per line can be applied in a batch.
Add this suggestion to a batch that can be applied as a single commit.
Applying suggestions on deleted lines is not supported.
You must change the existing code in this line in order to create a valid suggestion.
Outdated suggestions cannot be applied.
This suggestion has been applied or marked resolved.
Suggestions cannot be applied from pending reviews.
Suggestions cannot be applied on multi-line comments.
Suggestions cannot be applied while the pull request is queued to merge.
Suggestion cannot be applied right now. Please check back later.
Adds a new class for multilabel pair-generation. It is an iterable dataset, so the data does not need to be generated up-front, allowing for arbitrary sized datasets and utilizes sparse matrix representation to significantly reduce memory requirements for large datasets with sparse target matrices.
On datasets where most examples belong to most classes (dense target-matrix), this change will make it slower and more memory-hungry than before. However, I believe such datasets with sufficiently many classes to be problematic are very rare.
On my dataset with 300+ classes and 100k+ examples this function is multiple orders of magnitude faster than the old version, and crucially, does not crash due to memory overflow.