Batched NNLS - #8402
Draft
achirkin wants to merge 13 commits into
Draft
Conversation
|
Auto-sync is disabled for draft pull requests in this repository. Workflows must be run manually. Contributors can view more details about this message here. |
Contributor
Author
|
/ok to test |
Contributor
Author
|
/ok to test |
4 tasks
This file contains hidden or bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment
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.
GPU batch-friendly implementation of Lawson and Hanson NNLS algorithm.
Solves one problem per block:$\arg \min_x {||Ax - b ||}_2^2$ subject to $x \ge 0$ where $A \in \mathbb{R}^{n \times m}, b \in \mathbb{R}^{n}$ . The batching happens by building a matrix $B^{n \times p}$ from columns $b$ and masking some columns of $A$ for each problem in a batch with a bitmap of size $m \times p$ .
The current version keeps$O(n)$ data in shared memory, which limits the scaling over n.